TSTP Solution File: GRP512-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP512-1 : TPTP v3.4.2. Bugfixed v2.7.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art10.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/GRP/GRP512-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 4 1)
% (binary-posweight-lex-big-order 30 #f 4 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(3,40,1,6,0,1,6,50,1,9,0,1,9,50,1,12,0,1)
%
%
% START OF PROOF
% 11 [] equal(multiply(multiply(multiply(X,Y),Z),inverse(multiply(X,Z))),Y).
% 12 [] -equal(multiply(a,b),multiply(b,a)).
% 13 [para:11.1.1,11.1.1.1] equal(multiply(X,inverse(multiply(multiply(Y,X),inverse(multiply(Y,Z))))),Z).
% 14 [para:11.1.1,11.1.1.1.1] equal(multiply(multiply(X,Y),inverse(multiply(multiply(multiply(Z,X),U),Y))),inverse(multiply(Z,U))).
% 15 [para:11.1.1,11.1.1.2.1] equal(multiply(multiply(multiply(multiply(multiply(X,Y),Z),U),inverse(multiply(X,Z))),inverse(Y)),U).
% 16 [para:13.1.1,11.1.1.1.1] equal(multiply(multiply(X,Y),inverse(multiply(Z,Y))),inverse(multiply(multiply(U,Z),inverse(multiply(U,X))))).
% 22 [para:15.1.1,14.1.1.2.1,demod:11] equal(multiply(multiply(X,inverse(Y)),inverse(X)),inverse(Y)).
% 25 [para:22.1.1,11.1.1.1] equal(multiply(inverse(X),inverse(multiply(Y,inverse(Y)))),inverse(X)).
% 28 [para:11.1.1,22.1.1.1] equal(multiply(X,inverse(multiply(multiply(Y,X),Z))),inverse(multiply(Y,Z))).
% 29 [para:22.1.1,13.1.1.2.1.1,demod:28] equal(multiply(inverse(X),inverse(inverse(multiply(X,Y)))),Y).
% 31 [para:13.1.1,22.1.1.1] equal(multiply(X,inverse(Y)),inverse(multiply(multiply(Z,Y),inverse(multiply(Z,X))))).
% 39 [para:29.1.1,11.1.1.1.1] equal(multiply(multiply(X,Y),inverse(multiply(inverse(Z),Y))),inverse(inverse(multiply(Z,X)))).
% 43 [para:13.1.1,29.1.1.2.1.1,demod:31] equal(multiply(inverse(X),inverse(inverse(Y))),multiply(Y,inverse(X))).
% 46 [para:29.1.1,22.1.1.1] equal(multiply(X,inverse(inverse(Y))),inverse(inverse(multiply(Y,X)))).
% 47 [para:25.1.1,11.1.1.1.1,demod:43,46,39] equal(multiply(X,inverse(X)),inverse(multiply(Y,inverse(Y)))).
% 54 [para:47.1.2,13.1.1.2] equal(multiply(X,multiply(Y,inverse(Y))),X).
% 59 [para:47.1.1,22.1.1.1] equal(multiply(inverse(multiply(X,inverse(X))),inverse(Y)),inverse(Y)).
% 61 [para:47.1.2,29.1.1.1,demod:54,43,46] equal(multiply(multiply(X,inverse(X)),Y),Y).
% 63 [para:54.1.1,11.1.1.1,demod:54] equal(multiply(multiply(X,Y),inverse(X)),Y).
% 75 [para:16.1.1,13.1.1.2.1.2.1,demod:28,31] equal(multiply(inverse(X),inverse(Y)),inverse(multiply(X,Y))).
% 87 [para:16.1.2,22.1.1.1.2,demod:31,63] equal(multiply(multiply(X,Y),inverse(multiply(Z,Y))),multiply(X,inverse(Z))).
% 96 [para:25.1.1,16.1.2.1.1,demod:63,46,75,61,39] equal(inverse(inverse(X)),X).
% 100 [para:47.1.1,16.1.1.1,demod:31,59] equal(inverse(multiply(X,inverse(Y))),multiply(Y,inverse(X))).
% 102 [para:54.1.1,16.1.2.1.1,demod:63,100,61] equal(multiply(multiply(X,Y),inverse(Y)),X).
% 110 [para:96.1.1,29.1.1.1,demod:96,46] equal(multiply(X,multiply(Y,inverse(X))),Y).
% 116 [para:16.1.2,96.1.1.1,demod:100,87] equal(multiply(X,inverse(Y)),multiply(multiply(Z,X),inverse(multiply(Z,Y)))).
% 125 [para:63.1.1,16.1.1.1,demod:116,100] equal(multiply(X,multiply(Y,inverse(Z))),multiply(multiply(Y,X),inverse(Z))).
% 128 [para:63.1.1,16.1.2.1.2.1,demod:110,75,125] equal(multiply(X,inverse(multiply(Y,multiply(Z,X)))),inverse(multiply(Z,Y))).
% 131 [para:11.1.1,102.1.1.1,demod:96,46] equal(multiply(X,multiply(Y,Z)),multiply(multiply(Z,X),Y)).
% 134 [para:102.1.1,14.1.1.2.1.1,demod:100,125] equal(multiply(X,multiply(Y,inverse(multiply(Z,X)))),multiply(Y,inverse(Z))).
% 140 [para:102.1.1,16.1.2.1.1,demod:46,128,131,96,134,125,slowcut:12] 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 6
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 22
% derived clauses: 455
% kept clauses: 126
% kept size sum: 1779
% kept mid-nuclei: 0
% kept new demods: 111
% forw unit-subs: 240
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.2
% 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/GRP512-1+eq_r.in")
%
%------------------------------------------------------------------------------