TSTP Solution File: SWC320-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC320-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 : art01.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 190.1s
% Output : Assurance 190.1s
% 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/SWC320-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(201,40,1,402,0,1,54395,4,2236,56310,5,2803,56311,1,2803,56311,50,2805,56311,40,2805,56512,0,2805,149370,3,4208,172692,4,4910,193595,5,5606,193596,5,5608,193597,1,5608,193597,50,5612,193597,40,5612,193798,0,5612,245686,3,6163,258018,4,6439,267341,5,6719,267342,5,6720,267342,1,6720,267342,50,6723,267342,40,6723,267543,0,6723,333583,3,7590,356707,4,8000,370083,5,8424,370084,5,8426,370084,1,8426,370084,50,8429,370084,40,8429,370285,0,8429,448936,3,9283,475017,4,9708,492274,5,10130,492275,5,10132,492276,1,10132,492276,50,10135,492276,40,10135,492477,0,10135,829572,3,14487,927747,4,16662,1016057,5,18837,1016057,1,18837,1016057,50,18840,1016057,40,18840,1016258,0,18841)
%
%
% START OF PROOF
% 1016058 [] equal(X,X).
% 1016066 [] ss^list(nil).
% 1016114 [] segment^p(X,nil) | -ss^list(X).
% 1016115 [] segment^p(X,X) | -ss^list(X).
% 1016129 [] -member^p(nil,X) | -ss^item(X).
% 1016137 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 1016138 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 1016158 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 1016173 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 1016185 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 1016233 [] -equal(app(X,cons(Y,Z)),U) | member^p(U,Y) | -ss^item(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 1016244 [] ss^list(sk1).
% 1016245 [] ss^list(sk2).
% 1016246 [] ss^list(sk3).
% 1016247 [] ss^list(sk4).
% 1016248 [] equal(sk2,sk4).
% 1016249 [] equal(sk1,sk3).
% 1016250 [] -equal(nil,sk4) | equal(nil,sk3).
% 1016251 [] -neq(sk4,nil) | ss^item(sk5).
% 1016252 [] -neq(sk4,nil) | ss^list(sk6).
% 1016253 [] equal(app(cons(sk5,nil),sk6),sk3) | -neq(sk4,nil).
% 1016254 [] equal(app(sk6,cons(sk5,nil)),sk4) | -neq(sk4,nil).
% 1016255 [] neq(sk2,nil) | equal(nil,sk2).
% 1016256 [] equal(nil,sk2) | -equal(app(cons(Y,nil),X),sk1) | -equal(app(X,cons(Y,nil)),sk2) | -ss^item(Y) | -ss^list(X).
% 1016257 [] -equal(nil,sk1) | neq(sk2,nil).
% 1016272 [input:1016173,factor:cut:1016058] -neq(X,X) | -ss^list(X).
% 1016371 [input:1016233,factor] -equal(app(X,cons(Y,Z)),Z) | member^p(Z,Y) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 1017030 [para:1016248.1.2,1016251.1.1] -neq(sk2,nil) | ss^item(sk5).
% 1017032 [para:1016248.1.2,1016252.1.1] -neq(sk2,nil) | ss^list(sk6).
% 1017044 [binary:1017030,1016257.2] -equal(nil,sk1) | ss^item(sk5).
% 1017049 [binary:1016257.2,1017032] -equal(nil,sk1) | ss^list(sk6).
% 1017076 [binary:1016245,1016114.2] segment^p(sk2,nil).
% 1017111 [binary:1016247,1016115.2] segment^p(sk4,sk4).
% 1017210 [para:1016248.1.2,1017111.1.1] segment^p(sk2,sk4).
% 1017286 [para:1016255.2.2,1017210.1.1] neq(sk2,nil) | segment^p(nil,sk4).
% 1018205 [binary:1016246,1016272.2] -neq(sk3,sk3).
% 1018206 [binary:1016247,1016272.2] -neq(sk4,sk4).
% 1018243 [para:1016249.1.2,1018205.1.2] -neq(sk3,sk1).
% 1018247 [para:1016248.1.2,1018206.1.2] -neq(sk4,sk2).
% 1018321 [binary:1016251,1016158,cut:1016066,cut:1016247] equal(sk4,nil) | ss^item(sk5).
% 1018322 [binary:1016252,1016158,cut:1016066,cut:1016247] equal(sk4,nil) | ss^list(sk6).
% 1018400 [binary:1018243,1016158,cut:1016244,cut:1016246] equal(sk3,sk1).
% 1018401 [binary:1018247,1016158,cut:1016245,cut:1016247] equal(sk4,sk2).
% 1021070 [para:1018321.1.1,1016250.1.2,cut:1016058] equal(nil,sk3) | ss^item(sk5).
% 1021073 [para:1018322.1.1,1016250.1.2,cut:1016058] equal(nil,sk3) | ss^list(sk6).
% 1021445 [para:1016249.1.2,1021070.1.2,binarycut:1017044] ss^item(sk5).
% 1021449 [binary:1016129.2,1021445] -member^p(nil,sk5).
% 1021645 [para:1016249.1.2,1021073.1.2,binarycut:1017049] ss^list(sk6).
% 1023559 [?] ?
% 1027162 [binary:1016138,1017286.2,cut:1016247,binarycut:1023559] neq(sk2,nil).
% 1027657 [binary:1016173,1027162,cut:1016066,cut:1016245] -equal(sk2,nil).
% 1027662 [binary:1016185.3,1027657,cut:1017076,cut:1016245,cut:1016066] -segment^p(nil,sk2).
% 1027666 [binary:1016137.2,1027662,cut:1016245] -equal(nil,sk2).
% 1032936 [para:1016254.1.1,1016371.1.1,cut:1021449,cut:1021445,cut:1016066,cut:1021645] -neq(sk4,nil) | -equal(sk4,nil).
% 1041439 [para:1016248.1.2,1032936.1.1,cut:1027162] -equal(sk4,nil).
% 1041446 [binary:1016158.2,1041439,cut:1016066,cut:1016247] neq(sk4,nil).
% 1051824 [para:1016253.1.1,1016256.2.1,cut:1041446,cut:1018400,cut:1027666,cut:1021445,cut:1021645] -equal(app(sk6,cons(sk5,nil)),sk2).
% 1051825 [para:1016254.1.1,1051824.1.1,cut:1018401,cut:1041446] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-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
% clause length limited to 19
% clause depth limited to 5
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 8779
% derived clauses: 1513508
% kept clauses: 440280
% kept size sum: 645835
% kept mid-nuclei: 151304
% kept new demods: 36352
% forw unit-subs: 115873
% forw double-subs: 47212
% forw overdouble-subs: 36096
% backward subs: 462
% fast unit cutoff: 155540
% full unit cutoff: 95
% dbl unit cutoff: 8767
% real runtime : 197.87
% process. runtime: 197.79
% specific non-discr-tree subsumption statistics:
% tried: 8743900
% length fails: 158079
% strength fails: 1330529
% predlist fails: 5205932
% aux str. fails: 212648
% by-lit fails: 209482
% full subs tried: 1497821
% full subs fail: 1452354
%
% ; 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/SWC320-1+eq_r.in")
%
%------------------------------------------------------------------------------