TSTP Solution File: GRP440-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP440-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/GRP440-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,0,6,0,0,6,50,0,9,0,0,9,50,0,12,0,0,17,50,0,20,0,0,35,50,5,38,0,5)
%
%
% START OF PROOF
% 37 [] equal(inverse(multiply(X,multiply(Y,multiply(multiply(inverse(Y),Z),inverse(multiply(U,multiply(X,Z))))))),U).
% 38 [] -equal(multiply(multiply(inverse(b2),b2),a2),a2).
% 40 [para:37.1.1,37.1.1.1.2.2.2] equal(inverse(multiply(X,multiply(Y,multiply(multiply(inverse(Y),multiply(multiply(inverse(X),Z),inverse(multiply(U,multiply(V,Z))))),U)))),V).
% 42 [para:40.1.1,37.1.1.1.2.2.2] equal(inverse(multiply(X,multiply(Y,multiply(multiply(inverse(Y),multiply(multiply(inverse(X),multiply(multiply(inverse(Z),U),inverse(multiply(V,multiply(W,U))))),V)),W)))),Z).
% 49 [para:37.1.1,42.1.1.1.2.2.1.2.1.2.1.1] equal(inverse(multiply(X,multiply(Y,multiply(multiply(inverse(Y),multiply(multiply(inverse(X),multiply(multiply(Z,U),inverse(multiply(V,multiply(W,U))))),V)),W)))),multiply(X1,multiply(X2,multiply(multiply(inverse(X2),X3),inverse(multiply(Z,multiply(X1,X3))))))).
% 137 [para:49.1.1,42.1.1] equal(multiply(X,multiply(Y,multiply(multiply(inverse(Y),Z),inverse(multiply(inverse(U),multiply(X,Z)))))),U).
% 152 [para:137.1.1,37.1.1.1.2.2.2.1.2] equal(inverse(multiply(X,multiply(Y,multiply(multiply(inverse(Y),multiply(Z,multiply(multiply(inverse(Z),U),inverse(multiply(inverse(V),multiply(X,U)))))),inverse(multiply(W,V)))))),W).
% 268 [para:49.1.2,152.1.1.1.2.2.1,demod:42] equal(inverse(multiply(inverse(X),multiply(X,multiply(Y,inverse(multiply(Z,Y)))))),Z).
% 332 [para:268.1.1,49.1.2.2.2.2,demod:42] equal(X,multiply(X,multiply(Y,multiply(multiply(inverse(Y),multiply(Z,inverse(multiply(U,Z)))),U)))).
% 349 [para:268.1.1,152.1.1.1.2.2.1.2.2.2,demod:332] equal(inverse(multiply(X,multiply(Y,multiply(inverse(Y),inverse(multiply(Z,X)))))),Z).
% 414 [para:349.1.1,137.1.1.2.2.2] equal(multiply(X,multiply(Y,multiply(multiply(inverse(Y),multiply(inverse(X),inverse(multiply(Z,inverse(U))))),Z))),U).
% 438 [para:349.1.1,349.1.1.1.2.2.2] equal(inverse(multiply(multiply(X,multiply(inverse(X),inverse(multiply(Y,Z)))),multiply(U,multiply(inverse(U),Y)))),Z).
% 451 [para:332.1.2,137.1.1.2.2.1,demod:332] equal(multiply(X,multiply(Y,multiply(inverse(Y),inverse(multiply(inverse(Z),X))))),Z).
% 456 [para:268.1.1,332.1.2.2.2.1.2.2] equal(X,multiply(X,multiply(Y,multiply(multiply(inverse(Y),multiply(multiply(Z,multiply(U,inverse(multiply(V,U)))),V)),inverse(Z))))).
% 459 [para:349.1.1,332.1.2.2.2.1.2.2] equal(X,multiply(X,multiply(Y,multiply(multiply(inverse(Y),multiply(multiply(Z,multiply(inverse(Z),inverse(multiply(U,V)))),U)),V)))).
% 503 [para:268.1.1,451.1.1.2.2.2] equal(multiply(multiply(X,multiply(Y,inverse(multiply(Z,Y)))),multiply(U,multiply(inverse(U),Z))),X).
% 1285 [para:332.1.2,459.1.2.2.2,demod:332] equal(X,multiply(X,multiply(Y,multiply(inverse(Y),multiply(multiply(Z,multiply(inverse(Z),inverse(U))),U))))).
% 1370 [para:1285.1.2,503.1.1] equal(multiply(X,multiply(Y,inverse(multiply(multiply(multiply(Z,multiply(inverse(Z),inverse(U))),U),Y)))),X).
% 1440 [para:1370.1.1,37.1.1.1.2] equal(inverse(multiply(inverse(X),X)),multiply(multiply(Y,multiply(inverse(Y),inverse(Z))),Z)).
% 1577 [para:1440.1.1,49.1.2.2.2.2,demod:42] equal(multiply(X,Y),multiply(X,multiply(Z,multiply(multiply(inverse(Z),Y),multiply(multiply(U,multiply(inverse(U),inverse(V))),V))))).
% 1664 [para:1440.1.2,438.1.1.1] equal(inverse(inverse(multiply(inverse(X),X))),multiply(inverse(Y),Y)).
% 1688 [para:1440.1.1,456.1.2.2.2.2,demod:1577] equal(X,multiply(X,multiply(multiply(multiply(inverse(Y),Y),multiply(Z,inverse(multiply(U,Z)))),U))).
% 1863 [para:1664.1.1,332.1.2.2.2.1.1,demod:1688] equal(X,multiply(X,inverse(multiply(inverse(Y),Y)))).
% 2032 [para:1863.1.2,49.1.2.2.2,demod:42] equal(multiply(X,Y),multiply(X,multiply(Z,multiply(inverse(Z),Y)))).
% 2034 [para:1863.1.2,137.1.1.2.2.1,demod:2032,1863] equal(multiply(X,inverse(multiply(inverse(Y),X))),Y).
% 2044 [para:1863.1.2,268.1.1.1.2.2] equal(inverse(multiply(inverse(X),multiply(X,Y))),inverse(Y)).
% 2045 [para:1863.1.2,268.1.1.1.2.2.2.1,demod:2044] equal(inverse(multiply(inverse(multiply(inverse(X),X)),inverse(Y))),Y).
% 2049 [para:1863.1.2,332.1.2.2.2,demod:2032,2034] equal(X,multiply(X,multiply(inverse(Y),Y))).
% 2070 [para:1863.1.2,414.1.1.2.2,demod:2032,2045] equal(multiply(X,multiply(inverse(X),Y)),Y).
% 2105 [para:2049.1.2,37.1.1.1.2.2.1,demod:2070,2049] equal(inverse(multiply(X,inverse(multiply(Y,X)))),Y).
% 2162 [para:2049.1.2,268.1.1.1,demod:2105] equal(inverse(inverse(X)),X).
% 2169 [para:2049.1.2,451.1.1.2.2.2.1,demod:2070,2162,slowcut:38] 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 12
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 79
% derived clauses: 9787
% kept clauses: 2149
% kept size sum: 91530
% kept mid-nuclei: 0
% kept new demods: 1406
% forw unit-subs: 1896
% 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.43
% process. runtime: 0.42
% 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/GRP440-1+eq_r.in")
%
%------------------------------------------------------------------------------