%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC273-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 59.6s
% Output   : Assurance 59.6s
% 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/SWC273-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(196,40,3,392,0,3,54223,4,2260,56288,5,2805,56289,1,2806,56289,50,2809,56289,40,2809,56485,0,2809,138742,3,4227,180960,4,4912,207933,5,5610,207933,5,5612,207933,1,5612,207933,50,5616,207933,40,5616,208129,0,5616,253742,3,6169,271832,4,6443)
% 
% 
% START OF PROOF
% 207961 [] ss^list(skaf68(X)).
% 207962 [] ss^list(skaf67(X)).
% 207963 [] ss^list(skaf66(X)).
% 207964 [] ss^item(skaf65(X)).
% 207965 [] ss^item(skaf64(X)).
% 208025 [] -leq(skaf64(X),skaf65(X)) | -ss^list(X) | totalordered^p(X).
% 208037 [] -lt(X,Y) | leq(X,Y) | -ss^item(X) | -ss^item(Y).
% 208098 [] equal(app(app(skaf66(X),cons(skaf64(X),skaf67(X))),cons(skaf65(X),skaf68(X))),X) | -ss^list(X) | totalordered^p(X).
% 208115 [] -equal(app(app(X,cons(Y,Z)),cons(U,V)),W) | lt(Y,U) | -ss^item(U) | -ss^item(Y) | -ss^list(W) | -ss^list(Z) | -ss^list(X) | -ss^list(V) | -strictordered^p(W).
% 208120 [] ss^list(sk1).
% 208125 [] equal(sk1,sk3).
% 208127 [] strictordered^p(sk3).
% 208129 [] -totalordered^p(sk1).
% 208896 [para:208125.1.2,208127.1.1] strictordered^p(sk1).
% 210405 [binary:208120,208025.2,cut:208129] -leq(skaf64(sk1),skaf65(sk1)).
% 214338 [binary:208037.2,210405,cut:207965,cut:207964] -lt(skaf64(sk1),skaf65(sk1)).
% 219295 [binary:208120,208098.2,cut:208129] equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1).
% 276009 [binary:219295,208115,cut:214338,cut:207964,cut:207965,cut:208120,cut:207962,cut:207963,cut:207961,cut:208896] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double 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: 11
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    2760
%  derived clauses:   367511
%  kept clauses:      178171
%  kept size sum:     0
%  kept mid-nuclei:   45864
%  kept new demods:   33969
%  forw unit-subs:    29797
%  forw double-subs: 13615
%  forw overdouble-subs: 6775
%  backward subs:     154
%  fast unit cutoff:  36419
%  full unit cutoff:  0
%  dbl  unit cutoff:  744
%  real runtime  :  65.19
%  process. runtime:  64.72
% specific non-discr-tree subsumption statistics: 
%  tried:           2027045
%  length fails:    17733
%  strength fails:  200641
%  predlist fails:  1390221
%  aux str. fails:  61388
%  by-lit fails:    57387
%  full subs tried: 254904
%  full subs fail:  247538
% 
% ; 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/SWC273-1+eq_r.in")
% 
%------------------------------------------------------------------------------