TSTP Solution File: GRP488-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP488-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/GRP488-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
% 8 [] equal(double_divide(X,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X,identity),double_divide(Y,Z))),Y),identity)),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(identity,a2),a2).
% 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:10.1.2,8.1.1.2,demod:13,10] equal(double_divide(X,multiply(Y,double_divide(identity,double_divide(inverse(X),double_divide(Y,Z))))),Z).
% 18 [para:10.1.2,8.1.1.2.1,demod:13,10] equal(double_divide(X,inverse(multiply(double_divide(inverse(X),double_divide(identity,Y)),identity))),Y).
% 20 [para:11.1.2,8.1.1.2.1.1.2.2,demod:9,14,10] equal(double_divide(X,multiply(Y,double_divide(identity,multiply(identity,X)))),inverse(Y)).
% 27 [para:14.1.2,14.1.2.1] equal(multiply(identity,inverse(X)),inverse(multiply(identity,X))).
% 40 [para:20.1.1,8.1.1.2.1.1.2.2,demod:9,10] equal(double_divide(X,multiply(Y,double_divide(identity,double_divide(inverse(X),inverse(Z))))),multiply(Z,double_divide(identity,multiply(identity,Y)))).
% 41 [para:15.1.1,20.1.1.2,demod:13] equal(double_divide(X,inverse(identity)),inverse(multiply(multiply(identity,X),identity))).
% 42 [para:16.1.1,20.1.1.2,demod:41] equal(double_divide(X,double_divide(X,inverse(identity))),inverse(identity)).
% 47 [para:42.1.1,8.1.1.2.1.1.2,demod:9,10,11] equal(double_divide(X,multiply(inverse(X),identity)),inverse(identity)).
% 49 [para:47.1.1,8.1.1.2.1.1.2.2,demod:41,16,40,9,10] equal(double_divide(X,inverse(identity)),multiply(inverse(X),identity)).
% 51 [para:15.1.1,47.1.1.2,demod:11] equal(identity,inverse(identity)).
% 53 [para:47.1.1,16.1.1.2,demod:15,10,49,51] equal(multiply(identity,identity),identity).
% 56 [para:53.1.1,20.1.1.2.2.2,demod:51,10] equal(double_divide(identity,multiply(X,identity)),inverse(X)).
% 63 [para:20.1.1,18.1.1.2.1.1.2,demod:51,10,53] equal(double_divide(X,inverse(multiply(double_divide(inverse(X),inverse(Y)),identity))),multiply(Y,identity)).
% 71 [para:49.1.2,56.1.1.2,demod:14,10,51] equal(double_divide(identity,inverse(X)),multiply(identity,X)).
% 72 [para:71.1.1,9.1.2.1,demod:27,10,51,49] equal(inverse(X),multiply(identity,inverse(X))).
% 74 [para:14.1.2,71.1.1.2,demod:72] equal(double_divide(identity,multiply(identity,X)),inverse(X)).
% 80 [para:13.1.1,72.1.2.2,demod:13] equal(multiply(X,Y),multiply(identity,multiply(X,Y))).
% 82 [para:74.1.1,8.1.1.2.1.1.2.2,demod:63,9,10] equal(multiply(X,identity),multiply(identity,X)).
% 84 [para:74.1.1,20.1.1.2.2] equal(double_divide(X,multiply(Y,inverse(X))),inverse(Y)).
% 93 [para:82.1.2,12.1.1] -equal(multiply(a2,identity),a2).
% 96 [para:82.1.2,16.1.1] equal(multiply(double_divide(X,Y),identity),inverse(multiply(Y,X))).
% 103 [para:82.1.2,17.1.1.2,demod:13,84,80,14,96,slowcut:93] 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: 32
% derived clauses: 377
% kept clauses: 89
% kept size sum: 1016
% kept mid-nuclei: 0
% kept new demods: 87
% forw unit-subs: 287
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% 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/GRP488-1+eq_r.in")
%
%------------------------------------------------------------------------------