TSTP Solution File: SWC407-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC407-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.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/SWC407-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,3,59015,4,2313,63075,5,2804,63076,1,2806,63076,50,2809,63076,40,2809,63277,0,2809,132445,3,4210,147296,4,4911,161067,5,5623,161067,5,5625,161068,1,5625,161068,50,5629,161068,40,5629,161269,0,5629,196496,3,6180,201831,4,6458,223097,5,6730,223097,5,6731,223098,1,6731,223098,50,6732,223098,40,6732,223299,0,6732,289465,3,7584,301229,4,8008,324885,5,8433,324886,5,8435,324886,1,8435,324886,50,8438,324886,40,8438,325087,0,8438,385119,3,9290,406116,4,9715,425222,5,10139,425222,5,10141,425222,1,10141,425222,50,10144,425222,40,10144,425423,0,10144,656093,3,14497,735651,4,16673,863905,5,18847,863906,1,18847,863906,50,18850,863906,40,18850,864107,0,18850,906739,3,20251,908105,4,20951,914745,1,21651,914745,50,21652,914745,40,21652,914946,0,21652,1156576,3,24553,1284120,4,26003,1345449,1,27453,1345449,50,27458,1345449,40,27458,1345650,0,27488,1500476,3,28889,1545578,4,29589,1595377,5,30290,1595377,1,30290,1595377,50,30296,1595377,40,30296,1595578,0,30332,1647897,3,30884,1663894,4,31159,1713343,5,31433,1713344,1,31433,1713344,50,31438,1713344,40,31438,1713545,0,31438,1756796,3,32839,1757902,4,33539,1764787,5,34239,1764788,1,34239,1764788,50,34240,1764788,40,34240,1764989,0,34240,1841309,3,35642,1858667,4,36341,1874792,5,37041,1874793,5,37042,1874793,1,37042,1874793,50,37045,1874793,40,37045,1874994,0,37045)
%
%
% START OF PROOF
% 1874794 [] equal(X,X).
% 1874802 [] ss^list(nil).
% 1874805 [] -singleton^p(nil).
% 1874806 [] ss^item(skaf83(X)).
% 1874807 [] ss^list(skaf82(X)).
% 1874841 [] ss^item(skaf44(X)).
% 1874842 [] ss^list(skaf48(X,Y)).
% 1874843 [] ss^list(skaf47(X,Y)).
% 1874844 [] ss^list(skaf46(X,Y)).
% 1874851 [] segment^p(X,X) | -ss^list(X).
% 1874853 [] rearseg^p(X,X) | -ss^list(X).
% 1874854 [] frontseg^p(X,nil) | -ss^list(X).
% 1874865 [] -member^p(nil,X) | -ss^item(X).
% 1874867 [] equal(app(X,nil),X) | -ss^list(X).
% 1874868 [] equal(app(nil,X),X) | -ss^list(X).
% 1874879 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 1874890 [] equal(tl(cons(X,Y)),Y) | -ss^item(X) | -ss^list(Y).
% 1874891 [] equal(hd(cons(X,Y)),X) | -ss^item(X) | -ss^list(Y).
% 1874895 [] equal(cons(skaf44(X),nil),X) | -singleton^p(X) | -ss^list(X).
% 1874898 [] equal(cons(hd(X),tl(X)),X) | equal(nil,X) | -ss^list(X).
% 1874903 [] equal(cons(skaf83(X),skaf82(X)),X) | equal(nil,X) | -ss^list(X).
% 1874910 [] -equal(cons(X,nil),Y) | -ss^item(X) | -ss^list(Y) | singleton^p(Y).
% 1874921 [] -segment^p(X,Y) | -segment^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 1874923 [] -frontseg^p(X,Y) | -frontseg^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 1874925 [] equal(app(skaf46(X,Y),Y),X) | -rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 1874934 [] member^p(app(X,Y),Z) | -member^p(X,Z) | -ss^item(Z) | -ss^list(X) | -ss^list(Y).
% 1874938 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 1874939 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 1874943 [] equal(app(app(X,Y),Z),app(X,app(Y,Z))) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 1874951 [] equal(cons(X,app(Y,Z)),app(cons(X,Y),Z)) | -ss^item(X) | -ss^list(Z) | -ss^list(Y).
% 1874955 [] -member^p(cons(X,Y),Z) | member^p(Y,Z) | equal(Z,X) | -ss^item(Z) | -ss^item(X) | -ss^list(Y).
% 1874962 [] equal(app(app(skaf47(X,Y),Y),skaf48(Y,X)),X) | -segment^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 1874966 [] segment^p(app(app(X,Y),Z),U) | -segment^p(Y,U) | -ss^list(Y) | -ss^list(U) | -ss^list(Z) | -ss^list(X).
% 1874967 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 1874972 [] 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).
% 1874980 [] ss^list(sk1).
% 1874982 [] ss^list(sk3).
% 1874984 [] equal(sk2,sk4).
% 1874985 [] equal(sk1,sk3).
% 1874986 [] ss^item(sk5).
% 1874987 [] member^p(sk1,sk5).
% 1874988 [] -member^p(sk2,sk5).
% 1874990 [] equal(nil,sk3) | ss^item(sk6).
% 1874993 [] equal(cons(sk6,nil),sk3) | equal(nil,sk3).
% 1874994 [] member^p(sk4,sk6) | equal(nil,sk3).
% 1874995 [input:1874879,factor] ss^list(app(X,X)) | -ss^list(X).
% 1875014 [input:1874925,factor:binarycut:1874853] equal(app(skaf46(X,X),X),X) | -ss^list(X).
% 1875042 [input:1874939,factor] equal(app(X,X),nil) | -equal(nil,X) | -ss^list(X).
% 1875052 [input:1874943,factor:factor] equal(app(app(X,X),Y),app(X,app(X,Y))) | -ss^list(X) | -ss^list(Y).
% 1875065 [input:1874951,factor] equal(cons(X,app(Y,Y)),app(cons(X,Y),Y)) | -ss^item(X) | -ss^list(Y).
% 1875068 [input:1874962,factor:binarycut:1874851] equal(app(app(skaf47(X,X),X),skaf48(X,X)),X) | -ss^list(X).
% 1875089 [input:1874966,factor:factor:factor:factor:factor:factor:factor:factor:factor:factor:binarycut:1874851] segment^p(app(app(X,X),X),X) | -ss^list(X).
% 1875112 [input:1874972,factor:cut:1874794] frontseg^p(cons(X,Y),cons(X,Z)) | -frontseg^p(Y,Z) | -ss^item(X) | -ss^list(Y) | -ss^list(Z).
% 1875765 [para:1874990.1.2,1874985.1.2] equal(sk1,nil) | ss^item(sk6).
% 1875769 [?] ?
% 1875774 [para:1874984.1.2,1874994.1.1] member^p(sk2,sk6) | equal(nil,sk3).
% 1875778 [para:1875765.1.1,1874987.1.1,binarycut:1875769] ss^item(sk6).
% 1876015 [para:1874993.1.1,1874890.1.1.1,cut:1875778,cut:1874802] equal(tl(sk3),nil) | equal(nil,sk3).
% 1876027 [para:1874993.1.1,1874891.1.1.1,cut:1875778,cut:1874802] equal(hd(sk3),sk6) | equal(nil,sk3).
% 1876042 [para:1875014.1.1,1874867.1.1,cut:1874802,cut:1874844] equal(nil,skaf46(nil,nil)).
% 1876043 [para:1876042.1.2,1875014.1.1.1,cut:1874802] equal(app(nil,nil),nil).
% 1876060 [para:1874895.1.1,1874891.1.1.1,cut:1874841,cut:1874802] equal(hd(X),skaf44(X)) | -singleton^p(X) | -ss^list(X).
% 1876087 [para:1876015.1.1,1874898.1.1.2,cut:1874982] equal(cons(hd(sk3),nil),sk3) | equal(nil,sk3).
% 1876157 [para:1874903.1.1,1874890.1.1.1,cut:1874806,cut:1874807] equal(tl(X),skaf82(X)) | equal(nil,X) | -ss^list(X).
% 1876209 [para:1874993.1.1,1874910.1.1,cut:1875778] equal(nil,sk3) | -equal(sk3,X) | -ss^list(X) | singleton^p(X).
% 1876210 [binary:1874993,1874910,cut:1875778,cut:1874982] equal(nil,sk3) | singleton^p(sk3).
% 1876219 [para:1876210.1.2,1874985.1.2] equal(sk1,nil) | singleton^p(sk3).
% 1876225 [?] ?
% 1876239 [para:1876219.1.1,1874987.1.1,binarycut:1876225] singleton^p(sk3).
% 1876240 [para:1874985.1.2,1876239.1.1] singleton^p(sk1).
% 1876264 [para:1876157.1.1,1876015.1.1,cut:1874982] equal(skaf82(sk3),nil) | equal(nil,sk3).
% 1876285 [para:1876264.1.1,1874903.1.1.2,cut:1874982] equal(cons(skaf83(sk3),nil),sk3) | equal(nil,sk3).
% 1876345 [para:1876285.1.1,1874891.1.1.1,cut:1874806,cut:1874802] equal(hd(sk3),skaf83(sk3)) | equal(nil,sk3).
% 1876359 [para:1874985.1.2,1876345.1.1.1] equal(hd(sk1),skaf83(sk3)) | equal(nil,sk3).
% 1876362 [para:1876345.1.1,1876027.1.1] equal(skaf83(sk3),sk6) | equal(nil,sk3).
% 1876378 [para:1876359.1.1,1876060.1.1,cut:1876240,cut:1874980] equal(skaf83(sk3),skaf44(sk1)) | equal(nil,sk3).
% 1876393 [para:1876378.1.2,1874895.1.1.1,cut:1876240,cut:1874980] equal(cons(skaf83(sk3),nil),sk1) | equal(nil,sk3).
% 1876496 [para:1876362.1.1,1876393.1.1.1] equal(cons(sk6,nil),sk1) | equal(nil,sk3).
% 1876525 [para:1875042.1.1,1875089.1.1.1] segment^p(app(nil,X),X) | -equal(nil,X) | -ss^list(X).
% 1876539 [para:1876209.1.2,1876239.1.1,cut:1874805] -equal(sk3,X) | -ss^list(X) | singleton^p(X).
% 1876773 [para:1874867.1.1,1874938.1.1,cut:1874802] -equal(X,Y) | frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1876823 [binary:1874985,1876773,cut:1874982,cut:1874980] frontseg^p(sk3,sk1).
% 1881924 [para:1875052.1.1,1874879.1.1,binarycut:1874995] ss^list(app(X,app(X,Y))) | -ss^list(Y) | -ss^list(X).
% 1882972 [para:1875068.1.1,1874967.1.1,cut:1874842,cut:1874843] -equal(X,Y) | segment^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1884142 [para:1874868.1.1,1881924.1.1.2,cut:1874802] ss^list(app(nil,X)) | -ss^list(X).
% 1884222 [binary:1874868,1882972,binarycut:1884142] segment^p(X,app(nil,X)) | -ss^list(X).
% 1884666 [binary:1874921,1876525,binarycut:1884222,binarycut:1884142] equal(X,app(nil,X)) | -equal(nil,X) | -ss^list(X).
% 1897669 [binary:1876539,1884666,cut:1874982,binarydemod:1884142,cut:1874982] singleton^p(app(nil,sk3)) | -equal(nil,sk3).
% 1897795 [para:1874939.1.1,1897669.1.1,cut:1874805,cut:1874794,cut:1874802,cut:1874982] -equal(nil,sk3).
% 1900461 [para:1874993.1.1,1875112.1.2,cut:1875778,cut:1874802,binarycut:1874854,cut:1897795] frontseg^p(cons(sk6,X),sk3) | -ss^list(X).
% 1900465 [para:1876496.1.1,1900461.1.1,cut:1874802,cut:1897795] frontseg^p(sk1,sk3).
% 1900470 [binary:1874923,1900465,cut:1876823,cut:1874982,cut:1874980] equal(sk3,sk1).
% 1900518 [para:1900470.1.1,1876027.1.1.1,cut:1897795] equal(hd(sk1),sk6).
% 1900520 [para:1900470.1.1,1876087.1.1.1.1,demod:1900518,cut:1897795] equal(cons(sk6,nil),sk3).
% 1900654 [para:1900520.1.1,1874955.1.1,cut:1875778,cut:1874802,binarycut:1874865] -member^p(sk3,X) | equal(X,sk6) | -ss^item(X).
% 1900679 [para:1900520.1.1,1875065.1.2.1,demod:1900520,1876043,cut:1875778,cut:1874802] equal(sk3,app(sk3,nil)).
% 1900876 [para:1874985.1.2,1900679.1.2.1] equal(sk3,app(sk1,nil)).
% 1902311 [para:1900876.1.2,1874934.1.1,cut:1874980,cut:1874802] -member^p(sk1,X) | member^p(sk3,X) | -ss^item(X).
% 1904347 [binary:1874987,1902311,cut:1874986] member^p(sk3,sk5).
% 1904348 [binary:1900654,1904347,cut:1874986] equal(sk5,sk6).
% 1904352 [para:1904348.1.2,1875774.1.2,cut:1874988,cut:1897795] 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: 27545
% derived clauses: 2918930
% kept clauses: 772327
% kept size sum: 579556
% kept mid-nuclei: 361676
% kept new demods: 72185
% forw unit-subs: 256122
% forw double-subs: 81576
% forw overdouble-subs: 87258
% backward subs: 3076
% fast unit cutoff: 286245
% full unit cutoff: 236
% dbl unit cutoff: 12030
% real runtime : 381.70
% process. runtime: 379.51
% specific non-discr-tree subsumption statistics:
% tried: 22978633
% length fails: 464735
% strength fails: 5018478
% predlist fails: 5614173
% aux str. fails: 845362
% by-lit fails: 549383
% full subs tried: 10227719
% full subs fail: 10107390
%
% ; 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/SWC407-1+eq_r.in")
%
%------------------------------------------------------------------------------