TSTP Solution File: GRP613-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP613-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 : art02.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/GRP613-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 7 1)
% (binary-posweight-lex-big-order 30 #f 7 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(4,40,0,8,0,0)
%
%
% START OF PROOF
% 6 [] equal(double_divide(inverse(double_divide(inverse(double_divide(X,inverse(Y))),Z)),double_divide(X,Z)),Y).
% 7 [] equal(multiply(X,Y),inverse(double_divide(Y,X))).
% 8 [] -equal(multiply(inverse(a1),a1),multiply(inverse(b1),b1)).
% 9 [para:6.1.1,7.1.2.1,demod:7] equal(multiply(double_divide(X,Y),multiply(Y,multiply(inverse(Z),X))),inverse(Z)).
% 10 [para:7.1.2,6.1.1.1,demod:7] equal(double_divide(multiply(X,multiply(inverse(Y),Z)),double_divide(Z,X)),Y).
% 12 [para:6.1.1,6.1.1.1.1,demod:7] equal(double_divide(inverse(X),double_divide(multiply(inverse(X),Y),double_divide(Y,inverse(Z)))),Z).
% 13 [para:6.1.1,6.1.1.2,demod:7] equal(double_divide(multiply(double_divide(X,Y),multiply(inverse(Z),multiply(Y,multiply(inverse(U),X)))),U),Z).
% 15 [para:6.1.1,9.1.1.1,demod:7] equal(multiply(X,multiply(double_divide(Y,Z),multiply(inverse(U),multiply(Z,multiply(inverse(X),Y))))),inverse(U)).
% 16 [para:9.1.1,9.1.1.2] equal(multiply(double_divide(multiply(inverse(X),Y),double_divide(Y,inverse(Z))),inverse(X)),inverse(Z)).
% 46 [para:15.1.1,13.1.1.1.2,demod:10] equal(double_divide(multiply(inverse(X),inverse(Y)),Y),X).
% 47 [para:15.1.1,15.1.1.2.2,demod:10] equal(multiply(X,multiply(inverse(Y),inverse(X))),inverse(Y)).
% 49 [para:7.1.2,46.1.1.1.2] equal(double_divide(multiply(inverse(X),multiply(Y,Z)),double_divide(Z,Y)),X).
% 63 [para:47.1.1,10.1.1.1] equal(double_divide(inverse(X),double_divide(inverse(Y),Y)),X).
% 79 [para:7.1.2,63.1.1.1] equal(double_divide(multiply(X,Y),double_divide(inverse(Z),Z)),double_divide(Y,X)).
% 104 [para:47.1.1,49.1.1.1] equal(double_divide(inverse(X),double_divide(inverse(inverse(Y)),inverse(X))),Y).
% 130 [para:79.1.1,46.1.1,demod:7] equal(double_divide(multiply(X,inverse(X)),inverse(Y)),Y).
% 136 [para:130.1.1,6.1.1.2,demod:7,130] equal(double_divide(multiply(inverse(X),inverse(Y)),X),Y).
% 160 [para:136.1.1,130.1.1] equal(inverse(inverse(X)),X).
% 193 [para:160.1.1,47.1.1.2.1,demod:160] equal(multiply(X,multiply(Y,inverse(X))),Y).
% 204 [para:160.1.1,104.1.1.1,demod:160] equal(double_divide(X,double_divide(Y,X)),Y).
% 217 [para:6.1.1,204.1.1.2,demod:7] equal(double_divide(double_divide(X,Y),Z),multiply(Y,multiply(inverse(Z),X))).
% 218 [para:204.1.1,10.1.1.2,demod:204,217] equal(double_divide(double_divide(X,Y),X),Y).
% 227 [para:46.1.1,204.1.1.2] equal(double_divide(X,Y),multiply(inverse(Y),inverse(X))).
% 235 [para:136.1.1,204.1.1.2,demod:227] equal(double_divide(X,Y),double_divide(Y,X)).
% 238 [para:12.1.1,218.1.1.1] equal(double_divide(X,inverse(Y)),double_divide(multiply(inverse(Y),Z),double_divide(Z,inverse(X)))).
% 253 [para:136.1.1,218.1.1.1,demod:227] equal(double_divide(X,double_divide(X,Y)),Y).
% 255 [para:235.1.1,7.1.2.1,demod:7] equal(multiply(X,Y),multiply(Y,X)).
% 283 [para:253.1.1,7.1.2.1] equal(multiply(double_divide(X,Y),X),inverse(Y)).
% 299 [para:255.1.1,8.1.1] -equal(multiply(a1,inverse(a1)),multiply(inverse(b1),b1)).
% 376 [para:16.1.1,193.1.1.2,demod:238] equal(multiply(X,inverse(Y)),double_divide(Y,inverse(X))).
% 418 [para:255.1.1,299.1.2,demod:376] -equal(double_divide(a1,inverse(a1)),double_divide(b1,inverse(b1))).
% 459 [para:63.1.1,283.1.1.1,demod:7,376,slowcut:418] 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 7
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 47
% derived clauses: 1795
% kept clauses: 449
% kept size sum: 7009
% kept mid-nuclei: 0
% kept new demods: 435
% forw unit-subs: 1229
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.5
% process. runtime: 0.4
% 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/GRP613-1+eq_r.in")
%
%------------------------------------------------------------------------------