TSTP Solution File: GRP433-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP433-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 : art04.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/GRP433-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,1,6,50,1,9,0,2)
%
%
% START OF PROOF
% 8 [] equal(inverse(multiply(multiply(multiply(inverse(multiply(multiply(X,Y),Z)),X),Y),multiply(U,inverse(U)))),Z).
% 9 [] -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 10 [para:8.1.1,8.1.1.1.1.1.1] equal(inverse(multiply(multiply(multiply(X,multiply(inverse(multiply(multiply(Y,Z),X)),Y)),Z),multiply(U,inverse(U)))),multiply(V,inverse(V))).
% 12 [para:10.1.1,10.1.1] equal(multiply(X,inverse(X)),multiply(Y,inverse(Y))).
% 15 [para:12.1.1,8.1.1.1.1.1.1.1] equal(inverse(multiply(multiply(multiply(inverse(multiply(X,inverse(X))),Y),Z),multiply(U,inverse(U)))),inverse(multiply(Y,Z))).
% 16 [para:12.1.1,8.1.1.1.1.1.1.1.1] equal(inverse(multiply(multiply(multiply(inverse(multiply(multiply(X,inverse(X)),Y)),Z),inverse(Z)),multiply(U,inverse(U)))),Y).
% 17 [para:8.1.1,12.1.1.2] equal(multiply(multiply(multiply(multiply(inverse(multiply(multiply(X,Y),Z)),X),Y),multiply(U,inverse(U))),Z),multiply(V,inverse(V))).
% 41 [para:12.1.1,16.1.1.1.1.1.1.1,demod:15] equal(inverse(multiply(X,inverse(X))),inverse(multiply(Y,inverse(Y)))).
% 47 [para:41.1.1,12.1.1.2] equal(multiply(multiply(X,inverse(X)),inverse(multiply(Y,inverse(Y)))),multiply(Z,inverse(Z))).
% 60 [para:47.1.1,10.1.1.1.1.1.2.1.1,demod:15] equal(inverse(multiply(multiply(inverse(multiply(X,inverse(X))),Y),inverse(Y))),multiply(Z,inverse(Z))).
% 73 [para:41.1.1,47.1.1.1.2] equal(multiply(multiply(multiply(X,inverse(X)),inverse(multiply(Y,inverse(Y)))),inverse(multiply(Z,inverse(Z)))),multiply(U,inverse(U))).
% 94 [para:60.1.1,8.1.1.1.1.1.1] equal(inverse(multiply(multiply(multiply(multiply(X,inverse(X)),inverse(multiply(Y,inverse(Y)))),Z),multiply(U,inverse(U)))),inverse(Z)).
% 500 [para:73.1.2,15.1.1.1.1,demod:94] equal(inverse(inverse(multiply(X,inverse(X)))),inverse(multiply(Y,inverse(multiply(inverse(multiply(Z,inverse(Z))),Y))))).
% 608 [para:500.1.2,500.1.2] equal(inverse(inverse(multiply(X,inverse(X)))),inverse(inverse(multiply(Y,inverse(Y))))).
% 613 [para:608.1.1,12.1.1.2] equal(multiply(inverse(multiply(X,inverse(X))),inverse(inverse(multiply(Y,inverse(Y))))),multiply(Z,inverse(Z))).
% 689 [para:613.1.2,15.1.1.1.1.1,demod:15] equal(inverse(multiply(inverse(inverse(multiply(X,inverse(X)))),Y)),inverse(multiply(inverse(inverse(multiply(Z,inverse(Z)))),Y))).
% 691 [para:613.1.2,16.1.1.1.1.1,demod:15] equal(inverse(multiply(inverse(inverse(multiply(X,inverse(X)))),inverse(inverse(inverse(multiply(multiply(Y,inverse(Y)),Z)))))),Z).
% 2878 [para:613.1.2,94.1.1.1.1.1,demod:15] equal(inverse(multiply(inverse(inverse(multiply(X,inverse(X)))),Y)),inverse(Y)).
% 3040 [para:2878.1.1,691.1.1] equal(inverse(inverse(inverse(inverse(multiply(multiply(X,inverse(X)),Y))))),Y).
% 3140 [para:94.1.1,3040.1.1.1.1.1,demod:3040] equal(inverse(inverse(multiply(X,inverse(X)))),multiply(Y,inverse(Y))).
% 3141 [para:3140.1.2,8.1.1.1.1.1.1.1.1,demod:2878] equal(inverse(multiply(multiply(multiply(inverse(X),Y),inverse(Y)),multiply(Z,inverse(Z)))),X).
% 3168 [para:3140.1.1,16.1.1.1.1.1.1.1.1.2,demod:3141] equal(multiply(multiply(inverse(multiply(X,inverse(X))),multiply(Y,inverse(Y))),Z),Z).
% 3180 [para:3140.1.1,47.1.1.1.2,demod:3168] equal(inverse(multiply(X,inverse(X))),multiply(Y,inverse(Y))).
% 3415 [para:3140.1.1,689.1.1.1.1,demod:2878] equal(inverse(multiply(multiply(X,inverse(X)),Y)),inverse(Y)).
% 3421 [para:3140.1.1,691.1.1.1.1,demod:3415] equal(inverse(inverse(inverse(inverse(X)))),X).
% 3509 [para:8.1.1,3421.1.1.1.1.1] equal(inverse(inverse(inverse(X))),multiply(multiply(multiply(inverse(multiply(multiply(Y,Z),X)),Y),Z),multiply(U,inverse(U)))).
% 3613 [para:689.1.1,3421.1.1.1.1.1,demod:3421,2878] equal(X,multiply(inverse(inverse(multiply(Y,inverse(Y)))),X)).
% 3646 [para:3421.1.1,3040.1.1] equal(multiply(multiply(X,inverse(X)),Y),Y).
% 3744 [para:3646.1.1,15.1.1.1.1,demod:3613] equal(inverse(multiply(X,multiply(Y,inverse(Y)))),inverse(X)).
% 3901 [para:3180.1.1,16.1.1.1.1.2,demod:3744,3646] equal(inverse(inverse(X)),X).
% 3959 [para:3901.1.1,17.1.2.2,demod:3901,3509,slowcut:9] 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: 79
% derived clauses: 33075
% kept clauses: 3948
% kept size sum: 124655
% kept mid-nuclei: 0
% kept new demods: 145
% forw unit-subs: 13533
% 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.46
% process. runtime: 0.47
% 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/GRP433-1+eq_r.in")
%
%------------------------------------------------------------------------------