TSTP Solution File: GRP595-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP595-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 : art07.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/GRP595-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 7 1)
% (binary-posweight-lex-big-order 30 #f 7 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(4,40,0,8,0,0)
%
%
% START OF PROOF
% 6 [] equal(inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,inverse(double_divide(Z,Y)))))),Z).
% 7 [] equal(multiply(X,Y),inverse(double_divide(Y,X))).
% 8 [] -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% 9 [para:6.1.1,7.1.2,demod:7] equal(multiply(multiply(multiply(X,Y),Z),double_divide(Z,X)),Y).
% 10 [para:6.1.1,6.1.1.1.2,demod:7] equal(multiply(X,double_divide(double_divide(Y,Z),multiply(Z,X))),Y).
% 11 [para:6.1.1,6.1.1.1.2.1.2,demod:7] equal(multiply(multiply(X,Y),double_divide(Y,multiply(multiply(Z,X),U))),double_divide(U,Z)).
% 12 [para:10.1.1,9.1.1.1] equal(multiply(X,double_divide(double_divide(double_divide(X,Y),multiply(Y,multiply(Z,U))),Z)),U).
% 13 [para:10.1.1,9.1.1.1.1] equal(multiply(multiply(X,Y),double_divide(Y,Z)),double_divide(double_divide(X,U),multiply(U,Z))).
% 18 [para:11.1.1,10.1.1] equal(double_divide(multiply(X,double_divide(Y,multiply(Z,X))),Z),Y).
% 24 [para:18.1.1,7.1.2.1] equal(multiply(X,multiply(Y,double_divide(Z,multiply(X,Y)))),inverse(Z)).
% 31 [para:11.1.1,18.1.1.1] equal(double_divide(double_divide(multiply(X,Y),Z),multiply(Z,X)),Y).
% 33 [para:18.1.1,18.1.1.1.2] equal(double_divide(multiply(X,Y),Z),multiply(U,double_divide(Y,multiply(multiply(Z,X),U)))).
% 34 [para:31.1.1,7.1.2.1] equal(multiply(multiply(X,Y),double_divide(multiply(Y,Z),X)),inverse(Z)).
% 44 [para:24.1.1,9.1.1.1,demod:33] equal(multiply(inverse(X),double_divide(double_divide(multiply(Y,X),Z),Z)),Y).
% 66 [para:34.1.1,31.1.1.1.1] equal(double_divide(double_divide(inverse(X),Y),multiply(Y,multiply(Z,U))),double_divide(multiply(U,X),Z)).
% 93 [para:44.1.1,18.1.1.1] equal(double_divide(X,Y),double_divide(multiply(X,Z),multiply(Y,inverse(Z)))).
% 107 [para:9.1.1,93.1.2.1,demod:7] equal(double_divide(multiply(multiply(X,Y),Z),U),double_divide(Y,multiply(U,multiply(X,Z)))).
% 108 [para:93.1.2,10.1.1.2.1,demod:33] equal(double_divide(multiply(inverse(X),double_divide(Y,Z)),Z),multiply(Y,X)).
% 143 [para:10.1.1,108.1.1.1] equal(double_divide(X,multiply(Y,inverse(Z))),multiply(double_divide(X,Y),Z)).
% 148 [para:12.1.1,108.1.1.1,demod:66] equal(double_divide(X,Y),multiply(double_divide(multiply(X,Z),Y),Z)).
% 151 [para:9.1.1,148.1.2.1.1,demod:107] equal(double_divide(X,multiply(Y,multiply(Z,U))),multiply(double_divide(X,Y),double_divide(U,Z))).
% 155 [para:18.1.1,148.1.2.1] equal(double_divide(X,Y),multiply(Z,double_divide(Z,multiply(Y,X)))).
% 164 [para:148.1.2,93.1.2.1,demod:143] equal(double_divide(double_divide(multiply(X,Y),Z),U),multiply(double_divide(double_divide(X,Z),U),Y)).
% 193 [para:13.1.1,24.1.1.2.2.2,demod:10,164,151] equal(multiply(multiply(X,Y),double_divide(Y,multiply(X,Z))),inverse(Z)).
% 221 [para:155.1.2,10.1.1] equal(double_divide(double_divide(X,Y),Y),X).
% 222 [para:155.1.2,10.1.1.2.2,demod:193,151] equal(double_divide(X,inverse(multiply(X,Y))),Y).
% 234 [para:155.1.2,34.1.1] equal(double_divide(X,Y),inverse(multiply(Y,X))).
% 252 [para:221.1.1,6.1.1.1.2.1.2.1,demod:7] equal(multiply(multiply(inverse(X),Y),double_divide(Y,Z)),double_divide(X,Z)).
% 255 [para:221.1.1,18.1.1.1.2] equal(double_divide(multiply(X,Y),Z),double_divide(Y,multiply(Z,X))).
% 256 [para:221.1.1,24.1.1.2.2,demod:7] equal(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z)).
% 266 [para:222.1.1,6.1.1.1.2.1.2.1,demod:252,7,234] equal(double_divide(X,double_divide(X,Y)),Y).
% 267 [para:10.1.1,222.1.1.2.1] equal(double_divide(X,inverse(Y)),double_divide(double_divide(Y,Z),multiply(Z,X))).
% 277 [para:222.1.1,148.1.2.1,demod:255,234,256] equal(double_divide(X,double_divide(Y,multiply(X,Z))),multiply(Y,Z)).
% 278 [para:222.1.1,13.1.1.2,demod:267,234,256] equal(multiply(X,multiply(Y,Z)),double_divide(double_divide(Z,Y),inverse(X))).
% 280 [para:266.1.1,7.1.2.1] equal(multiply(double_divide(X,Y),X),inverse(Y)).
% 288 [para:93.1.2,266.1.1.2,demod:280,255] equal(double_divide(X,inverse(Y)),multiply(Y,inverse(X))).
% 289 [para:266.1.1,108.1.1.1.2,demod:277,7,288,255] equal(multiply(X,Y),multiply(Y,X)).
% 292 [para:266.1.1,13.1.1.2,demod:278,267,256] equal(multiply(X,multiply(Y,Z)),multiply(X,multiply(Z,Y))).
% 349 [para:289.1.1,8.1.2.2,demod:256,cut:292] 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 7
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 27
% derived clauses: 633
% kept clauses: 340
% kept size sum: 5252
% kept mid-nuclei: 0
% kept new demods: 273
% forw unit-subs: 281
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.2
% 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/GRP595-1+eq_r.in")
%
%------------------------------------------------------------------------------