%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWV254-2 : TPTP v3.4.2. Released v3.2.0.
% 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 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% 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: /tmp/SystemOnTPTP31277/SWV/SWV254-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: heq
% detected subclass: small
% detected subclass: short
% 
% strategies selected: 
% (binary-unit-uniteq 30 #f)
% (binary-posweight-order 120 #f 3 5)
% (binary-posweight-order 240 #f)
% (binary-posweight-lex-big-order 60 #f)
% (binary-posweight-lex-small-order 12 #f)
% (binary-weightorder 24 #f)
% (hyper 30 #f)
% (binary 24 #t)
% (binary-order 30 #f)
% (binary-unit 30 #f)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(7,40,0,14,0,0)
% 
% 
% START OF PROOF
% 8 [] equal(X,X).
% 9 [] equal(c_^set^interval_^oat^least^less^than(X,Y,Z),c_emptyset) | -c_lessequals(Y,X,Z) | -class_^orderings_^oorder(Z).
% 10 [] equal(c_^set^interval_^oat^least^less^than(X,c_^suc(X),tc_nat),c_insert(X,c_emptyset,tc_nat)).
% 11 [] -equal(c_emptyset,c_insert(X,Y,Z)).
% 12 [] class_^orderings_^oorder(tc_nat).
% 13 [] c_lessequals(X,v_x(X),tc_nat).
% 14 [] equal(v_x(X),v_nat).
% 18 [binary:13,9.2,demod:14,cut:12] equal(c_^set^interval_^oat^least^less^than(v_nat,X,tc_nat),c_emptyset).
% 19 [para:10.1.1,18.1.1] equal(c_insert(v_nat,c_emptyset,tc_nat),c_emptyset).
% 20 [para:19.1.1,11.1.2,cut:8] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    10
%  derived clauses:   14
%  kept clauses:      4
%  kept size sum:     26
%  kept mid-nuclei:   0
%  kept new demods:   4
%  forw unit-subs:    8
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  2
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.0
% 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" "/tmp/SystemOnTPTP31277/SWV/SWV254-2+eq_r.in")
% 
%------------------------------------------------------------------------------