TSTP Solution File: GRP205-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : GRP205-1 : TPTP v3.4.2. Released v2.3.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art02.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/GRP205-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 4 1)
% (binary-posweight-lex-big-order 30 #f 4 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(11,40,0,22,0,1)
% 
% 
% START OF PROOF
% 12 [] equal(X,X).
% 13 [] equal(multiply(identity,X),X).
% 14 [] equal(multiply(X,identity),X).
% 15 [] equal(multiply(X,left_division(X,Y)),Y).
% 16 [] equal(left_division(X,multiply(X,Y)),Y).
% 17 [] equal(multiply(right_division(X,Y),Y),X).
% 18 [] equal(right_division(multiply(X,Y),Y),X).
% 19 [] equal(multiply(X,right_inverse(X)),identity).
% 20 [] equal(multiply(left_inverse(X),X),identity).
% 21 [] equal(multiply(multiply(multiply(X,Y),X),Z),multiply(X,multiply(Y,multiply(X,Z)))).
% 22 [] -equal(multiply(x,multiply(multiply(y,z),x)),multiply(multiply(x,y),multiply(z,x))).
% 26 [para:14.1.1,16.1.1.2] equal(left_division(X,X),identity).
% 33 [para:20.1.1,18.1.1.1] equal(right_division(identity,X),left_inverse(X)).
% 35 [para:21.1.1,14.1.1,demod:14] equal(multiply(X,multiply(Y,X)),multiply(multiply(X,Y),X)).
% 37 [para:19.1.1,21.1.1.1.1,demod:13] equal(multiply(X,Y),multiply(X,multiply(right_inverse(X),multiply(X,Y)))).
% 38 [para:15.1.1,21.1.1.1.1] equal(multiply(multiply(X,Y),Z),multiply(Y,multiply(left_division(Y,X),multiply(Y,Z)))).
% 40 [para:19.1.1,35.1.2.1,demod:13] equal(multiply(X,multiply(right_inverse(X),X)),X).
% 47 [para:40.1.1,16.1.1.2,demod:26] equal(identity,multiply(right_inverse(X),X)).
% 50 [para:47.1.2,18.1.1.1,demod:33] equal(left_inverse(X),right_inverse(X)).
% 59 [para:15.1.1,37.1.2.2.2,demod:15] equal(X,multiply(Y,multiply(right_inverse(Y),X))).
% 60 [para:37.1.2,16.1.1.2,demod:16] equal(X,multiply(right_inverse(Y),multiply(Y,X))).
% 61 [para:15.1.1,59.1.2.2] equal(left_division(right_inverse(X),Y),multiply(X,Y)).
% 62 [para:59.1.2,16.1.1.2] equal(left_division(X,Y),multiply(right_inverse(X),Y)).
% 64 [para:60.1.2,18.1.1.1] equal(right_division(X,multiply(Y,X)),right_inverse(Y)).
% 66 [para:19.1.1,38.1.2.2.2,demod:15,14] equal(multiply(multiply(X,Y),right_inverse(Y)),X).
% 67 [para:20.1.1,38.1.2.2.2,demod:60,14,61,50] equal(multiply(multiply(X,right_inverse(Y)),Y),X).
% 69 [para:38.1.2,16.1.1.2] equal(left_division(X,multiply(multiply(Y,X),Z)),multiply(left_division(X,Y),multiply(X,Z))).
% 79 [para:17.1.1,64.1.1.2] equal(right_division(X,Y),right_inverse(right_division(Y,X))).
% 85 [para:15.1.1,66.1.1.1] equal(multiply(X,right_inverse(left_division(Y,X))),Y).
% 87 [para:17.1.1,66.1.1.1] equal(multiply(X,right_inverse(Y)),right_division(X,Y)).
% 94 [para:62.1.2,67.1.1.1] equal(multiply(left_division(X,right_inverse(Y)),Y),right_inverse(X)).
% 98 [para:79.1.2,61.1.1.1] equal(left_division(right_division(X,Y),Z),multiply(right_division(Y,X),Z)).
% 104 [para:85.1.1,16.1.1.2] equal(left_division(X,Y),right_inverse(left_division(Y,X))).
% 116 [para:87.1.1,35.1.2.1,demod:62] equal(multiply(X,left_division(Y,X)),multiply(right_division(X,Y),X)).
% 124 [para:104.1.2,61.1.1.1] equal(left_division(left_division(X,Y),Z),multiply(left_division(Y,X),Z)).
% 126 [para:104.1.2,87.1.1.2] equal(multiply(X,left_division(Y,Z)),right_division(X,left_division(Z,Y))).
% 266 [para:17.1.1,69.1.1.2.1] equal(left_division(X,multiply(Y,Z)),multiply(left_division(X,right_division(Y,X)),multiply(X,Z))).
% 461 [para:266.1.2,64.1.1.2,demod:116,98,104,126] equal(multiply(multiply(X,Y),left_division(multiply(Z,Y),X)),multiply(X,left_division(Z,X))).
% 618 [para:94.1.1,461.1.1.2.1,demod:124,61] equal(multiply(multiply(X,Y),multiply(Z,X)),multiply(X,multiply(multiply(Y,Z),X))).
% 739 [para:618.1.1,22.1.2,cut:12] 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 4
% seconds given: 60
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    404
%  derived clauses:   97801
%  kept clauses:      716
%  kept size sum:     11792
%  kept mid-nuclei:   0
%  kept new demods:   724
%  forw unit-subs:    26828
%  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  :  2.65
%  process. runtime:  2.62
% 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/GRP205-1+eq_r.in")
% 
%------------------------------------------------------------------------------