%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC357-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 : art04.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 49.6s
% Output   : Assurance 49.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/SWC357-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(198,40,2,396,0,2,53944,4,2233,56917,5,2804,56918,1,2806,56918,50,2809,56918,40,2809,57116,0,2809,137904,3,4212,171234,4,4910)
% 
% 
% START OF PROOF
% 56919 [] equal(X,X).
% 56927 [] ss^list(nil).
% 56970 [] ss^list(skaf45(X,Y)).
% 56993 [] equal(app(nil,X),X) | -ss^list(X).
% 57034 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 57051 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 57092 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 57105 [] ss^list(sk1).
% 57106 [] ss^list(sk2).
% 57109 [] equal(sk2,sk4).
% 57110 [] equal(sk1,sk3).
% 57111 [] neq(sk2,nil).
% 57112 [] -segment^p(sk2,sk1).
% 57114 [] frontseg^p(sk4,sk3) | equal(nil,sk4).
% 57130 [input:57034,factor:cut:56919] -neq(X,X) | -ss^list(X).
% 57889 [para:57114.2.2,57109.1.2] frontseg^p(sk4,sk3) | equal(sk2,nil).
% 58422 [binary:57105,56993.2] equal(app(nil,sk1),sk1).
% 59322 [binary:57106,57130.2] -neq(sk2,sk2).
% 59354 [para:57889.2.1,59322.1.2,cut:57111] frontseg^p(sk4,sk3).
% 59395 [para:57109.1.2,59354.1.1] frontseg^p(sk2,sk3).
% 59467 [para:57110.1.2,59395.1.2] frontseg^p(sk2,sk1).
% 62999 [binary:59467,57051.2,cut:57106,cut:57105] equal(app(sk1,skaf45(sk2,sk1)),sk2).
% 70668 [para:58422.1.1,57092.1.1.1,cut:57105,cut:56927] -equal(app(sk1,X),Y) | segment^p(Y,sk1) | -ss^list(Y) | -ss^list(X).
% 184079 [binary:62999,70668,cut:57112,cut:57106,cut:56970] 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 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
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    1550
%  derived clauses:   235216
%  kept clauses:      117832
%  kept size sum:     0
%  kept mid-nuclei:   28497
%  kept new demods:   33250
%  forw unit-subs:    20229
%  forw double-subs: 5924
%  forw overdouble-subs: 3219
%  backward subs:     35
%  fast unit cutoff:  19420
%  full unit cutoff:  0
%  dbl  unit cutoff:  291
%  real runtime  :  52.30
%  process. runtime:  51.86
% specific non-discr-tree subsumption statistics: 
%  tried:           1171033
%  length fails:    14594
%  strength fails:  115968
%  predlist fails:  812080
%  aux str. fails:  36386
%  by-lit fails:    40692
%  full subs tried: 129392
%  full subs fail:  125924
% 
% ; 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/SWC357-1+eq_r.in")
% 
%------------------------------------------------------------------------------