%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWV007-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 : 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/SWV/SWV007-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 3 7)
% (binary-unit 9 #f 3 7)
% (binary-double 9 #f 3 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 7)
% (binary-order 25 #f 3 7)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(24,40,1,48,0,1)
% 
% 
% START OF PROOF
% 31 [] less_than(X,successor(X)).
% 32 [] -less_than(Z,X) | -less_than(X,Y) | less_than(Z,Y).
% 33 [] less_than(Y,X) | less_than(X,Y) | equal(X,Y).
% 34 [] -less_than(X,X).
% 36 [] -less_than(X,Y) | -equal(X,Z) | less_than(Z,Y).
% 41 [] -less_than(n,m).
% 42 [] less_than(i,m).
% 45 [] less_than(a(m),a(k)).
% 48 [] -less_than(a(X),a(k)) | -less_than(X,successor(n)) | less_than(X,i).
% 328 [hyper:41,33] less_than(m,n) | equal(m,n).
% 329 [hyper:41,33] less_than(m,n) | equal(n,m).
% 881 [hyper:32,328,31] less_than(m,successor(n)) | equal(m,n).
% 4004 [hyper:48,881,cut:45] less_than(m,i) | equal(m,n).
% 4046 [hyper:32,4004,42,cut:34] equal(m,n).
% 4067 [hyper:36,4046,329,cut:34] equal(n,m).
% 4082 [hyper:36,4067,31] less_than(m,successor(n)).
% 4369 [hyper:48,4082,cut:45] less_than(m,i).
% 4394 [hyper:32,4369,42,cut:34] 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 7
% clause depth limited to 3
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    139
%  derived clauses:   26954
%  kept clauses:      1890
%  kept size sum:     30854
%  kept mid-nuclei:   2189
%  kept new demods:   4
%  forw unit-subs:    8066
%  forw double-subs: 2202
%  forw overdouble-subs: 3441
%  backward subs:     31
%  fast unit cutoff:  1742
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.62
%  process. runtime:  0.61
% specific non-discr-tree subsumption statistics: 
%  tried:           184069
%  length fails:    30009
%  strength fails:  47201
%  predlist fails:  6469
%  aux str. fails:  4819
%  by-lit fails:    29814
%  full subs tried: 56717
%  full subs fail:  54377
% 
% ; 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/SWV/SWV007-1+eq_r.in")
% 
%------------------------------------------------------------------------------