TSTP Solution File: BOO022-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO022-1 : TPTP v3.4.2. Released v2.2.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/BOO022-1+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(8,40,1,16,0,2,143,50,11,151,0,11)
%
%
% START OF PROOF
% 145 [] equal(multiply(add(X,Y),Y),Y).
% 146 [] equal(multiply(X,add(Y,Z)),add(multiply(Y,X),multiply(Z,X))).
% 147 [] equal(add(X,inverse(X)),n1).
% 148 [] equal(add(multiply(X,Y),Y),Y).
% 149 [] equal(add(X,multiply(Y,Z)),multiply(add(Y,X),add(Z,X))).
% 150 [] equal(multiply(X,inverse(X)),n0).
% 151 [] -equal(multiply(multiply(a,b),c),multiply(a,multiply(b,c))).
% 154 [para:148.1.1,145.1.1.1] equal(multiply(X,X),X).
% 155 [para:145.1.1,148.1.1.1] equal(add(X,X),X).
% 160 [para:150.1.1,146.1.2.2] equal(multiply(inverse(X),add(Y,X)),add(multiply(Y,inverse(X)),n0)).
% 165 [para:154.1.1,146.1.2.2,demod:148] equal(multiply(X,add(Y,X)),X).
% 166 [para:146.1.2,155.1.1,demod:155] equal(multiply(X,Y),multiply(Y,X)).
% 180 [para:166.1.1,150.1.1] equal(multiply(inverse(X),X),n0).
% 181 [para:166.1.1,148.1.1.1] equal(add(multiply(X,Y),X),X).
% 183 [para:166.1.1,151.1.1.1] -equal(multiply(multiply(b,a),c),multiply(a,multiply(b,c))).
% 188 [para:147.1.1,149.1.2.1] equal(add(inverse(X),multiply(X,Y)),multiply(n1,add(Y,inverse(X)))).
% 189 [para:147.1.1,149.1.2.2] equal(add(inverse(X),multiply(Y,X)),multiply(add(Y,inverse(X)),n1)).
% 193 [para:149.1.2,154.1.1,demod:154] equal(add(X,Y),add(Y,X)).
% 194 [para:155.1.1,149.1.2.1,demod:165] equal(add(X,multiply(X,Y)),X).
% 200 [para:146.1.2,149.1.2.1] equal(add(multiply(X,Y),multiply(multiply(Z,Y),U)),multiply(multiply(Y,add(Z,X)),add(U,multiply(X,Y)))).
% 205 [para:180.1.1,148.1.1.1] equal(add(n0,X),X).
% 220 [para:193.1.1,147.1.1] equal(add(inverse(X),X),n1).
% 223 [para:193.1.1,149.1.2.1] equal(add(X,multiply(Y,Z)),multiply(add(X,Y),add(Z,X))).
% 225 [para:193.1.1,205.1.1] equal(add(X,n0),X).
% 237 [para:220.1.1,145.1.1.1] equal(multiply(n1,X),X).
% 238 [para:220.1.1,165.1.1.2] equal(multiply(X,n1),X).
% 245 [para:166.1.1,183.1.2] -equal(multiply(multiply(b,a),c),multiply(multiply(b,c),a)).
% 250 [para:148.1.1,160.1.1.2,demod:225,180] equal(n0,multiply(multiply(X,Y),inverse(Y))).
% 255 [para:181.1.1,160.1.1.2,demod:225,180] equal(n0,multiply(multiply(X,Y),inverse(X))).
% 259 [para:194.1.1,149.1.2.1] equal(add(multiply(X,Y),multiply(X,Z)),multiply(X,add(Z,multiply(X,Y)))).
% 304 [para:255.1.2,166.1.1] equal(n0,multiply(inverse(X),multiply(X,Y))).
% 317 [para:304.1.2,146.1.2.1,demod:205] equal(multiply(multiply(X,Y),add(inverse(X),Z)),multiply(Z,multiply(X,Y))).
% 318 [para:304.1.2,146.1.2.2,demod:225] equal(multiply(multiply(X,Y),add(Z,inverse(X))),multiply(Z,multiply(X,Y))).
% 422 [para:166.1.1,245.1.2.1] -equal(multiply(multiply(b,a),c),multiply(multiply(c,b),a)).
% 654 [para:189.1.1,200.1.2.2,demod:318,238,225,250] equal(multiply(X,Y),multiply(X,multiply(Y,add(Z,X)))).
% 772 [para:188.1.1,223.1.2.1,demod:149,237] equal(add(inverse(X),multiply(multiply(X,Y),Z)),add(inverse(X),multiply(Y,Z))).
% 1064 [para:255.1.2,259.1.1.2,demod:317,772,225] equal(multiply(multiply(X,Y),Z),multiply(multiply(Y,Z),multiply(X,Y))).
% 1291 [para:194.1.1,654.1.2.2.2,demod:1064,slowcut:422] 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: 386
% derived clauses: 53426
% kept clauses: 1265
% kept size sum: 17601
% kept mid-nuclei: 0
% kept new demods: 1104
% forw unit-subs: 41310
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 28
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.56
% process. runtime: 0.55
% 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/BOO022-1+eq_r.in")
%
%------------------------------------------------------------------------------