TSTP Solution File: GRP586-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP586-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 : 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/GRP586-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(X,inverse(double_divide(inverse(double_divide(double_divide(X,Y),inverse(Z))),Y))),Z).
% 7 [] equal(multiply(X,Y),inverse(double_divide(Y,X))).
% 8 [] -equal(multiply(multiply(inverse(b2),b2),a2),a2).
% 9 [para:6.1.1,7.1.2.1,demod:7] equal(multiply(multiply(X,multiply(inverse(Y),double_divide(Z,X))),Z),inverse(Y)).
% 10 [para:7.1.2,6.1.1.2,demod:7] equal(double_divide(X,multiply(Y,multiply(inverse(Z),double_divide(X,Y)))),Z).
% 12 [para:6.1.1,6.1.1.2.1.1.1,demod:7] equal(double_divide(X,multiply(Y,inverse(Z))),double_divide(multiply(inverse(Z),double_divide(double_divide(X,Y),U)),U)).
% 13 [para:6.1.1,6.1.1.2.1.1.1.1,demod:7] equal(double_divide(X,multiply(multiply(Y,multiply(inverse(Z),double_divide(X,Y))),multiply(inverse(U),Z))),U).
% 26 [para:6.1.1,12.1.2.1.2,demod:12,7] equal(double_divide(X,multiply(Y,inverse(Z))),double_divide(multiply(inverse(Z),U),multiply(multiply(Y,inverse(U)),X))).
% 36 [para:9.1.1,13.1.1.2] equal(double_divide(multiply(inverse(X),Y),inverse(Y)),X).
% 42 [para:36.1.1,7.1.2.1] equal(multiply(inverse(X),multiply(inverse(Y),X)),inverse(Y)).
% 43 [para:7.1.2,36.1.1.1.1] equal(double_divide(multiply(multiply(X,Y),Z),inverse(Z)),double_divide(Y,X)).
% 44 [para:7.1.2,36.1.1.2] equal(double_divide(multiply(inverse(X),double_divide(Y,Z)),multiply(Z,Y)),X).
% 56 [para:42.1.1,36.1.1.1] equal(double_divide(inverse(X),inverse(multiply(inverse(X),Y))),Y).
% 57 [para:42.1.1,42.1.1.2] equal(multiply(inverse(multiply(inverse(X),Y)),inverse(X)),inverse(Y)).
% 66 [para:42.1.1,56.1.1.2.1] equal(double_divide(inverse(X),inverse(inverse(Y))),multiply(inverse(Y),X)).
% 70 [para:57.1.1,42.1.1.2] equal(multiply(inverse(inverse(X)),inverse(Y)),inverse(multiply(inverse(X),Y))).
% 72 [para:7.1.2,66.1.1.2.1,demod:7] equal(double_divide(inverse(X),inverse(multiply(Y,Z))),multiply(multiply(Y,Z),X)).
% 84 [para:9.1.1,43.1.1.1] equal(double_divide(inverse(X),inverse(Y)),double_divide(multiply(inverse(X),double_divide(Y,Z)),Z)).
% 106 [para:6.1.1,44.1.1.1.2,demod:26,84,7] equal(double_divide(X,multiply(inverse(X),inverse(Y))),Y).
% 116 [para:7.1.2,106.1.1.2.2] equal(double_divide(X,multiply(inverse(X),multiply(Y,Z))),double_divide(Z,Y)).
% 181 [para:116.1.1,10.1.1] equal(double_divide(double_divide(X,inverse(X)),inverse(Y)),Y).
% 192 [para:181.1.1,6.1.1,demod:84,7] equal(double_divide(inverse(X),multiply(inverse(Y),Y)),X).
% 210 [para:70.1.1,192.1.1.2,demod:72,slowcut:8] 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: 29
% derived clauses: 536
% kept clauses: 200
% kept size sum: 3730
% kept mid-nuclei: 0
% kept new demods: 195
% forw unit-subs: 319
% 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.2
% process. runtime: 0.1
% 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/GRP586-1+eq_r.in")
%
%------------------------------------------------------------------------------