%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : KRS010-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 : art07.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/KRS010-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 13)
% (binary-unit 10 #f 2 13)
% (binary-double 16 #f 2 13)
% (binary 54 #t 2 13)
% (binary-order 27 #f 2 13)
% (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(31,40,2,62,0,2)
%
%
% START OF PROOF
% 32 [] -a(X) | d(X) | c(X).
% 35 [] -r(X,Z) | -r(X,Y) | equalish(Y,Z) | -e(X) | -c(Y) | -c(Z).
% 36 [] -e(X) | r3least(X).
% 37 [] -r(X,Y) | -e(X) | a(Y).
% 48 [] -equalish(u2r2(X),u2r1(X)) | -r3least(X).
% 49 [] -equalish(u2r3(X),u2r1(X)) | -r3least(X).
% 50 [] -equalish(u2r3(X),u2r2(X)) | -r3least(X).
% 51 [] r(X,u2r1(X)) | -r3least(X).
% 52 [] r(X,u2r2(X)) | -r3least(X).
% 53 [] r(X,u2r3(X)) | -r3least(X).
% 60 [] -r(X,Z) | -r(X,Y) | equalish(Y,Z) | -d(Y) | -d(Z) | f(X).
% 61 [] e(exist).
% 62 [] -f(exist).
% 64 [hyper:36,61] r3least(exist).
% 69 [hyper:51,64] r(exist,u2r1(exist)).
% 70 [hyper:52,64] r(exist,u2r2(exist)).
% 71 [hyper:53,64] r(exist,u2r3(exist)).
% 78 [hyper:37,69,cut:61] a(u2r1(exist)).
% 81 [hyper:32,78] d(u2r1(exist)) | c(u2r1(exist)).
% 84 [hyper:37,70,cut:61] a(u2r2(exist)).
% 87 [hyper:32,84] d(u2r2(exist)) | c(u2r2(exist)).
% 100 [hyper:37,71,cut:61] a(u2r3(exist)).
% 105 [hyper:32,100] d(u2r3(exist)) | c(u2r3(exist)).
% 172 [hyper:35,87,70,81,cut:61,cut:69] equalish(u2r2(exist),u2r1(exist)) | d(u2r2(exist)) | d(u2r1(exist)).
% 225 [hyper:35,105,71,81,cut:61,cut:69] equalish(u2r3(exist),u2r1(exist)) | d(u2r3(exist)) | d(u2r1(exist)).
% 329 [hyper:48,172,cut:64] d(u2r2(exist)) | d(u2r1(exist)).
% 497 [hyper:49,225,cut:64] d(u2r3(exist)) | d(u2r1(exist)).
% 537 [hyper:60,497,70,cut:71,binarycut:329,cut:62] equalish(u2r3(exist),u2r2(exist)) | d(u2r1(exist)).
% 538 [hyper:50,537,cut:64] d(u2r1(exist)).
% 577 [hyper:60,538,69,71,105,cut:62] equalish(u2r3(exist),u2r1(exist)) | c(u2r3(exist)).
% 578 [hyper:60,538,69,70,87,cut:62] equalish(u2r2(exist),u2r1(exist)) | c(u2r2(exist)).
% 674 [hyper:49,577,cut:64] c(u2r3(exist)).
% 742 [hyper:48,578,cut:64] c(u2r2(exist)).
% 768 [hyper:35,742,70,71,cut:61,cut:674] equalish(u2r3(exist),u2r2(exist)).
% 798 [hyper:50,768,cut:64] 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 13
% clause depth limited to 2
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 63
% derived clauses: 1681
% kept clauses: 133
% kept size sum: 1444
% kept mid-nuclei: 549
% kept new demods: 0
% forw unit-subs: 412
% forw double-subs: 263
% forw overdouble-subs: 211
% backward subs: 28
% fast unit cutoff: 529
% full unit cutoff: 0
% dbl unit cutoff: 7
% real runtime : 0.5
% process. runtime: 0.5
% specific non-discr-tree subsumption statistics:
% tried: 1696
% length fails: 11
% strength fails: 123
% predlist fails: 1076
% aux str. fails: 0
% by-lit fails: 162
% full subs tried: 49
% full subs fail: 49
%
% ; 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/KRS010-1+noeq.in")
%
%------------------------------------------------------------------------------