TSTP Solution File: BOO014-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : BOO014-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/BOO014-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,1,20,0,1,226,50,33,236,0,34)
%
%
% START OF PROOF
% 228 [] equal(add(X,Y),add(Y,X)).
% 229 [] equal(multiply(X,Y),multiply(Y,X)).
% 230 [] equal(add(X,multiply(Y,Z)),multiply(add(X,Y),add(X,Z))).
% 231 [] equal(multiply(X,add(Y,Z)),add(multiply(X,Y),multiply(X,Z))).
% 232 [] equal(add(X,additive_identity),X).
% 233 [] equal(multiply(X,multiplicative_identity),X).
% 234 [] equal(add(X,inverse(X)),multiplicative_identity).
% 235 [] equal(multiply(X,inverse(X)),additive_identity).
% 236 [] -equal(inverse(add(a,b)),multiply(inverse(a),inverse(b))).
% 237 [para:228.1.1,232.1.1] equal(add(additive_identity,X),X).
% 238 [para:228.1.1,234.1.1] equal(add(inverse(X),X),multiplicative_identity).
% 241 [para:229.1.1,233.1.1] equal(multiply(multiplicative_identity,X),X).
% 242 [para:229.1.1,235.1.1] equal(multiply(inverse(X),X),additive_identity).
% 246 [para:232.1.1,230.1.2.1] equal(add(X,multiply(additive_identity,Y)),multiply(X,add(X,Y))).
% 247 [para:232.1.1,230.1.2.2] equal(add(X,multiply(Y,additive_identity)),multiply(add(X,Y),X)).
% 248 [para:234.1.1,230.1.2.1,demod:241] equal(add(X,multiply(inverse(X),Y)),add(X,Y)).
% 249 [para:234.1.1,230.1.2.2,demod:233] equal(add(X,multiply(Y,inverse(X))),add(X,Y)).
% 250 [para:228.1.1,230.1.2.1] equal(add(X,multiply(Y,Z)),multiply(add(Y,X),add(X,Z))).
% 252 [para:238.1.1,230.1.2.1,demod:241] equal(add(inverse(X),multiply(X,Y)),add(inverse(X),Y)).
% 253 [para:238.1.1,230.1.2.2,demod:233] equal(add(inverse(X),multiply(Y,X)),add(inverse(X),Y)).
% 255 [para:233.1.1,248.1.1.2,demod:234] equal(multiplicative_identity,add(X,multiplicative_identity)).
% 256 [para:235.1.1,248.1.1.2,demod:232] equal(X,add(X,inverse(inverse(X)))).
% 259 [para:242.1.1,248.1.1.2,demod:232] equal(X,add(X,X)).
% 260 [para:259.1.2,230.1.2.1] equal(add(X,multiply(X,Y)),multiply(X,add(X,Y))).
% 262 [para:255.1.2,228.1.1] equal(multiplicative_identity,add(multiplicative_identity,X)).
% 263 [para:256.1.2,228.1.1] equal(X,add(inverse(inverse(X)),X)).
% 264 [para:233.1.1,231.1.2.1,demod:233,262] equal(X,add(X,multiply(X,Y))).
% 266 [para:235.1.1,231.1.2.1,demod:237] equal(multiply(X,add(inverse(X),Y)),multiply(X,Y)).
% 268 [para:231.1.2,228.1.1,demod:231] equal(multiply(X,add(Y,Z)),multiply(X,add(Z,Y))).
% 271 [para:242.1.1,231.1.2.1,demod:237] equal(multiply(inverse(X),add(X,Y)),multiply(inverse(X),Y)).
% 272 [para:242.1.1,231.1.2.2,demod:232] equal(multiply(inverse(X),add(Y,X)),multiply(inverse(X),Y)).
% 275 [para:230.1.2,231.1.2.1] equal(multiply(add(X,Y),add(add(X,Z),U)),add(add(X,multiply(Y,Z)),multiply(add(X,Y),U))).
% 276 [para:230.1.2,231.1.2.2] equal(multiply(add(X,Y),add(Z,add(X,U))),add(multiply(add(X,Y),Z),add(X,multiply(Y,U)))).
% 277 [para:264.1.2,237.1.1] equal(additive_identity,multiply(additive_identity,X)).
% 278 [para:229.1.1,264.1.2.2] equal(X,add(X,multiply(Y,X))).
% 282 [para:277.1.2,229.1.1] equal(additive_identity,multiply(X,additive_identity)).
% 288 [para:228.1.1,246.1.2.2,demod:232,277] equal(X,multiply(X,add(Y,X))).
% 289 [para:246.1.2,248.1.1.2,demod:234,232,277] equal(multiplicative_identity,add(X,add(inverse(X),Y))).
% 297 [para:230.1.2,278.1.2.2] equal(add(X,Y),add(add(X,Y),add(X,multiply(Z,Y)))).
% 304 [para:288.1.2,229.1.1] equal(X,multiply(add(Y,X),X)).
% 322 [para:289.1.2,228.1.1] equal(multiplicative_identity,add(add(inverse(X),Y),X)).
% 382 [para:242.1.1,252.1.1.2,demod:263,232] equal(inverse(inverse(X)),X).
% 386 [para:246.1.2,252.1.1.2,demod:238,232,277] equal(multiplicative_identity,add(inverse(X),add(X,Y))).
% 397 [para:382.1.1,322.1.2.1.1] equal(multiplicative_identity,add(add(X,Y),inverse(X))).
% 402 [para:386.1.2,250.1.2.1,demod:241] equal(add(add(X,Y),multiply(inverse(X),Z)),add(add(X,Y),Z)).
% 506 [para:266.1.1,229.1.1] equal(multiply(X,Y),multiply(add(inverse(X),Y),X)).
% 507 [para:264.1.2,266.1.1.2,demod:235] equal(additive_identity,multiply(X,multiply(inverse(X),Y))).
% 515 [para:382.1.1,507.1.2.2.1] equal(additive_identity,multiply(inverse(X),multiply(X,Y))).
% 531 [para:304.1.2,515.1.2.2] equal(additive_identity,multiply(inverse(add(X,Y)),Y)).
% 532 [para:247.1.2,515.1.2.2,demod:232,282] equal(additive_identity,multiply(inverse(add(X,Y)),X)).
% 557 [para:531.1.2,253.1.1.2,demod:232] equal(inverse(X),add(inverse(X),inverse(add(Y,X)))).
% 558 [para:268.1.1,229.1.1] equal(multiply(X,add(Y,Z)),multiply(add(Z,Y),X)).
% 560 [para:268.1.1,248.1.1.2,demod:248] equal(add(X,add(Y,Z)),add(X,add(Z,Y))).
% 579 [para:532.1.2,253.1.1.2,demod:232] equal(inverse(X),add(inverse(X),inverse(add(X,Y)))).
% 607 [para:382.1.1,506.1.2.1.1] equal(multiply(inverse(X),Y),multiply(add(X,Y),inverse(X))).
% 609 [para:557.1.2,228.1.1] equal(inverse(X),add(inverse(add(Y,X)),inverse(X))).
% 611 [para:557.1.2,304.1.2.1] equal(inverse(add(X,Y)),multiply(inverse(Y),inverse(add(X,Y)))).
% 616 [para:579.1.2,228.1.1] equal(inverse(X),add(inverse(add(X,Y)),inverse(X))).
% 657 [para:271.1.1,253.1.1.2,demod:616] equal(add(inverse(add(X,Y)),multiply(inverse(X),Y)),inverse(X)).
% 756 [para:304.1.2,276.1.2.1,demod:264,260,250] equal(add(X,Y),add(X,add(Y,multiply(X,Z)))).
% 1078 [para:558.1.1,242.1.1] equal(multiply(add(X,Y),inverse(add(Y,X))),additive_identity).
% 1119 [para:1078.1.1,249.1.1.2,demod:232] equal(add(X,Y),add(add(X,Y),add(Y,X))).
% 1120 [para:1078.1.1,252.1.1.2,demod:232] equal(inverse(add(X,Y)),add(inverse(add(X,Y)),inverse(add(Y,X)))).
% 1134 [para:560.1.1,228.1.1] equal(add(X,add(Y,Z)),add(add(Z,Y),X)).
% 1164 [para:607.1.2,275.1.2.2,demod:402,233,397] equal(add(X,Y),add(add(X,multiply(Y,Z)),Y)).
% 1230 [para:304.1.2,756.1.2.2.2] equal(add(add(X,Y),Z),add(add(X,Y),add(Z,Y))).
% 1317 [para:1119.1.2,609.1.2.1.1,demod:1120] equal(inverse(add(X,Y)),inverse(add(Y,X))).
% 1372 [para:304.1.2,1164.1.2.1.2,demod:1230] equal(add(X,add(Y,Z)),add(add(X,Z),Y)).
% 1374 [para:1164.1.2,1134.1.1.2,demod:1372,756] equal(add(X,add(Y,Z)),add(Z,add(X,Y))).
% 1639 [para:616.1.2,1374.1.2.2] equal(add(inverse(add(X,Y)),add(inverse(X),Z)),add(Z,inverse(X))).
% 1731 [para:657.1.1,297.1.2.2,demod:1639,1372] equal(add(inverse(add(X,Y)),Y),add(Y,inverse(X))).
% 1737 [para:1731.1.1,272.1.1.2,demod:611,271] equal(multiply(inverse(X),inverse(Y)),inverse(add(Y,X))).
% 1743 [para:1737.1.1,236.1.2,cut:1317] 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: 482
% derived clauses: 118300
% kept clauses: 1712
% kept size sum: 24444
% kept mid-nuclei: 0
% kept new demods: 1319
% forw unit-subs: 90215
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 50
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 1.33
% process. runtime: 1.32
% 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/BOO014-4+eq_r.in")
%
%------------------------------------------------------------------------------