%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP185-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 : art01.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 59.6s
% Output : Assurance 59.6s
% 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/GRP185-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(17,40,0,34,0,0,8657,3,3002,11317,4,4501,13430,5,6001,13430,1,6001,13430,50,6008,13430,40,6008,13447,0,6008)
%
%
% START OF PROOF
% 13432 [] equal(multiply(identity,X),X).
% 13433 [] equal(multiply(inverse(X),X),identity).
% 13434 [] equal(multiply(multiply(X,Y),Z),multiply(X,multiply(Y,Z))).
% 13435 [] equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,X)).
% 13436 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 13438 [] equal(least_upper_bound(X,least_upper_bound(Y,Z)),least_upper_bound(least_upper_bound(X,Y),Z)).
% 13439 [] equal(least_upper_bound(X,X),X).
% 13441 [] equal(least_upper_bound(X,greatest_lower_bound(X,Y)),X).
% 13442 [] equal(greatest_lower_bound(X,least_upper_bound(X,Y)),X).
% 13443 [] equal(multiply(X,least_upper_bound(Y,Z)),least_upper_bound(multiply(X,Y),multiply(X,Z))).
% 13445 [] equal(multiply(least_upper_bound(X,Y),Z),least_upper_bound(multiply(X,Z),multiply(Y,Z))).
% 13447 [] -equal(least_upper_bound(multiply(a,b),least_upper_bound(identity,multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)))),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))).
% 13448 [para:13435.1.1,13441.1.1.2] equal(least_upper_bound(X,greatest_lower_bound(Y,X)),X).
% 13449 [para:13441.1.1,13436.1.1] equal(X,least_upper_bound(greatest_lower_bound(X,Y),X)).
% 13450 [para:13442.1.1,13435.1.1] equal(X,greatest_lower_bound(least_upper_bound(X,Y),X)).
% 13453 [para:13442.1.1,13448.1.1.2,demod:13438] equal(least_upper_bound(X,least_upper_bound(Y,X)),least_upper_bound(X,Y)).
% 13454 [para:13433.1.1,13434.1.1.1,demod:13432] equal(X,multiply(inverse(Y),multiply(Y,X))).
% 13457 [para:13450.1.2,13449.1.2.1] equal(least_upper_bound(X,Y),least_upper_bound(X,least_upper_bound(X,Y))).
% 13471 [para:13433.1.1,13454.1.2.2] equal(X,multiply(inverse(inverse(X)),identity)).
% 13473 [para:13454.1.2,13454.1.2.2] equal(multiply(X,Y),multiply(inverse(inverse(X)),Y)).
% 13478 [para:13438.1.2,13436.1.1] equal(least_upper_bound(X,least_upper_bound(Y,Z)),least_upper_bound(Z,least_upper_bound(X,Y))).
% 13480 [para:13436.1.1,13438.1.2.1,demod:13438] equal(least_upper_bound(X,least_upper_bound(Y,Z)),least_upper_bound(Y,least_upper_bound(X,Z))).
% 13490 [para:13453.1.1,13438.1.2.1,demod:13438] equal(least_upper_bound(X,least_upper_bound(Y,least_upper_bound(X,Z))),least_upper_bound(X,least_upper_bound(Y,Z))).
% 13500 [para:13473.1.2,13471.1.2] equal(X,multiply(X,identity)).
% 13503 [para:13443.1.2,13436.1.1,demod:13443] equal(multiply(X,least_upper_bound(Y,Z)),multiply(X,least_upper_bound(Z,Y))).
% 13506 [para:13471.1.2,13443.1.2.1,demod:13473] equal(multiply(X,least_upper_bound(identity,Y)),least_upper_bound(X,multiply(X,Y))).
% 13508 [para:13443.1.2,13438.1.2.1] equal(least_upper_bound(multiply(X,Y),least_upper_bound(multiply(X,Z),U)),least_upper_bound(multiply(X,least_upper_bound(Y,Z)),U)).
% 13534 [para:13432.1.1,13445.1.2.2] equal(multiply(least_upper_bound(X,identity),Y),least_upper_bound(multiply(X,Y),Y)).
% 13542 [para:13445.1.2,13438.1.2.1] equal(least_upper_bound(multiply(X,Y),least_upper_bound(multiply(Z,Y),U)),least_upper_bound(multiply(least_upper_bound(X,Z),Y),U)).
% 13651 [para:13478.1.1,13457.1.2.2,demod:13490] equal(least_upper_bound(X,least_upper_bound(Y,Z)),least_upper_bound(X,least_upper_bound(Z,Y))).
% 13946 [para:13651.1.1,13447.1.1,demod:13457,13500,13508,13439,13438,13432,13542] -equal(least_upper_bound(multiply(a,b),least_upper_bound(a,least_upper_bound(b,identity))),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))).
% 14003 [para:13480.1.1,13946.1.1] -equal(least_upper_bound(a,least_upper_bound(multiply(a,b),least_upper_bound(b,identity))),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))).
% 14499 [para:13506.1.1,13534.1.2.1,demod:13438] equal(multiply(least_upper_bound(X,identity),least_upper_bound(identity,Y)),least_upper_bound(X,least_upper_bound(multiply(X,Y),least_upper_bound(identity,Y)))).
% 14734 [para:13436.1.1,14003.1.1.2.2,demod:14499,cut:13503] 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 lex ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 4
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1862
% derived clauses: 2894275
% kept clauses: 14682
% kept size sum: 281616
% kept mid-nuclei: 0
% kept new demods: 6460
% forw unit-subs: 886333
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 12
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 60.83
% process. runtime: 60.38
% 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/GRP185-1+eq_r.in")
%
%------------------------------------------------------------------------------