TSTP Solution File: GRP197-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP197-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 : art04.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 10.0s
% Output : Assurance 10.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/GRP197-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(6,40,0,12,0,0,14,50,0,20,0,0,24,50,0,30,0,0,75,50,89,81,0,89)
%
%
% START OF PROOF
% 77 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 79 [] -equal(multiply(X,Y),multiply(X,Z)) | equal(Y,Z).
% 80 [] equal(multiply(X,multiply(X,multiply(X,multiply(Y,Y)))),multiply(Y,multiply(X,multiply(X,multiply(Y,X))))).
% 81 [] -equal(multiply(b,multiply(b,multiply(a,multiply(a,a)))),multiply(a,multiply(b,multiply(a,multiply(a,b))))).
% 84 [para:80.1.1,77.1.1,demod:77] equal(multiply(X,multiply(Y,multiply(Z,multiply(Y,multiply(Z,multiply(X,multiply(Y,Z))))))),multiply(Y,multiply(Z,multiply(Y,multiply(Z,multiply(Y,multiply(Z,multiply(X,X)))))))).
% 85 [para:80.1.2,77.1.1,demod:77] equal(multiply(X,multiply(X,multiply(X,multiply(Y,multiply(Z,multiply(Y,Z)))))),multiply(Y,multiply(Z,multiply(X,multiply(X,multiply(Y,multiply(Z,X))))))).
% 86 [para:80.1.1,77.1.1.1,demod:77] equal(multiply(X,multiply(Y,multiply(Y,multiply(X,multiply(Y,Z))))),multiply(Y,multiply(Y,multiply(Y,multiply(X,multiply(X,Z)))))).
% 87 [para:80.1.2,77.1.1.1,demod:77] equal(multiply(X,multiply(X,multiply(X,multiply(Y,multiply(Y,Z))))),multiply(Y,multiply(X,multiply(X,multiply(Y,multiply(X,Z)))))).
% 104 [hyper:79,85] equal(multiply(X,multiply(X,multiply(X,multiply(Y,multiply(X,Y))))),multiply(Y,multiply(X,multiply(X,multiply(X,multiply(Y,X)))))).
% 106 [para:85.1.1,86.1.2] equal(multiply(X,multiply(Y,multiply(Y,multiply(X,multiply(Y,multiply(X,X)))))),multiply(X,multiply(X,multiply(Y,multiply(Y,multiply(X,multiply(X,Y))))))).
% 112 [para:104.1.1,77.1.1.1,demod:77] equal(multiply(X,multiply(Y,multiply(Y,multiply(Y,multiply(X,multiply(Y,Z)))))),multiply(Y,multiply(Y,multiply(Y,multiply(X,multiply(Y,multiply(X,Z))))))).
% 114 [para:104.1.2,86.1.2.2.2] equal(multiply(X,multiply(Y,multiply(Y,multiply(X,multiply(Y,multiply(X,multiply(Y,X))))))),multiply(Y,multiply(Y,multiply(X,multiply(X,multiply(X,multiply(Y,multiply(X,Y)))))))).
% 117 [hyper:79,84] equal(multiply(X,multiply(Y,multiply(X,multiply(Y,multiply(X,multiply(X,Y)))))),multiply(Y,multiply(X,multiply(Y,multiply(X,multiply(Y,multiply(X,X))))))).
% 133 [hyper:79,106] equal(multiply(X,multiply(X,multiply(Y,multiply(X,multiply(Y,Y))))),multiply(Y,multiply(X,multiply(X,multiply(Y,multiply(Y,X)))))).
% 138 [para:133.1.1,77.1.1.1,demod:77] equal(multiply(X,multiply(Y,multiply(Y,multiply(X,multiply(X,multiply(Y,Z)))))),multiply(Y,multiply(Y,multiply(X,multiply(Y,multiply(X,multiply(X,Z))))))).
% 148 [para:112.1.2,112.1.1.2] equal(multiply(X,multiply(X,multiply(Y,multiply(Y,multiply(Y,multiply(X,multiply(Y,Z))))))),multiply(Y,multiply(Y,multiply(Y,multiply(X,multiply(Y,multiply(X,multiply(X,Z)))))))).
% 252 [para:148.1.1,114.1.2] equal(multiply(X,multiply(Y,multiply(Y,multiply(X,multiply(Y,multiply(X,multiply(Y,X))))))),multiply(X,multiply(X,multiply(X,multiply(Y,multiply(X,multiply(Y,multiply(Y,Y)))))))).
% 321 [hyper:79,252] equal(multiply(X,multiply(X,multiply(Y,multiply(X,multiply(Y,multiply(X,Y)))))),multiply(Y,multiply(Y,multiply(X,multiply(Y,multiply(X,multiply(X,X))))))).
% 328 [para:321.1.2,138.1.2] equal(multiply(X,multiply(Y,multiply(Y,multiply(X,multiply(X,multiply(Y,X)))))),multiply(X,multiply(X,multiply(Y,multiply(X,multiply(Y,multiply(X,Y))))))).
% 338 [hyper:79,328] equal(multiply(X,multiply(X,multiply(Y,multiply(Y,multiply(X,Y))))),multiply(Y,multiply(X,multiply(Y,multiply(X,multiply(Y,X)))))).
% 348 [para:338.1.1,77.1.1.1,demod:77] equal(multiply(X,multiply(Y,multiply(X,multiply(Y,multiply(X,multiply(Y,Z)))))),multiply(Y,multiply(Y,multiply(X,multiply(X,multiply(Y,multiply(X,Z))))))).
% 387 [para:348.1.1,117.1.2] equal(multiply(X,multiply(Y,multiply(X,multiply(Y,multiply(X,multiply(X,Y)))))),multiply(X,multiply(X,multiply(Y,multiply(Y,multiply(X,multiply(Y,X))))))).
% 468 [hyper:79,387] equal(multiply(X,multiply(Y,multiply(X,multiply(Y,multiply(Y,X))))),multiply(Y,multiply(X,multiply(X,multiply(Y,multiply(X,Y)))))).
% 485 [para:468.1.2,87.1.2] equal(multiply(X,multiply(X,multiply(X,multiply(Y,multiply(Y,Y))))),multiply(X,multiply(Y,multiply(X,multiply(Y,multiply(Y,X)))))).
% 561 [hyper:79,485,slowcut:81] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation 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 8
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 256
% derived clauses: 420317
% kept clauses: 521
% kept size sum: 15291
% kept mid-nuclei: 0
% kept new demods: 4
% forw unit-subs: 129788
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 30
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 19.37
% process. runtime: 19.37
% 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/GRP197-1+eq_r.in")
%
%------------------------------------------------------------------------------