%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : COL046-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art02.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 109.6s
% Output : Assurance 109.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/COL/COL046-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(5,40,1,10,0,1,864,3,3009,868,4,4517,868,50,5666,868,40,5666,873,0,5666,1937,3,7169,2029,4,7921,2029,5,8667,2029,1,8667,2029,50,8667,2029,40,8667,2034,0,8667,28510,3,10168,30954,4,10918,33323,1,11668,33323,50,11670,33323,40,11670,33328,0,11670)
%
%
% START OF PROOF
% 33325 [] equal(apply(apply(apply(s,X),Y),Z),apply(apply(X,Z),apply(Y,Z))).
% 33326 [] equal(apply(apply(apply(b,X),Y),Z),apply(X,apply(Y,Z))).
% 33327 [] equal(apply(m,X),apply(X,X)).
% 33328 [] -equal(apply(X,f(X)),apply(f(X),apply(X,f(X)))).
% 33331 [para:33326.1.1,33327.1.2] equal(apply(m,apply(apply(b,X),Y)),apply(X,apply(Y,apply(apply(b,X),Y)))).
% 33346 [para:33325.1.1,33328.1.1] -equal(apply(apply(X,f(apply(apply(s,X),Y))),apply(Y,f(apply(apply(s,X),Y)))),apply(f(apply(apply(s,X),Y)),apply(apply(apply(s,X),Y),f(apply(apply(s,X),Y))))).
% 33349 [para:33325.1.2,33326.1.1.1] equal(apply(apply(apply(apply(s,b),X),Y),Z),apply(Y,apply(apply(X,Y),Z))).
% 34233 [para:33325.1.1,33346.1.2.2] -equal(apply(apply(X,f(apply(apply(s,X),Y))),apply(Y,f(apply(apply(s,X),Y)))),apply(f(apply(apply(s,X),Y)),apply(apply(X,f(apply(apply(s,X),Y))),apply(Y,f(apply(apply(s,X),Y)))))).
% 35074 [para:33331.1.2,33349.1.1.1.1,slowcut:34233] 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
% seconds given: 180
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 5696
% derived clauses: 4460672
% kept clauses: 29393
% kept size sum: 64271
% kept mid-nuclei: 0
% kept new demods: 730
% forw unit-subs: 637648
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 543
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 117.67
% process. runtime: 117.16
% 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/COL/COL046-1+eq_r.in")
%
%------------------------------------------------------------------------------