%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC016-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 : art10.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 198.5s
% Output : Assurance 198.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/SWC016-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(201,40,3,402,0,3,54358,4,2204,56289,5,2804,56290,1,2804,56290,50,2807,56290,40,2807,56491,0,2807,148401,3,4211,173121,4,4926,194235,5,5608,194235,5,5610,194236,1,5610,194236,50,5614,194236,40,5614,194437,0,5614,240651,3,6166,255700,4,6441,266808,5,6715,266809,5,6716,266809,1,6716,266809,50,6719,266809,40,6719,267010,0,6719,327922,3,7570,339593,4,7996,353716,5,8420,353718,5,8421,353719,1,8421,353719,50,8424,353719,40,8424,353920,0,8424,434714,3,9275,461542,4,9701,478807,5,10125,478808,5,10127,478809,1,10127,478809,50,10130,478809,40,10130,479010,0,10130,801864,3,14496,898535,4,16657,978680,5,18832,978681,1,18832,978681,50,18835,978681,40,18835,978882,0,18835,1018479,3,20236)
%
%
% START OF PROOF
% 978682 [] equal(X,X).
% 978690 [] ss^list(nil).
% 978738 [] segment^p(X,nil) | -ss^list(X).
% 978761 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 978762 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 978797 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 978809 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 978869 [] ss^list(sk2).
% 978872 [] equal(sk2,sk4).
% 978873 [] equal(sk1,sk3).
% 978874 [] -equal(nil,sk4) | equal(nil,sk3).
% 978875 [] -neq(sk4,nil) | ss^list(sk5).
% 978876 [] -neq(sk4,nil) | neq(sk5,nil).
% 978877 [] -neq(sk4,nil) | frontseg^p(sk4,sk5).
% 978878 [] -neq(sk4,nil) | frontseg^p(sk3,sk5).
% 978879 [] neq(sk2,nil) | equal(nil,sk2).
% 978880 [] equal(nil,sk2) | -neq(X,nil) | -frontseg^p(sk2,X) | -frontseg^p(sk1,X) | -ss^list(X).
% 978881 [] -equal(nil,sk1) | neq(sk2,nil).
% 979650 [para:978872.1.2,978874.1.2] -equal(nil,sk2) | equal(nil,sk3).
% 979654 [para:978872.1.2,978875.1.1] -neq(sk2,nil) | ss^list(sk5).
% 979657 [para:978872.1.2,978876.1.1] -neq(sk2,nil) | neq(sk5,nil).
% 979659 [para:978872.1.2,978877.1.1] -neq(sk2,nil) | frontseg^p(sk4,sk5).
% 979662 [para:978872.1.2,978878.1.1] -neq(sk2,nil) | frontseg^p(sk3,sk5).
% 979666 [binary:979654,978879] equal(nil,sk2) | ss^list(sk5).
% 979687 [binary:979654,978881.2] -equal(nil,sk1) | ss^list(sk5).
% 979764 [para:978873.1.2,979650.2.2] -equal(nil,sk2) | equal(nil,sk1).
% 979768 [para:979666.1.2,979650.1.2,cut:978682] equal(nil,sk3) | ss^list(sk5).
% 979771 [binary:978869,978738.2] segment^p(sk2,nil).
% 979774 [binary:978690,978738.2] segment^p(nil,nil).
% 980060 [para:978873.1.2,979768.1.2,binarycut:979687] ss^list(sk5).
% 987449 [para:978879.2.2,979764.1.2,cut:978682,binarycut:978881] neq(sk2,nil).
% 987465 [binary:978797,987449,cut:978690,cut:978869] -equal(sk2,nil).
% 987466 [binary:979657,987449] neq(sk5,nil).
% 987467 [binary:979659,987449] frontseg^p(sk4,sk5).
% 987468 [binary:979662,987449] frontseg^p(sk3,sk5).
% 987633 [binary:978809.3,987465,cut:979771,cut:978869,cut:978690] -segment^p(nil,sk2).
% 987641 [para:978872.1.2,987467.1.1] frontseg^p(sk2,sk5).
% 987646 [para:978873.1.2,987468.1.1] frontseg^p(sk1,sk5).
% 987653 [binary:978761.2,987633,cut:978869] -equal(nil,sk2).
% 1020875 [para:978880.2.1,978762.2.2,cut:987653] -frontseg^p(sk2,X) | -frontseg^p(sk1,X) | -segment^p(nil,Y) | -neq(X,Y) | -ss^list(X) | -ss^list(Y).
% 1020905 [binary:987466,1020875.4,cut:979774,cut:987646,cut:987641,cut:980060,cut:978690] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-order strategy
% not using sos strategy
% using unit paramodulation 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: 9835
% derived clauses: 1595037
% kept clauses: 424985
% kept size sum: 727176
% kept mid-nuclei: 155233
% kept new demods: 36277
% forw unit-subs: 117297
% forw double-subs: 38598
% forw overdouble-subs: 37374
% backward subs: 703
% fast unit cutoff: 148476
% full unit cutoff: 93
% dbl unit cutoff: 8447
% real runtime : 209.45
% process. runtime: 207.70
% specific non-discr-tree subsumption statistics:
% tried: 7828712
% length fails: 143186
% strength fails: 1185297
% predlist fails: 4506918
% aux str. fails: 201806
% by-lit fails: 210419
% full subs tried: 1458997
% full subs fail: 1413158
%
% ; 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/SWC016-1+eq_r.in")
%
%------------------------------------------------------------------------------