TSTP Solution File: GRP094-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP094-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 : art10.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/GRP094-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(6,40,0,12,0,0,182,50,101,188,0,101,646,4,702)
%
%
% START OF PROOF
% 183 [] equal(X,X).
% 184 [] equal(divide(divide(identity,divide(X,Y)),divide(divide(Y,Z),X)),Z).
% 185 [] equal(multiply(X,Y),divide(X,divide(identity,Y))).
% 186 [] equal(inverse(X),divide(identity,X)).
% 187 [] equal(identity,divide(X,X)).
% 188 [] -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)).
% 189 [para:186.1.2,187.1.2] equal(identity,inverse(identity)).
% 192 [para:185.1.2,186.1.2,demod:186] equal(inverse(inverse(X)),multiply(identity,X)).
% 193 [para:186.1.2,185.1.2.2] equal(multiply(X,Y),divide(X,inverse(Y))).
% 199 [para:187.1.2,184.1.1.1.2,demod:189,186] equal(inverse(divide(divide(X,Y),X)),Y).
% 200 [para:187.1.2,184.1.1.2,demod:199,186] equal(divide(X,identity),X).
% 201 [para:187.1.2,184.1.1.2.1,demod:193,186] equal(multiply(inverse(divide(X,Y)),X),Y).
% 202 [para:186.1.2,184.1.1.1] equal(divide(inverse(divide(X,Y)),divide(divide(Y,Z),X)),Z).
% 205 [para:185.1.2,184.1.1.1.2,demod:186] equal(divide(inverse(multiply(X,Y)),divide(divide(inverse(Y),Z),X)),Z).
% 206 [para:185.1.2,184.1.1.2,demod:186] equal(divide(inverse(divide(inverse(X),Y)),multiply(divide(Y,Z),X)),Z).
% 211 [para:187.1.2,199.1.1.1.1,demod:192,186] equal(multiply(identity,X),X).
% 212 [para:185.1.2,199.1.1.1,demod:186] equal(inverse(multiply(divide(inverse(X),Y),X)),Y).
% 215 [para:199.1.1,192.1.1.1,demod:211] equal(inverse(X),divide(divide(Y,X),Y)).
% 217 [para:184.1.1,199.1.1.1.1,demod:193,186] equal(inverse(multiply(X,divide(Y,Z))),divide(divide(Z,X),Y)).
% 220 [para:199.1.1,201.1.1.1] equal(multiply(X,divide(Y,X)),Y).
% 221 [para:185.1.2,220.1.1.2,demod:186] equal(multiply(inverse(X),multiply(Y,X)),Y).
% 224 [para:185.1.2,215.1.2.1,demod:211,192,186] equal(X,divide(multiply(Y,X),Y)).
% 227 [para:184.1.1,215.1.2.1,demod:193,186] equal(inverse(divide(divide(X,Y),Z)),multiply(Y,divide(Z,X))).
% 232 [para:224.1.2,215.1.2.1] equal(inverse(X),divide(Y,multiply(X,Y))).
% 234 [para:201.1.1,221.1.1.2] equal(multiply(inverse(X),Y),inverse(divide(X,Y))).
% 235 [para:232.1.2,184.1.1.1.2,demod:211,192,186] equal(divide(X,divide(divide(multiply(X,Y),Z),Y)),Z).
% 236 [para:232.1.2,184.1.1.2,demod:193,217,234,186] equal(multiply(multiply(divide(divide(X,Y),Z),Z),Y),X).
% 239 [para:232.1.2,215.1.2.1] equal(inverse(multiply(X,Y)),divide(inverse(X),Y)).
% 252 [para:186.1.2,202.1.1.1.1,demod:200,211,192] equal(divide(X,divide(X,Y)),Y).
% 254 [para:185.1.2,202.1.1.2.1,demod:186,234] equal(divide(multiply(inverse(X),Y),divide(multiply(Y,Z),X)),inverse(Z)).
% 257 [para:185.1.2,252.1.1.2,demod:186] equal(divide(X,multiply(X,Y)),inverse(Y)).
% 260 [para:252.1.1,199.1.1.1.1,demod:234] equal(multiply(inverse(X),Y),divide(Y,X)).
% 263 [para:232.1.2,252.1.1.2,demod:193] equal(multiply(X,Y),multiply(Y,X)).
% 265 [para:252.1.1,202.1.1.2.1,demod:260,234] equal(divide(divide(X,Y),divide(Z,Y)),divide(X,Z)).
% 273 [para:205.1.1,215.1.2.1,demod:239,193,227] equal(multiply(X,multiply(Y,Z)),divide(X,divide(inverse(Y),Z))).
% 274 [para:205.1.1,212.1.1.1.1,demod:239] equal(divide(inverse(X),multiply(Y,Z)),divide(divide(inverse(Z),X),Y)).
% 278 [para:252.1.1,205.1.1.2,demod:211,192,234,239,274] equal(divide(divide(multiply(X,multiply(Y,Z)),Z),Y),X).
% 281 [para:234.1.2,260.1.1.1,demod:260] equal(multiply(divide(X,Y),Z),divide(Z,divide(Y,X))).
% 300 [para:206.1.1,184.1.1.2.1,demod:281,265,260,186,211,192,234] equal(divide(multiply(X,Y),Z),divide(X,divide(Z,Y))).
% 303 [para:206.1.1,215.1.2.1,demod:211,192,260,234,281] equal(divide(divide(X,Y),Z),divide(X,multiply(Z,Y))).
% 317 [para:257.1.1,235.1.1.2.1,demod:273] equal(multiply(X,multiply(Y,Z)),multiply(multiply(X,Z),Y)).
% 330 [para:278.1.1,236.1.1.1.1,demod:317] equal(multiply(X,multiply(Y,Z)),multiply(X,multiply(Z,Y))).
% 647 [input:188,cut:263] -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)).
% 648 [para:254.1.2,647.1.1.1.1,demod:317,211,187,257,252,281,303,300,260,cut:183,cut:330,cut:183] 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: 520
% derived clauses: 469563
% kept clauses: 622
% kept size sum: 9601
% kept mid-nuclei: 4
% kept new demods: 219
% forw unit-subs: 234871
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 6
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 7.10
% process. runtime: 7.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/GRP094-1+eq_r.in")
%
%------------------------------------------------------------------------------