%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC059-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 59.5s
% Output : Assurance 59.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/SWC059-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,3,398,0,3,55182,4,2227,57106,5,2805,57107,1,2807,57107,50,2810,57107,40,2810,57306,0,2810,152847,3,4212,178758,4,4912,198048,5,5611,198049,5,5613,198050,1,5613,198050,50,5617,198050,40,5617,198249,0,5617,240988,3,6168,251321,4,6444)
%
%
% START OF PROOF
% 198051 [] equal(X,X).
% 198059 [] ss^list(nil).
% 198108 [] segment^p(X,X) | -ss^list(X).
% 198166 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 198237 [] ss^list(sk1).
% 198241 [] equal(sk2,sk4).
% 198242 [] equal(sk1,sk3).
% 198243 [] -equal(nil,sk4) | equal(nil,sk3).
% 198244 [] -neq(sk4,nil) | neq(sk3,nil).
% 198245 [] -neq(sk4,nil) | segment^p(sk4,sk3).
% 198246 [] neq(sk2,nil) | equal(nil,sk2).
% 198247 [] equal(nil,sk2) | -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 198248 [] -equal(nil,sk1) | neq(sk2,nil).
% 198263 [input:198166,factor:cut:198051] -neq(X,X) | -ss^list(X).
% 199017 [para:198241.1.2,198243.1.2] -equal(nil,sk2) | equal(nil,sk3).
% 199021 [para:198241.1.2,198244.1.1] -neq(sk2,nil) | neq(sk3,nil).
% 199025 [para:198241.1.2,198245.1.1] -neq(sk2,nil) | segment^p(sk4,sk3).
% 199031 [binary:198237,198247.5] -neq(sk1,nil) | -segment^p(sk1,sk1) | -segment^p(sk2,sk1) | equal(nil,sk2).
% 199073 [para:198242.1.2,199017.2.2] -equal(nil,sk2) | equal(nil,sk1).
% 199133 [binary:198237,198108.2] segment^p(sk1,sk1).
% 200685 [binary:198059,198263.2] -neq(nil,nil).
% 232662 [para:198246.2.2,199073.1.2,cut:198051,binarycut:198248] neq(sk2,nil).
% 232724 [binary:199021,232662] neq(sk3,nil).
% 232725 [binary:199025,232662] segment^p(sk4,sk3).
% 232743 [para:198242.1.2,232724.1.1] neq(sk1,nil).
% 232745 [para:199017.2.2,232724.1.1,cut:200685] -equal(nil,sk2).
% 232950 [para:198241.1.2,232725.1.1] segment^p(sk2,sk3).
% 233356 [para:198242.1.2,232950.1.2] segment^p(sk2,sk1).
% 256858 [binary:232743,199031,cut:199133,cut:233356,cut:232745] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double 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: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2723
% derived clauses: 375832
% kept clauses: 169806
% kept size sum: 835426
% kept mid-nuclei: 39702
% kept new demods: 33957
% forw unit-subs: 26755
% forw double-subs: 8680
% forw overdouble-subs: 5978
% backward subs: 54
% fast unit cutoff: 28836
% full unit cutoff: 0
% dbl unit cutoff: 663
% real runtime : 65.48
% process. runtime: 64.92
% specific non-discr-tree subsumption statistics:
% tried: 1596637
% length fails: 22756
% strength fails: 142547
% predlist fails: 1102420
% aux str. fails: 42479
% by-lit fails: 36220
% full subs tried: 210106
% full subs fail: 203305
%
% ; 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/SWC059-1+eq_r.in")
%
%------------------------------------------------------------------------------