%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : BOO012-4 : TPTP v3.4.2. Released v1.1.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art04.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/BOO012-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,0,20,0,0,231,50,36,241,0,36)
% 
% 
% START OF PROOF
% 233 [] equal(add(X,Y),add(Y,X)).
% 234 [] equal(multiply(X,Y),multiply(Y,X)).
% 235 [] equal(add(X,multiply(Y,Z)),multiply(add(X,Y),add(X,Z))).
% 237 [] equal(add(X,additive_identity),X).
% 238 [] equal(multiply(X,multiplicative_identity),X).
% 239 [] equal(add(X,inverse(X)),multiplicative_identity).
% 240 [] equal(multiply(X,inverse(X)),additive_identity).
% 241 [] -equal(inverse(inverse(x)),x).
% 243 [para:233.1.1,239.1.1] equal(add(inverse(X),X),multiplicative_identity).
% 245 [para:234.1.1,238.1.1] equal(multiply(multiplicative_identity,X),X).
% 246 [para:234.1.1,240.1.1] equal(multiply(inverse(X),X),additive_identity).
% 249 [para:239.1.1,235.1.2.1,demod:245] equal(add(X,multiply(inverse(X),Y)),add(X,Y)).
% 253 [para:243.1.1,235.1.2.1,demod:245] equal(add(inverse(X),multiply(X,Y)),add(inverse(X),Y)).
% 259 [para:240.1.1,249.1.1.2,demod:237] equal(X,add(X,inverse(inverse(X)))).
% 278 [para:259.1.2,233.1.1] equal(X,add(inverse(inverse(X)),X)).
% 378 [para:246.1.1,253.1.1.2,demod:278,237,slowcut:241] 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:    258
%  derived clauses:   52643
%  kept clauses:      346
%  kept size sum:     3706
%  kept mid-nuclei:   0
%  kept new demods:   271
%  forw unit-subs:    41066
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     18
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.39
%  process. runtime:  0.37
% 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/BOO012-4+eq_r.in")
% 
%------------------------------------------------------------------------------