%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC259-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 : art07.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 20.0s
% Output   : Assurance 20.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/SWC/SWC259-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(207,40,1,414,0,1,78253,4,2274)
% 
% 
% START OF PROOF
% 208 [] equal(X,X).
% 212 [] totalordered^p(nil).
% 216 [] ss^list(nil).
% 275 [] totalordered^p(cons(X,nil)) | -ss^item(X).
% 281 [] equal(app(X,nil),X) | -ss^list(X).
% 353 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 396 [] ss^list(sk3).
% 399 [] equal(sk1,sk3).
% 400 [] -totalordered^p(sk1).
% 402 [] equal(nil,sk3) | ss^item(sk5).
% 411 [] equal(cons(sk5,nil),sk3) | equal(nil,sk3).
% 802 [hyper:281,396] equal(app(sk3,nil),sk3).
% 2070 [hyper:275,402] totalordered^p(cons(sk5,nil)) | equal(nil,sk3).
% 56630 [hyper:353,411,208,cut:396,demod:802,cut:216] equal(cons(sk5,nil),sk3) | equal(sk3,nil).
% 98157 [para:399.1.1,400.1.1] -totalordered^p(sk3).
% 102679 [para:56630.2.1,98157.1.1,cut:212] equal(cons(sk5,nil),sk3).
% 109688 [para:2070.2.2,98157.1.1,demod:102679,cut:212,cut:98157] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 5
% seconds given: 28
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    89
%  derived clauses:   137966
%  kept clauses:      69437
%  kept size sum:     0
%  kept mid-nuclei:   18399
%  kept new demods:   24715
%  forw unit-subs:    3839
%  forw double-subs: 19113
%  forw overdouble-subs: 1157
%  backward subs:     8
%  fast unit cutoff:  10940
%  full unit cutoff:  0
%  dbl  unit cutoff:  21
%  real runtime  :  25.44
%  process. runtime:  25.44
% specific non-discr-tree subsumption statistics: 
%  tried:           87142
%  length fails:    6070
%  strength fails:  11077
%  predlist fails:  16187
%  aux str. fails:  15668
%  by-lit fails:    2492
%  full subs tried: 35166
%  full subs fail:  34139
% 
% ; 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/SWC259-1+eq_r.in")
% 
%------------------------------------------------------------------------------