%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC179-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 : art02.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/SWC179-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(207,40,1,414,0,1,73705,4,2160,104008,5,2802,104009,1,2803,104009,50,2808,104009,40,2808,104216,0,2808)
% 
% 
% START OF PROOF
% 421 [?] ?
% 73821 [?] ?
% 104012 [] duplicatefree^p(nil).
% 104075 [?] ?
% 104201 [] equal(sk1,sk3).
% 104202 [] -duplicatefree^p(sk1).
% 104213 [] equal(cons(sk5,nil),sk3) | equal(nil,sk3).
% 104826 [input:104075,cut:421] duplicatefree^p(cons(X,nil)).
% 104828 [para:104213.1.1,104826.1.1,cut:73821] equal(nil,sk3).
% 104837 [para:104828.1.2,104201.1.2] equal(sk1,nil).
% 104847 [para:104837.1.1,104202.1.1,cut:104012] 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:    249
%  derived clauses:   129828
%  kept clauses:      68633
%  kept size sum:     979890
%  kept mid-nuclei:   14035
%  kept new demods:   21535
%  forw unit-subs:    4082
%  forw double-subs: 16590
%  forw overdouble-subs: 908
%  backward subs:     72
%  fast unit cutoff:  12433
%  full unit cutoff:  0
%  dbl  unit cutoff:  39
%  real runtime  :  28.11
%  process. runtime:  28.10
% specific non-discr-tree subsumption statistics: 
%  tried:           75612
%  length fails:    8363
%  strength fails:  11787
%  predlist fails:  6678
%  aux str. fails:  12989
%  by-lit fails:    0
%  full subs tried: 35739
%  full subs fail:  34601
% 
% ; 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/SWC179-1+eq_r.in")
% 
%------------------------------------------------------------------------------