%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC207-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 : art10.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 29.4s
% Output   : Assurance 29.4s
% 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/SWC207-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(202,40,1,404,0,1,57028,4,2257,61029,5,2803,61029,1,2803,61029,50,2805,61029,40,2805,61231,0,2805)
% 
% 
% START OF PROOF
% 61030 [] equal(X,X).
% 61038 [] ss^list(nil).
% 61128 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 61130 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 61145 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 61216 [] ss^list(sk1).
% 61218 [] ss^list(sk3).
% 61219 [] ss^list(sk4).
% 61220 [] equal(sk2,sk4).
% 61221 [] equal(sk1,sk3).
% 61222 [] neq(sk2,nil).
% 61223 [] -neq(sk1,nil).
% 61225 [] equal(nil,sk3) | ss^item(sk5).
% 61226 [] equal(cons(sk5,nil),sk3) | equal(nil,sk4).
% 61245 [input:61145,factor:cut:61030] -neq(X,X) | -ss^list(X).
% 62002 [para:61225.1.2,61221.1.2] equal(sk1,nil) | ss^item(sk5).
% 62008 [?] ?
% 62053 [para:62002.1.1,61223.1.1,binarycut:62008] ss^item(sk5).
% 63493 [binary:61218,61245.2] -neq(sk3,sk3).
% 63494 [binary:61219,61245.2] -neq(sk4,sk4).
% 63556 [para:61221.1.2,63493.1.2] -neq(sk3,sk1).
% 63595 [para:61220.1.2,63494.1.1] -neq(sk2,sk4).
% 63646 [para:61226.2.2,63595.1.2,cut:61222] equal(cons(sk5,nil),sk3).
% 63963 [binary:61223,61130,cut:61038,cut:61216] equal(sk1,nil).
% 64029 [para:63963.1.1,63556.1.2] -neq(sk3,nil).
% 64129 [binary:61130,64029,cut:61038,cut:61218] equal(sk3,nil).
% 80172 [para:63646.1.1,61128.1.1,cut:64129,cut:62053,cut:61038] 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:    1031
%  derived clauses:   114768
%  kept clauses:      62142
%  kept size sum:     905045
%  kept mid-nuclei:   16014
%  kept new demods:   32726
%  forw unit-subs:    7536
%  forw double-subs: 4905
%  forw overdouble-subs: 1151
%  backward subs:     61
%  fast unit cutoff:  4382
%  full unit cutoff:  0
%  dbl  unit cutoff:  183
%  real runtime  :  31.25
%  process. runtime:  30.70
% specific non-discr-tree subsumption statistics: 
%  tried:           301989
%  length fails:    7865
%  strength fails:  23752
%  predlist fails:  198648
%  aux str. fails:  15285
%  by-lit fails:    1695
%  full subs tried: 36002
%  full subs fail:  34542
% 
% ; 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/SWC207-1+eq_r.in")
% 
%------------------------------------------------------------------------------