TSTP Solution File: BOO007-4 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : BOO007-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 : 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/BOO007-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,1,213,50,21,223,0,21)
% 
% 
% START OF PROOF
% 215 [] equal(add(X,Y),add(Y,X)).
% 216 [] equal(multiply(X,Y),multiply(Y,X)).
% 217 [] equal(add(X,multiply(Y,Z)),multiply(add(X,Y),add(X,Z))).
% 218 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 220 [] equal(multiply(X,multiplicative_identity),X).
% 221 [] equal(add(X,inverse(X)),multiplicative_identity).
% 223 [] -equal(multiply(a,multiply(b,c)),multiply(multiply(a,b),c)).
% 227 [para:216.1.1,220.1.1] equal(multiply(multiplicative_identity,X),X).
% 229 [para:216.1.1,223.1.1] -equal(multiply(multiply(b,c),a),multiply(multiply(a,b),c)).
% 235 [para:221.1.1,217.1.2.1,demod:227] equal(add(X,multiply(inverse(X),Y)),add(X,Y)).
% 243 [para:220.1.1,235.1.1.2,demod:221] equal(multiplicative_identity,add(X,multiplicative_identity)).
% 251 [para:220.1.1,218.1.2.2,demod:220,243] equal(X,add(multiply(X,Y),X)).
% 255 [para:216.1.1,218.1.2.1] equal(multiply(X,add(Y,Z)),add(multiply(Y,X),multiply(X,Z))).
% 257 [para:218.1.2,217.1.2.1] equal(add(multiply(X,Y),multiply(multiply(X,Z),U)),multiply(multiply(X,add(Y,Z)),add(multiply(X,Y),U))).
% 258 [para:218.1.2,217.1.2.2] equal(add(multiply(X,Y),multiply(Z,multiply(X,U))),multiply(add(multiply(X,Y),Z),multiply(X,add(Y,U)))).
% 265 [para:216.1.1,229.1.1.1] -equal(multiply(multiply(c,b),a),multiply(multiply(a,b),c)).
% 269 [para:251.1.2,215.1.1] equal(X,add(X,multiply(X,Y))).
% 270 [para:216.1.1,251.1.2.1] equal(X,add(multiply(Y,X),X)).
% 596 [para:216.1.1,255.1.2.2] equal(multiply(X,add(Y,Z)),add(multiply(Y,X),multiply(Z,X))).
% 656 [para:270.1.2,257.1.2.2,demod:269,596] equal(multiply(X,Y),multiply(multiply(Y,add(X,Z)),X)).
% 675 [para:270.1.2,258.1.2.1,demod:269,255] equal(multiply(X,Y),multiply(X,multiply(Y,add(X,Z)))).
% 1187 [para:270.1.2,656.1.2.1.2] equal(multiply(multiply(X,Y),Z),multiply(multiply(Z,Y),multiply(X,Y))).
% 1209 [para:270.1.2,675.1.2.2.2,demod:1187,slowcut:265] 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:    418
%  derived clauses:   65687
%  kept clauses:      1177
%  kept size sum:     15928
%  kept mid-nuclei:   0
%  kept new demods:   1003
%  forw unit-subs:    52892
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     34
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.60
%  process. runtime:  0.58
% 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/BOO007-4+eq_r.in")
% 
%------------------------------------------------------------------------------