%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC019-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 : art09.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/SWC019-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(195,40,0,390,0,1,54261,4,2248,56132,5,2802,56132,1,2802,56132,50,2804,56132,40,2804,56327,0,2804)
% 
% 
% START OF PROOF
% 397 [?] ?
% 56133 [] equal(X,X).
% 56141 [] ss^list(nil).
% 56233 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 56319 [] ss^list(sk1).
% 56323 [] equal(sk2,sk4).
% 56324 [] equal(sk1,sk3).
% 56325 [] equal(sk4,sk3).
% 56326 [] -neq(X,nil) | -frontseg^p(sk2,X) | -frontseg^p(sk1,X) | -ss^list(X).
% 56327 [] -equal(nil,sk2) | -equal(nil,sk1).
% 57094 [para:56325.1.1,56323.1.2] equal(sk2,sk3).
% 57096 [binary:56319,56326.4,cut:397] -neq(sk1,nil) | -frontseg^p(sk2,sk1).
% 57101 [para:57094.1.2,56324.1.2] equal(sk1,sk2).
% 57117 [para:57101.1.2,56327.1.2] -equal(nil,sk1).
% 57119 [para:57101.1.2,57096.2.1,cut:397] -neq(sk1,nil).
% 58959 [binary:57119,56233,cut:56141,cut:56319] equal(sk1,nil).
% 59044 [para:58959.1.1,57117.1.2,cut:56133] 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:    388
%  derived clauses:   87222
%  kept clauses:      42995
%  kept size sum:     615427
%  kept mid-nuclei:   14830
%  kept new demods:   32389
%  forw unit-subs:    4271
%  forw double-subs: 1918
%  forw overdouble-subs: 434
%  backward subs:     9
%  fast unit cutoff:  1135
%  full unit cutoff:  0
%  dbl  unit cutoff:  136
%  real runtime  :  28.61
%  process. runtime:  28.16
% specific non-discr-tree subsumption statistics: 
%  tried:           46733
%  length fails:    221
%  strength fails:  16147
%  predlist fails:  6458
%  aux str. fails:  1998
%  by-lit fails:    934
%  full subs tried: 19810
%  full subs fail:  19061
% 
% ; 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/SWC019-1+eq_r.in")
% 
%------------------------------------------------------------------------------