TSTP Solution File: GRP075-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP075-1 : TPTP v3.4.2. Bugfixed v2.3.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art08.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/GRP075-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 7 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 7 5)
% (binary-posweight-lex-big-order 30 #f 7 5)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% SOS clause
% -equal(multiply(inverse(a1),a1),identity) | -equal(multiply(identity,a2),a2) | -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% was split for some strategies as:
% -equal(multiply(inverse(a1),a1),identity).
% -equal(multiply(identity,a2),a2).
% -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(6,40,0,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(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))) | -equal(multiply(inverse(a1),a1),identity) | -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:14.1.2,11.1.2.2] equal(identity,double_divide(inverse(X),multiply(identity,X))).
% 18 [para:14.1.2,14.1.2.1] equal(multiply(identity,inverse(X)),inverse(multiply(identity,X))).
% 26 [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).
% 27 [para:10.1.2,8.1.1.1.1.2,demod:11,10] equal(double_divide(double_divide(double_divide(X,inverse(Y)),double_divide(inverse(Z),inverse(X))),Y),Z).
% 33 [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))).
% 35 [para:8.1.1,8.1.1.1.2.2,demod:26,16,13,33,11,10] equal(double_divide(multiply(X,inverse(Y)),inverse(X)),Y).
% 36 [para:35.1.1,9.1.2.1,demod:10] equal(multiply(inverse(X),multiply(X,inverse(Y))),inverse(Y)).
% 37 [para:14.1.2,35.1.1.1.2] equal(double_divide(multiply(X,multiply(identity,Y)),inverse(X)),inverse(Y)).
% 39 [para:15.1.1,35.1.1.1,demod:18,14] equal(double_divide(inverse(identity),multiply(identity,inverse(X))),X).
% 44 [para:39.1.1,9.1.2.1,demod:10] equal(multiply(multiply(identity,inverse(X)),inverse(identity)),inverse(X)).
% 54 [para:44.1.1,35.1.1.1,demod:14,18] equal(double_divide(inverse(X),multiply(identity,multiply(identity,X))),identity).
% 63 [para:36.1.1,37.1.1.1,demod:14] equal(double_divide(inverse(X),multiply(identity,identity)),multiply(identity,X)).
% 67 [para:63.1.1,17.1.2] equal(identity,multiply(identity,identity)).
% 70 [para:67.1.2,37.1.1.1.2] equal(double_divide(multiply(X,identity),inverse(X)),inverse(identity)).
% 75 [para:15.1.1,70.1.1.1,demod:10,67,14] equal(identity,inverse(identity)).
% 79 [para:75.1.2,35.1.1.2,demod:14,18,10] equal(multiply(identity,multiply(identity,X)),X).
% 80 [para:75.1.2,39.1.1.1] equal(double_divide(identity,multiply(identity,inverse(X))),X).
% 85 [para:79.1.1,54.1.1.2] equal(double_divide(inverse(X),X),identity).
% 88 [para:85.1.1,9.1.2.1,demod:75,10] equal(multiply(X,inverse(X)),identity).
% 96 [para:88.1.1,35.1.1.1] equal(double_divide(identity,inverse(X)),X).
% 100 [para:18.1.2,96.1.1.2,demod:80] equal(X,multiply(identity,X)).
% 102 [?] ?
% 104 [para:13.1.1,26.1.1.1.1,demod:102,10,75] equal(inverse(multiply(X,Y)),double_divide(Y,X)).
% 112 [para:14.1.2,27.1.1.1.2.1,demod:13,33,100] equal(double_divide(multiply(inverse(X),Y),X),inverse(Y)).
% 118 [para:75.1.2,27.1.1.1.2.2,demod:100,14,10,96] equal(double_divide(double_divide(X,Y),X),Y).
% 125 [para:118.1.1,118.1.1.1] equal(double_divide(X,double_divide(Y,X)),Y).
% 140 [para:37.1.1,125.1.1.2,demod:100] equal(double_divide(inverse(X),inverse(Y)),multiply(X,Y)).
% 180 [para:112.1.1,125.1.1.2] equal(double_divide(X,inverse(Y)),multiply(inverse(X),Y)).
% 198 [para:104.1.1,140.1.1.1] equal(double_divide(double_divide(X,Y),inverse(Z)),multiply(multiply(Y,X),Z)).
% 219 [para:140.1.1,33.1.1.1.1,demod:140,100] equal(double_divide(double_divide(multiply(X,Y),Z),Y),multiply(Z,X)).
% 230 [para:26.1.1,219.1.1.1.1,demod:140,198,10,75] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 242 [hyper:12,230,demod:100,11,180,cut:7,cut:7] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 7
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 87
% derived clauses: 3051
% kept clauses: 228
% kept size sum: 2825
% kept mid-nuclei: 0
% kept new demods: 231
% forw unit-subs: 2817
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 8
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.5
% process. runtime: 0.5
% 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/GRP075-1+eq_r.in")
%
%------------------------------------------------------------------------------