%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC279-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/SWC279-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(203,40,1,406,0,2,52550,4,2220,54459,5,2814,54459,1,2814,54459,50,2817,54459,40,2817,54662,0,2817,147517,3,4220,190455,4,4921,209725,5,5618,209725,5,5620,209726,1,5620,209726,50,5624,209726,40,5624,209929,0,5624,258269,3,6176,272956,4,6452)
% 
% 
% START OF PROOF
% 209918 [] equal(sk1,sk3).
% 209919 [] -equal(app(app(X,cons(Y,nil)),Z),sk3) | -member^p(Z,U) | leq(Y,U) | -ss^item(U) | -ss^item(Y) | -ss^list(X) | -ss^list(Z).
% 209920 [] -equal(app(app(X,cons(Y,nil)),Z),sk3) | -member^p(X,U) | leq(U,Y) | -ss^item(U) | -ss^item(Y) | -ss^list(X) | -ss^list(Z).
% 209921 [] ss^item(sk5).
% 209922 [] ss^list(sk6).
% 209923 [] ss^list(sk7).
% 209924 [] equal(app(app(sk6,cons(sk5,nil)),sk7),sk1).
% 209925 [] ss^item(sk8).
% 209926 [] member^p(sk6,sk8) | member^p(sk7,sk8).
% 209927 [] -leq(sk5,sk8) | member^p(sk6,sk8).
% 209928 [] -leq(sk8,sk5) | member^p(sk7,sk8).
% 209929 [] -leq(sk8,sk5) | -leq(sk5,sk8).
% 210755 [para:209924.1.1,209919.1.1,cut:209918,cut:209921,cut:209922,cut:209923] -member^p(sk7,X) | leq(sk5,X) | -ss^item(X).
% 210756 [para:209924.1.1,209920.1.1,cut:209918,cut:209921,cut:209922,cut:209923] -member^p(sk6,X) | leq(X,sk5) | -ss^item(X).
% 210833 [binary:209926.2,210755,cut:209925,binarycut:209927] member^p(sk6,sk8).
% 210837 [binary:209928.2,210755,cut:209925] -leq(sk8,sk5) | leq(sk5,sk8).
% 240095 [binary:209929.2,210837.2] -leq(sk8,sk5).
% 278155 [binary:210833,210756,cut:240095,cut:209925] 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:    2643
%  derived clauses:   391549
%  kept clauses:      176411
%  kept size sum:     0
%  kept mid-nuclei:   38840
%  kept new demods:   33252
%  forw unit-subs:    25650
%  forw double-subs: 9108
%  forw overdouble-subs: 6079
%  backward subs:     36
%  fast unit cutoff:  28590
%  full unit cutoff:  0
%  dbl  unit cutoff:  620
%  real runtime  :  65.7
%  process. runtime:  65.7
% specific non-discr-tree subsumption statistics: 
%  tried:           1906923
%  length fails:    10243
%  strength fails:  160436
%  predlist fails:  1337028
%  aux str. fails:  64975
%  by-lit fails:    42656
%  full subs tried: 244556
%  full subs fail:  237721
% 
% ; 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/SWC279-1+eq_r.in")
% 
%------------------------------------------------------------------------------