TSTP Solution File: GRP571-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP571-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 : art05.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/GRP571-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 6 1)
% (binary-posweight-lex-big-order 30 #f 6 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(6,40,1,12,0,1)
%
%
% START OF PROOF
% 8 [] equal(double_divide(double_divide(X,double_divide(double_divide(Y,double_divide(X,Z)),double_divide(Z,identity))),double_divide(identity,identity)),Y).
% 9 [] equal(multiply(X,Y),double_divide(double_divide(Y,X),identity)).
% 10 [] equal(inverse(X),double_divide(X,identity)).
% 11 [] equal(identity,double_divide(X,inverse(X))).
% 12 [] -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% 13 [para:9.1.2,10.1.2] equal(inverse(double_divide(X,Y)),multiply(Y,X)).
% 14 [para:10.1.2,9.1.2.1,demod:10] equal(multiply(identity,X),inverse(inverse(X))).
% 16 [para:9.1.2,9.1.2.1,demod:10] equal(multiply(identity,double_divide(X,Y)),inverse(multiply(Y,X))).
% 17 [para:14.1.2,11.1.2.2] equal(identity,double_divide(inverse(X),multiply(identity,X))).
% 18 [para:14.1.2,14.1.2.1] equal(multiply(identity,inverse(X)),inverse(multiply(identity,X))).
% 25 [para:10.1.2,8.1.1.1.2.1.2,demod:10] equal(double_divide(double_divide(X,double_divide(double_divide(Y,inverse(X)),inverse(identity))),inverse(identity)),Y).
% 26 [para:10.1.2,8.1.1.1.2.2,demod:10] equal(double_divide(double_divide(X,double_divide(double_divide(Y,double_divide(X,Z)),inverse(Z))),inverse(identity)),Y).
% 27 [para:11.1.2,8.1.1.1.2.1.2,demod:14,10] equal(double_divide(double_divide(X,double_divide(inverse(Y),multiply(identity,X))),inverse(identity)),Y).
% 31 [para:8.1.1,8.1.1.1.2.1,demod:10] equal(double_divide(double_divide(identity,double_divide(X,inverse(identity))),inverse(identity)),double_divide(Y,double_divide(double_divide(X,double_divide(Y,Z)),inverse(Z)))).
% 39 [para:17.1.2,27.1.1.1.2,demod:10] equal(double_divide(inverse(X),inverse(identity)),X).
% 41 [para:39.1.1,9.1.2.1,demod:10] equal(multiply(inverse(identity),inverse(X)),inverse(X)).
% 42 [para:14.1.2,39.1.1.1] equal(double_divide(multiply(identity,X),inverse(identity)),inverse(X)).
% 43 [para:13.1.1,39.1.1.1] equal(double_divide(multiply(X,Y),inverse(identity)),double_divide(Y,X)).
% 53 [para:42.1.1,25.1.1.1.2.1,demod:39] equal(double_divide(double_divide(identity,X),inverse(identity)),multiply(identity,X)).
% 55 [para:10.1.2,53.1.1.1,demod:39] equal(identity,multiply(identity,identity)).
% 56 [para:11.1.2,53.1.1.1,demod:11] equal(identity,multiply(identity,inverse(identity))).
% 62 [para:53.1.1,25.1.1.1.2.1,demod:53,42] equal(multiply(identity,inverse(X)),double_divide(identity,X)).
% 63 [para:55.1.2,18.1.2.1,demod:56] equal(identity,inverse(identity)).
% 67 [para:63.1.2,39.1.1.2,demod:14,10] equal(multiply(identity,X),X).
% 68 [para:63.1.2,41.1.1.1,demod:62] equal(double_divide(identity,X),inverse(X)).
% 69 [para:63.1.2,43.1.1.2,demod:10] equal(inverse(multiply(X,Y)),double_divide(Y,X)).
% 70 [para:63.1.2,25.1.1.1.2.2,demod:63,9] equal(multiply(multiply(inverse(X),Y),X),Y).
% 71 [para:11.1.2,26.1.1.1.2.1.2,demod:9,63,67,14,10] equal(multiply(double_divide(inverse(X),Y),Y),X).
% 72 [para:26.1.1,9.1.2.1,demod:10,69,16,63] equal(double_divide(X,double_divide(double_divide(Y,double_divide(X,Z)),inverse(Z))),inverse(Y)).
% 76 [para:26.1.1,8.1.1.1.2.1.2,demod:9,68,63,72] equal(multiply(multiply(X,Y),inverse(X)),Y).
% 83 [para:68.1.1,9.1.2.1,demod:67,14,10] equal(multiply(X,identity),X).
% 89 [para:69.1.1,27.1.1.1.2.1,demod:9,63,67] equal(multiply(double_divide(double_divide(X,Y),Z),Z),multiply(Y,X)).
% 96 [para:14.1.2,71.1.1.1.1,demod:67] equal(multiply(double_divide(X,Y),Y),inverse(X)).
% 103 [para:70.1.1,76.1.1.1,demod:69] equal(multiply(X,double_divide(X,inverse(Y))),Y).
% 108 [para:96.1.1,43.1.1.1,demod:67,14,10,63] equal(X,double_divide(Y,double_divide(X,Y))).
% 112 [para:108.1.2,108.1.2.2] equal(X,double_divide(double_divide(Y,X),Y)).
% 131 [para:112.1.2,31.1.2.2,demod:68,67,14,10,63] equal(X,double_divide(Y,double_divide(Y,X))).
% 137 [para:131.1.2,108.1.2.2] equal(X,double_divide(double_divide(X,Y),Y)).
% 142 [para:137.1.2,96.1.1.1,demod:13] equal(multiply(X,Y),multiply(Y,X)).
% 153 [para:142.1.1,12.1.1] -equal(multiply(c3,multiply(a3,b3)),multiply(a3,multiply(b3,c3))).
% 158 [para:142.1.1,153.1.1.2] -equal(multiply(c3,multiply(b3,a3)),multiply(a3,multiply(b3,c3))).
% 161 [para:103.1.1,70.1.1.1] equal(multiply(X,Y),double_divide(inverse(Y),inverse(X))).
% 188 [para:69.1.1,161.1.2.1] equal(multiply(X,multiply(Y,Z)),double_divide(double_divide(Z,Y),inverse(X))).
% 215 [para:142.1.1,158.1.2] -equal(multiply(c3,multiply(b3,a3)),multiply(multiply(b3,c3),a3)).
% 221 [para:8.1.1,89.1.1.1,demod:188,10,83,63,68] equal(X,multiply(multiply(Y,multiply(double_divide(Z,Y),X)),Z)).
% 357 [para:103.1.1,221.1.2.1.2,demod:188,slowcut:215] 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 6
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 137
% derived clauses: 9628
% kept clauses: 343
% kept size sum: 3978
% kept mid-nuclei: 0
% kept new demods: 313
% forw unit-subs: 9270
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 5
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.11
% process. runtime: 0.12
% 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/GRP571-1+eq_r.in")
%
%------------------------------------------------------------------------------