TSTP Solution File: SWC392-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC392-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 : art05.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.2s
% Output : Assurance 378.2s
% 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/SWC392-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(203,40,2,406,0,2,58158,4,2316,62108,5,2817,62109,1,2819,62109,50,2822,62109,40,2822,62312,0,2822,134098,3,4223,174702,4,4955,194450,5,5650,194450,5,5653,194450,1,5653,194450,50,5656,194450,40,5656,194653,0,5656,229766,3,6207,234838,4,6484,256315,5,6757,256315,5,6758,256316,1,6758,256316,50,6759,256316,40,6759,256519,0,6759,318516,3,7610,341798,4,8035,363287,5,8462,363288,5,8464,363288,1,8464,363288,50,8467,363288,40,8467,363491,0,8467,418646,3,9322,444349,4,9746,463785,5,10168,463786,5,10170,463787,1,10170,463787,50,10173,463787,40,10173,463990,0,10173,642595,3,14524,728877,4,16700,866324,5,18876,866325,1,18876,866325,50,18879,866325,40,18879,866528,0,18879,907387,3,20280,908462,4,20980,915926,5,21680,915927,1,21680,915927,50,21681,915927,40,21681,916130,0,21682,1153360,3,24584,1261534,4,26033,1332984,5,27484,1332985,1,27484,1332985,50,27490,1332985,40,27490,1333188,0,27521,1479276,3,28923,1524182,4,29622,1573990,5,30323,1573990,1,30323,1573990,50,30329,1573990,40,30329,1574193,0,30366,1626473,3,30927,1641207,4,31192,1689777,5,31467,1689777,1,31467,1689777,50,31472,1689777,40,31472,1689980,0,31473,1732489,3,32874,1733418,4,33574,1739621,5,34274,1739622,1,34274,1739622,50,34275,1739622,40,34275,1739825,0,34275,1813986,3,35678,1833371,4,36377,1850155,5,37076,1850157,1,37077,1850157,50,37080,1850157,40,37080,1850360,0,37080)
%
%
% START OF PROOF
% 1850158 [] equal(X,X).
% 1850166 [] ss^list(nil).
% 1850169 [] -singleton^p(nil).
% 1850170 [] ss^item(skaf83(X)).
% 1850171 [] ss^list(skaf82(X)).
% 1850205 [] ss^item(skaf44(X)).
% 1850206 [] ss^list(skaf48(X,Y)).
% 1850207 [] ss^list(skaf47(X,Y)).
% 1850208 [] ss^list(skaf46(X,Y)).
% 1850215 [] segment^p(X,X) | -ss^list(X).
% 1850217 [] rearseg^p(X,X) | -ss^list(X).
% 1850218 [] frontseg^p(X,nil) | -ss^list(X).
% 1850229 [] -member^p(nil,X) | -ss^item(X).
% 1850231 [] equal(app(X,nil),X) | -ss^list(X).
% 1850232 [] equal(app(nil,X),X) | -ss^list(X).
% 1850243 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 1850254 [] equal(tl(cons(X,Y)),Y) | -ss^item(X) | -ss^list(Y).
% 1850255 [] equal(hd(cons(X,Y)),X) | -ss^item(X) | -ss^list(Y).
% 1850259 [] equal(cons(skaf44(X),nil),X) | -singleton^p(X) | -ss^list(X).
% 1850262 [] equal(cons(hd(X),tl(X)),X) | equal(nil,X) | -ss^list(X).
% 1850267 [] equal(cons(skaf83(X),skaf82(X)),X) | equal(nil,X) | -ss^list(X).
% 1850274 [] -equal(cons(X,nil),Y) | -ss^item(X) | -ss^list(Y) | singleton^p(Y).
% 1850285 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 1850287 [] -frontseg^p(X,Y) | -frontseg^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 1850289 [] equal(app(skaf46(X,Y),Y),X) | -rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 1850298 [] member^p(app(X,Y),Z) | -member^p(X,Z) | -ss^item(Z) | -ss^list(X) | -ss^list(Y).
% 1850302 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 1850303 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 1850307 [] equal(app(app(X,Y),Z),app(X,app(Y,Z))) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 1850315 [] equal(cons(X,app(Y,Z)),app(cons(X,Y),Z)) | -ss^item(X) | -ss^list(Z) | -ss^list(Y).
% 1850319 [] -member^p(cons(X,Y),Z) | member^p(Y,Z) | equal(Z,X) | -ss^item(Z) | -ss^item(X) | -ss^list(Y).
% 1850326 [] equal(app(app(skaf47(X,Y),Y),skaf48(Y,X)),X) | -segment^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 1850330 [] segment^p(app(app(X,Y),Z),U) | -segment^p(Y,U) | -ss^list(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 1850331 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 1850336 [] frontseg^p(cons(X,Y),cons(Z,U)) | -frontseg^p(Y,U) | -equal(X,Z) | -ss^item(X) | -ss^item(Z) | -ss^list(Y) | -ss^list(U).
% 1850344 [] ss^list(sk1).
% 1850346 [] ss^list(sk3).
% 1850348 [] equal(sk2,sk4).
% 1850349 [] equal(sk1,sk3).
% 1850350 [] ss^item(sk5).
% 1850351 [] member^p(sk1,sk5).
% 1850352 [] -member^p(sk2,sk5).
% 1850354 [] equal(nil,sk3) | ss^item(sk6).
% 1850358 [] equal(cons(sk6,nil),sk3) | equal(nil,sk3).
% 1850359 [] member^p(sk4,sk6) | equal(nil,sk3).
% 1850361 [input:1850243,factor] ss^list(app(X,X)) | -ss^list(X).
% 1850380 [input:1850289,factor:binarycut:1850217] equal(app(skaf46(X,X),X),X) | -ss^list(X).
% 1850408 [input:1850303,factor] equal(app(X,X),nil) | -equal(nil,X) | -ss^list(X).
% 1850418 [input:1850307,factor:factor] equal(app(app(X,X),Y),app(X,app(X,Y))) | -ss^list(X) | -ss^list(Y).
% 1850431 [input:1850315,factor] equal(cons(X,app(Y,Y)),app(cons(X,Y),Y)) | -ss^item(X) | -ss^list(Y).
% 1850434 [input:1850326,factor:binarycut:1850215] equal(app(app(skaf47(X,X),X),skaf48(X,X)),X) | -ss^list(X).
% 1850455 [input:1850330,factor:factor:factor:factor:factor:factor:factor:factor:factor:factor:binarycut:1850215] segment^p(app(app(X,X),X),X) | -ss^list(X).
% 1850478 [input:1850336,factor:cut:1850158] frontseg^p(cons(X,Y),cons(X,Z)) | -frontseg^p(Y,Z) | -ss^item(X) | -ss^list(Y) | -ss^list(Z).
% 1851131 [para:1850354.1.2,1850349.1.2] equal(sk1,nil) | ss^item(sk6).
% 1851135 [?] ?
% 1851144 [para:1850348.1.2,1850359.1.1] member^p(sk2,sk6) | equal(nil,sk3).
% 1851150 [para:1851131.1.1,1850351.1.1,binarycut:1851135] ss^item(sk6).
% 1851401 [para:1850358.1.1,1850254.1.1.1,cut:1851150,cut:1850166] equal(tl(sk3),nil) | equal(nil,sk3).
% 1851412 [para:1850358.1.1,1850255.1.1.1,cut:1851150,cut:1850166] equal(hd(sk3),sk6) | equal(nil,sk3).
% 1851425 [para:1850380.1.1,1850231.1.1,cut:1850166,cut:1850208] equal(nil,skaf46(nil,nil)).
% 1851426 [para:1851425.1.2,1850380.1.1.1,cut:1850166] equal(app(nil,nil),nil).
% 1851445 [para:1850259.1.1,1850255.1.1.1,cut:1850205,cut:1850166] equal(hd(X),skaf44(X)) | -singleton^p(X) | -ss^list(X).
% 1851466 [para:1851401.1.1,1850262.1.1.2,cut:1850346] equal(cons(hd(sk3),nil),sk3) | equal(nil,sk3).
% 1851547 [para:1850267.1.1,1850254.1.1.1,cut:1850170,cut:1850171] equal(tl(X),skaf82(X)) | equal(nil,X) | -ss^list(X).
% 1851599 [para:1850358.1.1,1850274.1.1,cut:1851150] equal(nil,sk3) | -equal(sk3,X) | -ss^list(X) | singleton^p(X).
% 1851600 [binary:1850358,1850274,cut:1851150,cut:1850346] equal(nil,sk3) | singleton^p(sk3).
% 1851609 [para:1851600.1.2,1850349.1.2] equal(sk1,nil) | singleton^p(sk3).
% 1851615 [?] ?
% 1851629 [para:1851609.1.1,1850351.1.1,binarycut:1851615] singleton^p(sk3).
% 1851630 [para:1850349.1.2,1851629.1.1] singleton^p(sk1).
% 1851656 [para:1851547.1.1,1851401.1.1,cut:1850346] equal(skaf82(sk3),nil) | equal(nil,sk3).
% 1851677 [para:1851656.1.1,1850267.1.1.2,cut:1850346] equal(cons(skaf83(sk3),nil),sk3) | equal(nil,sk3).
% 1851731 [para:1851677.1.1,1850255.1.1.1,cut:1850170,cut:1850166] equal(hd(sk3),skaf83(sk3)) | equal(nil,sk3).
% 1851745 [para:1850349.1.2,1851731.1.1.1] equal(hd(sk1),skaf83(sk3)) | equal(nil,sk3).
% 1851748 [para:1851731.1.1,1851412.1.1] equal(skaf83(sk3),sk6) | equal(nil,sk3).
% 1851769 [para:1851745.1.1,1851445.1.1,cut:1851630,cut:1850344] equal(skaf83(sk3),skaf44(sk1)) | equal(nil,sk3).
% 1851779 [para:1851769.1.2,1850259.1.1.1,cut:1851630,cut:1850344] equal(cons(skaf83(sk3),nil),sk1) | equal(nil,sk3).
% 1851882 [para:1851748.1.1,1851779.1.1.1] equal(cons(sk6,nil),sk1) | equal(nil,sk3).
% 1852036 [para:1850408.1.1,1850455.1.1.1] segment^p(app(nil,X),X) | -equal(nil,X) | -ss^list(X).
% 1852239 [para:1850231.1.1,1850302.1.1,cut:1850166] -equal(X,Y) | frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1852286 [para:1851599.1.2,1851629.1.1,cut:1850169] -equal(sk3,X) | -ss^list(X) | singleton^p(X).
% 1854098 [binary:1850349,1852239,cut:1850346,cut:1850344] frontseg^p(sk3,sk1).
% 1857311 [para:1850418.1.1,1850243.1.1,binarycut:1850361] ss^list(app(X,app(X,Y))) | -ss^list(Y) | -ss^list(X).
% 1858363 [para:1850434.1.1,1850331.1.1,cut:1850206,cut:1850207] -equal(X,Y) | segment^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1859544 [para:1850232.1.1,1857311.1.1.2,cut:1850166] ss^list(app(nil,X)) | -ss^list(X).
% 1859597 [binary:1850232,1858363,binarycut:1859544] segment^p(X,app(nil,X)) | -ss^list(X).
% 1859903 [binary:1850285,1852036,binarycut:1859597,binarycut:1859544] equal(X,app(nil,X)) | -equal(nil,X) | -ss^list(X).
% 1872278 [binary:1852286,1859903,cut:1850346,binarydemod:1859544,cut:1850346] singleton^p(app(nil,sk3)) | -equal(nil,sk3).
% 1872392 [para:1850303.1.1,1872278.1.1,cut:1850169,cut:1850158,cut:1850166,cut:1850346] -equal(nil,sk3).
% 1875873 [para:1850358.1.1,1850478.1.2,cut:1851150,cut:1850166,binarycut:1850218,cut:1872392] frontseg^p(cons(sk6,X),sk3) | -ss^list(X).
% 1875877 [para:1851882.1.1,1875873.1.1,cut:1850166,cut:1872392] frontseg^p(sk1,sk3).
% 1875882 [binary:1850287,1875877,cut:1854098,cut:1850346,cut:1850344] equal(sk3,sk1).
% 1875939 [para:1875882.1.1,1851412.1.1.1,cut:1872392] equal(hd(sk1),sk6).
% 1875941 [para:1875882.1.1,1851466.1.1.1.1,demod:1875939,cut:1872392] equal(cons(sk6,nil),sk3).
% 1876034 [para:1875941.1.1,1850319.1.1,cut:1851150,cut:1850166,binarycut:1850229] -member^p(sk3,X) | equal(X,sk6) | -ss^item(X).
% 1876059 [para:1875941.1.1,1850431.1.2.1,demod:1875941,1851426,cut:1851150,cut:1850166] equal(sk3,app(sk3,nil)).
% 1876242 [para:1850349.1.2,1876059.1.2.1] equal(sk3,app(sk1,nil)).
% 1876289 [para:1876242.1.2,1850298.1.1,cut:1850344,cut:1850166] -member^p(sk1,X) | member^p(sk3,X) | -ss^item(X).
% 1879617 [binary:1850351,1876289,cut:1850350] member^p(sk3,sk5).
% 1879618 [binary:1876034,1879617,cut:1850350] equal(sk5,sk6).
% 1879622 [para:1879618.1.2,1851144.1.2,cut:1850352,cut:1872392] 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: 26782
% derived clauses: 2910138
% kept clauses: 769904
% kept size sum: 577686
% kept mid-nuclei: 363384
% kept new demods: 72050
% forw unit-subs: 251473
% forw double-subs: 77727
% forw overdouble-subs: 95605
% backward subs: 3410
% fast unit cutoff: 290161
% full unit cutoff: 262
% dbl unit cutoff: 11663
% real runtime : 381.98
% process. runtime: 379.70
% specific non-discr-tree subsumption statistics:
% tried: 29826875
% length fails: 476441
% strength fails: 6783583
% predlist fails: 5677367
% aux str. fails: 1214773
% by-lit fails: 699379
% full subs tried: 14657157
% full subs fail: 14524290
%
% ; 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/SWC392-1+eq_r.in")
%
%------------------------------------------------------------------------------