%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC041-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 : art03.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 19.5s
% Output : Assurance 19.5s
% 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/SWC041-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(199,40,0,403,0,1,50931,4,2216,52908,5,2803,52909,1,2804,52909,50,2807,52909,40,2807,53113,0,2807)
%
%
% START OF PROOF
% 52910 [] equal(X,X).
% 52918 [] ss^list(nil).
% 52967 [] segment^p(X,X) | -ss^list(X).
% 52990 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 53010 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 53025 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 53028 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 53099 [] equal(app(sk3,sk5),sk4).
% 53100 [] ss^list(sk5).
% 53101 [] -equal(nil,sk1).
% 53102 [] equal(sk1,sk3).
% 53103 [] equal(sk2,sk4).
% 53104 [] equal(nil,sk2).
% 53105 [] ss^list(sk4).
% 53108 [] ss^list(sk1).
% 53128 [input:53025,factor:cut:52910] -neq(X,X) | -ss^list(X).
% 53898 [para:53102.1.2,53099.1.1.1] equal(app(sk1,sk5),sk4).
% 54118 [binary:53105,52967.2] segment^p(sk4,sk4).
% 54149 [para:53103.1.2,54118.1.1] segment^p(sk2,sk4).
% 54189 [para:53104.1.2,54149.1.1] segment^p(nil,sk4).
% 54630 [binary:53105,52990.3,cut:54189] equal(nil,sk4).
% 55623 [binary:53105,53128.2] -neq(sk4,sk4).
% 55709 [para:54630.1.2,55623.1.2] -neq(sk4,nil).
% 55972 [binary:55709,53010,cut:52918,cut:53105] equal(sk4,nil).
% 57435 [para:53898.1.1,53028.1.1,cut:55972,cut:53101,cut:53108,cut:53100] 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: 494
% derived clauses: 89161
% kept clauses: 42078
% kept size sum: 586253
% kept mid-nuclei: 14089
% kept new demods: 30898
% forw unit-subs: 4439
% forw double-subs: 1742
% forw overdouble-subs: 448
% backward subs: 7
% fast unit cutoff: 1152
% full unit cutoff: 0
% dbl unit cutoff: 137
% real runtime : 28.91
% process. runtime: 28.41
% specific non-discr-tree subsumption statistics:
% tried: 49320
% length fails: 221
% strength fails: 16138
% predlist fails: 9219
% aux str. fails: 1757
% by-lit fails: 822
% full subs tried: 19783
% full subs fail: 19012
%
% ; 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/SWC041-1+eq_r.in")
%
%------------------------------------------------------------------------------