%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC381-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/SWC381-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(202,40,2,404,0,3,53435,4,2199,55385,5,2805,55386,1,2807,55386,50,2809,55386,40,2809,55588,0,2810,142435,3,4212,185904,4,4911)
% 
% 
% START OF PROOF
% 55387 [] equal(X,X).
% 55487 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 55502 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 55573 [] ss^list(sk1).
% 55575 [] ss^list(sk3).
% 55577 [] equal(sk2,sk4).
% 55578 [] equal(sk1,sk3).
% 55579 [] neq(sk2,nil).
% 55585 [] -neq(sk4,nil) | -equal(cons(X,nil),sk1) | -member^p(sk2,X) | -ss^item(X).
% 55586 [] -neq(sk4,nil) | ss^item(sk5).
% 55587 [] equal(cons(sk5,nil),sk3) | -neq(sk4,nil).
% 55588 [] -neq(sk4,nil) | member^p(sk4,sk5).
% 55602 [input:55502,factor:cut:55387] -neq(X,X) | -ss^list(X).
% 56356 [para:55577.1.2,55586.1.1,cut:55579] ss^item(sk5).
% 56358 [para:55577.1.2,55585.1.1,cut:55579] -equal(cons(X,nil),sk1) | -member^p(sk2,X) | -ss^item(X).
% 56367 [para:55577.1.2,55587.2.1,cut:55579] equal(cons(sk5,nil),sk3).
% 56369 [para:55577.1.2,55588.1.1,cut:55579] member^p(sk4,sk5).
% 56371 [para:55577.1.2,56369.1.1] member^p(sk2,sk5).
% 57874 [binary:55575,55602.2] -neq(sk3,sk3).
% 57905 [para:55578.1.2,57874.1.2] -neq(sk3,sk1).
% 58312 [binary:57905,55487,cut:55573,cut:55575] equal(sk3,sk1).
% 192663 [binary:56371,56358.2,demod:56367,cut:58312,cut:56356] 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:    1565
%  derived clauses:   255983
%  kept clauses:      117565
%  kept size sum:     0
%  kept mid-nuclei:   21372
%  kept new demods:   33061
%  forw unit-subs:    11455
%  forw double-subs: 4552
%  forw overdouble-subs: 3197
%  backward subs:     31
%  fast unit cutoff:  13435
%  full unit cutoff:  0
%  dbl  unit cutoff:  301
%  real runtime  :  50.12
%  process. runtime:  50.11
% specific non-discr-tree subsumption statistics: 
%  tried:           1268951
%  length fails:    15442
%  strength fails:  107910
%  predlist fails:  889311
%  aux str. fails:  40000
%  by-lit fails:    47931
%  full subs tried: 146239
%  full subs fail:  142801
% 
% ; 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/SWC381-1+eq_r.in")
% 
%------------------------------------------------------------------------------