TSTP Solution File: GRP098-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP098-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/GRP098-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 5 7)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 5 7)
% (binary-posweight-lex-big-order 30 #f 5 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(4,40,0,8,0,0,13,50,0,17,0,0,1909,4,764)
%
%
% START OF PROOF
% 15 [] equal(divide(divide(divide(X,inverse(Y)),Z),divide(X,Z)),Y).
% 16 [] equal(multiply(X,Y),divide(X,inverse(Y))).
% 17 [] -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)).
% 18 [para:16.1.2,15.1.1.1,demod:16] equal(divide(multiply(multiply(X,Y),Z),multiply(X,Z)),Y).
% 19 [para:16.1.2,15.1.1.1.1] equal(divide(divide(multiply(X,Y),Z),divide(X,Z)),Y).
% 20 [para:15.1.1,15.1.1.1,demod:16] equal(divide(X,divide(multiply(Y,X),multiply(Y,Z))),Z).
% 21 [para:15.1.1,15.1.1.2,demod:16] equal(divide(divide(multiply(divide(multiply(X,Y),Z),U),divide(X,Z)),Y),U).
% 25 [para:20.1.1,15.1.1.2,demod:16] equal(divide(divide(multiply(X,Y),divide(multiply(Z,X),multiply(Z,U))),U),Y).
% 26 [para:25.1.1,16.1.2] equal(multiply(divide(multiply(X,Y),divide(multiply(Z,X),multiply(Z,inverse(U)))),U),Y).
% 27 [para:26.1.1,21.1.1.1.1,demod:16,20] equal(divide(multiply(X,Y),X),Y).
% 28 [para:27.1.1,16.1.2] equal(multiply(multiply(inverse(X),Y),X),Y).
% 31 [para:27.1.1,19.1.1.1] equal(divide(X,divide(Y,Y)),X).
% 34 [para:31.1.1,21.1.1] equal(divide(multiply(divide(multiply(X,divide(Y,Y)),Z),U),divide(X,Z)),U).
% 37 [para:31.1.1,27.1.1] equal(multiply(divide(X,X),Y),Y).
% 38 [para:16.1.2,37.1.1.1] equal(multiply(multiply(inverse(X),X),Y),Y).
% 39 [para:37.1.1,18.1.1.1.1,demod:37] equal(divide(multiply(X,Y),Y),X).
% 41 [para:37.1.1,20.1.1.2.1,demod:37] equal(divide(X,divide(X,Y)),Y).
% 51 [para:39.1.1,16.1.2] equal(multiply(multiply(X,inverse(Y)),Y),X).
% 55 [para:39.1.1,25.1.1.1] equal(divide(X,Y),divide(multiply(Z,X),multiply(Z,Y))).
% 58 [para:37.1.1,39.1.1.1] equal(divide(X,X),divide(Y,Y)).
% 59 [para:16.1.2,41.1.1.2] equal(divide(X,multiply(X,Y)),inverse(Y)).
% 75 [para:28.1.1,39.1.1.1] equal(divide(X,Y),multiply(inverse(Y),X)).
% 77 [para:58.1.1,26.1.1.1.2,demod:31,75] equal(multiply(divide(X,Y),Y),X).
% 79 [para:15.1.1,77.1.1.1,demod:16] equal(multiply(X,divide(Y,Z)),divide(multiply(Y,X),Z)).
% 82 [para:18.1.1,77.1.1.1] equal(multiply(X,multiply(Y,Z)),multiply(multiply(Y,X),Z)).
% 95 [para:25.1.1,77.1.1.1,demod:55] equal(multiply(X,Y),divide(multiply(Z,X),divide(Z,Y))).
% 99 [para:27.1.1,77.1.1.1] equal(multiply(X,Y),multiply(Y,X)).
% 135 [para:51.1.1,39.1.1.1] equal(divide(X,Y),multiply(X,inverse(Y))).
% 140 [para:26.1.1,59.1.1.2,demod:55,95,135] equal(divide(divide(X,Y),X),inverse(Y)).
% 143 [para:99.1.1,59.1.1.2] equal(divide(X,multiply(Y,X)),inverse(Y)).
% 182 [para:20.1.1,140.1.1.1,demod:55] equal(divide(X,Y),inverse(divide(Y,X))).
% 185 [para:59.1.1,140.1.1.1] equal(divide(inverse(X),Y),inverse(multiply(Y,X))).
% 190 [para:34.1.1,77.1.1.1,demod:27,79] equal(divide(multiply(X,Y),Z),multiply(divide(X,Z),Y)).
% 191 [para:182.1.2,16.1.2.2,demod:79] equal(divide(multiply(X,Y),Z),divide(Y,divide(Z,X))).
% 193 [para:21.1.1,182.1.2.1,demod:190,191] equal(divide(X,divide(divide(Y,divide(divide(Z,U),X)),divide(U,Z))),inverse(Y)).
% 221 [para:185.1.2,75.1.2.1,demod:75,190] equal(divide(X,multiply(Y,Z)),divide(divide(X,Z),Y)).
% 229 [para:99.1.1,82.1.2.1,demod:82] equal(multiply(X,multiply(Y,Z)),multiply(Y,multiply(X,Z))).
% 1910 [input:17,cut:38,cut:99] -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))) | -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 1911 [para:193.1.2,1910.2.1.1,demod:82,75,143,16,59,41,191,79,190,221,cut:58,cut:229] 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 6
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 305
% derived clauses: 168942
% kept clauses: 1891
% kept size sum: 40693
% kept mid-nuclei: 4
% kept new demods: 213
% forw unit-subs: 163024
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 6
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 7.67
% process. runtime: 7.65
% 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/GRP098-1+eq_r.in")
%
%------------------------------------------------------------------------------