TSTP Solution File: GRP409-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP409-1 : TPTP v3.4.2. Released v2.6.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/GRP409-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 7 1)
% (binary-posweight-lex-big-order 30 #f 7 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,0,6,0,0,6,50,0,9,0,0,22,50,2,25,0,2,48,50,13,51,0,13)
%
%
% START OF PROOF
% 50 [] equal(multiply(multiply(inverse(multiply(X,inverse(multiply(Y,Z)))),multiply(X,inverse(Z))),inverse(multiply(inverse(Z),Z))),Y).
% 51 [] -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 53 [para:50.1.1,50.1.1.1.1.1.2.1] equal(multiply(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(inverse(multiply(inverse(Z),Z))))),inverse(multiply(inverse(inverse(multiply(inverse(Z),Z))),inverse(multiply(inverse(Z),Z))))),multiply(inverse(multiply(U,inverse(multiply(Y,Z)))),multiply(U,inverse(Z)))).
% 54 [para:50.1.1,50.1.1.1.2] equal(multiply(multiply(inverse(multiply(multiply(inverse(multiply(X,inverse(multiply(Y,Z)))),multiply(X,inverse(Z))),inverse(multiply(U,multiply(inverse(Z),Z))))),Y),inverse(multiply(inverse(multiply(inverse(Z),Z)),multiply(inverse(Z),Z)))),U).
% 58 [para:53.1.1,50.1.1] equal(multiply(inverse(multiply(X,inverse(multiply(multiply(Y,inverse(multiply(inverse(Z),Z))),Z)))),multiply(X,inverse(Z))),Y).
% 62 [para:53.1.1,53.1.1] equal(multiply(inverse(multiply(X,inverse(multiply(Y,Z)))),multiply(X,inverse(Z))),multiply(inverse(multiply(U,inverse(multiply(Y,Z)))),multiply(U,inverse(Z)))).
% 64 [para:58.1.1,50.1.1.1.1.1.2.1] equal(multiply(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(Z,inverse(U))))),inverse(multiply(inverse(multiply(Z,inverse(U))),multiply(Z,inverse(U))))),inverse(multiply(Z,inverse(multiply(multiply(Y,inverse(multiply(inverse(U),U))),U))))).
% 76 [para:58.1.1,62.1.1.1.1.2.1,demod:58] equal(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(Z,inverse(U))))),multiply(inverse(multiply(V,inverse(Y))),multiply(V,inverse(multiply(Z,inverse(U)))))).
% 81 [para:50.1.1,76.1.1.2.2.1,demod:50] equal(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(Z))),multiply(inverse(multiply(U,inverse(Y))),multiply(U,inverse(Z)))).
% 92 [para:81.1.1,50.1.1.1.1.1.2.1,demod:64] equal(inverse(multiply(X,inverse(multiply(multiply(multiply(inverse(multiply(Y,inverse(Z))),multiply(Y,inverse(U))),inverse(multiply(inverse(U),U))),U)))),inverse(multiply(X,inverse(Z)))).
% 93 [para:81.1.1,50.1.1.2.1] equal(multiply(multiply(inverse(multiply(X,inverse(multiply(Y,multiply(Z,inverse(U)))))),multiply(X,inverse(multiply(Z,inverse(U))))),inverse(multiply(inverse(multiply(V,inverse(U))),multiply(V,inverse(U))))),Y).
% 130 [para:58.1.1,93.1.1.1] equal(multiply(X,inverse(multiply(inverse(multiply(Y,inverse(Z))),multiply(Y,inverse(Z))))),multiply(X,inverse(multiply(inverse(multiply(U,inverse(Z))),multiply(U,inverse(Z)))))).
% 138 [para:50.1.1,130.1.1.2.1.1.1,demod:50] equal(multiply(X,inverse(multiply(inverse(Y),Y))),multiply(X,inverse(multiply(inverse(multiply(Z,inverse(multiply(inverse(U),U)))),multiply(Z,inverse(multiply(inverse(U),U))))))).
% 148 [para:50.1.1,138.1.2.2.1.1.1,demod:50] equal(multiply(X,inverse(multiply(inverse(Y),Y))),multiply(X,inverse(multiply(inverse(Z),Z)))).
% 170 [para:148.1.1,50.1.1] equal(multiply(multiply(inverse(multiply(X,inverse(multiply(Y,Z)))),multiply(X,inverse(Z))),inverse(multiply(inverse(U),U))),Y).
% 177 [para:148.1.1,54.1.1] equal(multiply(multiply(inverse(multiply(multiply(inverse(multiply(X,inverse(multiply(Y,Z)))),multiply(X,inverse(Z))),inverse(multiply(U,multiply(inverse(Z),Z))))),Y),inverse(multiply(inverse(V),V))),U).
% 238 [para:54.1.1,170.1.1.1.1.1,demod:177] equal(multiply(multiply(inverse(X),X),inverse(multiply(inverse(Y),Y))),inverse(multiply(inverse(Z),Z))).
% 340 [para:238.1.1,92.1.1.1.2.1.1] equal(inverse(multiply(X,inverse(multiply(inverse(multiply(inverse(Y),Y)),Z)))),inverse(multiply(X,inverse(Z)))).
% 392 [para:238.1.1,148.1.1] equal(inverse(multiply(inverse(X),X)),multiply(multiply(inverse(Y),Y),inverse(multiply(inverse(Z),Z)))).
% 477 [para:392.1.2,58.1.1.1.1.2.1.1,demod:340] equal(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(Y))),multiply(inverse(Z),Z)).
% 490 [para:477.1.2,51.1.1,cut:477] 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 10
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 68
% derived clauses: 8176
% kept clauses: 474
% kept size sum: 18274
% kept mid-nuclei: 0
% kept new demods: 110
% forw unit-subs: 1986
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 4
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.20
% process. runtime: 0.20
% 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/GRP409-1+eq_r.in")
%
%------------------------------------------------------------------------------