TSTP Solution File: GRP568-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP568-1 : TPTP v3.4.2. Bugfixed v2.7.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/GRP568-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,0,12,0,0)
%
%
% START OF PROOF
% 8 [] equal(double_divide(double_divide(X,double_divide(double_divide(Y,double_divide(X,Z)),double_divide(identity,Z))),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(a,b),multiply(b,a)).
% 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: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).
% 19 [para:11.1.2,8.1.1.1.2.1.2,demod:10] equal(double_divide(double_divide(X,double_divide(inverse(Y),double_divide(identity,inverse(X)))),inverse(identity)),Y).
% 23 [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)),double_divide(identity,Z)))).
% 25 [para:14.1.2,14.1.2.1] equal(multiply(identity,inverse(X)),inverse(multiply(identity,X))).
% 37 [para:11.1.2,17.1.1.1.2.1,demod:10,11] equal(double_divide(inverse(X),inverse(identity)),X).
% 41 [para:37.1.1,9.1.2.1,demod:10] equal(multiply(inverse(identity),inverse(X)),inverse(X)).
% 43 [para:14.1.2,37.1.1.1] equal(double_divide(multiply(identity,X),inverse(identity)),inverse(X)).
% 44 [para:13.1.1,37.1.1.1] equal(double_divide(multiply(X,Y),inverse(identity)),double_divide(Y,X)).
% 49 [para:43.1.1,17.1.1.1.2.1,demod:37] equal(double_divide(double_divide(identity,X),inverse(identity)),multiply(identity,X)).
% 52 [para:10.1.2,49.1.1.1,demod:37] equal(identity,multiply(identity,identity)).
% 53 [para:11.1.2,49.1.1.1,demod:11] equal(identity,multiply(identity,inverse(identity))).
% 58 [para:49.1.1,17.1.1.1.2.1,demod:49,43] equal(multiply(identity,inverse(X)),double_divide(identity,X)).
% 60 [para:52.1.2,25.1.2.1,demod:53] equal(identity,inverse(identity)).
% 63 [para:60.1.2,37.1.1.2,demod:14,10] equal(multiply(identity,X),X).
% 64 [para:60.1.2,41.1.1.1,demod:58] equal(double_divide(identity,X),inverse(X)).
% 65 [para:60.1.2,44.1.1.2,demod:10] equal(inverse(multiply(X,Y)),double_divide(Y,X)).
% 69 [para:19.1.1,9.1.2.1,demod:10,65,16,63,14,64,60] equal(double_divide(X,double_divide(inverse(Y),X)),inverse(Y)).
% 70 [para:19.1.1,8.1.1.1.2.1.2,demod:9,60,69,63,14,64] equal(multiply(multiply(X,Y),inverse(X)),Y).
% 71 [para:14.1.2,19.1.1.1.2.1,demod:9,60,14,64,63] equal(multiply(double_divide(X,Y),Y),inverse(X)).
% 87 [para:70.1.1,70.1.1.1,demod:65] equal(multiply(X,double_divide(X,Y)),inverse(Y)).
% 92 [para:71.1.1,44.1.1.1,demod:63,14,10,60] equal(X,double_divide(Y,double_divide(X,Y))).
% 97 [para:92.1.2,92.1.2.2] equal(X,double_divide(double_divide(Y,X),Y)).
% 113 [para:97.1.2,23.1.2.2,demod:63,14,10,60,64] equal(X,double_divide(Y,double_divide(Y,X))).
% 123 [para:113.1.2,87.1.1.2,demod:13,slowcut:12] 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: 48
% derived clauses: 999
% kept clauses: 109
% kept size sum: 1156
% kept mid-nuclei: 0
% kept new demods: 110
% forw unit-subs: 881
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 0
% 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/GRP568-1+eq_r.in")
%
%------------------------------------------------------------------------------