%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC206-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 : art04.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.5s
% Output   : Assurance 19.5s
% 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/SWC206-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,2,54968,4,2249,56917,5,2804,56918,1,2806,56918,50,2808,56918,40,2808,57117,0,2808)
% 
% 
% START OF PROOF
% 56919 [] equal(X,X).
% 56927 [] ss^list(nil).
% 56999 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 57019 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 57034 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 57105 [] ss^list(sk1).
% 57109 [] equal(sk2,sk4).
% 57110 [] equal(sk1,sk3).
% 57111 [] neq(sk2,nil).
% 57112 [] -neq(sk1,nil).
% 57114 [] -neq(sk4,nil) | ss^list(sk5).
% 57115 [] -neq(sk4,nil) | neq(sk5,nil).
% 57117 [] -neq(sk4,nil) | segment^p(sk3,sk5).
% 57131 [input:57034,factor:cut:56919] -neq(X,X) | -ss^list(X).
% 57885 [para:57109.1.2,57114.1.1,cut:57111] ss^list(sk5).
% 57891 [para:57109.1.2,57115.1.1,cut:57111] neq(sk5,nil).
% 57896 [para:57109.1.2,57117.1.1,cut:57111] segment^p(sk3,sk5).
% 57899 [para:57110.1.2,57896.1.1] segment^p(sk1,sk5).
% 59321 [binary:56927,57131.2] -neq(nil,nil).
% 59739 [binary:57112,57019,cut:56927,cut:57105] equal(sk1,nil).
% 59832 [para:59739.1.1,57899.1.1] segment^p(nil,sk5).
% 59843 [binary:56999,59832,cut:57885] equal(nil,sk5).
% 59947 [para:59843.1.2,57891.1.1,cut:59321] 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:    408
%  derived clauses:   89134
%  kept clauses:      43911
%  kept size sum:     623060
%  kept mid-nuclei:   14795
%  kept new demods:   32388
%  forw unit-subs:    4313
%  forw double-subs: 1809
%  forw overdouble-subs: 412
%  backward subs:     18
%  fast unit cutoff:  1132
%  full unit cutoff:  0
%  dbl  unit cutoff:  136
%  real runtime  :  28.66
%  process. runtime:  28.20
% specific non-discr-tree subsumption statistics: 
%  tried:           46802
%  length fails:    221
%  strength fails:  16132
%  predlist fails:  6569
%  aux str. fails:  2001
%  by-lit fails:    930
%  full subs tried: 19792
%  full subs fail:  19057
% 
% ; 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/SWC206-1+eq_r.in")
% 
%------------------------------------------------------------------------------