%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP169-2 : 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 : art06.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/GRP169-2+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(18,40,0,36,0,0,110,50,8,128,0,8)
%
%
% START OF PROOF
% 112 [] equal(multiply(identity,X),X).
% 113 [] equal(multiply(inverse(X),X),identity).
% 114 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 115 [] equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,X)).
% 116 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 121 [] equal(least_upper_bound(X,greatest_lower_bound(X,Y)),X).
% 122 [] equal(greatest_lower_bound(X,least_upper_bound(X,Y)),X).
% 123 [] equal(multiply(X,least_upper_bound(Y,Z)),least_upper_bound(multiply(X,Y),multiply(X,Z))).
% 125 [] equal(multiply(least_upper_bound(X,Y),Z),least_upper_bound(multiply(X,Z),multiply(Y,Z))).
% 127 [] equal(greatest_lower_bound(inverse(a),inverse(b)),inverse(a)).
% 128 [] -equal(greatest_lower_bound(a,b),b).
% 129 [para:115.1.1,128.1.1] -equal(greatest_lower_bound(b,a),b).
% 130 [para:115.1.1,127.1.1] equal(greatest_lower_bound(inverse(b),inverse(a)),inverse(a)).
% 131 [para:113.1.1,114.1.1.1,demod:112] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 134 [para:130.1.1,121.1.1.2] equal(least_upper_bound(inverse(b),inverse(a)),inverse(b)).
% 136 [para:116.1.1,122.1.1.2] equal(greatest_lower_bound(X,least_upper_bound(Y,X)),X).
% 158 [para:113.1.1,131.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 160 [para:131.1.2,131.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 184 [para:131.1.2,123.1.2.2] equal(multiply(inverse(X),least_upper_bound(Y,multiply(X,Z))),least_upper_bound(multiply(inverse(X),Y),Z)).
% 213 [para:160.1.2,158.1.2] equal(X,multiply(X,identity)).
% 215 [para:213.1.2,158.1.2] equal(X,inverse(inverse(X))).
% 218 [para:113.1.1,125.1.2.1] equal(multiply(least_upper_bound(inverse(X),Y),X),least_upper_bound(identity,multiply(Y,X))).
% 1774 [para:134.1.1,218.1.1.1,demod:113] equal(identity,least_upper_bound(identity,multiply(inverse(a),b))).
% 1792 [para:1774.1.2,184.1.1.2,demod:213,215] equal(a,least_upper_bound(a,b)).
% 1795 [para:1792.1.2,136.1.1.2,cut:129] 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: 293
% derived clauses: 36024
% kept clauses: 1740
% kept size sum: 25466
% kept mid-nuclei: 0
% kept new demods: 961
% forw unit-subs: 21995
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.41
% process. runtime: 0.41
% 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/GRP169-2+eq_r.in")
%
%------------------------------------------------------------------------------