TSTP Solution File: SWC053-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC053-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 : art09.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 378.4s
% Output : Assurance 378.4s
% 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/SWC053-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(204,40,0,408,0,1,65245,4,2266,75176,5,2802,75178,1,2806,75178,50,2809,75178,40,2809,75382,0,2809,149973,3,4210,159950,4,4911,171638,5,5610,171639,5,5611,171639,1,5611,171639,50,5615,171639,40,5615,171843,0,5615,222688,3,6167,235921,4,6441,246844,5,6716,246844,5,6717,246844,1,6717,246844,50,6720,246844,40,6720,247048,0,6720,314701,3,7571,336598,4,7996,351761,5,8421,351762,5,8423,351762,1,8423,351762,50,8426,351762,40,8426,351966,0,8438,430272,3,9292,456499,4,9715,472974,5,10139,472975,5,10141,472976,1,10141,472976,50,10144,472976,40,10144,473180,0,10144,800943,3,14496,898348,4,16670,973791,5,18845,973792,1,18845,973792,50,18848,973792,40,18848,973996,0,18849,1013331,3,20250,1016068,4,20950,1024500,5,21650,1024501,1,21650,1024501,50,21652,1024501,40,21652,1024705,0,21652,1269609,3,24554,1392364,4,26004,1455017,5,27453,1455018,1,27453,1455018,50,27459,1455018,40,27459,1455222,0,27493,1545639,3,28895,1573997,4,29594,1639325,5,30294,1639326,1,30294,1639326,50,30301,1639326,40,30301,1639530,0,30336,1681777,3,30887,1699464,4,31163,1740141,5,31437,1740142,1,31437,1740142,50,31441,1740142,40,31441,1740346,0,31442,1780454,3,32843,1783093,4,33543,1791879,5,34244,1791880,1,34244,1791880,50,34245,1791880,40,34245,1792084,0,34245,1868262,3,35648,1881571,4,36346,1897123,5,37046,1897124,5,37047,1897124,1,37047,1897124,50,37050,1897124,40,37050,1897328,0,37050)
%
%
% START OF PROOF
% 1897125 [] equal(X,X).
% 1897133 [] ss^list(nil).
% 1897176 [] ss^list(skaf45(X,Y)).
% 1897182 [] segment^p(X,X) | -ss^list(X).
% 1897199 [] equal(app(nil,X),X) | -ss^list(X).
% 1897209 [] -frontseg^p(nil,X) | equal(nil,X) | -ss^list(X).
% 1897240 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 1897257 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1897297 [] segment^p(app(app(X,Y),Z),U) | -segment^p(Y,U) | -ss^list(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 1897311 [] ss^list(sk1).
% 1897312 [] ss^list(sk2).
% 1897315 [] equal(sk2,sk4).
% 1897316 [] equal(sk1,sk3).
% 1897317 [] equal(nil,sk4) | ss^list(sk5).
% 1897318 [] equal(nil,sk3) | ss^list(sk5).
% 1897319 [] neq(sk5,nil) | equal(nil,sk4).
% 1897320 [] frontseg^p(sk4,sk5) | equal(nil,sk4).
% 1897321 [] frontseg^p(sk3,sk5) | equal(nil,sk4).
% 1897322 [] neq(sk5,nil) | equal(nil,sk3).
% 1897323 [] frontseg^p(sk4,sk5) | equal(nil,sk3).
% 1897324 [] frontseg^p(sk3,sk5) | equal(nil,sk3).
% 1897326 [] equal(nil,sk2) | -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 1897327 [] -equal(nil,sk1) | neq(sk2,nil).
% 1897328 [] -equal(nil,sk1) | -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 1897342 [input:1897240,factor:cut:1897125] -neq(X,X) | -ss^list(X).
% 1898096 [para:1897317.1.2,1897315.1.2] equal(sk2,nil) | ss^list(sk5).
% 1898099 [para:1897318.1.2,1897316.1.2] equal(sk1,nil) | ss^list(sk5).
% 1898104 [para:1897315.1.2,1897320.1.1] frontseg^p(sk2,sk5) | equal(nil,sk4).
% 1898107 [para:1897316.1.2,1897321.1.1] frontseg^p(sk1,sk5) | equal(nil,sk4).
% 1898110 [para:1897315.1.2,1897323.1.1] frontseg^p(sk2,sk5) | equal(nil,sk3).
% 1898113 [para:1897316.1.2,1897324.1.1] frontseg^p(sk1,sk5) | equal(nil,sk3).
% 1898118 [para:1898099.1.1,1897327.1.2,cut:1897125] neq(sk2,nil) | ss^list(sk5).
% 1898122 [para:1898096.1.1,1898118.1.1] neq(nil,nil) | ss^list(sk5).
% 1898134 [binary:1898122,1897342,cut:1897133] ss^list(sk5).
% 1898209 [para:1897326.1.2,1898110.1.1] frontseg^p(nil,sk5) | equal(nil,sk3) | -neq(X,nil) | -segment^p(sk1,X) | -segment^p(sk2,X) | -ss^list(X).
% 1898289 [binary:1897209,1898209,cut:1898134] equal(nil,sk5) | equal(nil,sk3) | -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 1898356 [binary:1897322,1897240,cut:1897133,cut:1898134] -equal(sk5,nil) | equal(nil,sk3).
% 1898364 [para:1898289.1.2,1898356.1.1,cut:1897125] equal(nil,sk3) | -neq(X,nil) | -segment^p(sk1,X) | -segment^p(sk2,X) | -ss^list(X).
% 1898369 [para:1898364.1.2,1897316.1.2] equal(sk1,nil) | -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 1898408 [para:1898369.1.1,1897328.1.2,cut:1897125,factor] -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 1900458 [para:1897199.1.1,1897297.1.1.1,cut:1897133,factor:factor:binarycut:1897182] segment^p(app(X,Y),X) | -ss^list(Y) | -ss^list(X).
% 1902185 [para:1897257.1.1,1900458.1.1,cut:1897176] -frontseg^p(X,Y) | segment^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 1903544 [binary:1898104,1902185,cut:1897312,cut:1898134] segment^p(sk2,sk5) | equal(nil,sk4).
% 1903545 [binary:1898107,1902185,cut:1897311,cut:1898134] segment^p(sk1,sk5) | equal(nil,sk4).
% 1903546 [binary:1898110,1902185,cut:1897312,cut:1898134] segment^p(sk2,sk5) | equal(nil,sk3).
% 1903547 [binary:1898113,1902185,cut:1897311,cut:1898134] segment^p(sk1,sk5) | equal(nil,sk3).
% 1923770 [binary:1897319,1898408,cut:1898134,binarycut:1903545,binarycut:1903544] equal(nil,sk4).
% 1923772 [binary:1897322,1898408,cut:1898134,binarycut:1903547,binarycut:1903546] equal(nil,sk3).
% 1923775 [para:1923770.1.2,1897315.1.2] equal(sk2,nil).
% 1924028 [para:1923772.1.2,1897316.1.2] equal(sk1,nil).
% 1924161 [para:1924028.1.1,1897327.1.2,cut:1897125] neq(sk2,nil).
% 1924305 [binary:1897240,1924161,cut:1923775,cut:1897133,cut:1897312] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using weight-order strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 28287
% derived clauses: 2918207
% kept clauses: 794878
% kept size sum: 545960
% kept mid-nuclei: 301582
% kept new demods: 57809
% forw unit-subs: 226766
% forw double-subs: 79801
% forw overdouble-subs: 65058
% backward subs: 1886
% fast unit cutoff: 240835
% full unit cutoff: 92
% dbl unit cutoff: 12437
% real runtime : 380.52
% process. runtime: 378.47
% specific non-discr-tree subsumption statistics:
% tried: 10748901
% length fails: 386973
% strength fails: 2180750
% predlist fails: 4866768
% aux str. fails: 220015
% by-lit fails: 383532
% full subs tried: 2526838
% full subs fail: 2442721
%
% ; 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/SWC053-1+eq_r.in")
%
%------------------------------------------------------------------------------