%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV008-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 : art01.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/SWV008-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(18,40,0,36,0,0)
%
%
% START OF PROOF
% 27 [] less_than(Y,X) | less_than(X,Y) | equal(X,Y).
% 31 [] -less_than(X,Y) | -equal(Y,Z) | less_than(X,Z).
% 32 [] -less_than(n,l).
% 33 [] less_than(one,l).
% 34 [] less_than(a(l),a(predecessor(l))).
% 35 [] -less_than(one,n) | -less_than(a(X),a(predecessor(n))) | less_than(X,n) | less_than(n,X).
% 36 [] -less_than(a(X),a(predecessor(X))) | -less_than(X,n) | -less_than(one,X).
% 254 [hyper:32,27] less_than(l,n) | equal(l,n).
% 511 [hyper:36,254,cut:34,cut:33] equal(l,n).
% 532 [hyper:31,511,33] less_than(one,n).
% 539 [para:511.1.1,34.1.1.1] less_than(a(n),a(predecessor(l))).
% 929 [para:511.1.1,539.1.2.1.1] less_than(a(n),a(predecessor(n))).
% 1077 [hyper:35,929,cut:532] less_than(n,n).
% 1078 [hyper:36,929,cut:1077,cut:532] 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: 62
% derived clauses: 2690
% kept clauses: 384
% kept size sum: 4495
% kept mid-nuclei: 635
% kept new demods: 4
% forw unit-subs: 850
% forw double-subs: 15
% forw overdouble-subs: 499
% backward subs: 5
% fast unit cutoff: 66
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.6
% process. runtime: 0.5
% specific non-discr-tree subsumption statistics:
% tried: 6907
% length fails: 150
% strength fails: 633
% predlist fails: 2381
% aux str. fails: 1131
% by-lit fails: 15
% full subs tried: 2517
% full subs fail: 2062
%
% ; 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/SWV008-1+eq_r.in")
%
%------------------------------------------------------------------------------