%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC209-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 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/SWC209-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,0,396,0,1,55487,4,2212,58918,5,2803,58919,1,2805,58919,50,2807,58919,40,2807,59117,0,2808)
% 
% 
% START OF PROOF
% 59110 [] equal(sk2,sk4).
% 59111 [] equal(sk1,sk3).
% 59112 [] neq(sk2,nil).
% 59113 [] -neq(sk1,nil).
% 59114 [] neq(sk3,nil) | equal(nil,sk4).
% 59116 [] neq(sk3,nil) | equal(nil,sk3).
% 59887 [para:59111.1.2,59114.1.1,cut:59113] equal(nil,sk4).
% 59889 [para:59111.1.2,59116.1.1,cut:59113] equal(nil,sk3).
% 59892 [para:59887.1.2,59110.1.2] equal(sk2,nil).
% 59894 [para:59889.1.2,59111.1.2] equal(sk1,nil).
% 59896 [para:59892.1.1,59112.1.1] neq(nil,nil).
% 59897 [para:59894.1.1,59113.1.1,cut:59896] 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:    137
%  derived clauses:   92077
%  kept clauses:      43505
%  kept size sum:     628508
%  kept mid-nuclei:   15214
%  kept new demods:   32320
%  forw unit-subs:    4734
%  forw double-subs: 3285
%  forw overdouble-subs: 408
%  backward subs:     6
%  fast unit cutoff:  1319
%  full unit cutoff:  0
%  dbl  unit cutoff:  136
%  real runtime  :  28.28
%  process. runtime:  28.24
% specific non-discr-tree subsumption statistics: 
%  tried:           43982
%  length fails:    221
%  strength fails:  16189
%  predlist fails:  3962
%  aux str. fails:  2088
%  by-lit fails:    930
%  full subs tried: 19750
%  full subs fail:  19019
% 
% ; 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/SWC209-1+eq_r.in")
% 
%------------------------------------------------------------------------------