TSTP Solution File: BOO009-2 by Gandalf---c-2.6

View Problem - Process Solution

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

% Computer : art08.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/BOO009-2+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(16,40,1,32,0,1)
% 
% 
% START OF PROOF
% 17 [] equal(X,X).
% 18 [] equal(add(X,Y),add(Y,X)).
% 19 [] equal(multiply(X,Y),multiply(Y,X)).
% 20 [] equal(add(multiply(X,Y),Z),multiply(add(X,Z),add(Y,Z))).
% 21 [] equal(add(X,multiply(Y,Z)),multiply(add(X,Y),add(X,Z))).
% 22 [] equal(multiply(add(X,Y),Z),add(multiply(X,Z),multiply(Y,Z))).
% 24 [] equal(add(X,inverse(X)),multiplicative_identity).
% 26 [] equal(multiply(X,inverse(X)),additive_identity).
% 28 [] equal(multiply(X,multiplicative_identity),X).
% 29 [] equal(multiply(multiplicative_identity,X),X).
% 30 [] equal(add(X,additive_identity),X).
% 31 [] equal(add(additive_identity,X),X).
% 32 [] -equal(multiply(a,add(a,b)),a).
% 33 [para:24.1.1,31.1.1] equal(multiplicative_identity,inverse(additive_identity)).
% 34 [para:26.1.1,29.1.1] equal(additive_identity,inverse(multiplicative_identity)).
% 35 [para:18.1.1,32.1.1.2] -equal(multiply(a,add(b,a)),a).
% 37 [para:19.1.1,35.1.1] -equal(multiply(add(b,a),a),a).
% 38 [para:31.1.1,20.1.2.1] equal(add(multiply(additive_identity,X),Y),multiply(Y,add(X,Y))).
% 39 [para:31.1.1,20.1.2.2] equal(add(multiply(X,additive_identity),Y),multiply(add(X,Y),Y)).
% 40 [para:24.1.1,20.1.2.1,demod:29] equal(add(multiply(X,Y),inverse(X)),add(Y,inverse(X))).
% 46 [para:33.1.2,40.1.1.2,demod:33] equal(add(multiply(additive_identity,X),multiplicative_identity),add(X,multiplicative_identity)).
% 52 [para:30.1.1,21.1.2.2] equal(add(X,multiply(Y,additive_identity)),multiply(add(X,Y),X)).
% 55 [para:21.1.2,20.1.2] equal(add(multiply(X,X),Y),add(X,multiply(Y,Y))).
% 57 [para:46.1.1,18.1.1] equal(add(X,multiplicative_identity),add(multiplicative_identity,multiply(additive_identity,X))).
% 59 [para:19.1.1,57.1.2.2] equal(add(X,multiplicative_identity),add(multiplicative_identity,multiply(X,additive_identity))).
% 60 [para:29.1.1,22.1.2.1] equal(multiply(add(multiplicative_identity,X),Y),add(Y,multiply(X,Y))).
% 62 [para:26.1.1,22.1.2.1,demod:31] equal(multiply(add(X,Y),inverse(X)),multiply(Y,inverse(X))).
% 74 [para:55.1.2,31.1.1] equal(add(multiply(additive_identity,additive_identity),X),multiply(X,X)).
% 95 [para:28.1.1,38.1.1.1,demod:31] equal(X,multiply(X,add(multiplicative_identity,X))).
% 109 [para:95.1.2,19.1.1] equal(X,multiply(add(multiplicative_identity,X),X)).
% 114 [para:39.1.2,37.1.1] -equal(add(multiply(b,additive_identity),a),a).
% 126 [para:18.1.1,114.1.1] -equal(add(a,multiply(b,additive_identity)),a).
% 146 [para:57.1.2,62.1.1.1,demod:34] equal(multiply(add(X,multiplicative_identity),additive_identity),multiply(multiply(additive_identity,X),additive_identity)).
% 151 [para:62.1.1,109.1.2,demod:34] equal(additive_identity,multiply(additive_identity,additive_identity)).
% 153 [para:74.1.1,62.1.1.1,demod:28,33,151] equal(multiply(X,X),X).
% 154 [para:153.1.1,22.1.2.1] equal(multiply(add(X,Y),X),add(X,multiply(Y,X))).
% 155 [para:153.1.1,22.1.2.2] equal(multiply(add(X,Y),Y),add(multiply(X,Y),Y)).
% 164 [para:57.1.2,52.1.2.1,demod:28,155,59,146] equal(add(add(X,multiplicative_identity),multiplicative_identity),add(X,multiplicative_identity)).
% 171 [para:52.1.1,126.1.1,demod:154] -equal(add(a,multiply(b,a)),a).
% 189 [para:60.1.2,171.1.1] -equal(multiply(add(multiplicative_identity,b),a),a).
% 197 [para:18.1.1,189.1.1.1] -equal(multiply(add(b,multiplicative_identity),a),a).
% 243 [para:164.1.1,62.1.1.1,demod:29,26] equal(additive_identity,inverse(add(X,multiplicative_identity))).
% 244 [para:243.1.2,24.1.1.2,demod:30] equal(add(X,multiplicative_identity),multiplicative_identity).
% 249 [para:244.1.1,197.1.1.1,demod:29,cut:17] 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:    105
%  derived clauses:   5297
%  kept clauses:      216
%  kept size sum:     2175
%  kept mid-nuclei:   0
%  kept new demods:   112
%  forw unit-subs:    3433
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     5
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.7
%  process. runtime:  0.4
% 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/BOO009-2+eq_r.in")
% 
%------------------------------------------------------------------------------