TSTP Solution File: GRP002-4 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP002-4 : TPTP v3.4.2. Released v1.0.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/GRP002-4+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 5 1)
% (binary-posweight-lex-big-order 30 #f 5 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(9,40,1,18,0,1)
% 
% 
% START OF PROOF
% 11 [] equal(multiply(identity,X),X).
% 12 [] equal(multiply(inverse(X),X),identity).
% 13 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 14 [] equal(multiply(X,identity),X).
% 15 [] equal(multiply(X,inverse(X)),identity).
% 16 [] equal(commutator(X,Y),multiply(X,multiply(Y,multiply(inverse(X),inverse(Y))))).
% 17 [] equal(multiply(X,multiply(X,X)),identity).
% 18 [] -equal(commutator(commutator(a,b),b),identity).
% 19 [para:12.1.1,14.1.1] equal(identity,inverse(identity)).
% 20 [para:12.1.1,13.1.1.1,demod:11] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 21 [para:17.1.1,13.1.1.1,demod:13,11] equal(X,multiply(Y,multiply(Y,multiply(Y,X)))).
% 22 [para:13.1.1,15.1.1] equal(multiply(X,multiply(Y,inverse(multiply(X,Y)))),identity).
% 23 [para:15.1.1,13.1.1.1,demod:11] equal(X,multiply(Y,multiply(inverse(Y),X))).
% 24 [para:12.1.1,20.1.2.2,demod:14] equal(X,inverse(inverse(X))).
% 25 [para:17.1.1,20.1.2.2,demod:14] equal(multiply(X,X),inverse(X)).
% 28 [para:25.1.1,13.1.1.1] equal(multiply(inverse(X),Y),multiply(X,multiply(X,Y))).
% 34 [para:16.1.2,20.1.2.2] equal(multiply(X,multiply(inverse(Y),inverse(X))),multiply(inverse(Y),commutator(Y,X))).
% 36 [para:25.1.2,16.1.2.2.2.2] equal(commutator(X,Y),multiply(X,multiply(Y,multiply(inverse(X),multiply(Y,Y))))).
% 39 [para:24.1.2,16.1.2.2.2.2] equal(commutator(X,inverse(Y)),multiply(X,multiply(inverse(Y),multiply(inverse(X),Y)))).
% 46 [para:22.1.1,20.1.2.2,demod:14] equal(multiply(X,inverse(multiply(Y,X))),inverse(Y)).
% 50 [para:46.1.1,20.1.2.2] equal(inverse(multiply(X,Y)),multiply(inverse(Y),inverse(X))).
% 51 [para:46.1.1,16.1.2.2.2,demod:50,13] equal(commutator(X,multiply(Y,inverse(X))),multiply(X,multiply(Y,inverse(multiply(Y,X))))).
% 53 [para:46.1.1,21.1.2.2.2] equal(inverse(multiply(X,Y)),multiply(Y,multiply(Y,inverse(X)))).
% 54 [para:46.1.1,23.1.2.2] equal(inverse(multiply(X,inverse(Y))),multiply(Y,inverse(X))).
% 55 [para:46.1.1,46.1.1.2.1,demod:24] equal(multiply(inverse(multiply(X,Y)),X),inverse(Y)).
% 60 [para:23.1.2,55.1.1.1.1] equal(multiply(inverse(X),Y),inverse(multiply(inverse(Y),X))).
% 61 [para:28.1.2,13.1.1,demod:13] equal(multiply(inverse(multiply(X,Y)),Z),multiply(X,multiply(Y,multiply(X,multiply(Y,Z))))).
% 62 [para:28.1.1,16.1.2.2.2,demod:51,53] equal(commutator(X,Y),commutator(X,multiply(Y,inverse(X)))).
% 70 [para:50.1.2,13.1.1.1] equal(multiply(inverse(multiply(X,Y)),Z),multiply(inverse(Y),multiply(inverse(X),Z))).
% 76 [para:55.1.1,62.1.2.2,demod:60] equal(commutator(X,multiply(inverse(Y),X)),commutator(X,inverse(Y))).
% 77 [para:28.1.1,62.1.2.2,demod:53] equal(commutator(X,inverse(Y)),commutator(X,inverse(multiply(X,Y)))).
% 78 [para:13.1.1,54.1.1.1] equal(inverse(multiply(X,multiply(Y,inverse(Z)))),multiply(Z,inverse(multiply(X,Y)))).
% 82 [para:16.1.2,60.1.2.1,demod:13,78,24] equal(multiply(X,multiply(inverse(multiply(X,Y)),Y)),inverse(commutator(inverse(Y),X))).
% 109 [para:34.1.2,55.1.1.1.1,demod:62,51,13,54,50] equal(commutator(X,Y),inverse(commutator(Y,X))).
% 128 [para:62.1.2,109.1.2.1,demod:109] equal(commutator(multiply(X,inverse(Y)),Y),commutator(X,Y)).
% 134 [para:36.1.2,28.1.1,demod:109,82,61,24] equal(commutator(inverse(X),Y),commutator(X,inverse(Y))).
% 147 [para:46.1.1,128.1.1.1,demod:77,134] equal(commutator(X,inverse(Y)),commutator(Y,multiply(X,Y))).
% 190 [para:147.1.1,134.1.1,demod:24,76] equal(commutator(X,inverse(Y)),commutator(Y,X)).
% 201 [para:190.1.1,128.1.1,demod:190,24] equal(commutator(X,multiply(Y,X)),commutator(X,Y)).
% 205 [para:50.1.2,201.1.1.2,demod:24,134] equal(commutator(X,multiply(X,Y)),commutator(X,Y)).
% 212 [para:39.1.2,46.1.1.2.1,demod:13,109,190,70] equal(multiply(inverse(multiply(X,Y)),multiply(Y,commutator(X,Y))),inverse(X)).
% 221 [para:39.1.2,39.1.2.2.2,demod:15,212,13,134,60,24] equal(commutator(X,multiply(inverse(multiply(X,Y)),Y)),identity).
% 228 [para:39.1.2,205.1.1.2,demod:221,70,190] equal(commutator(X,commutator(Y,X)),identity).
% 235 [para:228.1.1,109.1.2.1,demod:19,slowcut:18] 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 5
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    57
%  derived clauses:   2097
%  kept clauses:      215
%  kept size sum:     2686
%  kept mid-nuclei:   0
%  kept new demods:   167
%  forw unit-subs:    1782
%  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.4
%  process. runtime:  0.3
% 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/GRP002-4+eq_r.in")
% 
%------------------------------------------------------------------------------