TSTP Solution File: FLD018-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD018-3 : TPTP v3.4.2. Bugfixed v2.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 0.0s
% Output : Assurance 0.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/FLD/FLD018-3+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 2 9)
% (binary-unit 10 #f 2 9)
% (binary-double 16 #f 2 9)
% (binary 54 #t 2 9)
% (binary-order 27 #f 2 9)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(29,40,0,58,0,0)
%
%
% START OF PROOF
% 30 [] -sum(Y,U,V) | -sum(Z,U,W) | -sum(X,Y,Z) | sum(X,V,W).
% 31 [] -sum(Y,U,V) | -sum(X,V,W) | -sum(X,Y,Z) | sum(Z,U,W).
% 32 [] sum(additive_identity,X,X) | -defined(X).
% 33 [] sum(additive_inverse(X),X,additive_identity) | -defined(X).
% 34 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 56 [] defined(a).
% 57 [] sum(additive_identity,a,additive_identity).
% 58 [] -sum(additive_identity,additive_inverse(a),additive_identity).
% 59 [hyper:32,56] sum(additive_identity,a,a).
% 60 [hyper:33,56] sum(additive_inverse(a),a,additive_identity).
% 170 [hyper:34,57] sum(a,additive_identity,additive_identity).
% 511 [hyper:30,170,59,57] sum(a,a,additive_identity).
% 1385 [hyper:34,60] sum(a,additive_inverse(a),additive_identity).
% 2248 [hyper:31,1385,511,170,cut:58] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 9
% clause depth limited to 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 65
% derived clauses: 4201
% kept clauses: 415
% kept size sum: 4265
% kept mid-nuclei: 1764
% kept new demods: 0
% forw unit-subs: 1083
% forw double-subs: 337
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 6
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.6
% process. runtime: 0.6
% specific non-discr-tree subsumption statistics:
% tried: 807
% length fails: 0
% strength fails: 673
% predlist fails: 85
% aux str. fails: 7
% by-lit fails: 0
% full subs tried: 42
% full subs fail: 42
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/FLD/FLD018-3+noeq.in")
%
%------------------------------------------------------------------------------