TSTP Solution File: SWC002-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC002-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 : art03.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 257.9s
% Output : Assurance 257.9s
% 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/SWC002-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(214,40,0,428,0,1,63066,4,2314,64919,5,2803,64920,1,2805,64920,50,2808,64920,40,2808,65134,0,2808,146094,3,4210,172756,4,4910,194016,5,5609,194017,5,5611,194018,1,5611,194018,50,5614,194018,40,5614,194232,0,5614,234175,3,6165,250741,4,6440,264626,5,6715,264626,5,6716,264626,1,6716,264626,50,6718,264626,40,6718,264840,0,6718,322382,3,7570,338206,4,7994,351633,5,8419,351635,5,8420,351636,1,8420,351636,50,8423,351636,40,8423,351850,0,8423,427475,3,9277,450338,4,9699,469299,5,10124,469300,5,10126,469301,1,10126,469301,50,10129,469301,40,10129,469515,0,10129,787072,3,14480,861188,4,16658,970003,5,18830,970004,1,18830,970004,50,18833,970004,40,18833,970218,0,18833,1010584,3,20234,1012070,4,20934,1015584,5,21634,1015585,1,21634,1015585,50,21635,1015585,40,21635,1015799,0,21635,1292117,3,24536,1352769,4,25986)
%
%
% START OF PROOF
% 1015643 [] segment^p(X,X) | -ss^list(X).
% 1015713 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 1015772 [] ss^list(sk1).
% 1015773 [] ss^list(sk2).
% 1015774 [] ss^list(sk3).
% 1015775 [] ss^list(sk4).
% 1015776 [] equal(sk2,sk4).
% 1015777 [] equal(sk1,sk3).
% 1015778 [] neq(sk2,nil).
% 1015790 [] -neq(sk4,nil) | -equal(app(app(X,cons(Y,nil)),Z),sk2) | -equal(app(X,Z),sk1) | ss^item(sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(X) | -ss^list(Z).
% 1015791 [] -neq(sk4,nil) | -equal(app(app(X,cons(Y,nil)),Z),sk2) | member^p(sk2,sk5(Z,X,Y)) | -equal(app(X,Z),sk1) | -ss^item(Y) | -ss^list(X) | -ss^list(Z).
% 1015792 [] -neq(sk4,nil) | -equal(app(app(X,cons(Y,nil)),Z),sk2) | geq(sk5(Z,X,Y),Y) | -equal(app(X,Z),sk1) | -ss^item(Y) | -ss^list(X) | -ss^list(Z).
% 1015793 [] -neq(sk4,nil) | -equal(app(app(X,cons(Y,nil)),Z),sk2) | -equal(Y,sk5(Z,X,Y)) | -equal(app(X,Z),sk1) | -ss^item(Y) | -ss^list(X) | -ss^list(Z).
% 1015794 [] -neq(sk4,nil) | ss^item(sk6).
% 1015795 [] -neq(sk4,nil) | ss^list(sk7).
% 1015796 [] -neq(sk4,nil) | ss^list(sk8).
% 1015797 [] equal(app(app(sk7,cons(sk6,nil)),sk8),sk4) | -neq(sk4,nil).
% 1015798 [] equal(app(sk7,sk8),sk3) | -neq(sk4,nil).
% 1015799 [] -neq(sk4,nil) | -member^p(sk4,X) | -geq(X,sk6) | equal(sk6,X) | -ss^item(X).
% 1015810 [para:1015776.1.2,1015794.1.1,cut:1015778] ss^item(sk6).
% 1015812 [para:1015776.1.2,1015795.1.1,cut:1015778] ss^list(sk7).
% 1015814 [para:1015776.1.2,1015796.1.1,cut:1015778] ss^list(sk8).
% 1015816 [para:1015776.1.2,1015790.1.1,cut:1015778] -equal(app(app(X,cons(Y,nil)),Z),sk2) | -equal(app(X,Z),sk1) | ss^item(sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(X) | -ss^list(Z).
% 1015818 [para:1015776.1.2,1015791.1.1,cut:1015778] -equal(app(app(X,cons(Y,nil)),Z),sk2) | member^p(sk2,sk5(Z,X,Y)) | -equal(app(X,Z),sk1) | -ss^item(Y) | -ss^list(X) | -ss^list(Z).
% 1015820 [para:1015776.1.2,1015798.2.1,cut:1015778] equal(app(sk7,sk8),sk3).
% 1015822 [para:1015776.1.2,1015792.1.1,cut:1015778] -equal(app(app(X,cons(Y,nil)),Z),sk2) | geq(sk5(Z,X,Y),Y) | -equal(app(X,Z),sk1) | -ss^item(Y) | -ss^list(X) | -ss^list(Z).
% 1015824 [para:1015776.1.2,1015793.1.1,cut:1015778] -equal(app(app(X,cons(Y,nil)),Z),sk2) | -equal(Y,sk5(Z,X,Y)) | -equal(app(X,Z),sk1) | -ss^item(Y) | -ss^list(X) | -ss^list(Z).
% 1015826 [para:1015776.1.2,1015797.2.1,cut:1015778] equal(app(app(sk7,cons(sk6,nil)),sk8),sk4).
% 1015847 [para:1015776.1.2,1015799.1.1,cut:1015778] -member^p(sk4,X) | -geq(X,sk6) | equal(sk6,X) | -ss^item(X).
% 1015851 [binary:1015774,1015643.2] segment^p(sk3,sk3).
% 1015852 [binary:1015775,1015643.2] segment^p(sk4,sk4).
% 1015883 [para:1015777.1.2,1015851.1.1] segment^p(sk1,sk3).
% 1015884 [para:1015777.1.2,1015851.1.2] segment^p(sk3,sk1).
% 1015885 [para:1015776.1.2,1015852.1.1] segment^p(sk2,sk4).
% 1015886 [para:1015776.1.2,1015852.1.2] segment^p(sk4,sk2).
% 1017123 [binary:1015883,1015713,cut:1015884,cut:1015774,cut:1015772] equal(sk3,sk1).
% 1017124 [binary:1015885,1015713,cut:1015886,cut:1015775,cut:1015773] equal(sk4,sk2).
% 1021029 [para:1015826.1.1,1015816.1.1,demod:1015820,cut:1017124,cut:1017123,cut:1015810,cut:1015812,cut:1015814] ss^item(sk5(sk8,sk7,sk6)).
% 1021030 [para:1015826.1.1,1015818.1.1,demod:1015820,cut:1017124,cut:1017123,cut:1015810,cut:1015812,cut:1015814] member^p(sk2,sk5(sk8,sk7,sk6)).
% 1021031 [para:1015826.1.1,1015822.1.1,demod:1015820,cut:1017124,cut:1017123,cut:1015810,cut:1015812,cut:1015814] geq(sk5(sk8,sk7,sk6),sk6).
% 1021032 [para:1015826.1.1,1015824.1.1,demod:1015820,cut:1017124,cut:1017123,cut:1015810,cut:1015812,cut:1015814] -equal(sk6,sk5(sk8,sk7,sk6)).
% 1021130 [para:1015776.1.2,1015847.1.1] -member^p(sk2,X) | -geq(X,sk6) | equal(sk6,X) | -ss^item(X).
% 1403111 [binary:1021030,1021130,cut:1021031,cut:1021032,cut:1021029] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 58
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 15224
% derived clauses: 2085246
% kept clauses: 508528
% kept size sum: 0
% kept mid-nuclei: 207894
% kept new demods: 49412
% forw unit-subs: 179427
% forw double-subs: 99286
% forw overdouble-subs: 43007
% backward subs: 570
% fast unit cutoff: 189567
% full unit cutoff: 100
% dbl unit cutoff: 7229
% real runtime : 264.96
% process. runtime: 262.64
% specific non-discr-tree subsumption statistics:
% tried: 12979670
% length fails: 305345
% strength fails: 2429108
% predlist fails: 7157784
% aux str. fails: 275435
% by-lit fails: 266233
% full subs tried: 2399972
% full subs fail: 2345981
%
% ; 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/SWC002-1+eq_r.in")
%
%------------------------------------------------------------------------------