%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC060-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 : art02.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 20.0s
% Output : Assurance 20.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/SWC060-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(200,40,0,400,0,1,57297,4,2300,60657,5,2803,60658,1,2805,60658,50,2808,60658,40,2808,60858,0,2808)
%
%
% START OF PROOF
% 403 [?] ?
% 587 [?] ?
% 60667 [] ss^list(nil).
% 60716 [] segment^p(X,X) | -ss^list(X).
% 60739 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 60847 [] ss^list(sk3).
% 60848 [] ss^list(sk4).
% 60849 [] equal(sk2,sk4).
% 60850 [] equal(sk1,sk3).
% 60852 [] equal(nil,sk2) | -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 60853 [] -equal(nil,sk1) | neq(sk2,nil).
% 60854 [] -equal(nil,sk1) | -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 60855 [] neq(sk3,nil) | equal(nil,sk4).
% 60856 [] segment^p(sk4,sk3) | equal(nil,sk4).
% 60858 [] segment^p(sk4,sk3) | equal(nil,sk3).
% 61640 [binary:60667,60854.5,cut:403,cut:587] -neq(nil,nil) | -equal(nil,sk1).
% 61650 [para:60849.1.2,60855.2.2] neq(sk3,nil) | equal(nil,sk2).
% 61657 [para:60849.1.2,60856.1.1] segment^p(sk2,sk3) | equal(nil,sk4).
% 61738 [binary:60847,60716.2] segment^p(sk3,sk3).
% 61739 [binary:60848,60716.2] segment^p(sk4,sk4).
% 61838 [para:60850.1.2,61738.1.1] segment^p(sk1,sk3).
% 61842 [para:60849.1.2,61739.1.1] segment^p(sk2,sk4).
% 61944 [binary:60852.4,61838,cut:60847,binarycut:61650] -segment^p(sk2,sk3) | equal(nil,sk2).
% 62320 [binary:60847,60739.3] -segment^p(nil,sk3) | equal(nil,sk3).
% 62904 [para:60849.1.2,61657.2.2,binarycut:61944] equal(nil,sk2).
% 62913 [para:62904.1.2,60853.2.1,binarycut:61640] -equal(nil,sk1).
% 62915 [para:62904.1.2,61842.1.1] segment^p(nil,sk4).
% 62962 [binary:60739,62915,cut:60848] equal(nil,sk4).
% 63053 [para:62962.1.2,60858.1.1,binarycut:62320] equal(nil,sk3).
% 63055 [para:60850.1.2,63053.1.2,cut:62913] 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: 329
% derived clauses: 91186
% kept clauses: 46372
% kept size sum: 651535
% kept mid-nuclei: 15436
% kept new demods: 32383
% forw unit-subs: 4107
% forw double-subs: 4262
% forw overdouble-subs: 450
% backward subs: 27
% fast unit cutoff: 1423
% full unit cutoff: 0
% dbl unit cutoff: 146
% real runtime : 28.31
% process. runtime: 28.30
% specific non-discr-tree subsumption statistics:
% tried: 46910
% length fails: 242
% strength fails: 16243
% predlist fails: 6373
% aux str. fails: 2156
% by-lit fails: 934
% full subs tried: 20038
% full subs fail: 19284
%
% ; 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/SWC060-1+eq_r.in")
%
%------------------------------------------------------------------------------