%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC068-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 : art07.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/SWC068-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(195,40,1,390,0,1,54220,4,2196,56121,63,2803,56121,1,2803,56121,50,2805,56121,40,2805,56316,0,2805)
%
%
% START OF PROOF
% 56122 [] equal(X,X).
% 56130 [] ss^list(nil).
% 56179 [] segment^p(X,X) | -ss^list(X).
% 56196 [] equal(app(nil,X),X) | -ss^list(X).
% 56204 [] -rearseg^p(nil,X) | equal(nil,X) | -ss^list(X).
% 56222 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 56265 [] -equal(app(X,Y),Z) | rearseg^p(Z,Y) | -ss^list(Z) | -ss^list(Y) | -ss^list(X).
% 56294 [] segment^p(app(app(X,Y),Z),U) | -segment^p(Y,U) | -ss^list(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 56308 [] ss^list(sk1).
% 56309 [] ss^list(sk2).
% 56311 [] ss^list(sk4).
% 56312 [] equal(app(sk4,sk4),sk3).
% 56313 [] equal(sk2,sk4).
% 56314 [] equal(sk1,sk3).
% 56315 [] -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 56316 [] -equal(nil,sk2) | -equal(nil,sk1).
% 56357 [input:56265,factor:factor] -equal(app(X,Y),X) | rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 56408 [input:56294,factor:factor:factor:factor:factor:factor:binarycut:56179] segment^p(app(app(X,Y),Y),Y) | -ss^list(Y) | -ss^list(X).
% 57083 [para:56313.1.2,56312.1.1.1] equal(app(sk2,sk4),sk3).
% 57098 [para:56313.1.2,57083.1.1.2] equal(app(sk2,sk2),sk3).
% 57174 [binary:56309,56179.2] segment^p(sk2,sk2).
% 57176 [binary:56311,56179.2] segment^p(sk4,sk4).
% 57271 [para:56313.1.2,57176.1.1] segment^p(sk2,sk4).
% 57343 [binary:56315.2,57271,cut:56311] -neq(sk4,nil) | -segment^p(sk1,sk4).
% 57516 [para:56313.1.2,57343.2.2] -neq(sk4,nil) | -segment^p(sk1,sk2).
% 57602 [binary:56308,56196.2] equal(app(nil,sk1),sk1).
% 57603 [binary:56309,56196.2] equal(app(nil,sk2),sk2).
% 57605 [binary:56311,56196.2] equal(app(nil,sk4),sk4).
% 106124 [para:57603.1.1,56408.1.1.1,demod:57098,cut:56309,cut:56130] segment^p(sk3,sk2).
% 106381 [para:56314.1.2,106124.1.1] segment^p(sk1,sk2).
% 106545 [binary:56315.3,106381,cut:57174,cut:56309] -neq(sk2,nil).
% 106550 [binary:57516.2,106381] -neq(sk4,nil).
% 106580 [binary:56222,106545,cut:56130,cut:56309] equal(sk2,nil).
% 106599 [binary:56222,106550,cut:56130,cut:56311] equal(sk4,nil).
% 107098 [para:106580.1.1,56316.1.2,cut:56122] -equal(nil,sk1).
% 107099 [para:106580.1.1,57083.1.1.1,demod:57605] equal(sk4,sk3).
% 107124 [binary:56204.2,107098,cut:56308] -rearseg^p(nil,sk1).
% 107220 [para:107099.1.1,106599.1.1] equal(sk3,nil).
% 108875 [binary:56357.2,107124,demod:57602,cut:56130,cut:56308] -equal(sk1,nil).
% 110074 [para:107220.1.1,56314.1.2,cut:108875] 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: 1143
% derived clauses: 150072
% kept clauses: 87933
% kept size sum: 0
% kept mid-nuclei: 14859
% kept new demods: 33040
% forw unit-subs: 7062
% forw double-subs: 2904
% forw overdouble-subs: 1204
% backward subs: 23
% fast unit cutoff: 4355
% full unit cutoff: 0
% dbl unit cutoff: 176
% real runtime : 35.44
% process. runtime: 35.40
% specific non-discr-tree subsumption statistics:
% tried: 472346
% length fails: 6945
% strength fails: 34126
% predlist fails: 334442
% aux str. fails: 13964
% by-lit fails: 3510
% full subs tried: 61190
% full subs fail: 59675
%
% ; 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/SWC068-1+eq_r.in")
%
%------------------------------------------------------------------------------