%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC264-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 60.0s
% Output   : Assurance 60.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/SWC264-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(194,40,2,388,0,2,54307,4,2220,56392,5,2804,56393,1,2806,56393,50,2809,56393,40,2809,56587,0,2809,141615,3,4213,173736,4,4912,196121,5,5610,196122,1,5612,196122,50,5616,196122,40,5616,196316,0,5616,246861,3,6168,262591,4,6443)
% 
% 
% START OF PROOF
% 196150 [] ss^list(skaf68(X)).
% 196151 [] ss^list(skaf67(X)).
% 196152 [] ss^list(skaf66(X)).
% 196153 [] ss^item(skaf65(X)).
% 196154 [] ss^item(skaf64(X)).
% 196214 [] -leq(skaf64(X),skaf65(X)) | -ss^list(X) | totalordered^p(X).
% 196226 [] -lt(X,Y) | leq(X,Y) | -ss^item(X) | -ss^item(Y).
% 196287 [] equal(app(app(skaf66(X),cons(skaf64(X),skaf67(X))),cons(skaf65(X),skaf68(X))),X) | -ss^list(X) | totalordered^p(X).
% 196304 [] -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).
% 196309 [] ss^list(sk1).
% 196314 [] equal(sk1,sk3).
% 196315 [] strictordered^p(sk3).
% 196316 [] -totalordered^p(sk1).
% 197083 [para:196314.1.2,196315.1.1] strictordered^p(sk1).
% 198574 [binary:196309,196214.2,cut:196316] -leq(skaf64(sk1),skaf65(sk1)).
% 202709 [binary:196226.2,198574,cut:196154,cut:196153] -lt(skaf64(sk1),skaf65(sk1)).
% 207489 [binary:196309,196287.2,cut:196316] equal(app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))),sk1).
% 267613 [binary:207489,196304,cut:202709,cut:196153,cut:196154,cut:196309,cut:196151,cut:196152,cut:196150,cut:197083] 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:    2552
%  derived clauses:   338908
%  kept clauses:      180701
%  kept size sum:     0
%  kept mid-nuclei:   42267
%  kept new demods:   34255
%  forw unit-subs:    26025
%  forw double-subs: 8653
%  forw overdouble-subs: 5865
%  backward subs:     44
%  fast unit cutoff:  31948
%  full unit cutoff:  0
%  dbl  unit cutoff:  690
%  real runtime  :  64.82
%  process. runtime:  64.77
% specific non-discr-tree subsumption statistics: 
%  tried:           1779344
%  length fails:    17405
%  strength fails:  159081
%  predlist fails:  1239175
%  aux str. fails:  50359
%  by-lit fails:    38486
%  full subs tried: 233946
%  full subs fail:  227225
% 
% ; 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/SWC264-1+eq_r.in")
% 
%------------------------------------------------------------------------------