%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : GRP178-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 : 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 537.5s
% Output : Assurance 537.5s
% 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/GRP178-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,0,42,0,0,427,50,49,448,0,49,37651,3,3000,43410,4,4476,48339,5,5951,48339,1,5951,48339,50,5954,48339,40,5954,48360,0,5954,48771,50,6002,48792,0,6015,67432,3,7466,70388,4,8210,72051,5,8916,72051,1,8916,72051,50,8917,72051,40,8917,72072,0,8917,109187,3,10418,119289,4,11169,140910,5,11918,140910,1,11918,140910,50,11923,140910,40,11923,140931,0,11923,503353,3,20926,761490,4,25434,1126685,5,29926,1126685,1,29926,1126685,50,29932,1126685,40,29932,1126706,0,29932,1353435,3,35955,1463473,4,38937,1555247,5,41933,1555247,1,41933,1555247,50,41938,1555247,40,41938,1555268,0,41938,1762055,3,44964,1856275,4,46441,1982086,5,47939,1982086,1,47939,1982086,50,47944,1982086,40,47944,1982107,0,47944,2084929,3,50946,2127756,4,52483,2164854,5,53946,2164854,1,53946,2164854,50,53952,2164854,40,53952,2164875,0,53952)
%
%
% START OF PROOF
% 73024 [?] ?
% 84555 [?] ?
% 85582 [para:73024.1.2,84555.1.2.2] equal(X,greatest_lower_bound(X,least_upper_bound(Y,least_upper_bound(Z,multiply(X,c))))).
% 1555271 [?] ?
% 1555296 [?] ?
% 1556508 [para:1555296.1.2,1555271.1.1] -equal(greatest_lower_bound(a,greatest_lower_bound(least_upper_bound(a,X),multiply(b,c))),greatest_lower_bound(c,a)).
% 2164856 [] equal(multiply(identity,X),X).
% 2164859 [] equal(greatest_lower_bound(X,Y),greatest_lower_bound(Y,X)).
% 2164860 [] equal(least_upper_bound(X,Y),least_upper_bound(Y,X)).
% 2164863 [] equal(least_upper_bound(X,X),X).
% 2164865 [] equal(least_upper_bound(X,greatest_lower_bound(X,Y)),X).
% 2164870 [] equal(multiply(greatest_lower_bound(X,Y),Z),greatest_lower_bound(multiply(X,Z),multiply(Y,Z))).
% 2164874 [] equal(greatest_lower_bound(a,b),identity).
% 2164882 [para:2164859.1.1,2164865.1.1.2] equal(least_upper_bound(X,greatest_lower_bound(Y,X)),X).
% 2164911 [para:2164882.1.1,2164860.1.1] equal(X,least_upper_bound(greatest_lower_bound(Y,X),X)).
% 2164973 [para:2164863.1.1,85582.1.2.2] equal(X,greatest_lower_bound(X,least_upper_bound(Y,multiply(X,c)))).
% 2164981 [para:2164863.1.1,2164973.1.2.2] equal(X,greatest_lower_bound(X,multiply(X,c))).
% 2164990 [para:2164981.1.2,2164911.1.2.1] equal(multiply(X,c),least_upper_bound(X,multiply(X,c))).
% 2165101 [para:2164990.1.2,1556508.1.1.2.1,demod:2164856,2164874,2164870,cut:2164859] 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 smaller arities for lex ordering
% using clause demodulation
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 21190
% derived clauses: 12644966
% kept clauses: 454778
% kept size sum: 2834
% kept mid-nuclei: 0
% kept new demods: 382421
% forw unit-subs: 9448051
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 545
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 542.56
% process. runtime: 539.54
% 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/GRP178-1+eq_r.in")
%
%------------------------------------------------------------------------------