TSTP Solution File: GRP199-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP199-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 : 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 20.0s
% Output : Assurance 20.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/GRP/GRP199-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 5 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 5 3)
% (binary-posweight-lex-big-order 30 #f 5 3)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(9,40,0,18,0,0,47,50,3,56,0,3,235,50,74,244,0,74,2544,4,2256)
%
%
% START OF PROOF
% 236 [] equal(X,X).
% 237 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 238 [] -equal(multiply(X,Y),multiply(Z,Y)) | equal(X,Z).
% 239 [] -equal(multiply(X,Y),multiply(X,Z)) | equal(Y,Z).
% 240 [] equal(multiply(X,multiply(Y,multiply(Z,multiply(Y,X)))),multiply(Y,multiply(X,multiply(Z,multiply(X,Y))))).
% 241 [] equal(multiply(b,b0),multiply(a,a0)).
% 242 [] equal(multiply(d,b0),multiply(c,a0)).
% 243 [] equal(multiply(b,d0),multiply(a,c0)).
% 244 [] -equal(multiply(d,d0),multiply(c,c0)).
% 246 [para:242.1.2,240.1.1.2.2.2] equal(multiply(a0,multiply(c,multiply(X,multiply(d,b0)))),multiply(c,multiply(a0,multiply(X,multiply(a0,c))))).
% 248 [para:240.1.1,240.1.1.2,demod:237] equal(multiply(X,multiply(Y,multiply(X,multiply(Y,multiply(Y,multiply(Y,X)))))),multiply(Y,multiply(X,multiply(Y,multiply(X,multiply(X,multiply(Y,Y))))))).
% 252 [para:241.1.2,237.1.1.1,demod:237] equal(multiply(b,multiply(b0,X)),multiply(a,multiply(a0,X))).
% 253 [para:242.1.2,237.1.1.1,demod:237] equal(multiply(d,multiply(b0,X)),multiply(c,multiply(a0,X))).
% 254 [para:243.1.2,237.1.1.1,demod:237] equal(multiply(b,multiply(d0,X)),multiply(a,multiply(c0,X))).
% 257 [para:237.1.1,240.1.1.2.2,demod:237] equal(multiply(X,multiply(Y,multiply(Z,multiply(U,multiply(Y,X))))),multiply(Y,multiply(X,multiply(Z,multiply(U,multiply(X,Y)))))).
% 309 [para:237.1.1,246.1.2.2.2,demod:253,237] equal(multiply(a0,multiply(c,multiply(X,multiply(Y,multiply(d,b0))))),multiply(d,multiply(b0,multiply(X,multiply(Y,multiply(a0,c)))))).
% 360 [para:237.1.1,257.1.1.2.2,demod:237] equal(multiply(X,multiply(Y,multiply(Z,multiply(U,multiply(V,multiply(Y,X)))))),multiply(Y,multiply(X,multiply(Z,multiply(U,multiply(V,multiply(X,Y))))))).
% 1050 [para:360.1.1,248.1.1] equal(multiply(X,multiply(Y,multiply(Y,multiply(X,multiply(X,multiply(Y,X)))))),multiply(X,multiply(Y,multiply(X,multiply(Y,multiply(Y,multiply(X,X))))))).
% 1217 [hyper:239,1050] equal(multiply(X,multiply(X,multiply(Y,multiply(Y,multiply(X,Y))))),multiply(X,multiply(Y,multiply(X,multiply(X,multiply(Y,Y)))))).
% 1221 [hyper:239,1217] equal(multiply(X,multiply(Y,multiply(Y,multiply(X,Y)))),multiply(Y,multiply(X,multiply(X,multiply(Y,Y))))).
% 1242 [para:1221.1.1,237.1.1.1,demod:237] equal(multiply(X,multiply(Y,multiply(Y,multiply(X,multiply(X,Z))))),multiply(Y,multiply(X,multiply(X,multiply(Y,multiply(X,Z)))))).
% 1326 [para:1242.1.2,257.1.1] equal(multiply(X,multiply(Y,multiply(Y,multiply(X,multiply(X,Y))))),multiply(X,multiply(Y,multiply(X,multiply(Y,multiply(Y,X)))))).
% 1382 [hyper:239,1326] equal(multiply(X,multiply(X,multiply(Y,multiply(Y,X)))),multiply(X,multiply(Y,multiply(X,multiply(X,Y))))).
% 1396 [hyper:239,1382] equal(multiply(X,multiply(Y,multiply(Y,X))),multiply(Y,multiply(X,multiply(X,Y)))).
% 1436 [para:1396.1.1,237.1.1.1,demod:237] equal(multiply(X,multiply(Y,multiply(Y,multiply(X,Z)))),multiply(Y,multiply(X,multiply(X,multiply(Y,Z))))).
% 1438 [para:1396.1.1,252.1.2.2] equal(multiply(b,multiply(b0,multiply(X,multiply(X,a0)))),multiply(a,multiply(X,multiply(a0,multiply(a0,X))))).
% 1499 [para:1436.1.1,253.1.2.2] equal(multiply(d,multiply(b0,multiply(X,multiply(X,multiply(a0,Y))))),multiply(c,multiply(X,multiply(a0,multiply(a0,multiply(X,Y)))))).
% 1588 [para:1438.1.2,254.1.2] equal(multiply(b,multiply(d0,multiply(a0,multiply(a0,c0)))),multiply(b,multiply(b0,multiply(c0,multiply(c0,a0))))).
% 1698 [hyper:239,1588] equal(multiply(d0,multiply(a0,multiply(a0,c0))),multiply(b0,multiply(c0,multiply(c0,a0)))).
% 1703 [para:1698.1.2,237.1.1.1,demod:237] equal(multiply(d0,multiply(a0,multiply(a0,multiply(c0,X)))),multiply(b0,multiply(c0,multiply(c0,multiply(a0,X))))).
% 1721 [para:1703.1.2,309.1.2.2] equal(multiply(a0,multiply(c,multiply(c0,multiply(c0,multiply(d,b0))))),multiply(d,multiply(d0,multiply(a0,multiply(a0,multiply(c0,c)))))).
% 2478 [para:1721.1.2,237.1.1.1,demod:237] equal(multiply(a0,multiply(c,multiply(c0,multiply(c0,multiply(d,multiply(b0,X)))))),multiply(d,multiply(d0,multiply(a0,multiply(a0,multiply(c0,multiply(c,X))))))).
% 2546 [binary:238.2,244,demod:237] -equal(multiply(d,multiply(d0,X)),multiply(c,multiply(c0,X))).
% 2551 [para:2478.1.2,2546.1.1,demod:2478,1703,1499,cut:236] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 3
% clause depth limited to 7
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 776
% derived clauses: 407107
% kept clauses: 2508
% kept size sum: 64088
% kept mid-nuclei: 0
% kept new demods: 1532
% forw unit-subs: 41886
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 26
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 22.60
% process. runtime: 22.59
% 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/GRP/GRP199-1+eq_r.in")
%
%------------------------------------------------------------------------------