TSTP Solution File: GRP591-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP591-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 : art03.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/GRP591-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(double_divide(X,Y),inverse(double_divide(X,inverse(Z))))),Y),Z).
% 7 [] equal(multiply(X,Y),inverse(double_divide(Y,X))).
% 8 [] -equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))).
% 9 [para:6.1.1,7.1.2.1,demod:7] equal(multiply(X,multiply(multiply(inverse(Y),Z),double_divide(Z,X))),inverse(Y)).
% 11 [para:7.1.2,6.1.1.1.1.2.1.2,demod:7] equal(double_divide(multiply(multiply(multiply(X,Y),Z),double_divide(Z,U)),U),double_divide(Y,X)).
% 12 [para:6.1.1,6.1.1.1.1.1,demod:7] equal(double_divide(multiply(multiply(inverse(X),multiply(multiply(inverse(Y),Z),double_divide(Z,U))),Y),U),X).
% 13 [para:6.1.1,6.1.1.1.1.2.1,demod:7] equal(double_divide(multiply(inverse(X),double_divide(multiply(multiply(inverse(X),Y),double_divide(Y,inverse(Z))),U)),U),Z).
% 16 [para:9.1.1,9.1.1.2.1] equal(multiply(X,multiply(inverse(Y),double_divide(multiply(multiply(inverse(Y),Z),double_divide(Z,inverse(U))),X))),inverse(U)).
% 29 [para:9.1.1,12.1.1.1.1] equal(double_divide(multiply(inverse(X),X),inverse(Y)),Y).
% 30 [para:29.1.1,7.1.2.1] equal(multiply(inverse(X),multiply(inverse(Y),Y)),inverse(X)).
% 33 [para:29.1.1,6.1.1.1.1.1,demod:7,29] equal(double_divide(multiply(inverse(X),Y),inverse(Y)),X).
% 50 [para:30.1.1,29.1.1.1] equal(double_divide(inverse(multiply(inverse(X),X)),inverse(Y)),Y).
% 51 [para:30.1.1,33.1.1.1] equal(double_divide(inverse(X),inverse(multiply(inverse(Y),Y))),X).
% 66 [para:7.1.2,51.1.1.1] equal(double_divide(multiply(X,Y),inverse(multiply(inverse(Z),Z))),double_divide(Y,X)).
% 69 [para:51.1.1,6.1.1.1.1.1,demod:66,7] equal(double_divide(X,multiply(inverse(Y),inverse(X))),Y).
% 77 [para:51.1.1,50.1.1] equal(multiply(inverse(X),X),multiply(inverse(Y),Y)).
% 91 [para:77.1.1,11.1.1.1.1.1,demod:11] equal(double_divide(X,inverse(X)),double_divide(Y,inverse(Y))).
% 97 [para:77.1.1,69.1.1.2] equal(double_divide(X,multiply(inverse(Y),Y)),inverse(X)).
% 103 [para:91.1.1,6.1.1.1.1.2.1,demod:97,7] equal(double_divide(inverse(multiply(X,Y)),X),Y).
% 115 [para:103.1.1,7.1.2.1] equal(multiply(X,inverse(multiply(X,Y))),inverse(Y)).
% 119 [para:9.1.1,103.1.1.1.1] equal(double_divide(inverse(inverse(X)),Y),multiply(multiply(inverse(X),Z),double_divide(Z,Y))).
% 124 [?] ?
% 132 [para:97.1.1,13.1.1,demod:115,97,124,119] equal(inverse(inverse(X)),X).
% 141 [para:132.1.1,33.1.1.1.1] equal(double_divide(multiply(X,Y),inverse(Y)),inverse(X)).
% 144 [para:132.1.1,13.1.1.1.2.1.2.2,demod:132,119] equal(double_divide(multiply(inverse(X),double_divide(double_divide(X,Y),Z)),Z),inverse(Y)).
% 164 [para:16.1.1,11.1.1.1.1.1,demod:144,132,119] equal(double_divide(double_divide(X,Y),Y),X).
% 178 [para:33.1.1,164.1.1.1] equal(double_divide(X,inverse(Y)),multiply(inverse(X),Y)).
% 180 [para:69.1.1,164.1.1.1,demod:132,178] equal(double_divide(X,double_divide(X,Y)),Y).
% 194 [para:69.1.1,180.1.1.2,demod:132,178] equal(double_divide(X,Y),double_divide(Y,X)).
% 197 [para:180.1.1,164.1.1.1] equal(double_divide(X,double_divide(Y,X)),Y).
% 208 [para:194.1.1,7.1.2.1,demod:7] equal(multiply(X,Y),multiply(Y,X)).
% 225 [para:6.1.1,197.1.1.2,demod:178,7] equal(double_divide(X,Y),multiply(double_divide(Y,inverse(Z)),double_divide(Z,X))).
% 230 [para:12.1.1,197.1.1.2,demod:7,225,178] equal(double_divide(X,Y),multiply(double_divide(Y,multiply(Z,X)),Z)).
% 249 [para:208.1.1,8.1.2] -equal(multiply(multiply(a3,b3),c3),multiply(multiply(b3,c3),a3)).
% 417 [para:208.1.1,249.1.2.1] -equal(multiply(multiply(a3,b3),c3),multiply(multiply(c3,b3),a3)).
% 517 [para:7.1.2,178.1.2.1] equal(double_divide(double_divide(X,Y),inverse(Z)),multiply(multiply(Y,X),Z)).
% 704 [para:230.1.2,141.1.1.1,demod:7,517,slowcut:417] 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: 122
% derived clauses: 9774
% kept clauses: 694
% kept size sum: 10276
% kept mid-nuclei: 0
% kept new demods: 636
% forw unit-subs: 8836
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 10
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.16
% process. runtime: 0.16
% 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/GRP591-1+eq_r.in")
%
%------------------------------------------------------------------------------