TSTP Solution File: GRP114-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP114-1 : TPTP v3.4.2. Released v1.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art08.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/GRP114-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 3 1)
% (binary-posweight-lex-big-order 30 #f 3 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(22,40,0,44,0,0,134,50,7,156,0,7)
%
%
% START OF PROOF
% 136 [] equal(multiply(identity,X),X).
% 137 [] equal(multiply(inverse(X),X),identity).
% 138 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 139 [] equal(inverse(identity),identity).
% 140 [] equal(inverse(inverse(X)),X).
% 141 [] equal(inverse(multiply(X,Y)),multiply(inverse(Y),inverse(X))).
% 144 [] equal(intersection(X,Y),intersection(Y,X)).
% 145 [] equal(union(X,Y),union(Y,X)).
% 146 [] equal(intersection(X,intersection(Y,Z)),intersection(intersection(X,Y),Z)).
% 147 [] equal(union(X,union(Y,Z)),union(union(X,Y),Z)).
% 148 [] equal(union(intersection(X,Y),Y),Y).
% 149 [] equal(intersection(union(X,Y),Y),Y).
% 151 [] equal(multiply(X,intersection(Y,Z)),intersection(multiply(X,Y),multiply(X,Z))).
% 152 [] equal(multiply(union(X,Y),Z),union(multiply(X,Z),multiply(Y,Z))).
% 153 [] equal(multiply(intersection(X,Y),Z),intersection(multiply(X,Z),multiply(Y,Z))).
% 154 [] equal(positive_part(X),union(X,identity)).
% 155 [] equal(negative_part(X),intersection(X,identity)).
% 156 [] -equal(multiply(positive_part(a),negative_part(a)),a).
% 157 [para:140.1.1,137.1.1.1] equal(multiply(X,inverse(X)),identity).
% 160 [para:137.1.1,138.1.1.1,demod:136] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 162 [para:144.1.1,155.1.2] equal(negative_part(X),intersection(identity,X)).
% 163 [para:145.1.1,154.1.2] equal(positive_part(X),union(identity,X)).
% 164 [para:139.1.1,141.1.2.1,demod:136] equal(inverse(multiply(X,identity)),inverse(X)).
% 169 [para:148.1.1,154.1.2,demod:155] equal(positive_part(negative_part(X)),identity).
% 171 [para:162.1.2,148.1.1.1] equal(union(negative_part(X),X),X).
% 172 [para:148.1.1,145.1.1] equal(X,union(X,intersection(Y,X))).
% 176 [para:146.1.2,155.1.2,demod:155] equal(negative_part(intersection(X,Y)),intersection(X,negative_part(Y))).
% 182 [para:154.1.2,149.1.1.1,demod:155] equal(negative_part(positive_part(X)),identity).
% 185 [para:163.1.2,149.1.1.1] equal(intersection(positive_part(X),X),X).
% 188 [para:182.1.1,171.1.1.1,demod:163] equal(positive_part(positive_part(X)),positive_part(X)).
% 190 [para:169.1.1,185.1.1.1,demod:162] equal(negative_part(negative_part(X)),negative_part(X)).
% 191 [para:185.1.1,146.1.2.1] equal(intersection(positive_part(X),intersection(X,Y)),intersection(X,Y)).
% 196 [para:147.1.2,154.1.2,demod:154] equal(positive_part(union(X,Y)),union(X,positive_part(Y))).
% 227 [para:137.1.1,151.1.2.1,demod:162] equal(multiply(inverse(X),intersection(X,Y)),negative_part(multiply(inverse(X),Y))).
% 229 [para:157.1.1,151.1.2.1,demod:162] equal(multiply(X,intersection(inverse(X),Y)),negative_part(multiply(X,Y))).
% 237 [para:136.1.1,152.1.2.1,demod:163] equal(multiply(positive_part(X),Y),union(Y,multiply(X,Y))).
% 238 [para:136.1.1,152.1.2.2,demod:154] equal(multiply(positive_part(X),Y),union(multiply(X,Y),Y)).
% 249 [para:164.1.1,140.1.1.1,demod:140] equal(X,multiply(X,identity)).
% 252 [para:249.1.2,151.1.2.1,demod:162] equal(multiply(X,negative_part(Y)),intersection(X,multiply(X,Y))).
% 255 [para:141.1.2,160.1.2.2,demod:140] equal(inverse(X),multiply(Y,inverse(multiply(X,Y)))).
% 262 [para:136.1.1,153.1.2.1,demod:162] equal(multiply(negative_part(X),Y),intersection(Y,multiply(X,Y))).
% 263 [para:136.1.1,153.1.2.2,demod:155] equal(multiply(negative_part(X),Y),intersection(multiply(X,Y),Y)).
% 274 [para:160.1.2,153.1.2.1] equal(multiply(intersection(inverse(X),Y),multiply(X,Z)),intersection(Z,multiply(Y,multiply(X,Z)))).
% 312 [para:172.1.2,196.1.1.1] equal(positive_part(X),union(X,positive_part(intersection(Y,X)))).
% 397 [para:312.1.2,149.1.1.1] equal(intersection(positive_part(X),positive_part(intersection(Y,X))),positive_part(intersection(Y,X))).
% 442 [para:157.1.1,237.1.2.2,demod:154] equal(multiply(positive_part(X),inverse(X)),positive_part(inverse(X))).
% 455 [para:169.1.1,442.1.1.1,demod:136] equal(inverse(negative_part(X)),positive_part(inverse(negative_part(X)))).
% 456 [para:188.1.1,442.1.1.1,demod:157] equal(identity,positive_part(inverse(positive_part(X)))).
% 468 [para:456.1.2,191.1.1.1,demod:176,162] equal(intersection(inverse(positive_part(X)),negative_part(Y)),intersection(inverse(positive_part(X)),Y)).
% 618 [para:137.1.1,252.1.2.2,demod:155] equal(multiply(inverse(X),negative_part(X)),negative_part(inverse(X))).
% 619 [para:157.1.1,252.1.2.2,demod:155] equal(multiply(X,negative_part(inverse(X))),negative_part(X)).
% 641 [para:619.1.1,255.1.2.2.1] equal(inverse(X),multiply(negative_part(inverse(X)),inverse(negative_part(X)))).
% 643 [para:619.1.1,238.1.2.1] equal(multiply(positive_part(X),negative_part(inverse(X))),union(negative_part(X),negative_part(inverse(X)))).
% 664 [para:618.1.1,237.1.2.2,demod:643] equal(multiply(positive_part(inverse(X)),negative_part(X)),multiply(positive_part(X),negative_part(inverse(X)))).
% 702 [para:137.1.1,262.1.2.2,demod:155] equal(multiply(negative_part(inverse(X)),X),negative_part(X)).
% 703 [para:138.1.1,262.1.2.2] equal(multiply(negative_part(multiply(X,Y)),Z),intersection(Z,multiply(X,multiply(Y,Z)))).
% 1063 [para:641.1.2,263.1.2.1,demod:641,190] equal(inverse(X),intersection(inverse(X),inverse(negative_part(X)))).
% 2055 [para:1063.1.2,397.1.1.2.1,demod:1063,455] equal(intersection(inverse(negative_part(X)),positive_part(inverse(X))),positive_part(inverse(X))).
% 2083 [para:468.1.1,227.1.1.2,demod:229,140] equal(negative_part(multiply(positive_part(X),Y)),negative_part(multiply(positive_part(X),negative_part(Y)))).
% 2137 [para:2055.1.1,274.1.1.1,demod:136,182,442,2083,664,703] equal(multiply(positive_part(inverse(X)),multiply(negative_part(X),Y)),Y).
% 2140 [para:702.1.1,2137.1.1.2,demod:140,slowcut:156] 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: 453
% derived clauses: 57707
% kept clauses: 2072
% kept size sum: 29673
% kept mid-nuclei: 0
% kept new demods: 1565
% forw unit-subs: 34532
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.77
% process. runtime: 0.74
% 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/GRP114-1+eq_r.in")
%
%------------------------------------------------------------------------------