%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC039-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 : art05.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 30.0s
% Output : Assurance 30.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/SWC039-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(208,40,1,416,0,1,62613,4,2272,76177,5,2802,76178,1,2804,76178,50,2807,76178,40,2807,76386,0,2807)
%
%
% START OF PROOF
% 76187 [] ss^list(nil).
% 76235 [] segment^p(X,nil) | -ss^list(X).
% 76236 [] segment^p(X,X) | -ss^list(X).
% 76258 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 76259 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 76277 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 76306 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 76352 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 76365 [] ss^list(sk1).
% 76367 [] ss^list(sk3).
% 76368 [] ss^list(sk4).
% 76369 [] equal(nil,sk2).
% 76370 [] equal(sk2,sk4).
% 76371 [] equal(sk1,sk3).
% 76372 [] -equal(nil,sk1).
% 76374 [] equal(nil,sk3) | ss^item(sk5).
% 76381 [] equal(nil,sk3) | ss^list(sk6).
% 76382 [] equal(nil,sk3) | ss^list(sk7).
% 76383 [] equal(cons(sk5,nil),sk3) | equal(nil,sk3).
% 76384 [] equal(app(app(sk6,sk3),sk7),sk4) | equal(nil,sk3).
% 76718 [para:76371.1.2,76374.1.2,cut:76372] ss^item(sk5).
% 76741 [para:76371.1.2,76381.1.2,cut:76372] ss^list(sk6).
% 76759 [para:76371.1.2,76382.1.2,cut:76372] ss^list(sk7).
% 76766 [para:76371.1.2,76383.2.2,cut:76372] equal(cons(sk5,nil),sk3).
% 76843 [binary:76367,76235.2] segment^p(sk3,nil).
% 76879 [binary:76368,76236.2] segment^p(sk4,sk4).
% 76947 [para:76370.1.2,76879.1.1] segment^p(sk2,sk4).
% 77052 [para:76369.1.2,76947.1.1] segment^p(nil,sk4).
% 77397 [binary:76365,76259.3,cut:76372] -segment^p(nil,sk1).
% 77399 [binary:76368,76259.3,cut:77052] equal(nil,sk4).
% 78535 [para:76766.1.1,76277.1.1,cut:76718,cut:76187] -equal(sk3,nil).
% 80668 [binary:76843,76306.2,cut:78535,cut:76367,cut:76187] -segment^p(nil,sk3).
% 80692 [binary:76258.2,80668,cut:76367] -equal(nil,sk3).
% 95137 [para:76371.1.2,76384.1.1.1.2,cut:80692] equal(app(app(sk6,sk1),sk7),sk4).
% 95161 [binary:76352,95137,cut:76368,cut:76365,cut:76759,cut:76741] segment^p(sk4,sk1).
% 95183 [para:77399.1.2,95161.1.1,cut:77397] 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
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1018
% derived clauses: 126577
% kept clauses: 72103
% kept size sum: 0
% kept mid-nuclei: 16085
% kept new demods: 30161
% forw unit-subs: 14198
% forw double-subs: 9877
% forw overdouble-subs: 1364
% backward subs: 81
% fast unit cutoff: 4328
% full unit cutoff: 0
% dbl unit cutoff: 116
% real runtime : 30.41
% process. runtime: 30.40
% specific non-discr-tree subsumption statistics:
% tried: 355077
% length fails: 12716
% strength fails: 14666
% predlist fails: 232261
% aux str. fails: 24057
% by-lit fails: 1880
% full subs tried: 54479
% full subs fail: 52910
%
% ; 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/SWC039-1+eq_r.in")
%
%------------------------------------------------------------------------------