TSTP Solution File: BOO005-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO005-2 : 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 : art05.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-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,0,32,0,0)
%
%
% START OF PROOF
% 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(add(a,multiplicative_identity),multiplicative_identity).
% 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)).
% 36 [para:31.1.1,20.1.2.1] equal(add(multiply(additive_identity,X),Y),multiply(Y,add(X,Y))).
% 38 [para:24.1.1,20.1.2.1,demod:29] equal(add(multiply(X,Y),inverse(X)),add(Y,inverse(X))).
% 44 [para:33.1.2,38.1.1.2,demod:33] equal(add(multiply(additive_identity,X),multiplicative_identity),add(X,multiplicative_identity)).
% 48 [para:30.1.1,21.1.2.2] equal(add(X,multiply(Y,additive_identity)),multiply(add(X,Y),X)).
% 51 [para:21.1.2,20.1.2] equal(add(multiply(X,X),Y),add(X,multiply(Y,Y))).
% 55 [para:44.1.1,18.1.1] equal(add(X,multiplicative_identity),add(multiplicative_identity,multiply(additive_identity,X))).
% 59 [para:26.1.1,22.1.2.1,demod:31] equal(multiply(add(X,Y),inverse(X)),multiply(Y,inverse(X))).
% 64 [para:19.1.1,55.1.2.2] equal(add(X,multiplicative_identity),add(multiplicative_identity,multiply(X,additive_identity))).
% 79 [para:51.1.2,31.1.1] equal(add(multiply(additive_identity,additive_identity),X),multiply(X,X)).
% 82 [para:28.1.1,36.1.1.1,demod:31] equal(X,multiply(X,add(multiplicative_identity,X))).
% 94 [para:82.1.2,19.1.1] equal(X,multiply(add(multiplicative_identity,X),X)).
% 140 [para:55.1.2,59.1.1.1,demod:34] equal(multiply(add(X,multiplicative_identity),additive_identity),multiply(multiply(additive_identity,X),additive_identity)).
% 144 [para:59.1.1,94.1.2,demod:34] equal(additive_identity,multiply(additive_identity,additive_identity)).
% 146 [para:79.1.1,59.1.1.1,demod:28,33,144] equal(multiply(X,X),X).
% 148 [para:146.1.1,22.1.2.2] equal(multiply(add(X,Y),Y),add(multiply(X,Y),Y)).
% 157 [para:55.1.2,48.1.2.1,demod:28,148,64,140] equal(add(add(X,multiplicative_identity),multiplicative_identity),add(X,multiplicative_identity)).
% 171 [para:157.1.1,59.1.1.1,demod:29,26] equal(additive_identity,inverse(add(X,multiplicative_identity))).
% 190 [para:171.1.2,24.1.1.2,demod:30,slowcut:32] 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: 68
% derived clauses: 2918
% kept clauses: 156
% kept size sum: 1606
% kept mid-nuclei: 0
% kept new demods: 90
% forw unit-subs: 1807
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.2
% 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-2+eq_r.in")
%
%------------------------------------------------------------------------------