TSTP Solution File: GRP450-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP450-1 : TPTP v3.4.2. Released v2.6.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.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/GRP450-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: ueq
%
% strategies selected:
% (binary-posweight-kb-big-order 60 #f 6 1)
% (binary-posweight-lex-big-order 30 #f 6 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(5,40,0,10,0,0)
%
%
% START OF PROOF
% 6 [] equal(X,X).
% 7 [] equal(divide(X,divide(divide(divide(divide(Y,Y),Y),Z),divide(divide(divide(Y,Y),X),Z))),Y).
% 8 [] equal(multiply(X,Y),divide(X,divide(divide(Z,Z),Y))).
% 9 [] equal(inverse(X),divide(divide(Y,Y),X)).
% 10 [] -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% 11 [para:9.1.2,9.1.2.1] equal(inverse(X),divide(inverse(divide(Y,Y)),X)).
% 14 [para:8.1.2,9.1.2,demod:9] equal(inverse(inverse(X)),multiply(divide(Y,Y),X)).
% 17 [para:9.1.2,8.1.2.2] equal(multiply(X,Y),divide(X,inverse(Y))).
% 18 [para:8.1.2,11.1.2,demod:9] equal(inverse(inverse(X)),multiply(inverse(divide(Y,Y)),X)).
% 32 [para:7.1.1,9.1.2,demod:17,11,9] equal(inverse(multiply(divide(inverse(X),Y),Y)),X).
% 33 [para:9.1.2,7.1.1.2,demod:17,9] equal(multiply(X,multiply(inverse(X),Y)),Y).
% 40 [para:8.1.2,7.1.1.2.2.1,demod:9] equal(divide(inverse(X),divide(divide(inverse(Y),Z),divide(multiply(divide(Y,Y),X),Z))),Y).
% 43 [para:33.1.1,14.1.2,demod:18] equal(inverse(inverse(inverse(inverse(X)))),X).
% 45 [para:18.1.2,33.1.1.2] equal(multiply(divide(X,X),inverse(inverse(Y))),Y).
% 46 [para:33.1.1,33.1.1.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 50 [para:43.1.1,33.1.1.2.1,demod:46] equal(multiply(inverse(X),multiply(X,Y)),Y).
% 52 [para:11.1.2,32.1.1.1.1] equal(inverse(multiply(inverse(X),X)),divide(Y,Y)).
% 94 [para:52.1.2,7.1.1.2,demod:17] equal(multiply(X,multiply(inverse(Y),Y)),X).
% 95 [para:52.1.2,7.1.1.2.2,demod:94,17,9] equal(divide(X,multiply(inverse(Y),X)),Y).
% 101 [para:52.1.1,52.1.1] equal(divide(X,X),divide(Y,Y)).
% 109 [para:101.1.1,7.1.1.2] equal(divide(X,divide(Y,Y)),X).
% 116 [para:9.1.2,109.1.1.2,demod:17] equal(multiply(X,divide(Y,Y)),X).
% 123 [para:109.1.1,32.1.1.1.1,demod:116] equal(inverse(inverse(X)),X).
% 124 [para:109.1.1,45.1.1.1,demod:123] equal(multiply(divide(X,X),Y),Y).
% 125 [para:123.1.1,17.1.2.2] equal(multiply(X,inverse(Y)),divide(X,Y)).
% 130 [para:14.1.1,95.1.1.2.1,demod:124] equal(divide(X,multiply(Y,X)),inverse(Y)).
% 134 [para:33.1.1,95.1.1.2,demod:123] equal(divide(multiply(X,Y),Y),X).
% 136 [para:134.1.1,8.1.2,demod:125,9] equal(multiply(divide(X,Y),Y),X).
% 139 [para:125.1.1,33.1.1.2] equal(multiply(X,divide(inverse(X),Y)),inverse(Y)).
% 144 [para:136.1.1,130.1.1.2] equal(divide(X,Y),inverse(divide(Y,X))).
% 148 [para:8.1.2,144.1.2.1,demod:9] equal(divide(inverse(X),Y),inverse(multiply(Y,X))).
% 149 [para:144.1.2,17.1.2.2] equal(multiply(X,divide(Y,Z)),divide(X,divide(Z,Y))).
% 154 [para:144.1.2,139.1.1.2.1,demod:149] equal(divide(divide(X,Y),divide(Z,divide(Y,X))),inverse(Z)).
% 155 [para:148.1.2,17.1.2.2] equal(multiply(X,multiply(Y,Z)),divide(X,divide(inverse(Z),Y))).
% 193 [para:40.1.1,154.1.1.2,demod:123,155,124] equal(divide(multiply(divide(X,Y),multiply(Y,Z)),Z),X).
% 197 [para:50.1.1,193.1.1.1.2,demod:17] equal(divide(multiply(multiply(X,Y),Z),multiply(Y,Z)),X).
% 213 [para:197.1.1,136.1.1.1] equal(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z)).
% 232 [para:213.1.2,10.1.1,cut:6] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 6
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 135
% derived clauses: 19067
% kept clauses: 221
% kept size sum: 2523
% kept mid-nuclei: 0
% kept new demods: 161
% forw unit-subs: 18826
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.19
% process. runtime: 0.18
% 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/GRP450-1+eq_r.in")
%
%------------------------------------------------------------------------------