TSTP Solution File: GRP601-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP601-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/GRP601-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(4,40,0,8,0,0)
%
%
% START OF PROOF
% 6 [] equal(inverse(double_divide(inverse(double_divide(X,inverse(double_divide(Y,double_divide(X,Z))))),Z)),Y).
% 7 [] equal(multiply(X,Y),inverse(double_divide(Y,X))).
% 8 [] -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 9 [para:6.1.1,7.1.2,demod:7] equal(multiply(X,multiply(multiply(double_divide(Y,X),Z),Y)),Z).
% 10 [para:6.1.1,6.1.1.1.1.1.2,demod:7] equal(multiply(X,multiply(Y,Z)),multiply(multiply(double_divide(U,double_divide(Z,X)),Y),U)).
% 11 [para:10.1.2,9.1.1.2] equal(multiply(double_divide(X,Y),multiply(Y,multiply(Z,X))),Z).
% 13 [para:10.1.2,11.1.1.2] equal(multiply(double_divide(X,multiply(double_divide(multiply(Y,X),double_divide(Z,U)),V)),multiply(U,multiply(V,Z))),Y).
% 15 [para:11.1.1,11.1.1.2] equal(multiply(double_divide(multiply(X,Y),double_divide(Y,Z)),X),Z).
% 16 [para:11.1.1,11.1.1.2.2] equal(multiply(double_divide(multiply(X,multiply(Y,Z)),U),multiply(U,Y)),double_divide(Z,X)).
% 17 [para:9.1.1,15.1.1.1.1] equal(multiply(double_divide(X,double_divide(multiply(multiply(double_divide(Y,Z),X),Y),U)),Z),U).
% 36 [para:16.1.1,15.1.1] equal(double_divide(X,multiply(double_divide(multiply(Y,X),Z),Y)),Z).
% 45 [para:36.1.1,7.1.2.1] equal(multiply(multiply(double_divide(multiply(X,Y),Z),X),Y),inverse(Z)).
% 57 [para:16.1.1,36.1.1.2] equal(double_divide(multiply(X,Y),double_divide(Y,multiply(Z,X))),Z).
% 80 [para:57.1.1,7.1.2.1] equal(multiply(double_divide(X,multiply(Y,Z)),multiply(Z,X)),inverse(Y)).
% 143 [para:80.1.1,13.1.1,demod:7] equal(multiply(double_divide(X,Y),multiply(Z,multiply(Y,X))),Z).
% 163 [para:11.1.1,143.1.1.2] equal(multiply(double_divide(multiply(X,Y),Z),X),double_divide(Y,Z)).
% 166 [para:15.1.1,143.1.1.2] equal(multiply(double_divide(X,Y),Z),double_divide(multiply(multiply(Y,X),U),double_divide(U,Z))).
% 174 [para:16.1.1,143.1.1.2] equal(multiply(double_divide(X,Y),double_divide(Z,U)),double_divide(multiply(U,multiply(X,Z)),Y)).
% 182 [para:57.1.1,143.1.1.1,demod:80] equal(multiply(X,multiply(Y,inverse(X))),Y).
% 190 [para:182.1.1,9.1.1] equal(multiply(double_divide(inverse(X),X),Y),Y).
% 202 [para:182.1.1,57.1.1.2.2,demod:166] equal(multiply(double_divide(inverse(X),Y),Y),X).
% 204 [para:45.1.1,182.1.1.2,demod:163] equal(multiply(X,inverse(Y)),double_divide(inverse(X),Y)).
% 250 [para:190.1.1,9.1.1,demod:204,10] equal(multiply(X,double_divide(inverse(Y),X)),Y).
% 252 [para:190.1.1,15.1.1.1.1,demod:250,204,174] equal(double_divide(X,double_divide(X,Y)),Y).
% 260 [para:190.1.1,182.1.1.2,demod:204] equal(double_divide(inverse(X),X),double_divide(inverse(Y),Y)).
% 267 [para:252.1.1,10.1.2.1.1] equal(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z)).
% 271 [para:252.1.1,36.1.1.2.1] equal(double_divide(X,multiply(Y,Z)),double_divide(multiply(Z,X),Y)).
% 290 [para:202.1.1,80.1.1.1.2,demod:204,7] equal(multiply(double_divide(X,Y),multiply(Z,X)),double_divide(inverse(Z),Y)).
% 294 [para:202.1.1,182.1.1.2] equal(multiply(X,Y),double_divide(inverse(Y),inverse(X))).
% 329 [para:17.1.1,182.1.1.2,demod:252,271,294,290,267] equal(multiply(X,Y),multiply(Y,X)).
% 343 [para:329.1.1,8.1.1,demod:204] -equal(double_divide(inverse(a1),a1),multiply(inverse(b1),b1)).
% 428 [para:329.1.1,343.1.2,demod:204,cut:260] 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 8
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 33
% derived clauses: 1169
% kept clauses: 419
% kept size sum: 6885
% kept mid-nuclei: 0
% kept new demods: 349
% forw unit-subs: 739
% 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.5
% 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/GRP601-1+eq_r.in")
%
%------------------------------------------------------------------------------