%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO031-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 : 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/BOO/BOO031-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(13,40,1,26,0,1)
%
%
% START OF PROOF
% 15 [] equal(add(multiply(X,Y),add(multiply(Y,Z),multiply(Z,X))),multiply(add(X,Y),multiply(add(Y,Z),add(Z,X)))).
% 16 [] equal(add(X,multiply(Y,multiply(X,Z))),X).
% 17 [] equal(add(add(multiply(X,Y),multiply(Y,Z)),Y),Y).
% 18 [] equal(multiply(add(X,inverse(X)),Y),Y).
% 19 [] equal(multiply(X,add(Y,add(X,Z))),X).
% 20 [] equal(multiply(multiply(add(X,Y),add(Y,Z)),Y),Y).
% 21 [] equal(add(multiply(X,inverse(X)),Y),Y).
% 22 [] equal(add(X,inverse(X)),n1).
% 23 [] equal(multiply(X,inverse(X)),n0).
% 24 [] equal(add(add(X,Y),Z),add(X,add(Y,Z))).
% 25 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 26 [] -equal(multiply(a,add(b,c)),add(multiply(b,a),multiply(c,a))).
% 27 [para:22.1.1,18.1.1.1] equal(multiply(n1,X),X).
% 30 [para:21.1.1,22.1.1,demod:23] equal(inverse(n0),n1).
% 31 [para:23.1.1,21.1.1.1] equal(add(n0,X),X).
% 32 [para:30.1.1,23.1.1.2] equal(multiply(n0,n1),n0).
% 43 [para:18.1.1,16.1.1.2] equal(add(X,multiply(X,Y)),X).
% 46 [para:32.1.1,16.1.1.2.2,demod:31] equal(multiply(X,n0),n0).
% 47 [para:46.1.1,16.1.1.2.2,demod:46] equal(add(X,n0),X).
% 48 [para:47.1.1,15.1.2.1,demod:31,46] equal(add(multiply(n0,X),multiply(X,Y)),multiply(Y,multiply(X,add(X,Y)))).
% 51 [para:18.1.1,43.1.1.2,demod:22] equal(add(n1,X),n1).
% 52 [para:43.1.1,21.1.1,demod:23] equal(n0,multiply(n0,X)).
% 54 [para:23.1.1,17.1.1.1.2,demod:47] equal(add(multiply(X,Y),Y),Y).
% 55 [para:18.1.1,17.1.1.1.1,demod:43] equal(add(X,X),X).
% 57 [para:32.1.1,17.1.1.1.1,demod:31,27] equal(add(X,n1),n1).
% 58 [para:55.1.1,15.1.2.1] equal(add(multiply(X,X),add(multiply(X,Y),multiply(Y,X))),multiply(X,multiply(add(X,Y),add(Y,X)))).
% 59 [para:55.1.1,15.1.2.2.1] equal(add(multiply(X,Y),add(multiply(Y,Y),multiply(Y,X))),multiply(add(X,Y),multiply(Y,add(Y,X)))).
% 64 [para:52.1.2,17.1.1.1.1,demod:31] equal(add(multiply(X,Y),X),X).
% 65 [para:22.1.1,19.1.1.2.2,demod:57] equal(multiply(X,n1),X).
% 66 [para:21.1.1,19.1.1.2] equal(multiply(X,add(X,Y)),X).
% 67 [para:19.1.1,16.1.1.2.2] equal(add(X,multiply(Y,X)),X).
% 68 [para:16.1.1,19.1.1.2.2] equal(multiply(X,add(Y,X)),X).
% 70 [para:17.1.1,19.1.1.2.2] equal(multiply(add(multiply(X,Y),multiply(Y,Z)),add(U,Y)),add(multiply(X,Y),multiply(Y,Z))).
% 71 [para:64.1.1,19.1.1.2.2,demod:25] equal(multiply(X,multiply(Y,add(Z,X))),multiply(X,Y)).
% 72 [para:16.1.1,66.1.1.2] equal(multiply(X,X),X).
% 73 [para:66.1.1,17.1.1.1.1,demod:64,24] equal(add(X,add(X,Y)),add(X,Y)).
% 74 [para:17.1.1,66.1.1.2] equal(multiply(add(multiply(X,Y),multiply(Y,Z)),Y),add(multiply(X,Y),multiply(Y,Z))).
% 75 [para:64.1.1,66.1.1.2,demod:25] equal(multiply(X,multiply(Y,X)),multiply(X,Y)).
% 76 [para:67.1.1,15.1.2.2.2,demod:75,25] equal(add(multiply(X,multiply(Y,Z)),add(multiply(Z,Y),multiply(Y,X))),multiply(add(multiply(X,Y),Z),multiply(add(Z,Y),Y))).
% 78 [para:66.1.1,67.1.1.2,demod:24] equal(add(X,add(Y,X)),add(X,Y)).
% 80 [para:22.1.1,20.1.1.1.2,demod:65] equal(multiply(add(X,Y),Y),Y).
% 83 [para:51.1.1,20.1.1.1.1,demod:27] equal(multiply(add(X,Y),X),X).
% 87 [para:67.1.1,20.1.1.1.1,demod:75,83,25] equal(multiply(X,Y),multiply(Y,X)).
% 88 [para:68.1.1,17.1.1.1.1,demod:78,64,24] equal(add(X,Y),add(Y,X)).
% 89 [para:16.1.1,80.1.1.1] equal(multiply(X,multiply(Y,multiply(X,Z))),multiply(Y,multiply(X,Z))).
% 90 [para:43.1.1,80.1.1.1] equal(multiply(X,multiply(X,Y)),multiply(X,Y)).
% 98 [para:87.1.1,26.1.2.2] -equal(multiply(a,add(b,c)),add(multiply(b,a),multiply(a,c))).
% 100 [para:87.1.1,15.1.2.2] equal(add(multiply(X,Y),add(multiply(Y,Z),multiply(Z,X))),multiply(add(X,Y),multiply(add(Z,X),add(Y,Z)))).
% 102 [para:87.1.1,16.1.1.2.2] equal(add(X,multiply(Y,multiply(Z,X))),X).
% 103 [para:87.1.1,19.1.1] equal(multiply(add(X,add(Y,Z)),Y),Y).
% 106 [para:43.1.1,24.1.1.1] equal(add(X,Y),add(X,add(multiply(X,Z),Y))).
% 108 [para:54.1.1,24.1.1.1] equal(add(X,Y),add(multiply(Z,X),add(X,Y))).
% 109 [para:64.1.1,24.1.1.1] equal(add(X,Y),add(multiply(X,Z),add(X,Y))).
% 110 [para:24.1.1,66.1.1.2] equal(multiply(add(X,Y),add(X,add(Y,Z))),add(X,Y)).
% 131 [para:25.1.1,17.1.1.1.1,demod:64,24] equal(add(multiply(X,multiply(Y,Z)),Z),Z).
% 132 [para:25.1.1,64.1.1.1] equal(add(multiply(X,multiply(Y,Z)),multiply(X,Y)),multiply(X,Y)).
% 133 [para:66.1.1,25.1.1.1] equal(multiply(X,Y),multiply(X,multiply(add(X,Z),Y))).
% 135 [para:68.1.1,25.1.1.1] equal(multiply(X,Y),multiply(X,multiply(add(Z,X),Y))).
% 198 [para:88.1.1,98.1.1.2] -equal(multiply(a,add(c,b)),add(multiply(b,a),multiply(a,c))).
% 200 [para:73.1.1,15.1.2.2.1,demod:110,24,108,66] equal(add(X,multiply(add(X,Y),Z)),multiply(add(Z,X),add(X,Y))).
% 201 [para:75.1.1,17.1.1.1.1,demod:132,24,25] equal(add(multiply(X,Y),multiply(Y,X)),multiply(Y,X)).
% 202 [para:25.1.1,75.1.1.2] equal(multiply(X,multiply(Y,multiply(Z,X))),multiply(X,multiply(Y,Z))).
% 206 [para:78.1.1,15.1.2.2.1,demod:103,200,24,108,68] equal(add(X,multiply(add(Y,X),Z)),multiply(add(Z,X),add(Y,X))).
% 213 [para:54.1.1,103.1.1.1.2] equal(multiply(add(X,Y),multiply(Z,Y)),multiply(Z,Y)).
% 227 [para:75.1.1,131.1.1.1.2] equal(add(multiply(X,multiply(Y,Z)),multiply(Z,Y)),multiply(Z,Y)).
% 299 [para:58.1.1,15.1.2.1,demod:213,68,80,200,227,25,75,201,72] equal(add(multiply(X,Y),multiply(Z,X)),multiply(X,add(Z,multiply(Y,X)))).
% 318 [para:59.1.1,15.1.2.2.1,demod:80,66,108,25,43,72] equal(add(multiply(X,Y),multiply(Y,Z)),multiply(add(Z,multiply(X,Y)),Y)).
% 373 [para:71.1.1,67.1.1.2] equal(add(multiply(X,add(Y,Z)),multiply(Z,X)),multiply(X,add(Y,Z))).
% 393 [para:102.1.1,70.1.1.1,demod:202,68,25] equal(multiply(X,Y),add(multiply(X,Y),multiply(Y,multiply(Z,X)))).
% 409 [para:80.1.1,74.1.1.1.2,demod:80,75,206] equal(add(X,multiply(add(Y,X),Z)),add(multiply(Z,add(Y,X)),X)).
% 427 [para:80.1.1,76.1.1.2.2,demod:80,68,109,409,135] equal(add(X,multiply(add(Y,X),Z)),multiply(add(X,Z),add(Y,X))).
% 431 [para:87.1.1,76.1.1.1.2,demod:80,108] equal(add(multiply(X,Y),multiply(Y,Z)),multiply(add(multiply(Z,Y),X),Y)).
% 434 [para:90.1.1,76.1.1.2.2,demod:75,431,80,76,89,25] equal(add(multiply(X,Y),multiply(Y,Z)),multiply(add(multiply(Y,Z),X),Y)).
% 457 [para:106.1.2,48.1.2.2.2,demod:434,66,31,52] equal(multiply(X,add(multiply(X,Y),Z)),add(multiply(Z,X),multiply(X,Y))).
% 779 [para:100.1.2,133.1.2.2,demod:393,318,457,373,299,427,slowcut:198] 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: 206
% derived clauses: 30565
% kept clauses: 751
% kept size sum: 10496
% kept mid-nuclei: 0
% kept new demods: 596
% forw unit-subs: 24556
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 4
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.38
% process. runtime: 0.36
% 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/BOO031-1+eq_r.in")
%
%------------------------------------------------------------------------------