TSTP Solution File: GRP408-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP408-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/GRP408-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 8 1)
% (binary-posweight-lex-big-order 30 #f 8 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,2,6,50,2,9,0,2)
%
%
% START OF PROOF
% 7 [] equal(X,X).
% 8 [] equal(multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(Y),multiply(inverse(Y),Y))))),Z).
% 9 [] -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% 10 [para:8.1.1,8.1.1.2.1.1.1] equal(multiply(X,inverse(multiply(inverse(Y),multiply(inverse(Z),multiply(inverse(Z),Z))))),inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Z)),U)),Y)),multiply(inverse(U),multiply(inverse(U),U))))).
% 11 [para:10.1.1,8.1.1] equal(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(multiply(X,Y)),U))),multiply(inverse(Z),multiply(inverse(Z),Z)))),U).
% 12 [para:10.1.2,8.1.1.2] equal(multiply(inverse(multiply(X,Y)),multiply(X,inverse(multiply(inverse(Z),multiply(inverse(Y),multiply(inverse(Y),Y)))))),Z).
% 14 [para:10.1.2,10.1.2.1.1] equal(multiply(inverse(multiply(X,Y)),inverse(multiply(inverse(multiply(inverse(Z),multiply(inverse(Z),Z))),multiply(inverse(Z),multiply(inverse(Z),Z))))),inverse(multiply(multiply(X,inverse(multiply(inverse(U),multiply(inverse(Y),multiply(inverse(Y),Y))))),multiply(inverse(U),multiply(inverse(U),U))))).
% 15 [para:10.1.2,12.1.1.2.2] equal(multiply(inverse(multiply(X,Y)),multiply(X,multiply(Z,inverse(multiply(inverse(U),multiply(inverse(V),multiply(inverse(V),V))))))),multiply(inverse(multiply(inverse(multiply(Z,V)),Y)),U)).
% 21 [para:11.1.1,11.1.1.1.1.1.1.1.1,demod:11] equal(inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),multiply(inverse(Y),multiply(inverse(Y),Y)))),Z).
% 27 [para:21.1.1,12.1.1.2.2] equal(multiply(inverse(multiply(X,Y)),multiply(X,Z)),multiply(inverse(multiply(U,Y)),multiply(U,Z))).
% 37 [para:27.1.1,12.1.1.2.2.1] equal(multiply(inverse(multiply(X,Y)),multiply(X,inverse(multiply(inverse(multiply(Z,U)),multiply(Z,multiply(inverse(Y),Y)))))),multiply(inverse(Y),U)).
% 38 [para:27.1.1,12.1.1.2.2.1.2.2] equal(multiply(inverse(multiply(X,multiply(Y,Z))),multiply(X,inverse(multiply(inverse(U),multiply(inverse(multiply(Y,Z)),multiply(inverse(multiply(V,Z)),multiply(V,Z))))))),U).
% 43 [para:27.1.1,21.1.1.1.2.2] equal(inverse(multiply(inverse(multiply(inverse(multiply(X,multiply(Y,Z))),multiply(X,U))),multiply(inverse(multiply(Y,Z)),multiply(inverse(multiply(V,Z)),multiply(V,Z))))),U).
% 44 [para:21.1.1,27.1.1.1] equal(multiply(X,multiply(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,X))),U)),multiply(inverse(multiply(V,multiply(inverse(Z),multiply(inverse(Z),Z)))),multiply(V,U))).
% 46 [para:27.1.1,27.1.1.1.1] equal(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),multiply(inverse(multiply(U,Y)),V)),multiply(inverse(multiply(W,multiply(U,Z))),multiply(W,V))).
% 47 [para:27.1.1,27.1.1.2] equal(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(multiply(U,Y)),multiply(U,V))),multiply(inverse(multiply(W,Z)),multiply(W,multiply(X,V)))).
% 52 [para:37.1.1,10.1.2.1.1.1,demod:8] equal(inverse(multiply(inverse(multiply(X,Y)),multiply(X,multiply(inverse(Z),Z)))),inverse(multiply(inverse(multiply(inverse(Z),Y)),multiply(inverse(Z),multiply(inverse(Z),Z))))).
% 59 [para:27.1.1,37.1.1.2.2.1.2.2] equal(multiply(inverse(multiply(X,multiply(Y,Z))),multiply(X,inverse(multiply(inverse(multiply(U,V)),multiply(U,multiply(inverse(multiply(W,Z)),multiply(W,Z))))))),multiply(inverse(multiply(Y,Z)),V)).
% 146 [para:47.1.1,46.1.1] equal(multiply(inverse(multiply(X,multiply(Y,Z))),multiply(X,multiply(Y,U))),multiply(inverse(multiply(V,multiply(W,Z))),multiply(V,multiply(W,U)))).
% 482 [para:27.1.1,52.1.2.1] equal(inverse(multiply(inverse(multiply(X,Y)),multiply(X,multiply(inverse(Z),Z)))),inverse(multiply(inverse(multiply(U,Y)),multiply(U,multiply(inverse(Z),Z))))).
% 630 [para:44.1.1,12.1.1.2.2.1,demod:59] equal(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,inverse(Z)))),multiply(inverse(Y),multiply(inverse(Y),Y))),Z).
% 741 [para:630.1.1,44.1.1.2] equal(multiply(inverse(X),X),multiply(inverse(multiply(Y,multiply(inverse(Z),multiply(inverse(Z),Z)))),multiply(Y,multiply(inverse(Z),multiply(inverse(Z),Z))))).
% 866 [para:630.1.1,741.1.2.1.1,demod:630] equal(multiply(inverse(X),X),multiply(inverse(Y),Y)).
% 869 [para:866.1.1,8.1.1.2.1.2.2] equal(multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(Y),multiply(inverse(U),U))))),Z).
% 872 [para:866.1.1,10.1.2.1.1.1,demod:869] equal(X,inverse(multiply(inverse(multiply(inverse(Y),Y)),multiply(inverse(X),multiply(inverse(X),X))))).
% 955 [para:866.1.1,52.1.2.1.1.1,demod:872] equal(inverse(multiply(inverse(multiply(X,Y)),multiply(X,multiply(inverse(Y),Y)))),Y).
% 1054 [para:866.1.1,955.1.1.1.2.2] equal(inverse(multiply(inverse(multiply(X,Y)),multiply(X,multiply(inverse(Z),Z)))),Y).
% 1063 [para:1054.1.1,12.1.1.2.2] equal(multiply(inverse(multiply(X,Y)),multiply(X,Z)),multiply(inverse(Y),Z)).
% 1073 [para:27.1.1,1054.1.1.1,demod:1063] equal(inverse(multiply(inverse(X),multiply(inverse(Y),Y))),X).
% 1095 [para:146.1.1,1054.1.1.1,demod:1063] equal(inverse(multiply(inverse(X),Y)),multiply(inverse(Y),X)).
% 1129 [para:38.1.1,1054.1.1.1.1.1,demod:1063,1073,1095] equal(multiply(multiply(X,multiply(Y,Z)),U),multiply(X,multiply(multiply(Y,Z),U))).
% 1151 [para:866.1.1,1054.1.1.1.2,demod:1073,1095] equal(multiply(multiply(inverse(X),X),Y),Y).
% 1153 [para:1151.1.1,10.1.1,demod:1151,1073,1095] equal(multiply(X,Y),multiply(Z,multiply(multiply(inverse(Z),X),Y))).
% 1156 [para:1151.1.1,12.1.1.1.1,demod:1151,1073,1095] equal(multiply(inverse(X),multiply(X,Y)),Y).
% 1157 [para:1151.1.1,11.1.1.1.1.1.1.1.1.1,demod:1153,1073,1151,1095] equal(multiply(X,multiply(inverse(X),Y)),Y).
% 1161 [para:1151.1.1,14.1.2.1,demod:1157,1156,1073,1095] equal(multiply(X,multiply(inverse(Y),Y)),X).
% 1166 [para:1151.1.1,482.1.1.1.1.1,demod:1156,1095,1161,1151] equal(inverse(inverse(X)),X).
% 1169 [para:1151.1.1,15.1.1.2.2,demod:1151,1063,1166,1095,1161] equal(multiply(inverse(X),multiply(Y,Z)),multiply(multiply(inverse(X),Y),Z)).
% 1172 [para:1151.1.1,43.1.1.1.1.1.1.1.2,demod:1169,1161,1151,1095,1063] equal(multiply(inverse(multiply(X,inverse(X))),Y),Y).
% 1177 [para:1166.1.1,10.1.2.1.2.1,demod:1172,1063,1129,1166,1095,1161] equal(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z)).
% 1233 [para:1177.1.2,9.1.1,cut:7] 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 9
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 63
% derived clauses: 17106
% kept clauses: 1223
% kept size sum: 44344
% kept mid-nuclei: 0
% kept new demods: 296
% forw unit-subs: 13049
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 8
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.53
% process. runtime: 0.54
% 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/GRP408-1+eq_r.in")
%
%------------------------------------------------------------------------------