%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC351-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 : art05.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/SWC351-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(199,40,0,404,0,1,49988,4,2158,52192,5,2802,52193,1,2804,52193,50,2806,52193,40,2806,52398,0,2806)
% 
% 
% START OF PROOF
% 51911 [?] ?
% 52338 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 52384 [] equal(app(sk3,sk5),sk4).
% 52385 [] ss^list(sk5).
% 52387 [] equal(sk1,sk3).
% 52389 [] ss^list(sk4).
% 52392 [] ss^list(sk1).
% 53188 [para:52387.1.2,52384.1.1.1] equal(app(sk1,sk5),sk4).
% 60864 [binary:53188,52338,cut:51911,cut:52389,cut:52392,cut:52385] 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:    627
%  derived clauses:   72698
%  kept clauses:      45488
%  kept size sum:     634585
%  kept mid-nuclei:   14050
%  kept new demods:   30258
%  forw unit-subs:    4543
%  forw double-subs: 1991
%  forw overdouble-subs: 799
%  backward subs:     16
%  fast unit cutoff:  1559
%  full unit cutoff:  0
%  dbl  unit cutoff:  144
%  real runtime  :  28.79
%  process. runtime:  28.77
% specific non-discr-tree subsumption statistics: 
%  tried:           89233
%  length fails:    3917
%  strength fails:  17230
%  predlist fails:  39530
%  aux str. fails:  2722
%  by-lit fails:    888
%  full subs tried: 22859
%  full subs fail:  21745
% 
% ; 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/SWC351-1+eq_r.in")
% 
%------------------------------------------------------------------------------