TSTP Solution File: SWC346-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC346-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 : art04.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 79.6s
% Output : Assurance 79.6s
% 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/SWC346-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(207,40,1,414,0,1,80538,4,2332,103487,5,2802,103488,1,2803,103488,50,2808,103488,40,2808,103695,0,2808,196528,3,4211,220871,4,4913,237781,5,5609,237783,1,5610,237783,50,5613,237783,40,5613,237990,0,5614,274795,3,6165,286483,4,6440,302416,5,6715,302417,5,6715,302417,1,6715,302417,50,6717,302417,40,6717,302624,0,6717,351427,3,7569,369587,4,7994)
%
%
% START OF PROOF
% 302421 [] strictordered^p(nil).
% 302426 [] ss^list(nil).
% 302429 [] -singleton^p(nil).
% 302474 [] segment^p(X,nil) | -ss^list(X).
% 302475 [] segment^p(X,X) | -ss^list(X).
% 302484 [] strictordered^p(cons(X,nil)) | -ss^item(X).
% 302497 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 302516 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 302534 [] -equal(cons(X,nil),Y) | -ss^item(X) | -ss^list(Y) | singleton^p(Y).
% 302545 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 302591 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 302604 [] ss^list(sk1).
% 302605 [] ss^list(sk2).
% 302606 [] ss^list(sk3).
% 302607 [] ss^list(sk4).
% 302608 [] equal(sk2,sk4).
% 302609 [] equal(sk1,sk3).
% 302611 [] equal(nil,sk3) | ss^item(sk5).
% 302612 [] equal(nil,sk4) | ss^list(sk6).
% 302613 [] equal(nil,sk4) | ss^list(sk7).
% 302614 [] equal(cons(sk5,nil),sk3) | equal(nil,sk4).
% 302618 [] equal(nil,sk3) | ss^list(sk6).
% 302619 [] equal(nil,sk3) | ss^list(sk7).
% 302620 [] equal(cons(sk5,nil),sk3) | equal(nil,sk3).
% 302621 [] equal(app(app(sk6,sk3),sk7),sk4) | equal(nil,sk3).
% 302624 [] -segment^p(sk2,sk1) | -strictordered^p(sk1).
% 302956 [para:302611.1.2,302609.1.2] equal(sk1,nil) | ss^item(sk5).
% 302959 [para:302612.1.2,302608.1.2] equal(sk2,nil) | ss^list(sk6).
% 302962 [para:302613.1.2,302608.1.2] equal(sk2,nil) | ss^list(sk7).
% 302965 [para:302614.2.2,302608.1.2] equal(cons(sk5,nil),sk3) | equal(sk2,nil).
% 302968 [para:302618.1.2,302609.1.2] equal(sk1,nil) | ss^list(sk6).
% 302999 [para:302619.1.2,302609.1.2] equal(sk1,nil) | ss^list(sk7).
% 303011 [para:302609.1.2,302621.1.1.1.2] equal(app(app(sk6,sk1),sk7),sk4) | equal(nil,sk3).
% 303096 [binary:302605,302474.2] segment^p(sk2,nil).
% 303097 [binary:302606,302474.2] segment^p(sk3,nil).
% 303135 [binary:302607,302475.2] segment^p(sk4,sk4).
% 303214 [para:302608.1.2,303135.1.1] segment^p(sk2,sk4).
% 303215 [para:302608.1.2,303135.1.2] segment^p(sk4,sk2).
% 303260 [?] ?
% 303261 [?] ?
% 303526 [para:302956.1.1,302624.1.2,cut:303096] -strictordered^p(sk1) | ss^item(sk5).
% 303591 [para:302956.1.1,303526.1.1,cut:302421] ss^item(sk5).
% 303599 [binary:302484.2,303591] strictordered^p(cons(sk5,nil)).
% 304590 [para:302620.1.1,303599.1.1] equal(nil,sk3) | strictordered^p(sk3).
% 307979 [para:302959.1.1,302624.1.1,binarycut:303260] -strictordered^p(sk1) | ss^list(sk6).
% 308659 [binary:303214,302545,cut:303215,cut:302607,cut:302605] equal(sk4,sk2).
% 311396 [para:302962.1.1,302624.1.1,binarycut:303261] -strictordered^p(sk1) | ss^list(sk7).
% 312427 [para:302968.1.1,307979.1.1,cut:302421] ss^list(sk6).
% 315397 [para:302999.1.1,311396.1.1,cut:302421] ss^list(sk7).
% 320366 [para:302965.1.1,302484.1.1,cut:303591] equal(sk2,nil) | strictordered^p(sk3).
% 320384 [binary:302534,302965,cut:303591,cut:302606] equal(sk2,nil) | singleton^p(sk3).
% 321144 [para:304590.1.2,302609.1.2] equal(sk1,nil) | strictordered^p(sk3).
% 321148 [?] ?
% 321326 [?] ?
% 321869 [para:320366.1.1,302624.1.1,binarycut:321148] -strictordered^p(sk1) | strictordered^p(sk3).
% 321987 [para:320384.1.1,302624.1.1,binarycut:321326] -strictordered^p(sk1) | singleton^p(sk3).
% 322801 [para:303011.1.1,302591.1.1,cut:302604,cut:315397,cut:312427] equal(nil,sk3) | -equal(sk4,X) | segment^p(X,sk1) | -ss^list(X).
% 323811 [para:321144.1.1,321869.1.1,cut:302421] strictordered^p(sk3).
% 323812 [para:302609.1.2,323811.1.1] strictordered^p(sk1).
% 323825 [binary:302624.2,323812] -segment^p(sk2,sk1).
% 323831 [binary:321987,323812] singleton^p(sk3).
% 323848 [para:302620.2.2,323831.1.1,cut:302429] equal(cons(sk5,nil),sk3).
% 324262 [para:323848.1.1,302516.1.1,cut:303591,cut:302426] -equal(sk3,nil).
% 324316 [binary:302545.3,324262,cut:303097,cut:302606,cut:302426] -segment^p(nil,sk3).
% 324372 [binary:302497.2,324316,cut:302606] -equal(nil,sk3).
% 381558 [binary:308659,322801.2,cut:324372,cut:323825,cut:302605] 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
% seconds given: 17
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4138
% derived clauses: 605959
% kept clauses: 256178
% kept size sum: 0
% kept mid-nuclei: 63240
% kept new demods: 27095
% forw unit-subs: 69379
% forw double-subs: 34101
% forw overdouble-subs: 11695
% backward subs: 1100
% fast unit cutoff: 47251
% full unit cutoff: 0
% dbl unit cutoff: 958
% real runtime : 84.15
% process. runtime: 83.68
% specific non-discr-tree subsumption statistics:
% tried: 2689038
% length fails: 40182
% strength fails: 269956
% predlist fails: 1779962
% aux str. fails: 91865
% by-lit fails: 88193
% full subs tried: 353498
% full subs fail: 340919
%
% ; 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/SWC346-1+eq_r.in")
%
%------------------------------------------------------------------------------