TSTP Solution File: SWC312-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC312-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 : art08.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 189.1s
% Output : Assurance 189.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/SWC312-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,3,402,0,4,54395,4,2239,56314,5,2805,56314,1,2805,56314,50,2807,56314,40,2807,56515,0,2807,150291,3,4211,173857,4,4908,195166,5,5608,195167,5,5610,195168,1,5610,195168,50,5614,195168,40,5614,195369,0,5614,246117,3,6176,259273,4,6440,268434,5,6721,268435,5,6722,268435,1,6722,268435,50,6724,268435,40,6724,268636,0,6725,334676,3,7587,358712,4,8004,372114,5,8426,372115,5,8428,372115,1,8428,372115,50,8431,372115,40,8431,372316,0,8431,450969,3,9282,477050,4,9707,494190,5,10132,494191,5,10134,494192,1,10134,494192,50,10137,494192,40,10137,494393,0,10137,826699,3,14494,925335,4,16663,1011007,5,18838,1011008,1,18838,1011008,50,18841,1011008,40,18841,1011209,0,18841)
%
%
% START OF PROOF
% 1011009 [] equal(X,X).
% 1011017 [] ss^list(nil).
% 1011065 [] segment^p(X,nil) | -ss^list(X).
% 1011066 [] segment^p(X,X) | -ss^list(X).
% 1011088 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 1011089 [] -segment^p(nil,X) | equal(nil,X) | -ss^list(X).
% 1011109 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 1011124 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 1011136 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 1011195 [] ss^list(sk1).
% 1011196 [] ss^list(sk2).
% 1011197 [] ss^list(sk3).
% 1011198 [] ss^list(sk4).
% 1011199 [] equal(sk2,sk4).
% 1011200 [] equal(sk1,sk3).
% 1011201 [] -equal(nil,sk4) | equal(nil,sk3).
% 1011202 [] -neq(sk4,nil) | ss^item(sk5).
% 1011203 [] -neq(sk4,nil) | ss^list(sk6).
% 1011204 [] equal(app(cons(sk5,nil),sk6),sk4) | -neq(sk4,nil).
% 1011205 [] equal(app(sk6,cons(sk5,nil)),sk3) | -neq(sk4,nil).
% 1011206 [] neq(sk2,nil) | equal(nil,sk2).
% 1011207 [] equal(nil,sk2) | -equal(app(cons(Y,nil),X),sk2) | -equal(app(X,cons(Y,nil)),sk1) | -ss^item(Y) | -ss^list(X).
% 1011208 [] -equal(nil,sk1) | neq(sk2,nil).
% 1011223 [input:1011124,factor:cut:1011009] -neq(X,X) | -ss^list(X).
% 1011981 [para:1011199.1.2,1011202.1.1] -neq(sk2,nil) | ss^item(sk5).
% 1011983 [para:1011199.1.2,1011203.1.1] -neq(sk2,nil) | ss^list(sk6).
% 1011995 [binary:1011981,1011208.2] -equal(nil,sk1) | ss^item(sk5).
% 1012000 [binary:1011208.2,1011983] -equal(nil,sk1) | ss^list(sk6).
% 1012027 [binary:1011196,1011065.2] segment^p(sk2,nil).
% 1012062 [binary:1011198,1011066.2] segment^p(sk4,sk4).
% 1012161 [para:1011199.1.2,1012062.1.1] segment^p(sk2,sk4).
% 1012237 [para:1011206.2.2,1012161.1.1] neq(sk2,nil) | segment^p(nil,sk4).
% 1013156 [binary:1011197,1011223.2] -neq(sk3,sk3).
% 1013157 [binary:1011198,1011223.2] -neq(sk4,sk4).
% 1013194 [para:1011200.1.2,1013156.1.2] -neq(sk3,sk1).
% 1013198 [para:1011199.1.2,1013157.1.2] -neq(sk4,sk2).
% 1013272 [binary:1011202,1011109,cut:1011017,cut:1011198] equal(sk4,nil) | ss^item(sk5).
% 1013273 [binary:1011203,1011109,cut:1011017,cut:1011198] equal(sk4,nil) | ss^list(sk6).
% 1013351 [binary:1013194,1011109,cut:1011195,cut:1011197] equal(sk3,sk1).
% 1013352 [binary:1013198,1011109,cut:1011196,cut:1011198] equal(sk4,sk2).
% 1016021 [para:1013272.1.1,1011201.1.2,cut:1011009] equal(nil,sk3) | ss^item(sk5).
% 1016024 [para:1013273.1.1,1011201.1.2,cut:1011009] equal(nil,sk3) | ss^list(sk6).
% 1016396 [para:1011200.1.2,1016021.1.2,binarycut:1011995] ss^item(sk5).
% 1016596 [para:1011200.1.2,1016024.1.2,binarycut:1012000] ss^list(sk6).
% 1018510 [?] ?
% 1022113 [binary:1011089,1012237.2,cut:1011198,binarycut:1018510] neq(sk2,nil).
% 1022608 [binary:1011124,1022113,cut:1011017,cut:1011196] -equal(sk2,nil).
% 1022613 [binary:1011136.3,1022608,cut:1012027,cut:1011196,cut:1011017] -segment^p(nil,sk2).
% 1022617 [binary:1011088.2,1022613,cut:1011196] -equal(nil,sk2).
% 1047662 [para:1011204.1.1,1011207.2.1,cut:1013352,cut:1022617,cut:1016396,cut:1016596] -equal(app(sk6,cons(sk5,nil)),sk1) | -neq(sk4,nil).
% 1047663 [para:1011205.1.1,1047662.1.1,cut:1013351] -neq(sk4,nil).
% 1047664 [para:1011199.1.2,1047663.1.1,cut:1022113] 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: 8691
% derived clauses: 1494745
% kept clauses: 440961
% kept size sum: 658427
% kept mid-nuclei: 150938
% kept new demods: 36352
% forw unit-subs: 113295
% forw double-subs: 39233
% forw overdouble-subs: 36352
% backward subs: 590
% fast unit cutoff: 150765
% full unit cutoff: 95
% dbl unit cutoff: 8800
% real runtime : 198.62
% process. runtime: 197.50
% specific non-discr-tree subsumption statistics:
% tried: 8737751
% length fails: 157680
% strength fails: 1326908
% predlist fails: 5209771
% aux str. fails: 211231
% by-lit fails: 209527
% full subs tried: 1493064
% full subs fail: 1447271
%
% ; 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/SWC312-1+eq_r.in")
%
%------------------------------------------------------------------------------