TSTP Solution File: FLD029-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : FLD029-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 : art10.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 20.0s
% Output : Assurance 20.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/FLD029-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(34,40,1,68,0,1,282716,4,2028,299938,5,2702,299939,1,2702,299939,50,2704,299939,40,2704,299973,0,2704)
%
%
% START OF PROOF
% 299940 [] -sum(Y,U,V) | -sum(Z,U,W) | -sum(X,Y,Z) | sum(X,V,W).
% 299942 [] sum(additive_identity,X,X) | -defined(X).
% 299943 [] sum(additive_inverse(X),X,additive_identity) | -defined(X).
% 299944 [] -sum(X,Y,Z) | sum(Y,X,Z).
% 299945 [] -product(Y,U,V) | -product(Z,U,W) | -product(X,Y,Z) | product(X,V,W).
% 299946 [] -product(Y,U,V) | -product(X,V,W) | -product(X,Y,Z) | product(Z,U,W).
% 299947 [] product(multiplicative_identity,X,X) | -defined(X).
% 299948 [] product(multiplicative_inverse(X),X,multiplicative_identity) | sum(additive_identity,X,additive_identity) | -defined(X).
% 299949 [] -product(X,Y,Z) | product(Y,X,Z).
% 299950 [] -product(U,Y,V) | -product(W,Y,X1) | -product(X,Y,Z) | -sum(U,W,X) | sum(V,X1,Z).
% 299966 [] defined(a).
% 299967 [] defined(b).
% 299969 [] defined(v).
% 299970 [] -sum(additive_identity,b,additive_identity).
% 299971 [] product(a,u,b).
% 299972 [] product(a,v,b).
% 299973 [] -product(multiplicative_identity,u,v).
% 299974 [input:299940,factor] -sum(U,X,X) | -sum(X,Y,Z) | sum(U,Z,Z).
% 299989 [input:299950,factor:factor:factor:factor] -product(X,Y,Z) | -sum(X,X,X) | sum(Z,Z,Z).
% 300033 [binary:299966,299942.2] sum(additive_identity,a,a).
% 300053 [binary:299967,299943.2] sum(additive_inverse(b),b,additive_identity).
% 300089 [binary:299970,299944.2] -sum(b,additive_identity,additive_identity).
% 300147 [binary:299969,299947.2] product(multiplicative_identity,v,v).
% 300206 [binary:299971,299949] product(u,a,b).
% 300207 [binary:299972,299949] product(v,a,b).
% 300208 [binary:299973,299949.2] -product(u,multiplicative_identity,v).
% 300212 [binary:300147,299949] product(v,multiplicative_identity,v).
% 300216 [binary:299945.3,300206] -product(a,X,Z) | -product(b,X,Y) | product(u,Z,Y).
% 300225 [binary:299946.3,300207] -product(a,Z,X) | -product(v,X,Y) | product(b,Z,Y).
% 300325 [binary:299944,300053] sum(b,additive_inverse(b),additive_identity).
% 300842 [binary:300089,299974.3] -sum(X,Y,additive_identity) | -sum(b,X,X).
% 306720 [binary:300325,300842] -sum(b,b,b).
% 306751 [binary:299989.3,306720] -product(X,Y,b) | -sum(X,X,X).
% 307106 [binary:299971,306751] -sum(a,a,a).
% 307132 [binary:299974.3,307106] -sum(X,Y,a) | -sum(a,X,X).
% 307725 [binary:300033,307132] -sum(a,additive_identity,additive_identity).
% 307728 [binary:299944.2,307725] -sum(additive_identity,a,additive_identity).
% 307762 [binary:299948.2,307728,cut:299966] product(multiplicative_inverse(a),a,multiplicative_identity).
% 307799 [binary:299949,307762] product(a,multiplicative_inverse(a),multiplicative_identity).
% 311241 [binary:300208,300216.3] -product(b,X,v) | -product(a,X,multiplicative_identity).
% 311686 [binary:300212,300225.2,binarycut:311241,slowcut:307799] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 9
% clause depth limited to 2
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1802
% derived clauses: 542885
% kept clauses: 51927
% kept size sum: 663323
% kept mid-nuclei: 259069
% kept new demods: 0
% forw unit-subs: 140363
% forw double-subs: 58695
% forw overdouble-subs: 11065
% backward subs: 14
% fast unit cutoff: 2150
% full unit cutoff: 0
% dbl unit cutoff: 6
% real runtime : 28.79
% process. runtime: 28.77
% specific non-discr-tree subsumption statistics:
% tried: 138234
% length fails: 4505
% strength fails: 5701
% predlist fails: 76643
% aux str. fails: 8786
% by-lit fails: 97
% full subs tried: 31528
% full subs fail: 28770
%
% ; 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/FLD029-3+noeq.in")
%
%------------------------------------------------------------------------------