TSTP Solution File: GRP415-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP415-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 : 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 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/GRP415-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 9 1)
% (binary-posweight-lex-big-order 30 #f 9 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,28,50,10,31,0,10,86,50,88,89,0,88)
%
%
% START OF PROOF
% 88 [] equal(inverse(multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(Y,X)),multiply(Y,inverse(Z)))),inverse(multiply(inverse(X),X)))))),Z).
% 89 [] -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 90 [para:88.1.1,88.1.1.1.2.1.1.1.2.2] equal(inverse(multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(Y,X)),multiply(Y,Z))),inverse(multiply(inverse(X),X)))))),multiply(U,inverse(multiply(inverse(multiply(inverse(multiply(V,U)),multiply(V,inverse(Z)))),inverse(multiply(inverse(U),U)))))).
% 91 [para:90.1.1,88.1.1] equal(multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(Y,X)),multiply(Y,inverse(inverse(Z))))),inverse(multiply(inverse(X),X))))),Z).
% 92 [para:90.1.2,88.1.1.1] equal(inverse(inverse(multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(Y,X)),multiply(Y,Z))),inverse(multiply(inverse(X),X))))))),Z).
% 95 [para:91.1.1,88.1.1.1.2.1.1.1.2] equal(inverse(multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(Y,X)),Z)),inverse(multiply(inverse(X),X)))))),multiply(inverse(multiply(inverse(multiply(U,Y)),multiply(U,inverse(inverse(Z))))),inverse(multiply(inverse(Y),Y)))).
% 99 [para:95.1.1,88.1.1] equal(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,inverse(inverse(multiply(Y,inverse(Z))))))),inverse(multiply(inverse(Y),Y))),Z).
% 101 [para:95.1.2,90.1.2.2.1,demod:88] equal(X,multiply(Y,inverse(inverse(multiply(Z,inverse(multiply(inverse(multiply(inverse(multiply(Y,Z)),X)),inverse(multiply(inverse(Z),Z))))))))).
% 109 [para:88.1.1,101.1.2.2.1.1.2.1.1] equal(inverse(multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(Y,Z)))),multiply(X,inverse(U)))),inverse(multiply(inverse(inverse(multiply(Y,Z))),inverse(multiply(Y,Z)))))),multiply(Y,inverse(inverse(multiply(Z,inverse(multiply(U,inverse(multiply(inverse(Z),Z))))))))).
% 155 [para:109.1.1,91.1.1.2] equal(multiply(inverse(multiply(X,Y)),multiply(X,inverse(inverse(multiply(Y,inverse(multiply(inverse(Z),inverse(multiply(inverse(Y),Y))))))))),Z).
% 164 [para:90.1.1,155.1.1.2.2.1,demod:88] equal(multiply(inverse(multiply(X,Y)),multiply(X,Z)),multiply(inverse(multiply(U,Y)),multiply(U,Z))).
% 192 [para:164.1.1,99.1.1.2.1] equal(multiply(inverse(multiply(inverse(multiply(X,multiply(Y,Z))),multiply(X,inverse(inverse(multiply(multiply(Y,Z),inverse(U))))))),inverse(multiply(inverse(multiply(V,Z)),multiply(V,Z)))),U).
% 1382 [para:155.1.1,192.1.1.1.1] equal(multiply(inverse(X),inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,Z)))),multiply(inverse(X),inverse(multiply(inverse(multiply(U,Z)),multiply(U,Z))))).
% 1427 [para:1382.1.1,92.1.1.1.1.2.1.1.1.2,demod:88] equal(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Y))),inverse(multiply(inverse(multiply(Z,Y)),multiply(Z,Y)))).
% 1569 [para:99.1.1,1427.1.1.1.1.1,demod:99] equal(inverse(multiply(inverse(X),X)),inverse(multiply(inverse(multiply(Y,inverse(multiply(inverse(Z),Z)))),multiply(Y,inverse(multiply(inverse(Z),Z)))))).
% 1778 [para:99.1.1,1569.1.2.1.1.1,demod:99] equal(inverse(multiply(inverse(X),X)),inverse(multiply(inverse(Y),Y))).
% 1953 [para:1778.1.1,88.1.1.1.2.1.1.1.2.2,demod:88,slowcut:89] 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 11
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 122
% derived clauses: 49567
% kept clauses: 1939
% kept size sum: 97890
% kept mid-nuclei: 0
% kept new demods: 128
% forw unit-subs: 11646
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 18
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 1.57
% process. runtime: 1.55
% 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/GRP415-1+eq_r.in")
%
%------------------------------------------------------------------------------