TSTP Solution File: GRP090-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP090-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 : art03.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/GRP090-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 4 7)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 4 7)
% (binary-posweight-lex-big-order 30 #f 4 7)
% (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),multiply(inverse(b1),b1)) | -equal(multiply(multiply(inverse(b2),b2),a2),a2) | -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))) | -equal(multiply(a4,b4),multiply(b4,a4)).
% was split for some strategies as:
% -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% -equal(multiply(multiply(inverse(b2),b2),a2),a2).
% -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% -equal(multiply(a4,b4),multiply(b4,a4)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(5,40,1,10,0,2,142,50,39,147,0,39,575,4,718)
%
%
% START OF PROOF
% 143 [] equal(X,X).
% 144 [] equal(divide(divide(X,divide(Y,Z)),divide(X,Y)),Z).
% 145 [] equal(multiply(X,Y),divide(X,divide(divide(Z,Z),Y))).
% 146 [] equal(inverse(X),divide(divide(Y,Y),X)).
% 147 [] -equal(multiply(multiply(inverse(b2),b2),a2),a2) | -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))) | -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)) | -equal(multiply(a4,b4),multiply(b4,a4)).
% 148 [para:146.1.2,146.1.2.1] equal(inverse(X),divide(inverse(divide(Y,Y)),X)).
% 150 [para:144.1.1,146.1.2] equal(inverse(divide(divide(X,Y),X)),Y).
% 151 [para:146.1.2,144.1.1.1,demod:146] equal(divide(inverse(divide(X,Y)),inverse(X)),Y).
% 155 [para:144.1.1,144.1.1.1.2] equal(divide(divide(X,Y),divide(X,divide(Z,divide(U,Y)))),divide(Z,U)).
% 158 [para:146.1.2,150.1.1.1] equal(inverse(inverse(X)),X).
% 162 [para:150.1.1,158.1.1.1] equal(inverse(X),divide(divide(Y,X),Y)).
% 172 [para:148.1.2,151.1.1.1.1,demod:158] equal(divide(X,divide(Y,Y)),X).
% 177 [para:150.1.1,151.1.1.1] equal(divide(X,inverse(divide(Y,X))),Y).
% 181 [para:172.1.1,144.1.1] equal(divide(X,divide(X,Y)),Y).
% 186 [para:146.1.2,145.1.2.2] equal(multiply(X,Y),divide(X,inverse(Y))).
% 190 [para:145.1.2,144.1.1.1,demod:172] equal(divide(multiply(X,Y),X),Y).
% 199 [para:181.1.1,144.1.1.1.2] equal(divide(divide(X,Y),divide(X,Z)),divide(Z,Y)).
% 202 [para:181.1.1,150.1.1.1.1] equal(inverse(divide(X,Y)),divide(Y,X)).
% 203 [para:162.1.2,181.1.1.2,demod:186] equal(multiply(divide(X,Y),Y),X).
% 204 [para:181.1.1,151.1.1.1.1,demod:186] equal(multiply(inverse(X),Y),divide(Y,X)).
% 205 [para:172.1.1,181.1.1.2] equal(divide(X,X),divide(Y,Y)).
% 206 [para:145.1.2,181.1.1.2,demod:146] equal(divide(X,multiply(X,Y)),inverse(Y)).
% 211 [para:144.1.1,203.1.1.1] equal(multiply(X,divide(Y,Z)),divide(Y,divide(Z,X))).
% 212 [para:190.1.1,203.1.1.1] equal(multiply(X,Y),multiply(Y,X)).
% 216 [para:144.1.1,177.1.1.2.1,demod:186] equal(multiply(divide(X,Y),Z),divide(X,divide(Y,Z))).
% 218 [para:145.1.2,202.1.1.1,demod:146] equal(inverse(multiply(X,Y)),divide(inverse(Y),X)).
% 221 [para:206.1.1,144.1.1.1.2,demod:186] equal(divide(multiply(X,Y),divide(X,Z)),multiply(Z,Y)).
% 225 [para:155.1.1,144.1.1.1.2,demod:199] equal(divide(divide(X,Y),divide(Z,U)),divide(X,divide(Z,divide(U,Y)))).
% 230 [para:190.1.1,155.1.1.2.2.2,demod:181,225] equal(divide(divide(X,Y),Z),divide(X,multiply(Z,Y))).
% 236 [para:218.1.1,186.1.2.2] equal(multiply(X,multiply(Y,Z)),divide(X,divide(inverse(Z),Y))).
% 247 [para:145.1.2,216.1.1.1,demod:236,146] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Z,Y))).
% 252 [para:221.1.1,211.1.1.2,demod:247,221,230] equal(multiply(X,multiply(Y,Z)),multiply(X,multiply(Z,Y))).
% 576 [input:147,cut:212] -equal(multiply(multiply(inverse(b2),b2),a2),a2) | -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))) | -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 577 [para:236.1.1,576.2.2,demod:181,216,204,236,247,cut:252,cut:143,cut:205] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 7
% clause depth limited to 5
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 458
% derived clauses: 463111
% kept clauses: 554
% kept size sum: 8783
% kept mid-nuclei: 4
% kept new demods: 146
% forw unit-subs: 196011
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 4
% fast unit cutoff: 6
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 7.16
% process. runtime: 7.17
% 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/GRP090-1+eq_r.in")
%
%------------------------------------------------------------------------------