%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC036-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 10.0s
% Output   : Assurance 10.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/SWC036-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)
% 
% 
% SOS clause 
% equal(nil,sk3) | -equal(nil,sk4).
% was split for some strategies as: 
% equal(nil,sk3).
% -equal(nil,sk4).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(195,40,1,390,0,1,32231,4,988,34754,5,1303,34755,1,1303,34755,50,1305,34755,40,1305,34950,0,1316)
% 
% 
% START OF PROOF
% 34946 [] equal(nil,sk2).
% 34947 [] equal(sk2,sk4).
% 34948 [] equal(sk1,sk3).
% 34949 [] -equal(nil,sk1).
% 34950 [] -equal(nil,sk4) | equal(nil,sk3).
% 35718 [para:34947.1.2,34950.1.2,cut:34946] equal(nil,sk3).
% 35722 [para:34948.1.2,35718.1.2,cut:34949] 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: 13
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    90
%  derived clauses:   53488
%  kept clauses:      23453
%  kept size sum:     329814
%  kept mid-nuclei:   11104
%  kept new demods:   17118
%  forw unit-subs:    3030
%  forw double-subs: 1180
%  forw overdouble-subs: 439
%  backward subs:     2
%  fast unit cutoff:  1084
%  full unit cutoff:  0
%  dbl  unit cutoff:  136
%  real runtime  :  13.21
%  process. runtime:  13.20
% specific non-discr-tree subsumption statistics: 
%  tried:           40744
%  length fails:    224
%  strength fails:  15276
%  predlist fails:  3024
%  aux str. fails:  1450
%  by-lit fails:    684
%  full subs tried: 19299
%  full subs fail:  18538
% 
% ; 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/SWC036-1+eq_r.in")
% 
%------------------------------------------------------------------------------