%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO029-1 : TPTP v3.4.2. Released v2.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art06.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/BOO029-1+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 4 1)
% (binary-posweight-lex-big-order 30 #f 4 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(12,40,0,24,0,0)
%
%
% START OF PROOF
% 14 [] equal(add(X,multiply(Y,multiply(X,Z))),X).
% 15 [] equal(add(add(multiply(X,Y),multiply(Y,Z)),Y),Y).
% 16 [] equal(multiply(add(X,Y),add(X,inverse(Y))),X).
% 17 [] equal(multiply(X,add(Y,add(X,Z))),X).
% 19 [] equal(add(multiply(X,Y),multiply(X,inverse(Y))),X).
% 20 [] equal(add(X,Y),add(Y,X)).
% 21 [] equal(multiply(X,Y),multiply(Y,X)).
% 22 [] equal(add(add(X,Y),Z),add(X,add(Y,Z))).
% 23 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 24 [] -equal(add(b,inverse(b)),add(a,inverse(a))).
% 25 [para:14.1.1,20.1.1] equal(X,add(multiply(Y,multiply(X,Z)),X)).
% 30 [para:17.1.1,21.1.1] equal(X,multiply(add(Y,add(X,Z)),X)).
% 31 [para:17.1.1,14.1.1.2.2] equal(add(X,multiply(Y,X)),X).
% 32 [para:14.1.1,17.1.1.2.2] equal(multiply(X,add(Y,X)),X).
% 35 [para:31.1.1,20.1.1] equal(X,add(multiply(Y,X),X)).
% 39 [para:32.1.1,21.1.1] equal(X,multiply(add(Y,X),X)).
% 43 [para:21.1.1,35.1.2.1] equal(X,add(multiply(X,Y),X)).
% 57 [para:43.1.2,17.1.1.2.2,demod:23] equal(multiply(X,multiply(Y,add(Z,X))),multiply(X,Y)).
% 60 [para:16.1.1,21.1.1] equal(X,multiply(add(X,inverse(Y)),add(X,Y))).
% 61 [para:16.1.1,14.1.1.2.2,demod:22] equal(add(X,add(Y,multiply(Z,X))),add(X,Y)).
% 67 [para:16.1.1,25.1.2.1.2] equal(add(X,Y),add(multiply(Z,X),add(X,Y))).
% 81 [para:30.1.2,25.1.2.1.2] equal(add(X,add(Y,Z)),add(multiply(U,Y),add(X,add(Y,Z)))).
% 83 [para:19.1.1,20.1.1] equal(X,add(multiply(X,inverse(Y)),multiply(X,Y))).
% 96 [para:15.1.1,22.1.1.1,demod:81,22] equal(add(X,Y),add(multiply(X,Z),add(X,Y))).
% 133 [para:21.1.1,83.1.2.1] equal(X,add(multiply(inverse(Y),X),multiply(X,Y))).
% 172 [para:60.1.2,57.1.1.2] equal(multiply(X,Y),multiply(X,add(Y,inverse(X)))).
% 176 [para:35.1.2,172.1.2.2] equal(multiply(X,multiply(Y,inverse(X))),multiply(X,inverse(X))).
% 181 [para:172.1.2,57.1.1.2] equal(multiply(inverse(X),multiply(X,Y)),multiply(inverse(X),X)).
% 201 [para:83.1.2,61.1.1.2] equal(add(X,Y),add(X,multiply(Y,inverse(X)))).
% 202 [para:133.1.2,61.1.1.2] equal(add(X,Y),add(X,multiply(inverse(X),Y))).
% 206 [para:39.1.2,201.1.2.2] equal(add(X,add(Y,inverse(X))),add(X,inverse(X))).
% 458 [para:176.1.1,25.1.2.1] equal(X,add(multiply(Y,inverse(Y)),X)).
% 474 [para:21.1.1,458.1.2.1] equal(X,add(multiply(inverse(Y),Y),X)).
% 510 [para:181.1.1,19.1.1.1,demod:474] equal(multiply(inverse(X),inverse(multiply(X,Y))),inverse(X)).
% 513 [para:21.1.1,510.1.1.2.1] equal(multiply(inverse(X),inverse(multiply(Y,X))),inverse(X)).
% 521 [para:510.1.1,202.1.2.2] equal(add(X,inverse(multiply(X,Y))),add(X,inverse(X))).
% 546 [para:513.1.1,202.1.2.2] equal(add(X,inverse(multiply(Y,X))),add(X,inverse(X))).
% 649 [para:206.1.1,67.1.2,demod:546] equal(add(X,inverse(X)),add(multiply(Y,X),inverse(multiply(Y,X)))).
% 651 [para:206.1.1,96.1.2,demod:649,521,slowcut:24] 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: 134
% derived clauses: 15725
% kept clauses: 625
% kept size sum: 8861
% kept mid-nuclei: 0
% kept new demods: 512
% forw unit-subs: 11456
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.20
% process. runtime: 0.19
% 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/BOO029-1+eq_r.in")
%
%------------------------------------------------------------------------------