%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : KRS015-1 : TPTP v3.4.2. Released v2.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art08.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/KRS/KRS015-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 2 11)
% (binary-unit 10 #f 2 11)
% (binary-double 16 #f 2 11)
% (binary 54 #t 2 11)
% (binary-order 27 #f 2 11)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(26,40,0,52,0,0,161,50,1,187,0,1)
%
%
% START OF PROOF
% 162 [] -c(X) | t2least(X).
% 164 [] -equalish(u1r2(X),u1r1(X)) | -t2least(X).
% 165 [] t(X,u1r1(X)) | -t2least(X).
% 166 [] t(X,u1r2(X)) | -t2least(X).
% 168 [] -d(X) | t1most(X).
% 170 [] -t(X,Y) | -t(X,Z) | equalish(Y,Z) | -t1most(X).
% 174 [] r(X,u4r4(X)) | -e(X).
% 175 [] -r(X,Y) | s(X,Y) | -e(X).
% 177 [] -s(X,Y) | -e(X) | d(Y).
% 178 [] -r(X,Y) | -e(X) | c(Y).
% 187 [] e(exist).
% 188 [hyper:174,187] r(exist,u4r4(exist)).
% 198 [hyper:175,188,cut:187] s(exist,u4r4(exist)).
% 199 [hyper:178,188,cut:187] c(u4r4(exist)).
% 200 [hyper:162,199] t2least(u4r4(exist)).
% 202 [hyper:165,200] t(u4r4(exist),u1r1(u4r4(exist))).
% 203 [hyper:166,200] t(u4r4(exist),u1r2(u4r4(exist))).
% 205 [hyper:177,198,cut:187] d(u4r4(exist)).
% 206 [hyper:168,205] t1most(u4r4(exist)).
% 304 [hyper:170,203,202,cut:206] equalish(u1r2(u4r4(exist)),u1r1(u4r4(exist))).
% 313 [hyper:164,304,cut:200] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 11
% clause depth limited to 3
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 79
% derived clauses: 666
% kept clauses: 40
% kept size sum: 202
% kept mid-nuclei: 131
% kept new demods: 0
% forw unit-subs: 158
% forw double-subs: 204
% forw overdouble-subs: 4
% backward subs: 1
% fast unit cutoff: 15
% full unit cutoff: 0
% dbl unit cutoff: 2
% real runtime : 0.2
% process. runtime: 0.2
% specific non-discr-tree subsumption statistics:
% tried: 291
% length fails: 75
% strength fails: 0
% predlist fails: 212
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 4
% 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/KRS/KRS015-1+noeq.in")
%
%------------------------------------------------------------------------------