%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC339-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/SWC339-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(200,40,1,406,0,1,50143,4,2150,52347,5,2802,52348,1,2802,52348,50,2804,52348,40,2804,52554,0,2820)
% 
% 
% START OF PROOF
% 52052 [?] ?
% 52522 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 52540 [] equal(app(app(sk5,sk3),sk6),sk4).
% 52541 [] ss^list(sk6).
% 52542 [] ss^list(sk5).
% 52543 [] equal(sk1,sk3).
% 52545 [] ss^list(sk4).
% 52546 [] ss^list(sk3).
% 66945 [binary:52540,52522,cut:52545,cut:52546,cut:52541,cut:52542] segment^p(sk4,sk3).
% 67157 [para:52543.1.2,66945.1.2,cut:52052] 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:    797
%  derived clauses:   79908
%  kept clauses:      51624
%  kept size sum:     727997
%  kept mid-nuclei:   14010
%  kept new demods:   30334
%  forw unit-subs:    4558
%  forw double-subs: 2192
%  forw overdouble-subs: 905
%  backward subs:     14
%  fast unit cutoff:  2296
%  full unit cutoff:  0
%  dbl  unit cutoff:  158
%  real runtime  :  29.47
%  process. runtime:  29.46
% specific non-discr-tree subsumption statistics: 
%  tried:           140406
%  length fails:    525
%  strength fails:  17788
%  predlist fails:  78540
%  aux str. fails:  4363
%  by-lit fails:    1044
%  full subs tried: 27991
%  full subs fail:  26761
% 
% ; 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/SWC339-1+eq_r.in")
% 
%------------------------------------------------------------------------------