TSTP Solution File: GRP481-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP481-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 : 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/GRP481-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(6,40,1,12,0,1)
%
%
% START OF PROOF
% 7 [] equal(X,X).
% 8 [] equal(double_divide(double_divide(double_divide(X,double_divide(Y,identity)),double_divide(double_divide(Z,double_divide(U,double_divide(U,identity))),double_divide(X,identity))),Y),Z).
% 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(inverse(a1),a1),identity).
% 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))).
% 15 [para:11.1.2,9.1.2.1,demod:10] equal(multiply(inverse(X),X),inverse(identity)).
% 16 [para:9.1.2,9.1.2.1,demod:10] equal(multiply(identity,double_divide(X,Y)),inverse(multiply(Y,X))).
% 17 [para:8.1.1,10.1.2,demod:13,11,10] equal(multiply(double_divide(inverse(X),inverse(Y)),double_divide(Y,inverse(identity))),X).
% 25 [para:8.1.1,8.1.1.1.2,demod:14,11,10] equal(double_divide(double_divide(double_divide(X,inverse(Y)),Z),Y),double_divide(inverse(Z),multiply(identity,X))).
% 27 [para:8.1.1,8.1.1.1.2.2,demod:17,16,13,25,11,10] equal(double_divide(multiply(X,inverse(Y)),inverse(X)),Y).
% 28 [para:14.1.2,11.1.2.2] equal(identity,double_divide(inverse(X),multiply(identity,X))).
% 29 [para:14.1.2,14.1.2.1] equal(multiply(identity,inverse(X)),inverse(multiply(identity,X))).
% 30 [para:15.1.1,12.1.1] -equal(inverse(identity),identity).
% 32 [para:13.1.1,11.1.2.2] equal(identity,double_divide(double_divide(X,Y),multiply(Y,X))).
% 38 [para:15.1.1,27.1.1.1,demod:29,14] equal(double_divide(inverse(identity),multiply(identity,inverse(X))),X).
% 48 [para:11.1.2,17.1.1.1,demod:16] equal(inverse(multiply(inverse(identity),inverse(X))),X).
% 49 [para:11.1.2,17.1.1.2] equal(multiply(double_divide(inverse(X),inverse(identity)),identity),X).
% 65 [para:48.1.1,38.1.1.2.2] equal(double_divide(inverse(identity),multiply(identity,X)),multiply(inverse(identity),inverse(X))).
% 72 [para:29.1.2,49.1.1.1.1,demod:27] equal(multiply(X,identity),multiply(identity,X)).
% 74 [para:72.1.1,15.1.1] equal(multiply(identity,inverse(identity)),inverse(identity)).
% 75 [para:72.1.1,28.1.2.2,demod:65] equal(identity,multiply(inverse(identity),inverse(identity))).
% 84 [para:74.1.1,27.1.1.1] equal(double_divide(inverse(identity),inverse(identity)),identity).
% 88 [para:75.1.2,32.1.2.2,demod:10,84] equal(identity,inverse(identity)).
% 105 [para:88.1.2,30.1.1,cut:7] 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: 25
% derived clauses: 234
% kept clauses: 92
% kept size sum: 1067
% kept mid-nuclei: 0
% kept new demods: 91
% forw unit-subs: 138
% 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.1
% process. runtime: 0.1
% 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/GRP481-1+eq_r.in")
%
%------------------------------------------------------------------------------