%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO005-4 : TPTP v3.4.2. Bugfixed v1.2.1.
% 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/BOO005-4+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(10,40,1,20,0,1)
%
%
% START OF PROOF
% 12 [] equal(add(X,Y),add(Y,X)).
% 13 [] equal(multiply(X,Y),multiply(Y,X)).
% 14 [] equal(add(X,multiply(Y,Z)),multiply(add(X,Y),add(X,Z))).
% 15 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 16 [] equal(add(X,additive_identity),X).
% 17 [] equal(multiply(X,multiplicative_identity),X).
% 18 [] equal(add(X,inverse(X)),multiplicative_identity).
% 19 [] equal(multiply(X,inverse(X)),additive_identity).
% 20 [] -equal(add(a,multiplicative_identity),multiplicative_identity).
% 21 [para:12.1.1,16.1.1] equal(add(additive_identity,X),X).
% 22 [para:12.1.1,20.1.1] -equal(add(multiplicative_identity,a),multiplicative_identity).
% 23 [para:12.1.1,18.1.1] equal(add(inverse(X),X),multiplicative_identity).
% 24 [para:21.1.1,18.1.1] equal(inverse(additive_identity),multiplicative_identity).
% 25 [para:13.1.1,17.1.1] equal(multiply(multiplicative_identity,X),X).
% 26 [para:13.1.1,19.1.1] equal(multiply(inverse(X),X),additive_identity).
% 27 [para:25.1.1,19.1.1] equal(inverse(multiplicative_identity),additive_identity).
% 28 [para:16.1.1,14.1.2.1] equal(add(X,multiply(additive_identity,Y)),multiply(X,add(X,Y))).
% 32 [para:23.1.1,14.1.2.1,demod:25] equal(add(inverse(X),multiply(X,Y)),add(inverse(X),Y)).
% 33 [para:23.1.1,14.1.2.2,demod:17] equal(add(inverse(X),multiply(Y,X)),add(inverse(X),Y)).
% 35 [para:17.1.1,32.1.1.2,demod:23] equal(multiplicative_identity,add(inverse(X),multiplicative_identity)).
% 37 [para:24.1.1,32.1.1.1,demod:24] equal(add(multiplicative_identity,multiply(additive_identity,X)),add(multiplicative_identity,X)).
% 39 [para:17.1.1,15.1.2.1] equal(multiply(X,add(multiplicative_identity,Y)),add(X,multiply(X,Y))).
% 44 [para:26.1.1,15.1.2.1,demod:21] equal(multiply(inverse(X),add(X,Y)),multiply(inverse(X),Y)).
% 47 [para:24.1.1,35.1.2.1] equal(multiplicative_identity,add(multiplicative_identity,multiplicative_identity)).
% 50 [para:16.1.1,28.1.2.2] equal(add(X,multiply(additive_identity,additive_identity)),multiply(X,X)).
% 51 [para:17.1.1,28.1.1.2,demod:16] equal(X,multiply(X,add(X,multiplicative_identity))).
% 52 [para:28.1.1,12.1.1] equal(multiply(X,add(X,Y)),add(multiply(additive_identity,Y),X)).
% 58 [para:12.1.1,51.1.2.2] equal(X,multiply(X,add(multiplicative_identity,X))).
% 73 [para:50.1.1,12.1.1] equal(multiply(X,X),add(multiply(additive_identity,additive_identity),X)).
% 103 [para:27.1.1,44.1.1.1,demod:27] equal(multiply(additive_identity,add(multiplicative_identity,X)),multiply(additive_identity,X)).
% 105 [para:37.1.1,44.1.1.2,demod:103,27] equal(multiply(additive_identity,X),multiply(additive_identity,multiply(additive_identity,X))).
% 106 [para:44.1.1,58.1.2,demod:27] equal(additive_identity,multiply(additive_identity,additive_identity)).
% 108 [para:73.1.2,44.1.1.2,demod:25,24,106] equal(multiply(X,X),X).
% 112 [para:17.1.1,39.1.2.2,demod:17,47] equal(X,add(X,X)).
% 127 [para:112.1.2,28.1.2.2,demod:108] equal(add(X,multiply(additive_identity,X)),X).
% 140 [para:127.1.1,44.1.1.2,demod:26] equal(additive_identity,multiply(inverse(X),multiply(additive_identity,X))).
% 162 [para:105.1.2,33.1.1.2,demod:16,23] equal(multiplicative_identity,inverse(multiply(additive_identity,X))).
% 163 [para:105.1.2,140.1.2.2,demod:25,162] equal(additive_identity,multiply(additive_identity,X)).
% 166 [para:52.1.2,18.1.1,demod:25,24,163,slowcut:22] 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 3
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 78
% derived clauses: 3116
% kept clauses: 144
% kept size sum: 1410
% kept mid-nuclei: 0
% kept new demods: 97
% forw unit-subs: 2146
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 5
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.5
% process. runtime: 0.3
% 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/BOO005-4+eq_r.in")
%
%------------------------------------------------------------------------------