TSTP Solution File: SWC200-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC200-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.1s
% Output : Assurance 378.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/SWC200-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(196,40,3,392,0,3,55394,4,2362,57361,5,2805,57362,1,2805,57362,50,2807,57362,40,2807,57558,0,2824,133202,3,4226,160768,4,4925,180627,5,5625,180627,5,5627,180627,1,5627,180627,50,5630,180627,40,5630,180823,0,5630,224261,3,6185,227061,4,6457,242070,5,6731,242070,5,6731,242072,1,6731,242072,50,6733,242072,40,6733,242268,0,6733,292564,3,7599,314079,4,8009,329268,5,8434,329270,5,8435,329271,1,8435,329271,50,8438,329271,40,8438,329467,0,8438,401367,3,9289,423895,4,9715,439616,5,10139,439617,5,10141,439618,1,10141,439618,50,10144,439618,40,10144,439814,0,10144,759580,3,14526,840001,4,16675,946901,5,18845,946902,1,18845,946902,50,18848,946902,40,18848,947098,0,18849,990175,3,20250,991851,4,20950,996351,5,21650,996352,1,21650,996352,50,21652,996352,40,21652,996548,0,21652,1319989,3,24553,1486123,4,26003,1584891,5,27453,1584892,1,27453,1584892,50,27460,1584892,40,27460,1585088,0,27489,1699163,3,28890,1733301,4,29590,1793013,1,30290,1793013,50,30296,1793013,40,30296,1793209,0,30336,1845914,3,30887,1865444,4,31162,1917900,5,31437,1917900,5,31438,1917900,1,31438,1917900,50,31444,1917900,40,31444,1918096,0,31444,1961733,3,32845,1963560,4,33545,1974018,5,34245,1974019,5,34245,1974019,1,34245,1974019,50,34247,1974019,40,34247,1974215,0,34247,2056909,3,35648,2069268,4,36349,2087264,5,37048,2087265,5,37049,2087265,1,37049,2087265,50,37051,2087265,40,37051,2087461,0,37052)
%
%
% START OF PROOF
% 2087266 [] equal(X,X).
% 2087274 [] ss^list(nil).
% 2087278 [] ss^item(skaf83(X)).
% 2087279 [] ss^list(skaf82(X)).
% 2087313 [] ss^item(skaf44(X)).
% 2087314 [] ss^list(skaf48(X,Y)).
% 2087315 [] ss^list(skaf47(X,Y)).
% 2087316 [] ss^list(skaf46(X,Y)).
% 2087317 [] ss^list(skaf45(X,Y)).
% 2087323 [] segment^p(X,X) | -ss^list(X).
% 2087324 [] rearseg^p(X,nil) | -ss^list(X).
% 2087325 [] rearseg^p(X,X) | -ss^list(X).
% 2087337 [] -member^p(nil,X) | -ss^item(X).
% 2087338 [] -ss^list(X) | ss^item(Y) | duplicatefree^p(X).
% 2087339 [] equal(app(X,nil),X) | -ss^list(X).
% 2087340 [] equal(app(nil,X),X) | -ss^list(X).
% 2087347 [] -equal(nil,X) | rearseg^p(nil,X) | -ss^list(X).
% 2087351 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 2087362 [] equal(tl(cons(X,Y)),Y) | -ss^item(X) | -ss^list(Y).
% 2087363 [] equal(hd(cons(X,Y)),X) | -ss^item(X) | -ss^list(Y).
% 2087364 [] -equal(cons(X,Y),nil) | -ss^item(X) | -ss^list(Y).
% 2087365 [] -equal(cons(X,Y),Y) | -ss^item(X) | -ss^list(Y).
% 2087367 [] equal(cons(skaf44(X),nil),X) | -singleton^p(X) | -ss^list(X).
% 2087370 [] equal(cons(hd(X),tl(X)),X) | equal(nil,X) | -ss^list(X).
% 2087375 [] equal(cons(skaf83(X),skaf82(X)),X) | equal(nil,X) | -ss^list(X).
% 2087393 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 2087394 [] -rearseg^p(X,Y) | -rearseg^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 2087397 [] equal(app(skaf46(X,Y),Y),X) | -rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 2087398 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 2087399 [] equal(tl(app(X,Y)),app(tl(X),Y)) | equal(nil,X) | -ss^list(Y) | -ss^list(X).
% 2087402 [] rearseg^p(app(X,Y),Z) | -rearseg^p(Y,Z) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 2087409 [] -equal(app(X,Y),Z) | rearseg^p(Z,Y) | -ss^list(Z) | -ss^list(Y) | -ss^list(X).
% 2087410 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 2087411 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 2087415 [] equal(app(app(X,Y),Z),app(X,app(Y,Z))) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 2087418 [] -segment^p(Y,Z) | -segment^p(X,Y) | segment^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 2087419 [] -rearseg^p(Y,Z) | -rearseg^p(X,Y) | rearseg^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 2087420 [] -frontseg^p(Y,Z) | -frontseg^p(X,Y) | frontseg^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 2087427 [] -member^p(cons(X,Y),Z) | member^p(Y,Z) | equal(Z,X) | -ss^item(Z) | -ss^item(X) | -ss^list(Y).
% 2087434 [] equal(app(app(skaf47(X,Y),Y),skaf48(Y,X)),X) | -segment^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 2087438 [] segment^p(app(app(X,Y),Z),U) | -segment^p(Y,U) | -ss^list(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 2087439 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 2087445 [] -equal(app(app(X,cons(Y,Z)),cons(Y,U)),V) | -ss^item(Y) | -ss^list(V) | -ss^list(X) | -ss^list(U) | -ss^list(Z) | -duplicatefree^p(V).
% 2087452 [] ss^list(sk1).
% 2087454 [] ss^list(sk3).
% 2087457 [] equal(sk1,sk3).
% 2087458 [] singleton^p(sk3).
% 2087460 [] member^p(sk1,sk5(X)) | -ss^item(X).
% 2087461 [] -equal(X,sk5(X)) | -ss^item(X).
% 2087462 [input:2087351,factor] ss^list(app(X,X)) | -ss^list(X).
% 2087481 [input:2087397,factor:binarycut:2087325] equal(app(skaf46(X,X),X),X) | -ss^list(X).
% 2087490 [input:2087402,factor:factor:factor:factor:binarycut:2087325] rearseg^p(app(X,X),X) | -ss^list(X).
% 2087509 [input:2087411,factor] equal(app(X,X),nil) | -equal(nil,X) | -ss^list(X).
% 2087518 [input:2087415,factor] equal(app(app(X,Y),X),app(X,app(Y,X))) | -ss^list(X) | -ss^list(Y).
% 2087519 [input:2087415,factor:factor] equal(app(app(X,X),Y),app(X,app(X,Y))) | -ss^list(X) | -ss^list(Y).
% 2087520 [input:2087415,factor:factor:factor] equal(app(app(X,Y),Y),app(X,app(Y,Y))) | -ss^list(X) | -ss^list(Y).
% 2087535 [input:2087434,factor:binarycut:2087323] equal(app(app(skaf47(X,X),X),skaf48(X,X)),X) | -ss^list(X).
% 2087547 [input:2087438,factor:factor:factor:factor:factor:factor:factor:factor:binarycut:2087323] segment^p(app(app(X,Y),X),Y) | -ss^list(Y) | -ss^list(X).
% 2087589 [input:2087445,factor:factor:factor:factor:factor:factor:factor] -equal(app(app(X,cons(Y,X)),cons(Y,X)),Z) | -ss^item(Y) | -ss^list(Z) | -ss^list(X) | -duplicatefree^p(Z).
% 2088228 [para:2087457.1.2,2087458.1.1] singleton^p(sk1).
% 2088347 [para:2087481.1.1,2087339.1.1,cut:2087274,cut:2087316] equal(nil,skaf46(nil,nil)).
% 2088348 [para:2088347.1.2,2087481.1.1.1,cut:2087274] equal(app(nil,nil),nil).
% 2088373 [para:2087367.1.1,2087365.1.1,cut:2087313,cut:2087274] -equal(X,nil) | -singleton^p(X) | -ss^list(X).
% 2088374 [para:2087367.1.1,2087362.1.1.1,cut:2087313,cut:2087274] equal(tl(X),nil) | -singleton^p(X) | -ss^list(X).
% 2088375 [para:2087367.1.1,2087363.1.1.1,cut:2087313,cut:2087274] equal(hd(X),skaf44(X)) | -singleton^p(X) | -ss^list(X).
% 2088421 [para:2088375.1.1,2087370.1.1.1] equal(cons(skaf44(X),tl(X)),X) | equal(nil,X) | -singleton^p(X) | -ss^list(X).
% 2088424 [para:2087375.1.1,2087362.1.1.1,cut:2087278,cut:2087279] equal(tl(X),skaf82(X)) | equal(nil,X) | -ss^list(X).
% 2088425 [para:2087375.1.1,2087363.1.1.1,cut:2087278,cut:2087279] equal(hd(X),skaf83(X)) | equal(nil,X) | -ss^list(X).
% 2088426 [para:2087375.1.1,2087364.1.1,cut:2087278,cut:2087279] -equal(X,nil) | equal(nil,X) | -ss^list(X).
% 2088471 [binary:2088426,2087509,binarycut:2087462] equal(nil,app(X,X)) | -equal(nil,X) | -ss^list(X).
% 2088478 [binary:2087347,2088471,binarycut:2087462] rearseg^p(nil,app(X,X)) | -equal(nil,X) | -ss^list(X).
% 2088534 [para:2087339.1.1,2087547.1.1,cut:2087274] segment^p(app(nil,X),X) | -ss^list(app(nil,X)) | -ss^list(X).
% 2088757 [para:2087397.1.1,2087339.1.1,cut:2087274,cut:2087316,binarycut:2087324] equal(X,skaf46(X,nil)) | -ss^list(X).
% 2088759 [para:2087339.1.1,2087397.1.1,cut:2087274,cut:2087316,binarycut:2087324] equal(skaf46(X,nil),X) | -ss^list(X).
% 2088906 [para:2087339.1.1,2087402.1.1,cut:2087274] -rearseg^p(nil,X) | rearseg^p(Y,X) | -ss^list(X) | -ss^list(Y).
% 2088949 [binary:2088478,2088906,binarycut:2087462,factor] rearseg^p(X,app(X,X)) | -equal(nil,X) | -ss^list(X).
% 2088979 [binary:2087394,2088949,binarycut:2087490,binarycut:2087462] equal(app(X,X),X) | -equal(nil,X) | -ss^list(X).
% 2089078 [para:2087340.1.1,2087409.1.1,cut:2087274] -equal(X,Y) | rearseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 2089096 [binary:2087457,2089078,cut:2087454,cut:2087452] rearseg^p(sk3,sk1).
% 2089118 [binary:2088757,2089078,cut:2087316] rearseg^p(skaf46(X,nil),X) | -ss^list(X).
% 2089119 [binary:2088759,2089078,cut:2087316] rearseg^p(X,skaf46(X,nil)) | -ss^list(X).
% 2089129 [para:2087339.1.1,2087410.1.1,cut:2087274] -equal(X,Y) | frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 2089169 [binary:2087457,2089129,cut:2087454,cut:2087452] frontseg^p(sk3,sk1).
% 2089189 [binary:2088757,2089129,cut:2087316] frontseg^p(skaf46(X,nil),X) | -ss^list(X).
% 2089778 [binary:2089096,2087419,cut:2087454,cut:2087452] -rearseg^p(X,sk3) | rearseg^p(X,sk1) | -ss^list(X).
% 2089854 [binary:2089169,2087420,cut:2087454,cut:2087452] -frontseg^p(X,sk3) | frontseg^p(X,sk1) | -ss^list(X).
% 2090138 [binary:2089118,2089778,cut:2087316,cut:2087454] rearseg^p(skaf46(sk3,nil),sk1).
% 2090190 [para:2087457.1.2,2090138.1.1.1] rearseg^p(skaf46(sk1,nil),sk1).
% 2090202 [binary:2087394,2090190,cut:2087452,cut:2087316,binarydemod:2089119,cut:2087452] equal(sk1,skaf46(sk1,nil)).
% 2090702 [binary:2089189,2089854,cut:2087316,cut:2087454] frontseg^p(skaf46(sk3,nil),sk1).
% 2090727 [para:2087340.1.1,2087438.1.1.1,cut:2087274,factor:factor:binarycut:2087323] segment^p(app(X,Y),X) | -ss^list(Y) | -ss^list(X).
% 2092833 [para:2087398.1.1,2090727.1.1,cut:2087317] -frontseg^p(X,Y) | segment^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 2093907 [para:2087519.1.1,2087351.1.1,binarycut:2087462] ss^list(app(X,app(X,Y))) | -ss^list(Y) | -ss^list(X).
% 2094983 [para:2087535.1.1,2087439.1.1,cut:2087314,cut:2087315] -equal(X,Y) | segment^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 2096264 [binary:2090702,2092833,cut:2087316,cut:2087452] segment^p(skaf46(sk3,nil),sk1).
% 2096379 [binary:2087418,2096264,cut:2087316,cut:2087452] -segment^p(X,skaf46(sk3,nil)) | segment^p(X,sk1) | -ss^list(X).
% 2097917 [para:2087340.1.1,2093907.1.1.2,cut:2087274] ss^list(app(nil,X)) | -ss^list(X).
% 2098264 [binary:2087340,2094983,binarycut:2097917] segment^p(X,app(nil,X)) | -ss^list(X).
% 2099719 [binary:2088534,2096379,cut:2087316,binarydemod:2097917,cut:2087316] segment^p(app(nil,skaf46(sk3,nil)),sk1).
% 2100061 [para:2087457.1.2,2099719.1.1.2.1,demod:2090202] segment^p(app(nil,sk1),sk1).
% 2100177 [binary:2087393,2100061,cut:2087452,binarydemod:2097917,2098264,cut:2087452] equal(sk1,app(nil,sk1)).
% 2100191 [para:2100177.1.2,2087520.1.1.1,cut:2087274,cut:2087452] equal(app(sk1,sk1),app(nil,app(sk1,sk1))).
% 2100192 [para:2100177.1.2,2087518.1.1.1,cut:2087274,cut:2087452] equal(app(sk1,nil),app(nil,app(sk1,nil))).
% 2111698 [para:2087509.1.1,2100191.1.2.2,demod:2088348,cut:2087452] equal(app(sk1,sk1),nil) | -equal(nil,sk1).
% 2111702 [binary:2088373,2111698,binarydemod:2087462,cut:2087452] -singleton^p(app(sk1,sk1)) | -equal(nil,sk1).
% 2111770 [para:2088979.1.1,2111702.1.1,cut:2088228,cut:2087452] -equal(nil,sk1).
% 2112025 [para:2087339.1.1,2100192.1.2.2,demod:2100177,cut:2087452] equal(app(sk1,nil),sk1).
% 2112051 [para:2112025.1.1,2087399.1.1.1,cut:2111770,cut:2087274,cut:2087452] equal(tl(sk1),app(tl(sk1),nil)).
% 2112063 [para:2112025.1.1,2093907.1.1.2,cut:2087274,cut:2087452] ss^list(app(sk1,sk1)).
% 2112064 [binary:2087338,2112063] duplicatefree^p(app(sk1,sk1)) | ss^item(X).
% 2112223 [para:2088374.1.1,2112051.1.2.1,demod:2088348,cut:2088228,cut:2087452] equal(tl(sk1),nil).
% 2112226 [para:2112223.1.1,2088424.1.1,cut:2111770,cut:2087452] equal(nil,skaf82(sk1)).
% 2112227 [para:2112223.1.1,2088421.1.1.2,cut:2111770,cut:2088228,cut:2087452] equal(cons(skaf44(sk1),nil),sk1).
% 2112229 [para:2112226.1.2,2087375.1.1.2,cut:2111770,cut:2087452] equal(cons(skaf83(sk1),nil),sk1).
% 2113206 [para:2112227.1.1,2087363.1.1.1,cut:2087313,cut:2087274] equal(hd(sk1),skaf44(sk1)).
% 2113266 [para:2112227.1.1,2087589.1.1.1.2,demod:2112227,2100177,cut:2087313,cut:2087274] -equal(app(sk1,sk1),X) | -ss^list(X) | -duplicatefree^p(X).
% 2113451 [para:2113206.1.1,2088425.1.1,cut:2111770,cut:2087452] equal(skaf44(sk1),skaf83(sk1)).
% 2114259 [binary:2087266,2113266,cut:2112063,binarydemod:2112064] ss^item(X).
% 2115659 [para:2112229.1.1,2087427.1.1,cut:2087278,cut:2087274,binarycut:2087337,cut:2114259] equal(X,skaf83(sk1)) | -member^p(sk1,X).
% 2115664 [para:2115659.1.2,2087375.1.1.1,demod:2112226,cut:2111770,cut:2087452] equal(cons(X,nil),sk1) | -member^p(sk1,X).
% 2115849 [para:2115664.1.1,2087363.1.1.1,demod:2113451,2113206,cut:2114259,cut:2087274] equal(skaf83(sk1),X) | -member^p(sk1,X).
% 2116140 [binary:2087461,2115849,cut:2087278,binarydemod:2087460,cut:2087278] 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: 29562
% derived clauses: 3385286
% kept clauses: 770617
% kept size sum: 596372
% kept mid-nuclei: 373357
% kept new demods: 45804
% forw unit-subs: 282222
% forw double-subs: 97397
% forw overdouble-subs: 75773
% backward subs: 601
% fast unit cutoff: 282062
% full unit cutoff: 210
% dbl unit cutoff: 11856
% real runtime : 380.62
% process. runtime: 378.32
% specific non-discr-tree subsumption statistics:
% tried: 11968052
% length fails: 396065
% strength fails: 2468990
% predlist fails: 5091117
% aux str. fails: 273168
% by-lit fails: 453166
% full subs tried: 3050043
% full subs fail: 2949858
%
% ; 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/SWC200-1+eq_r.in")
%
%------------------------------------------------------------------------------