TSTP Solution File: SWC083-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC083-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 368.9s
% Output : Assurance 368.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/SWC083-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(199,40,1,398,0,2,53885,4,2261,55922,5,2803,55923,1,2803,55923,50,2805,55923,40,2805,56122,0,2805,139627,3,4251,172573,4,4906,195831,5,5606,195832,5,5608,195832,1,5608,195832,50,5612,195832,40,5612,196031,0,5612,237025,3,6164,254059,4,6440,268441,5,6713,268442,5,6714,268443,1,6714,268443,50,6716,268443,40,6716,268642,0,6716,323952,3,7568,340265,4,7993,352974,5,8417,352975,5,8418,352975,1,8418,352975,50,8421,352975,40,8421,353174,0,8421,426900,3,9273,453035,4,9700,472434,62,10122,472434,5,10124,472435,1,10124,472435,50,10127,472435,40,10127,472634,0,10127,812342,3,14483,877038,4,16654,992749,5,18828,992750,1,18828,992750,50,18831,992750,40,18831,992949,0,18831,1033899,3,20232,1035435,4,20932,1039336,5,21632,1039337,5,21632,1039337,1,21632,1039337,50,21633,1039337,40,21633,1039536,0,21633,1320048,3,24534,1334686,4,25984,1488304,5,27435,1488305,1,27435,1488305,50,27441,1488305,40,27441,1488504,0,27471,1640529,3,28872,1696994,4,29572,1761226,5,30272,1761226,1,30272,1761226,50,30278,1761226,40,30278,1761425,0,30313,1818240,3,30865,1832724,4,31140,1881215,5,31415,1881215,1,31415,1881215,50,31420,1881215,40,31420,1881414,0,31420,1923139,3,32821,1924668,4,33521,1928735,1,34221,1928735,50,34222,1928735,40,34222,1928934,0,34222,2007812,3,35627,2027501,4,36323,2044213,5,37023,2044214,5,37024,2044214,1,37024,2044214,50,37027,2044214,40,37027,2044413,0,37027)
%
%
% START OF PROOF
% 2044215 [] equal(X,X).
% 2044223 [] ss^list(nil).
% 2044265 [] ss^list(skaf46(X,Y)).
% 2044266 [] ss^list(skaf45(X,Y)).
% 2044272 [] segment^p(X,X) | -ss^list(X).
% 2044273 [] rearseg^p(X,nil) | -ss^list(X).
% 2044274 [] rearseg^p(X,X) | -ss^list(X).
% 2044275 [] frontseg^p(X,nil) | -ss^list(X).
% 2044288 [] equal(app(X,nil),X) | -ss^list(X).
% 2044289 [] equal(app(nil,X),X) | -ss^list(X).
% 2044294 [] -equal(nil,X) | segment^p(nil,X) | -ss^list(X).
% 2044300 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 2044315 [] neq(X,Y) | equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 2044330 [] -neq(X,Y) | -equal(X,Y) | -ss^list(Y) | -ss^list(X).
% 2044333 [] -equal(app(X,Y),nil) | equal(nil,X) | -ss^list(X) | -ss^list(Y).
% 2044342 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 2044343 [] -rearseg^p(X,Y) | -rearseg^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 2044346 [] equal(app(skaf46(X,Y),Y),X) | -rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 2044347 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 2044351 [] rearseg^p(app(X,Y),Z) | -rearseg^p(Y,Z) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 2044352 [] frontseg^p(app(X,Y),Z) | -frontseg^p(X,Z) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 2044358 [] -equal(app(X,Y),Z) | rearseg^p(Z,Y) | -ss^list(Z) | -ss^list(Y) | -ss^list(X).
% 2044359 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 2044360 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 2044364 [] equal(app(app(X,Y),Z),app(X,app(Y,Z))) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 2044368 [] -rearseg^p(Y,Z) | -rearseg^p(X,Y) | rearseg^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 2044387 [] segment^p(app(app(X,Y),Z),U) | -segment^p(Y,U) | -ss^list(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 2044388 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 2044402 [] ss^list(sk2).
% 2044403 [] ss^list(sk3).
% 2044404 [] ss^list(sk4).
% 2044405 [] equal(sk2,sk4).
% 2044406 [] equal(sk1,sk3).
% 2044407 [] neq(sk2,nil).
% 2044408 [] -neq(X,nil) | -segment^p(sk2,X) | -segment^p(sk1,X) | -ss^list(X).
% 2044409 [] ss^list(sk5).
% 2044410 [] ss^list(sk6).
% 2044411 [] ss^list(sk7).
% 2044412 [] equal(app(app(sk5,sk6),sk7),sk3).
% 2044413 [] equal(app(sk5,sk7),sk4).
% 2044414 [input:2044300,factor] ss^list(app(X,X)) | -ss^list(X).
% 2044433 [input:2044346,factor:binarycut:2044274] equal(app(skaf46(X,X),X),X) | -ss^list(X).
% 2044438 [input:2044351,factor:binarycut:2044274] rearseg^p(app(X,Y),Y) | -ss^list(Y) | -ss^list(X).
% 2044461 [input:2044360,factor] equal(app(X,X),nil) | -equal(nil,X) | -ss^list(X).
% 2044491 [input:2044387,factor:binarycut:2044272] segment^p(app(app(X,Y),Z),Y) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 2044495 [input:2044387,factor:factor:factor:factor:factor] segment^p(app(app(X,Y),Z),X) | -segment^p(Y,X) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 2044511 [input:2044388,factor:factor:factor] -equal(app(app(X,Y),Z),X) | segment^p(X,Y) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 2045287 [binary:2044215,2044294,cut:2044223] segment^p(nil,nil).
% 2045305 [para:2044433.1.1,2044288.1.1,cut:2044223,cut:2044265] equal(nil,skaf46(nil,nil)).
% 2045307 [para:2045305.1.2,2044433.1.1.1,cut:2044223] equal(app(nil,nil),nil).
% 2045317 [binary:2044408,2044315,cut:2044223] -segment^p(sk1,X) | -segment^p(sk2,X) | equal(X,nil) | -ss^list(X).
% 2045403 [binary:2044407,2044330,cut:2044223,cut:2044402] -equal(sk2,nil).
% 2045701 [para:2044346.1.1,2044288.1.1,cut:2044223,cut:2044265,binarycut:2044273] equal(X,skaf46(X,nil)) | -ss^list(X).
% 2045703 [para:2044288.1.1,2044346.1.1,cut:2044223,cut:2044265,binarycut:2044273] equal(skaf46(X,nil),X) | -ss^list(X).
% 2045712 [binary:2044333,2044346,cut:2044223,cut:2044265] equal(nil,skaf46(nil,X)) | -rearseg^p(nil,X) | -ss^list(X).
% 2045727 [para:2045712.1.2,2044346.1.1.1,cut:2044223] equal(app(nil,X),nil) | -rearseg^p(nil,X) | -ss^list(X).
% 2045732 [para:2044347.1.1,2044289.1.1,cut:2044223,cut:2044266,binarycut:2044275] equal(X,skaf45(X,nil)) | -ss^list(X).
% 2045734 [para:2044289.1.1,2044347.1.1,cut:2044223,cut:2044266,binarycut:2044275] equal(skaf45(X,nil),X) | -ss^list(X).
% 2045766 [para:2044347.1.1,2045727.1.1,cut:2044266,cut:2044223,binarycut:2044275] -rearseg^p(nil,skaf45(X,nil)) | equal(X,nil) | -ss^list(X).
% 2045823 [para:2044413.1.1,2044351.1.1,cut:2044411,cut:2044409] -rearseg^p(sk7,X) | rearseg^p(sk4,X) | -ss^list(X).
% 2045849 [binary:2044273,2045823,cut:2044223,cut:2044411] rearseg^p(sk4,nil).
% 2045858 [para:2044413.1.1,2044352.1.1,cut:2044409,cut:2044411] -frontseg^p(sk5,X) | frontseg^p(sk4,X) | -ss^list(X).
% 2045888 [binary:2044275,2045858,cut:2044223,cut:2044409] frontseg^p(sk4,nil).
% 2046013 [para:2044289.1.1,2044358.1.1,cut:2044223] -equal(X,Y) | rearseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 2046108 [binary:2044405,2046013,cut:2044404,cut:2044402] rearseg^p(sk4,sk2).
% 2046110 [binary:2044413,2046013,demod:2044413,cut:2044404] rearseg^p(sk4,sk4).
% 2046147 [binary:2045701,2046013,cut:2044265] rearseg^p(skaf46(X,nil),X) | -ss^list(X).
% 2046148 [binary:2045703,2046013,cut:2044265] rearseg^p(X,skaf46(X,nil)) | -ss^list(X).
% 2046152 [binary:2045732,2046013,cut:2044266] rearseg^p(skaf45(X,nil),X) | -ss^list(X).
% 2046153 [binary:2045734,2046013,cut:2044266] rearseg^p(X,skaf45(X,nil)) | -ss^list(X).
% 2046162 [para:2044405.1.2,2046110.1.1] rearseg^p(sk2,sk4).
% 2046172 [para:2044364.1.1,2044412.1.1,cut:2044409,cut:2044411,cut:2044410] equal(app(sk5,app(sk6,sk7)),sk3).
% 2046187 [para:2044364.1.1,2044300.1.1,factor:factor:factor:binarycut:2044414] ss^list(app(X,app(X,X))) | -ss^list(X).
% 2046200 [para:2044364.1.1,2044438.1.1,factor:factor:factor:binarycut:2044414] rearseg^p(app(X,app(X,X)),X) | -ss^list(X).
% 2046610 [binary:2046108,2044368,cut:2044404,cut:2044402] -rearseg^p(X,sk4) | rearseg^p(X,sk2) | -ss^list(X).
% 2046612 [binary:2046162,2044368,cut:2044402,cut:2044404] -rearseg^p(X,sk2) | rearseg^p(X,sk4) | -ss^list(X).
% 2046943 [binary:2046147,2046610,cut:2044265,cut:2044404] rearseg^p(skaf46(sk4,nil),sk2).
% 2046944 [binary:2046152,2046610,cut:2044266,cut:2044404] rearseg^p(skaf45(sk4,nil),sk2).
% 2046946 [binary:2046200,2046610,cut:2044404,binarydemod:2046187,cut:2044404] rearseg^p(app(sk4,app(sk4,sk4)),sk2).
% 2046991 [para:2044405.1.2,2046944.1.1.1] rearseg^p(skaf45(sk2,nil),sk2).
% 2047002 [binary:2044343,2046991,cut:2044402,cut:2044266,binarydemod:2046153,cut:2044402] equal(sk2,skaf45(sk2,nil)).
% 2047045 [para:2047002.1.2,2045766.1.2,cut:2045403,cut:2044402] -rearseg^p(nil,sk2).
% 2047322 [para:2044461.1.1,2046946.1.1.2,cut:2044404] rearseg^p(app(sk4,nil),sk2) | -equal(nil,sk4).
% 2047463 [para:2044289.1.1,2044387.1.1.1,cut:2044223,factor:factor:binarycut:2044272] segment^p(app(X,Y),X) | -ss^list(Y) | -ss^list(X).
% 2047716 [binary:2046943,2046612,cut:2044265] rearseg^p(skaf46(sk4,nil),sk4).
% 2047717 [binary:2046944,2046612,cut:2044266] rearseg^p(skaf45(sk4,nil),sk4).
% 2047940 [binary:2044343,2047716,cut:2044404,cut:2044265,binarydemod:2046148,cut:2044404] equal(sk4,skaf46(sk4,nil)).
% 2047942 [binary:2044343,2047717,cut:2044404,cut:2044266,binarydemod:2046153,cut:2044404] equal(sk4,skaf45(sk4,nil)).
% 2047966 [para:2047940.1.2,2044346.1.1.1,cut:2045849,cut:2044404,cut:2044223] equal(app(sk4,nil),sk4).
% 2047967 [para:2047942.1.2,2044347.1.1.2,cut:2045888,cut:2044404,cut:2044223] equal(app(nil,sk4),sk4).
% 2047973 [para:2047966.1.1,2044359.1.1,cut:2044404,cut:2044223] -equal(sk4,X) | frontseg^p(X,sk4) | -ss^list(X).
% 2051767 [para:2044360.1.1,2047322.1.1,cut:2047045,cut:2044215,cut:2044404,cut:2044223] -equal(nil,sk4).
% 2052254 [para:2045307.1.1,2044495.1.1.1,cut:2045287,cut:2044223] segment^p(app(nil,X),nil) | -ss^list(X).
% 2052583 [para:2044413.1.1,2044491.1.1.1,cut:2044409,cut:2044411] segment^p(app(sk4,X),sk7) | -ss^list(X).
% 2052651 [para:2047967.1.1,2052254.1.1,cut:2044404] segment^p(sk4,nil).
% 2052653 [binary:2044342,2052651,cut:2051767,cut:2044223,cut:2044404] -segment^p(nil,sk4).
% 2052665 [para:2044288.1.1,2052583.1.1,cut:2044223,cut:2044404] segment^p(sk4,sk7).
% 2052670 [para:2044405.1.2,2052665.1.1] segment^p(sk2,sk7).
% 2053111 [para:2047967.1.1,2044511.1.1.1,cut:2052653,cut:2044404,cut:2044223] -equal(app(sk4,X),nil) | -ss^list(X).
% 2053243 [para:2044347.1.1,2053111.1.1,cut:2044266,cut:2044404] -frontseg^p(X,sk4) | -equal(X,nil) | -ss^list(X).
% 2058581 [para:2044413.1.1,2047463.1.1,cut:2044411,cut:2044409] segment^p(sk4,sk5).
% 2058595 [para:2046172.1.1,2047463.1.1,cut:2044409] -ss^list(app(sk6,sk7)) | segment^p(sk3,sk5).
% 2058622 [para:2044405.1.2,2058581.1.1] segment^p(sk2,sk5).
% 2058897 [binary:2044300,2058595,cut:2044410,cut:2044411] segment^p(sk3,sk5).
% 2058898 [para:2044406.1.2,2058897.1.1] segment^p(sk1,sk5).
% 2058901 [binary:2045317,2058898,cut:2058622,cut:2044409] equal(sk5,nil).
% 2058904 [para:2058901.1.1,2044413.1.1.1] equal(app(nil,sk7),sk4).
% 2058905 [para:2058901.1.1,2044412.1.1.1.1] equal(app(app(nil,sk6),sk7),sk3).
% 2059325 [para:2058904.1.1,2044289.1.1,cut:2044411] equal(sk4,sk7).
% 2059423 [binary:2047973,2059325,cut:2044411] frontseg^p(sk7,sk4).
% 2059569 [binary:2053243,2059423,cut:2044411] -equal(sk7,nil).
% 2063237 [para:2044289.1.1,2058905.1.1.1,cut:2044410] equal(app(sk6,sk7),sk3).
% 2063323 [para:2063237.1.1,2044491.1.1.1,cut:2044410,cut:2044411] segment^p(app(sk3,X),sk7) | -ss^list(X).
% 2066403 [para:2044288.1.1,2063323.1.1,cut:2044223,cut:2044403] segment^p(sk3,sk7).
% 2066433 [para:2044406.1.2,2066403.1.1] segment^p(sk1,sk7).
% 2066438 [binary:2045317,2066433,cut:2052670,cut:2059569,cut:2044411] 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: 27571
% derived clauses: 2909903
% kept clauses: 774710
% kept size sum: 426377
% kept mid-nuclei: 348141
% kept new demods: 55989
% forw unit-subs: 273513
% forw double-subs: 162878
% forw overdouble-subs: 69157
% backward subs: 555
% fast unit cutoff: 290454
% full unit cutoff: 144
% dbl unit cutoff: 11159
% real runtime : 377.59
% process. runtime: 376.13
% specific non-discr-tree subsumption statistics:
% tried: 12048745
% length fails: 404240
% strength fails: 2352951
% predlist fails: 5861552
% aux str. fails: 248933
% by-lit fails: 387560
% full subs tried: 2604749
% full subs fail: 2517079
%
% ; 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/SWC083-1+eq_r.in")
%
%------------------------------------------------------------------------------