%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC398-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 : art08.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 50.0s
% Output   : Assurance 50.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/SWC398-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,2,408,0,2,49471,4,2227,51487,5,2803,51489,1,2806,51489,50,2808,51489,40,2808,51697,0,2809,139797,3,4213,175730,4,4920)
% 
% 
% START OF PROOF
% 51299 [?] ?
% 51630 [] member^p(app(X,Y),Z) | -member^p(X,Z) | -ss^item(Z) | -ss^list(X) | -ss^list(Y).
% 51678 [] member^p(sk1,sk6).
% 51679 [] ss^item(sk6).
% 51682 [] equal(app(sk3,sk5),sk4).
% 51683 [] ss^list(sk5).
% 51684 [] equal(sk1,sk3).
% 51689 [] ss^list(sk1).
% 52483 [para:51684.1.2,51682.1.1.1] equal(app(sk1,sk5),sk4).
% 59208 [para:52483.1.1,51630.1.1,cut:51689,cut:51683] -member^p(sk1,X) | member^p(sk4,X) | -ss^item(X).
% 183717 [binary:51678,59208,cut:51299,cut:51679] 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:    1535
%  derived clauses:   248112
%  kept clauses:      114776
%  kept size sum:     0
%  kept mid-nuclei:   21816
%  kept new demods:   31553
%  forw unit-subs:    16134
%  forw double-subs: 5338
%  forw overdouble-subs: 2848
%  backward subs:     21
%  fast unit cutoff:  15026
%  full unit cutoff:  0
%  dbl  unit cutoff:  267
%  real runtime  :  50.38
%  process. runtime:  50.36
% specific non-discr-tree subsumption statistics: 
%  tried:           1064442
%  length fails:    10327
%  strength fails:  92588
%  predlist fails:  740259
%  aux str. fails:  34907
%  by-lit fails:    35001
%  full subs tried: 129773
%  full subs fail:  126646
% 
% ; 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/SWC398-1+eq_r.in")
% 
%------------------------------------------------------------------------------