%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC004-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 70.1s
% Output : Assurance 70.1s
% 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/SWC004-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(206,40,3,412,0,3,56802,4,2234,58744,5,2805,58745,1,2807,58745,50,2810,58745,40,2810,58951,0,2810,142854,3,4212,181024,4,4914,205679,5,5611,205679,5,5613,205680,1,5613,205680,50,5617,205680,40,5617,205886,0,5617,248910,3,6186,261449,4,6446,274953,5,6718,274954,5,6719,274955,1,6719,274955,50,6721,274955,40,6721,275161,0,6721)
%
%
% START OF PROOF
% 274964 [] ss^list(nil).
% 275013 [] segment^p(X,X) | -ss^list(X).
% 275042 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 275054 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 275056 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 275071 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 275083 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 275142 [] ss^list(sk1).
% 275143 [] ss^list(sk2).
% 275144 [] ss^list(sk3).
% 275145 [] ss^list(sk4).
% 275146 [] equal(sk2,sk4).
% 275147 [] equal(sk1,sk3).
% 275148 [] neq(sk2,nil).
% 275156 [] -neq(sk4,nil) | -equal(app(app(X,Y),Z),sk2) | -equal(app(X,Z),sk1) | -neq(Y,nil) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 275157 [] -neq(sk4,nil) | ss^item(sk5).
% 275158 [] -neq(sk4,nil) | ss^list(sk6).
% 275159 [] -neq(sk4,nil) | ss^list(sk7).
% 275160 [] equal(app(app(sk6,cons(sk5,nil)),sk7),sk4) | -neq(sk4,nil).
% 275161 [] equal(app(sk6,sk7),sk3) | -neq(sk4,nil).
% 275511 [para:275146.1.2,275156.1.1,cut:275148] -equal(app(app(X,Y),Z),sk2) | -equal(app(X,Z),sk1) | -neq(Y,nil) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 275543 [para:275146.1.2,275157.1.1,cut:275148] ss^item(sk5).
% 275545 [para:275146.1.2,275158.1.1,cut:275148] ss^list(sk6).
% 275547 [para:275146.1.2,275159.1.1,cut:275148] ss^list(sk7).
% 275549 [para:275146.1.2,275160.2.1,cut:275148] equal(app(app(sk6,cons(sk5,nil)),sk7),sk4).
% 275551 [para:275146.1.2,275161.2.1,cut:275148] equal(app(sk6,sk7),sk3).
% 275613 [binary:275145,275013.2] segment^p(sk4,sk4).
% 275684 [para:275146.1.2,275613.1.1] segment^p(sk2,sk4).
% 275685 [para:275146.1.2,275613.1.2] segment^p(sk4,sk2).
% 276880 [binary:275543,275042.2] ss^list(cons(sk5,X)) | -ss^list(X).
% 277505 [binary:275543,275054.2] -equal(cons(sk5,X),nil) | -ss^list(X).
% 278734 [binary:275551,275071.2,demod:275551,cut:275144] -neq(sk3,sk3).
% 278752 [para:275147.1.2,278734.1.2] -neq(sk3,sk1).
% 278816 [binary:275056,278752,cut:275142,cut:275144] equal(sk3,sk1).
% 280396 [binary:275684,275083,cut:275685,cut:275145,cut:275143] equal(sk4,sk2).
% 311074 [para:275549.1.1,275511.1.1,demod:275551,cut:280396,cut:278816,cut:275547,cut:275545,binarydemod:276880,cut:274964] -neq(cons(sk5,nil),nil).
% 311667 [binary:275056,311074,cut:274964,binarydemod:276880,277505,cut:274964] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 17
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 3874
% derived clauses: 452347
% kept clauses: 207230
% kept size sum: 0
% kept mid-nuclei: 53096
% kept new demods: 34485
% forw unit-subs: 44163
% forw double-subs: 11515
% forw overdouble-subs: 9889
% backward subs: 147
% fast unit cutoff: 45971
% full unit cutoff: 0
% dbl unit cutoff: 799
% real runtime : 71.91
% process. runtime: 71.88
% specific non-discr-tree subsumption statistics:
% tried: 2762314
% length fails: 35369
% strength fails: 245439
% predlist fails: 1951773
% aux str. fails: 85816
% by-lit fails: 61808
% full subs tried: 319681
% full subs fail: 308856
%
% ; 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/SWC004-1+eq_r.in")
%
%------------------------------------------------------------------------------