TSTP Solution File: BOO008-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO008-2 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art08.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/BOO/BOO008-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: ueq
%
% strategies selected:
% (binary-posweight-kb-big-order 60 #f 3 1)
% (binary-posweight-lex-big-order 30 #f 3 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(16,40,1,32,0,1,258,50,44,274,0,44)
%
%
% START OF PROOF
% 260 [] equal(add(X,Y),add(Y,X)).
% 261 [] equal(multiply(X,Y),multiply(Y,X)).
% 262 [] equal(add(multiply(X,Y),Z),multiply(add(X,Z),add(Y,Z))).
% 263 [] equal(add(X,multiply(Y,Z)),multiply(add(X,Y),add(X,Z))).
% 264 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 267 [] equal(add(inverse(X),X),multiplicative_identity).
% 269 [] equal(multiply(inverse(X),X),additive_identity).
% 270 [] equal(multiply(X,multiplicative_identity),X).
% 271 [] equal(multiply(multiplicative_identity,X),X).
% 272 [] equal(add(X,additive_identity),X).
% 273 [] equal(add(additive_identity,X),X).
% 274 [] -equal(add(a,add(b,c)),add(add(a,b),c)).
% 277 [para:260.1.1,274.1.1] -equal(add(add(b,c),a),add(add(a,b),c)).
% 282 [para:260.1.1,277.1.2] -equal(add(add(b,c),a),add(c,add(a,b))).
% 291 [para:267.1.1,262.1.2.1,demod:271] equal(add(multiply(inverse(X),Y),X),add(Y,X)).
% 294 [para:260.1.1,262.1.2.2] equal(add(multiply(X,Y),Z),multiply(add(X,Z),add(Z,Y))).
% 296 [para:270.1.1,291.1.1.1,demod:267] equal(multiplicative_identity,add(multiplicative_identity,X)).
% 300 [para:269.1.1,291.1.1.1,demod:273] equal(X,add(X,X)).
% 302 [para:300.1.2,262.1.2.2] equal(add(multiply(X,Y),Y),multiply(add(X,Y),Y)).
% 303 [para:296.1.2,260.1.1] equal(multiplicative_identity,add(X,multiplicative_identity)).
% 304 [para:272.1.1,263.1.2.1] equal(add(X,multiply(additive_identity,Y)),multiply(X,add(X,Y))).
% 315 [para:271.1.1,264.1.2.1,demod:271,296] equal(X,add(X,multiply(Y,X))).
% 316 [para:271.1.1,264.1.2.2,demod:271,303] equal(X,add(multiply(Y,X),X)).
% 326 [para:262.1.2,264.1.2.1] equal(multiply(add(add(X,Y),Z),add(U,Y)),add(add(multiply(X,U),Y),multiply(Z,add(U,Y)))).
% 327 [para:262.1.2,264.1.2.2] equal(multiply(add(X,add(Y,Z)),add(U,Z)),add(multiply(X,add(U,Z)),add(multiply(Y,U),Z))).
% 332 [para:315.1.2,273.1.1] equal(additive_identity,multiply(X,additive_identity)).
% 340 [para:332.1.2,261.1.1] equal(additive_identity,multiply(additive_identity,X)).
% 375 [para:260.1.1,282.1.2.2] -equal(add(add(b,c),a),add(c,add(b,a))).
% 1129 [para:304.1.2,326.1.2.2,demod:272,340,316,302,294] equal(add(X,Y),add(add(multiply(Z,Y),X),Y)).
% 1204 [para:304.1.2,327.1.2.1,demod:272,340,316,302,263] equal(add(X,Y),add(X,add(multiply(Z,X),Y))).
% 1517 [para:304.1.2,1129.1.2.1.1,demod:272,340] equal(add(X,add(Y,Z)),add(add(Y,X),add(Y,Z))).
% 1536 [para:304.1.2,1204.1.2.2.1,demod:1517,272,340,slowcut:375] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos 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 1
% clause depth limited to 4
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 461
% derived clauses: 100009
% kept clauses: 1486
% kept size sum: 21055
% kept mid-nuclei: 0
% kept new demods: 1206
% forw unit-subs: 80030
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 29
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.89
% process. runtime: 0.88
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/BOO/BOO008-2+eq_r.in")
%
%------------------------------------------------------------------------------