%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC408-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 : art06.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 19.9s
% Output   : Assurance 19.9s
% 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/SWC408-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(196,40,2,392,0,2,54487,4,2266)
% 
% 
% START OF PROOF
% 337 [] member^p(app(X,Y),Z) | -member^p(X,Z) | -ss^item(Z) | -ss^list(X) | -ss^list(Y).
% 384 [] ss^list(sk2).
% 386 [] ss^list(sk4).
% 387 [] equal(app(sk4,sk4),sk3).
% 388 [] equal(sk2,sk4).
% 389 [] equal(sk1,sk3).
% 390 [] ss^item(sk5).
% 391 [] member^p(sk2,sk5).
% 392 [] -member^p(sk1,sk5).
% 1417 [para:388.1.2,387.1.1.1] equal(app(sk2,sk4),sk3).
% 1978 [hyper:337,391,386,cut:390,cut:384,demod:1417] member^p(sk3,sk5).
% 56331 [para:389.1.1,392.1.1,cut:1978] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 19
% clause depth limited to 5
% seconds given: 28
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    70
%  derived clauses:   67370
%  kept clauses:      41197
%  kept size sum:     602460
%  kept mid-nuclei:   14728
%  kept new demods:   33091
%  forw unit-subs:    3843
%  forw double-subs: 1704
%  forw overdouble-subs: 82
%  backward subs:     0
%  fast unit cutoff:  1089
%  full unit cutoff:  0
%  dbl  unit cutoff:  13
%  real runtime  :  25.96
%  process. runtime:  25.41
% specific non-discr-tree subsumption statistics: 
%  tried:           12970
%  length fails:    0
%  strength fails:  4352
%  predlist fails:  3447
%  aux str. fails:  1959
%  by-lit fails:    902
%  full subs tried: 2020
%  full subs fail:  1942
% 
% ; 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/SWC408-1+eq_r.in")
% 
%------------------------------------------------------------------------------