%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC082-1 : TPTP v3.4.2. Released v2.4.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 19.9s
% Output   : Assurance 19.9s
% 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/SWC/SWC082-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: big
% 
% strategies selected: 
% (hyper 28 #f 5 19)
% (binary-unit 28 #f 5 19)
% (binary-double 11 #f 5 19)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 19)
% (binary-order 28 #f 5 19)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(199,40,1,398,0,1,55031,4,2246,56954,5,2802,56955,1,2804,56955,50,2807,56955,40,2807,57154,0,2807)
% 
% 
% START OF PROOF
% 57146 [] equal(sk2,sk4).
% 57147 [] equal(sk1,sk3).
% 57148 [] neq(sk2,nil).
% 57149 [] -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 57151 [] -neq(sk4,nil) | ss^list(sk5).
% 57152 [] -neq(sk4,nil) | neq(sk5,nil).
% 57153 [] -neq(sk4,nil) | segment^p(sk4,sk5).
% 57154 [] -neq(sk4,nil) | segment^p(sk3,sk5).
% 57936 [para:57146.1.2,57151.1.1,cut:57148] ss^list(sk5).
% 57941 [para:57146.1.2,57152.1.1,cut:57148] neq(sk5,nil).
% 57946 [para:57146.1.2,57153.1.1,cut:57148] segment^p(sk4,sk5).
% 57949 [para:57146.1.2,57154.1.1,cut:57148] segment^p(sk3,sk5).
% 57958 [para:57146.1.2,57946.1.1] segment^p(sk2,sk5).
% 57965 [para:57147.1.2,57949.1.1] segment^p(sk1,sk5).
% 57967 [binary:57149.2,57958,cut:57941,cut:57965,cut:57936] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 19
% clause depth limited to 5
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    147
%  derived clauses:   85751
%  kept clauses:      41920
%  kept size sum:     607906
%  kept mid-nuclei:   14859
%  kept new demods:   32315
%  forw unit-subs:    3844
%  forw double-subs: 1969
%  forw overdouble-subs: 431
%  backward subs:     8
%  fast unit cutoff:  1160
%  full unit cutoff:  0
%  dbl  unit cutoff:  136
%  real runtime  :  28.53
%  process. runtime:  28.12
% specific non-discr-tree subsumption statistics: 
%  tried:           44183
%  length fails:    242
%  strength fails:  16139
%  predlist fails:  3910
%  aux str. fails:  2089
%  by-lit fails:    934
%  full subs tried: 20019
%  full subs fail:  19273
% 
% ; 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/SWC/SWC082-1+eq_r.in")
% 
%------------------------------------------------------------------------------