%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC210-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 : art04.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/SWC210-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,1,396,0,2,53320,4,2203,55233,5,2803,55233,1,2803,55233,50,2805,55233,40,2805,55431,0,2805)
%
%
% START OF PROOF
% 55242 [] ss^list(nil).
% 55245 [] -singleton^p(nil).
% 55334 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 55420 [] ss^list(sk1).
% 55424 [] equal(sk2,sk4).
% 55425 [] equal(sk1,sk3).
% 55426 [] neq(sk2,nil).
% 55430 [] -neq(sk4,nil) | singleton^p(sk3).
% 55431 [] -neq(sk1,nil) | -neq(sk4,nil).
% 56199 [para:55424.1.2,55430.1.1,cut:55426] singleton^p(sk3).
% 56201 [para:55425.1.2,56199.1.1] singleton^p(sk1).
% 56203 [para:55424.1.2,55431.2.1,cut:55426] -neq(sk1,nil).
% 57993 [binary:56203,55334,cut:55242,cut:55420] equal(sk1,nil).
% 58031 [para:57993.1.1,56201.1.1,cut:55245] 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: 374
% derived clauses: 89198
% kept clauses: 42133
% kept size sum: 608137
% kept mid-nuclei: 14672
% kept new demods: 32379
% forw unit-subs: 3949
% forw double-subs: 1910
% forw overdouble-subs: 434
% backward subs: 12
% fast unit cutoff: 1110
% full unit cutoff: 0
% dbl unit cutoff: 136
% real runtime : 28.15
% process. runtime: 28.15
% specific non-discr-tree subsumption statistics:
% tried: 46456
% length fails: 221
% strength fails: 16127
% predlist fails: 6195
% aux str. fails: 1995
% by-lit fails: 934
% full subs tried: 19819
% full subs fail: 19070
%
% ; 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/SWC210-1+eq_r.in")
%
%------------------------------------------------------------------------------