TSTP Solution File: GRP167-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP167-1 : TPTP v3.4.2. Bugfixed v1.2.1.
% 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/GRP167-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(21,40,1,42,0,1,152,50,12,173,0,12)
%
%
% START OF PROOF
% 153 [] equal(X,X).
% 154 [] equal(multiply(identity,X),X).
% 155 [] equal(multiply(inverse(X),X),identity).
% 156 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 157 [] equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,X)).
% 158 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 161 [] equal(least_upper_bound(X,X),X).
% 163 [] equal(least_upper_bound(X,greatest_lower_bound(X,Y)),X).
% 164 [] equal(greatest_lower_bound(X,least_upper_bound(X,Y)),X).
% 165 [] equal(multiply(X,least_upper_bound(Y,Z)),least_upper_bound(multiply(X,Y),multiply(X,Z))).
% 166 [] equal(multiply(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(multiply(X,Y),multiply(X,Z))).
% 167 [] equal(multiply(least_upper_bound(X,Y),Z),least_upper_bound(multiply(X,Z),multiply(Y,Z))).
% 168 [] equal(multiply(greatest_lower_bound(X,Y),Z),greatest_lower_bound(multiply(X,Z),multiply(Y,Z))).
% 169 [] equal(positive_part(X),least_upper_bound(X,identity)).
% 170 [] equal(negative_part(X),greatest_lower_bound(X,identity)).
% 171 [] equal(least_upper_bound(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(least_upper_bound(X,Y),least_upper_bound(X,Z))).
% 172 [] equal(greatest_lower_bound(X,least_upper_bound(Y,Z)),least_upper_bound(greatest_lower_bound(X,Y),greatest_lower_bound(X,Z))).
% 173 [] -equal(a,multiply(positive_part(a),negative_part(a))).
% 174 [para:169.1.2,161.1.1] equal(positive_part(identity),identity).
% 176 [para:157.1.1,170.1.2] equal(negative_part(X),greatest_lower_bound(identity,X)).
% 177 [para:155.1.1,156.1.1.1,demod:154] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 178 [para:158.1.1,169.1.2] equal(positive_part(X),least_upper_bound(identity,X)).
% 179 [para:170.1.2,163.1.1.2] equal(least_upper_bound(X,negative_part(X)),X).
% 181 [para:176.1.2,163.1.1.2,demod:178] equal(positive_part(negative_part(X)),identity).
% 193 [para:164.1.1,176.1.2,demod:178] equal(negative_part(positive_part(X)),identity).
% 197 [para:193.1.1,179.1.1.2,demod:169] equal(positive_part(positive_part(X)),positive_part(X)).
% 236 [para:155.1.1,177.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 242 [para:177.1.2,177.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 243 [para:154.1.1,167.1.2.1,demod:178] equal(multiply(positive_part(X),Y),least_upper_bound(Y,multiply(X,Y))).
% 251 [para:177.1.2,167.1.2.1] equal(multiply(least_upper_bound(inverse(X),Y),multiply(X,Z)),least_upper_bound(Z,multiply(Y,multiply(X,Z)))).
% 255 [para:236.1.2,165.1.2.1,demod:242,178] equal(multiply(X,positive_part(Y)),least_upper_bound(X,multiply(X,Y))).
% 257 [para:236.1.2,166.1.2.1,demod:242,176] equal(multiply(X,negative_part(Y)),greatest_lower_bound(X,multiply(X,Y))).
% 259 [para:154.1.1,168.1.2.1,demod:176] equal(multiply(negative_part(X),Y),greatest_lower_bound(Y,multiply(X,Y))).
% 283 [para:169.1.2,171.1.2.1,demod:176] equal(least_upper_bound(X,negative_part(Y)),greatest_lower_bound(positive_part(X),least_upper_bound(X,Y))).
% 288 [para:178.1.2,171.1.2.1,demod:178] equal(positive_part(greatest_lower_bound(X,Y)),greatest_lower_bound(positive_part(X),positive_part(Y))).
% 325 [para:176.1.2,172.1.2.1,demod:176] equal(negative_part(least_upper_bound(X,Y)),least_upper_bound(negative_part(X),negative_part(Y))).
% 409 [para:242.1.2,155.1.1] equal(multiply(X,inverse(X)),identity).
% 411 [para:242.1.2,236.1.2] equal(X,multiply(X,identity)).
% 413 [para:411.1.2,236.1.2] equal(X,inverse(inverse(X))).
% 549 [para:155.1.1,243.1.2.2,demod:169] equal(multiply(positive_part(inverse(X)),X),positive_part(X)).
% 550 [para:156.1.1,243.1.2.2] equal(multiply(positive_part(multiply(X,Y)),Z),least_upper_bound(Z,multiply(X,multiply(Y,Z)))).
% 557 [para:409.1.1,243.1.2.2,demod:169] equal(multiply(positive_part(X),inverse(X)),positive_part(inverse(X))).
% 570 [para:197.1.1,557.1.1.1,demod:409] equal(identity,positive_part(inverse(positive_part(X)))).
% 574 [para:557.1.1,177.1.2.2] equal(inverse(X),multiply(inverse(positive_part(X)),positive_part(inverse(X)))).
% 645 [para:155.1.1,255.1.2.2,demod:169] equal(multiply(inverse(X),positive_part(X)),positive_part(inverse(X))).
% 658 [para:255.1.2,243.1.2] equal(multiply(positive_part(X),X),multiply(X,positive_part(X))).
% 741 [para:409.1.1,257.1.2.2,demod:170] equal(multiply(X,negative_part(inverse(X))),negative_part(X)).
% 749 [para:557.1.1,257.1.2.2,demod:288] equal(multiply(positive_part(X),negative_part(inverse(X))),positive_part(greatest_lower_bound(X,inverse(X)))).
% 751 [para:658.1.1,257.1.2.2,demod:259] equal(multiply(positive_part(X),negative_part(X)),multiply(negative_part(X),positive_part(X))).
% 770 [para:741.1.1,243.1.2.2,demod:325,749] equal(positive_part(greatest_lower_bound(X,inverse(X))),negative_part(least_upper_bound(inverse(X),X))).
% 865 [para:645.1.1,259.1.2.2,demod:288] equal(multiply(negative_part(inverse(X)),positive_part(X)),positive_part(greatest_lower_bound(X,inverse(X)))).
% 1024 [para:574.1.2,255.1.2.2,demod:574,197] equal(inverse(X),least_upper_bound(inverse(positive_part(X)),inverse(X))).
% 1535 [para:1024.1.2,283.1.2.2,demod:176,570] equal(least_upper_bound(inverse(positive_part(X)),negative_part(inverse(X))),negative_part(inverse(X))).
% 1865 [para:770.1.2,181.1.1.1,demod:197] equal(positive_part(greatest_lower_bound(X,inverse(X))),identity).
% 2188 [para:1535.1.1,251.1.1.1,demod:154,174,1865,865,550] equal(multiply(negative_part(inverse(X)),multiply(positive_part(X),Y)),Y).
% 2190 [para:549.1.1,2188.1.1.2,demod:751,413] equal(multiply(positive_part(X),negative_part(X)),X).
% 2206 [para:2190.1.1,173.1.2,cut:153] 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: 479
% derived clauses: 62185
% kept clauses: 2142
% kept size sum: 30457
% kept mid-nuclei: 0
% kept new demods: 1696
% forw unit-subs: 36091
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 4
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.81
% process. runtime: 0.79
% 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/GRP167-1+eq_r.in")
%
%------------------------------------------------------------------------------