TSTP Solution File: GRP089-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP089-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 : art06.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/GRP089-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,0,10,0,0,149,50,42,154,0,42,583,4,723)
%
%
% START OF PROOF
% 150 [] equal(X,X).
% 151 [] equal(divide(X,divide(divide(X,Y),divide(Z,Y))),Z).
% 152 [] equal(multiply(X,Y),divide(X,divide(divide(Z,Z),Y))).
% 153 [] equal(inverse(X),divide(divide(Y,Y),X)).
% 154 [] -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)).
% 157 [para:151.1.1,153.1.2,demod:153] equal(inverse(divide(inverse(X),divide(Y,X))),Y).
% 158 [para:153.1.2,151.1.1.2] equal(divide(X,inverse(divide(Y,X))),Y).
% 162 [para:151.1.1,151.1.1.2] equal(divide(X,Y),divide(divide(X,divide(Y,Z)),Z)).
% 174 [para:157.1.1,158.1.1.2] equal(divide(divide(X,Y),X),inverse(Y)).
% 178 [para:174.1.1,151.1.1.2] equal(divide(divide(X,Y),inverse(Y)),X).
% 181 [para:151.1.1,174.1.1.1] equal(divide(X,Y),inverse(divide(divide(Y,Z),divide(X,Z)))).
% 185 [para:174.1.1,174.1.1.1] equal(divide(inverse(X),divide(Y,X)),inverse(Y)).
% 186 [para:178.1.1,153.1.2] equal(inverse(inverse(X)),X).
% 191 [para:151.1.1,178.1.1.1,demod:181] equal(divide(X,divide(X,Y)),Y).
% 192 [para:178.1.1,158.1.1.2.1] equal(divide(inverse(X),inverse(Y)),divide(Y,X)).
% 193 [para:178.1.1,157.1.1.1.2,demod:186] equal(inverse(divide(X,Y)),divide(Y,X)).
% 195 [para:152.1.2,153.1.2,demod:186,153] equal(X,multiply(divide(Y,Y),X)).
% 197 [para:153.1.2,152.1.2.2] equal(multiply(X,Y),divide(X,inverse(Y))).
% 199 [para:152.1.2,151.1.1] equal(multiply(X,divide(Y,X)),Y).
% 202 [para:151.1.1,152.1.2.2,demod:185,153] equal(multiply(X,inverse(Y)),divide(X,Y)).
% 203 [para:152.1.2,158.1.1.2.1,demod:192,153] equal(divide(multiply(X,Y),Y),X).
% 205 [para:152.1.2,174.1.1,demod:153] equal(multiply(divide(inverse(X),Y),X),inverse(Y)).
% 209 [para:152.1.2,191.1.1.2,demod:153] equal(divide(X,multiply(X,Y)),inverse(Y)).
% 211 [para:153.1.2,199.1.1.2,demod:202] equal(divide(X,X),divide(Y,Y)).
% 213 [para:178.1.1,199.1.1.2] equal(multiply(inverse(X),Y),divide(Y,X)).
% 214 [para:199.1.1,195.1.2] equal(divide(X,divide(Y,Y)),X).
% 216 [para:203.1.1,151.1.1.2.2] equal(divide(X,divide(divide(X,Y),Z)),multiply(Z,Y)).
% 217 [para:203.1.1,158.1.1.2.1,demod:197] equal(multiply(X,Y),multiply(Y,X)).
% 225 [para:152.1.2,193.1.1.1,demod:153] equal(inverse(multiply(X,Y)),divide(inverse(Y),X)).
% 230 [para:193.1.1,213.1.1.1] equal(multiply(divide(X,Y),Z),divide(Z,divide(Y,X))).
% 237 [para:174.1.1,162.1.2.1.2,demod:197] equal(divide(X,divide(Y,Z)),divide(multiply(X,Z),Y)).
% 240 [para:203.1.1,162.1.2.1.2] equal(divide(X,multiply(Y,Z)),divide(divide(X,Y),Z)).
% 245 [para:225.1.1,197.1.2.2] equal(multiply(X,multiply(Y,Z)),divide(X,divide(inverse(Z),Y))).
% 252 [para:209.1.1,216.1.1.2.1,demod:245] equal(multiply(X,multiply(Y,Z)),multiply(Y,multiply(X,Z))).
% 254 [para:216.1.1,205.1.1.1,demod:245,237,193,240] equal(multiply(multiply(X,Y),Z),multiply(Y,multiply(X,Z))).
% 584 [input:154,cut:217] -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)).
% 585 [para:245.1.1,584.2.2,demod:214,230,213,245,254,cut:252,cut:150,cut:211] 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: 469
% derived clauses: 468436
% kept clauses: 562
% kept size sum: 8856
% kept mid-nuclei: 4
% kept new demods: 141
% forw unit-subs: 196741
% 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.24
% process. runtime: 7.23
% 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/GRP089-1+eq_r.in")
%
%------------------------------------------------------------------------------