%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP167-5 : 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 : art05.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-5+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,157,50,12,179,0,12)
%
%
% START OF PROOF
% 158 [] equal(X,X).
% 159 [] equal(multiply(identity,X),X).
% 160 [] equal(multiply(inverse(X),X),identity).
% 161 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 162 [] equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,X)).
% 163 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 170 [] equal(multiply(X,least_upper_bound(Y,Z)),least_upper_bound(multiply(X,Y),multiply(X,Z))).
% 171 [] equal(multiply(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(multiply(X,Y),multiply(X,Z))).
% 172 [] equal(multiply(least_upper_bound(X,Y),Z),least_upper_bound(multiply(X,Z),multiply(Y,Z))).
% 173 [] equal(multiply(greatest_lower_bound(X,Y),Z),greatest_lower_bound(multiply(X,Z),multiply(Y,Z))).
% 174 [] equal(inverse(least_upper_bound(X,Y)),greatest_lower_bound(inverse(X),inverse(Y))).
% 175 [] equal(positive_part(X),least_upper_bound(X,identity)).
% 176 [] equal(negative_part(X),greatest_lower_bound(X,identity)).
% 179 [] -equal(a,multiply(positive_part(a),negative_part(a))).
% 182 [para:162.1.1,176.1.2] equal(negative_part(X),greatest_lower_bound(identity,X)).
% 183 [para:160.1.1,161.1.1.1,demod:159] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 184 [para:163.1.1,175.1.2] equal(positive_part(X),least_upper_bound(identity,X)).
% 242 [para:160.1.1,183.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 248 [para:183.1.2,183.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 249 [para:159.1.1,172.1.2.1,demod:184] equal(multiply(positive_part(X),Y),least_upper_bound(Y,multiply(X,Y))).
% 261 [para:242.1.2,170.1.2.1,demod:248,184] equal(multiply(X,positive_part(Y)),least_upper_bound(X,multiply(X,Y))).
% 263 [para:242.1.2,171.1.2.1,demod:248,182] equal(multiply(X,negative_part(Y)),greatest_lower_bound(X,multiply(X,Y))).
% 265 [para:159.1.1,173.1.2.1,demod:182] equal(multiply(negative_part(X),Y),greatest_lower_bound(Y,multiply(X,Y))).
% 403 [para:248.1.2,242.1.2] equal(X,multiply(X,identity)).
% 404 [para:403.1.2,160.1.1] equal(inverse(identity),identity).
% 405 [para:403.1.2,242.1.2] equal(X,inverse(inverse(X))).
% 406 [para:404.1.1,174.1.2.1,demod:182,184] equal(inverse(positive_part(X)),negative_part(inverse(X))).
% 449 [para:405.1.2,406.1.2.1] equal(inverse(positive_part(inverse(X))),negative_part(X)).
% 451 [para:449.1.1,242.1.2.1.1,demod:403] equal(positive_part(inverse(X)),inverse(negative_part(X))).
% 619 [para:160.1.1,249.1.2.2,demod:175,451] equal(multiply(inverse(negative_part(X)),X),positive_part(X)).
% 636 [para:619.1.1,183.1.2.2,demod:405] equal(X,multiply(negative_part(X),positive_part(X))).
% 729 [para:261.1.2,249.1.2] equal(multiply(positive_part(X),X),multiply(X,positive_part(X))).
% 812 [para:729.1.1,263.1.2.2,demod:636,265] equal(multiply(positive_part(X),negative_part(X)),X).
% 831 [para:812.1.1,179.1.2,cut:158] 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: 266
% derived clauses: 21923
% kept clauses: 764
% kept size sum: 9527
% kept mid-nuclei: 0
% kept new demods: 616
% forw unit-subs: 11604
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.22
% process. runtime: 0.20
% 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-5+eq_r.in")
%
%------------------------------------------------------------------------------