TSTP Solution File: GRP201-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP201-1 : TPTP v3.4.2. Released v2.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art07.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/GRP201-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 4 1)
% (binary-posweight-lex-big-order 30 #f 4 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(11,40,0,22,0,0)
%
%
% START OF PROOF
% 13 [] equal(multiply(identity,X),X).
% 14 [] equal(multiply(X,identity),X).
% 15 [] equal(multiply(X,left_division(X,Y)),Y).
% 16 [] equal(left_division(X,multiply(X,Y)),Y).
% 17 [] equal(multiply(right_division(X,Y),Y),X).
% 18 [] equal(right_division(multiply(X,Y),Y),X).
% 19 [] equal(multiply(X,right_inverse(X)),identity).
% 20 [] equal(multiply(left_inverse(X),X),identity).
% 21 [] equal(multiply(multiply(multiply(X,Y),Z),Y),multiply(X,multiply(Y,multiply(Z,Y)))).
% 22 [] -equal(multiply(multiply(multiply(a,b),a),c),multiply(a,multiply(b,multiply(a,c)))).
% 26 [para:14.1.1,16.1.1.2] equal(left_division(X,X),identity).
% 27 [para:19.1.1,16.1.1.2] equal(left_division(X,identity),right_inverse(X)).
% 33 [para:20.1.1,18.1.1.1] equal(right_division(identity,X),left_inverse(X)).
% 35 [para:13.1.1,21.1.1.1.1,demod:13] equal(multiply(multiply(X,Y),X),multiply(X,multiply(Y,X))).
% 37 [para:20.1.1,21.1.1.1.1,demod:13] equal(multiply(X,Y),multiply(left_inverse(Y),multiply(Y,multiply(X,Y)))).
% 38 [para:17.1.1,21.1.1.1.1] equal(multiply(multiply(X,Y),Z),multiply(right_division(X,Z),multiply(Z,multiply(Y,Z)))).
% 40 [para:19.1.1,35.1.1.1,demod:13] equal(X,multiply(X,multiply(right_inverse(X),X))).
% 41 [para:35.1.1,22.1.1.1] -equal(multiply(multiply(a,multiply(b,a)),c),multiply(a,multiply(b,multiply(a,c)))).
% 49 [para:40.1.2,16.1.1.2,demod:26] equal(identity,multiply(right_inverse(X),X)).
% 52 [para:49.1.2,18.1.1.1,demod:33] equal(left_inverse(X),right_inverse(X)).
% 69 [?] ?
% 70 [para:17.1.1,37.1.2.2.2,demod:52,17] equal(X,multiply(right_inverse(Y),multiply(Y,X))).
% 72 [para:15.1.1,70.1.2.2] equal(left_division(X,Y),multiply(right_inverse(X),Y)).
% 73 [para:70.1.2,16.1.1.2] equal(left_division(right_inverse(X),Y),multiply(X,Y)).
% 74 [para:70.1.2,18.1.1.1] equal(right_division(X,multiply(Y,X)),right_inverse(Y)).
% 79 [para:72.1.2,35.1.1.1,demod:72] equal(multiply(left_division(X,Y),right_inverse(X)),left_division(X,multiply(Y,right_inverse(X)))).
% 82 [para:19.1.1,38.1.2.2.2,demod:17,27,72] equal(multiply(multiply(X,Y),right_inverse(Y)),X).
% 83 [para:20.1.1,38.1.2.2.2,demod:17,14,52] equal(multiply(multiply(X,right_inverse(Y)),Y),X).
% 85 [para:38.1.2,16.1.1.2] equal(left_division(right_division(X,Y),multiply(multiply(X,Z),Y)),multiply(Y,multiply(Z,Y))).
% 89 [para:72.1.2,38.1.2.2,demod:79] equal(multiply(multiply(X,Y),right_inverse(Z)),multiply(right_division(X,right_inverse(Z)),multiply(left_division(Z,Y),right_inverse(Z)))).
% 91 [para:17.1.1,74.1.1.2] equal(right_division(X,Y),right_inverse(right_division(Y,X))).
% 95 [para:15.1.1,82.1.1.1] equal(multiply(X,right_inverse(left_division(Y,X))),Y).
% 96 [para:82.1.1,16.1.1.2] equal(left_division(multiply(X,Y),X),right_inverse(Y)).
% 97 [para:17.1.1,82.1.1.1] equal(multiply(X,right_inverse(Y)),right_division(X,Y)).
% 98 [para:82.1.1,18.1.1.1] equal(right_division(X,right_inverse(Y)),multiply(X,Y)).
% 103 [para:82.1.1,74.1.1.2] equal(right_division(right_inverse(X),Y),right_inverse(multiply(Y,X))).
% 105 [para:72.1.2,83.1.1.1] equal(multiply(left_division(X,right_inverse(Y)),Y),right_inverse(X)).
% 108 [para:91.1.2,72.1.2.1] equal(left_division(right_division(X,Y),Z),multiply(right_division(Y,X),Z)).
% 110 [para:95.1.1,16.1.1.2] equal(left_division(X,Y),right_inverse(left_division(Y,X))).
% 124 [para:70.1.2,96.1.1.1,demod:103] equal(left_division(X,right_inverse(Y)),right_division(right_inverse(X),Y)).
% 137 [para:110.1.2,72.1.2.1] equal(left_division(left_division(X,Y),Z),multiply(left_division(Y,X),Z)).
% 160 [para:103.1.2,124.1.2.1,demod:124] equal(left_division(multiply(X,Y),right_inverse(Z)),right_division(left_division(Y,right_inverse(X)),Z)).
% 369 [para:15.1.1,85.1.1.2.1,demod:108] equal(multiply(right_division(X,Y),multiply(Z,X)),multiply(X,multiply(left_division(Y,Z),X))).
% 375 [para:105.1.1,85.1.1.2.1,demod:73,137,72,160] equal(multiply(multiply(X,multiply(Y,Z)),left_division(Z,X)),multiply(X,multiply(Y,X))).
% 593 [para:18.1.1,369.1.1.1] equal(multiply(X,multiply(Y,multiply(X,Z))),multiply(multiply(X,Z),multiply(left_division(Z,Y),multiply(X,Z)))).
% 624 [para:89.1.2,375.1.1.1,demod:593,35,38,69,98,97,slowcut:41] 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 4
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 286
% derived clauses: 43199
% kept clauses: 600
% kept size sum: 9488
% kept mid-nuclei: 0
% kept new demods: 608
% forw unit-subs: 17135
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 20
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 1.1
% process. runtime: 1.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/GRP201-1+eq_r.in")
%
%------------------------------------------------------------------------------