TSTP Solution File: SWC219-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC219-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 : art02.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.7s
% Output : Assurance 378.7s
% 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/SWC219-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(206,40,1,412,0,1,54285,4,2232,61749,5,2803,61750,1,2805,61750,50,2808,61750,40,2808,61956,0,2808,142932,3,4211,155268,4,4909,173099,5,5610,173099,5,5612,173099,1,5612,173099,50,5615,173099,40,5615,173305,0,5616,214430,3,6167,226854,4,6442,241138,5,6717,241138,5,6718,241139,1,6718,241139,50,6720,241139,40,6720,241345,0,6720,304230,3,7572,317614,4,7998,334348,5,8421,334349,5,8422,334349,1,8422,334349,50,8424,334349,40,8424,334555,0,8424,392492,3,9275,413103,4,9707,426180,5,10125,426180,5,10127,426181,1,10127,426181,50,10130,426181,40,10130,426387,0,10130,692711,3,14482,781778,4,16694,881265,5,18831,881266,5,18833,881267,1,18833,881267,50,18836,881267,40,18836,881473,0,18836,925238,3,20237,926283,4,20937,933084,5,21637,933085,1,21637,933085,50,21639,933085,40,21639,933291,0,21639,1152501,3,24540,1255007,4,25990,1310657,5,27440,1310658,1,27440,1310658,50,27446,1310658,40,27446,1310864,0,27478,1465166,3,28879,1502004,4,29579,1548229,5,30279,1548229,5,30280,1548230,1,30280,1548230,50,30286,1548230,40,30286,1548436,0,30324,1598501,3,30882,1613906,4,31151,1659737,5,31425,1659737,1,31425,1659737,50,31430,1659737,40,31430,1659943,0,31430,1705416,3,32831,1707807,4,33531,1715184,5,34231,1715185,5,34231,1715185,1,34231,1715185,50,34233,1715185,40,34233,1715391,0,34233,1813196,3,35634,1880783,4,36334,1905916,5,37034,1905918,5,37034,1905919,1,37034,1905919,50,37036,1905919,40,37036,1906125,0,37037)
%
%
% START OF PROOF
% 1905920 [] equal(X,X).
% 1905928 [] ss^list(nil).
% 1905932 [] ss^item(skaf83(X)).
% 1905933 [] ss^list(skaf82(X)).
% 1905967 [] ss^item(skaf44(X)).
% 1905970 [] ss^list(skaf46(X,Y)).
% 1905971 [] ss^list(skaf45(X,Y)).
% 1905978 [] rearseg^p(X,nil) | -ss^list(X).
% 1905979 [] rearseg^p(X,X) | -ss^list(X).
% 1905980 [] frontseg^p(X,nil) | -ss^list(X).
% 1905981 [] frontseg^p(X,X) | -ss^list(X).
% 1905991 [] -member^p(nil,X) | -ss^item(X).
% 1905992 [] -ss^list(X) | ss^item(Y) | duplicatefree^p(X).
% 1905993 [] equal(app(X,nil),X) | -ss^list(X).
% 1905994 [] equal(app(nil,X),X) | -ss^list(X).
% 1906001 [] -equal(nil,X) | rearseg^p(nil,X) | -ss^list(X).
% 1906002 [] -rearseg^p(nil,X) | equal(nil,X) | -ss^list(X).
% 1906005 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 1906006 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 1906016 [] equal(tl(cons(X,Y)),Y) | -ss^item(X) | -ss^list(Y).
% 1906017 [] equal(hd(cons(X,Y)),X) | -ss^item(X) | -ss^list(Y).
% 1906021 [] equal(cons(skaf44(X),nil),X) | -singleton^p(X) | -ss^list(X).
% 1906024 [] equal(cons(hd(X),tl(X)),X) | equal(nil,X) | -ss^list(X).
% 1906029 [] equal(cons(skaf83(X),skaf82(X)),X) | equal(nil,X) | -ss^list(X).
% 1906036 [] -equal(cons(X,nil),Y) | -ss^item(X) | -ss^list(Y) | singleton^p(Y).
% 1906040 [] equal(app(cons(X,nil),Y),cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 1906048 [] -rearseg^p(X,Y) | -rearseg^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 1906051 [] equal(app(skaf46(X,Y),Y),X) | -rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 1906052 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1906053 [] equal(tl(app(X,Y)),app(tl(X),Y)) | equal(nil,X) | -ss^list(Y) | -ss^list(X).
% 1906056 [] rearseg^p(app(X,Y),Z) | -rearseg^p(Y,Z) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 1906057 [] frontseg^p(app(X,Y),Z) | -frontseg^p(X,Z) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 1906058 [] member^p(cons(X,Y),Z) | -equal(Z,X) | -ss^item(Z) | -ss^item(X) | -ss^list(Y).
% 1906060 [] member^p(app(X,Y),Z) | -member^p(X,Z) | -ss^item(Z) | -ss^list(X) | -ss^list(Y).
% 1906063 [] -equal(app(X,Y),Z) | rearseg^p(Z,Y) | -ss^list(Z) | -ss^list(Y) | -ss^list(X).
% 1906064 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 1906065 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 1906070 [] -equal(app(X,Y),app(X,Z)) | equal(Y,Z) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 1906073 [] -rearseg^p(Y,Z) | -rearseg^p(X,Y) | rearseg^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 1906074 [] -frontseg^p(Y,Z) | -frontseg^p(X,Y) | frontseg^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 1906081 [] -member^p(cons(X,Y),Z) | member^p(Y,Z) | equal(Z,X) | -ss^item(Z) | -ss^item(X) | -ss^list(Y).
% 1906099 [] -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).
% 1906106 [] ss^list(sk1).
% 1906108 [] ss^list(sk3).
% 1906111 [] equal(sk1,sk3).
% 1906112 [] -equal(nil,sk1).
% 1906114 [] -equal(app(app(X,cons(Y,nil)),Z),sk1) | member^p(X,sk5(Z,X,Y)) | -ss^item(Y) | -ss^list(Z) | -ss^list(X).
% 1906119 [] equal(nil,sk3) | ss^item(sk6).
% 1906123 [] equal(cons(sk6,nil),sk3) | equal(nil,sk3).
% 1906131 [input:1906005,factor] ss^list(app(X,X)) | -ss^list(X).
% 1906153 [input:1906053,factor] equal(tl(app(X,X)),app(tl(X),X)) | equal(nil,X) | -ss^list(X).
% 1906155 [input:1906056,factor:binarycut:1905979] rearseg^p(app(X,Y),Y) | -ss^list(Y) | -ss^list(X).
% 1906159 [input:1906056,factor:factor:factor:factor:binarycut:1905979] rearseg^p(app(X,X),X) | -ss^list(X).
% 1906161 [input:1906057,factor:binarycut:1905981] frontseg^p(app(X,Y),X) | -ss^list(X) | -ss^list(Y).
% 1906165 [input:1906057,factor:factor:factor:factor:binarycut:1905981] frontseg^p(app(X,X),X) | -ss^list(X).
% 1906166 [input:1906058,factor:cut:1905920] member^p(cons(X,Y),X) | -ss^item(X) | -ss^list(Y).
% 1906168 [input:1906060,factor] member^p(app(X,X),Y) | -member^p(X,Y) | -ss^item(Y) | -ss^list(X).
% 1906258 [input:1906099,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).
% 1906905 [para:1906111.1.2,1906119.1.2,cut:1906112] ss^item(sk6).
% 1907096 [binary:1905992,1906131] duplicatefree^p(app(X,X)) | -ss^list(X) | ss^item(Y).
% 1907130 [para:1906123.1.1,1906016.1.1.1,cut:1906905,cut:1905928] equal(tl(sk3),nil) | equal(nil,sk3).
% 1907143 [para:1906111.1.2,1907130.1.1.1] equal(tl(sk1),nil) | equal(nil,sk3).
% 1907181 [para:1906021.1.1,1906114.1.1.1.2,cut:1905967] -equal(app(app(X,Y),Z),sk1) | member^p(X,sk5(Z,X,skaf44(Y))) | -singleton^p(Y) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 1907202 [para:1906021.1.1,1906017.1.1.1,cut:1905967,cut:1905928] equal(hd(X),skaf44(X)) | -singleton^p(X) | -ss^list(X).
% 1907229 [para:1906021.1.1,1906166.1.1,cut:1905967,cut:1905928] member^p(X,skaf44(X)) | -singleton^p(X) | -ss^list(X).
% 1907243 [para:1907143.1.1,1906024.1.1.2,cut:1906112,cut:1906106] equal(cons(hd(sk1),nil),sk1) | equal(nil,sk3).
% 1907323 [para:1906029.1.1,1906016.1.1.1,cut:1905932,cut:1905933] equal(tl(X),skaf82(X)) | equal(nil,X) | -ss^list(X).
% 1907326 [para:1906029.1.1,1906166.1.1,cut:1905932,cut:1905933] member^p(X,skaf83(X)) | equal(nil,X) | -ss^list(X).
% 1907396 [binary:1906123,1906036,cut:1906905,cut:1906108] equal(nil,sk3) | singleton^p(sk3).
% 1907414 [para:1906111.1.2,1907396.1.2,cut:1906112] singleton^p(sk3).
% 1907415 [para:1906111.1.2,1907414.1.1] singleton^p(sk1).
% 1907467 [para:1907323.1.1,1907130.1.1,cut:1906108] equal(skaf82(sk3),nil) | equal(nil,sk3).
% 1907468 [para:1907130.1.1,1907323.1.1,cut:1906108] equal(nil,skaf82(sk3)) | equal(nil,sk3).
% 1907489 [para:1907467.1.1,1906029.1.1.2,cut:1906108] equal(cons(skaf83(sk3),nil),sk3) | equal(nil,sk3).
% 1907495 [binary:1906001,1907468,cut:1905933] rearseg^p(nil,skaf82(sk3)) | equal(nil,sk3).
% 1907597 [para:1907489.1.1,1906017.1.1.1,cut:1905932,cut:1905928] equal(hd(sk3),skaf83(sk3)) | equal(nil,sk3).
% 1907598 [para:1907489.1.1,1906166.1.1,cut:1905932,cut:1905928] member^p(sk3,skaf83(sk3)) | equal(nil,sk3).
% 1907605 [para:1906111.1.2,1907598.1.2.1] member^p(sk3,skaf83(sk1)) | equal(nil,sk3).
% 1907611 [para:1906111.1.2,1907597.1.1.1] equal(hd(sk1),skaf83(sk3)) | equal(nil,sk3).
% 1907646 [para:1906051.1.1,1905993.1.1,cut:1905928,cut:1905970,binarycut:1905978] equal(X,skaf46(X,nil)) | -ss^list(X).
% 1907648 [para:1905993.1.1,1906051.1.1,cut:1905928,cut:1905970,binarycut:1905978] equal(skaf46(X,nil),X) | -ss^list(X).
% 1907689 [para:1906052.1.1,1905994.1.1,cut:1905928,cut:1905971,binarycut:1905980] equal(X,skaf45(X,nil)) | -ss^list(X).
% 1907691 [para:1905994.1.1,1906052.1.1,cut:1905928,cut:1905971,binarycut:1905980] equal(skaf45(X,nil),X) | -ss^list(X).
% 1907730 [para:1907611.1.1,1907243.1.1.1] equal(cons(skaf83(sk3),nil),sk1) | equal(nil,sk3).
% 1907763 [para:1905993.1.1,1906056.1.1,cut:1905928] -rearseg^p(nil,X) | rearseg^p(Y,X) | -ss^list(X) | -ss^list(Y).
% 1907867 [binary:1907495,1907763,cut:1905933] equal(nil,sk3) | rearseg^p(X,skaf82(sk3)) | -ss^list(X).
% 1907884 [para:1906111.1.2,1907867.1.2,cut:1906112] rearseg^p(X,skaf82(sk3)) | -ss^list(X).
% 1907887 [binary:1906002,1907884,cut:1905928,cut:1905933] equal(nil,skaf82(sk3)).
% 1907888 [para:1906111.1.2,1907887.1.2.1] equal(nil,skaf82(sk1)).
% 1907896 [para:1907888.1.2,1906029.1.1.2,cut:1906112,cut:1906106] equal(cons(skaf83(sk1),nil),sk1).
% 1907908 [para:1907896.1.1,1906016.1.1.1,cut:1905932,cut:1905928] equal(tl(sk1),nil).
% 1907909 [para:1907896.1.1,1906017.1.1.1,cut:1905932,cut:1905928] equal(hd(sk1),skaf83(sk1)).
% 1907912 [para:1907896.1.1,1906040.1.1.1,cut:1905932] equal(app(sk1,X),cons(skaf83(sk1),X)) | -ss^list(X).
% 1907927 [para:1907909.1.1,1907202.1.1,cut:1907415,cut:1906106] equal(skaf83(sk1),skaf44(sk1)).
% 1907946 [para:1905994.1.1,1906063.1.1,cut:1905928] -equal(X,Y) | rearseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1908047 [binary:1906111,1907946,cut:1906108,cut:1906106] rearseg^p(sk3,sk1).
% 1908090 [binary:1907646,1907946,cut:1905970] rearseg^p(skaf46(X,nil),X) | -ss^list(X).
% 1908091 [binary:1907648,1907946,cut:1905970] rearseg^p(X,skaf46(X,nil)) | -ss^list(X).
% 1908096 [binary:1907689,1907946,cut:1905971] rearseg^p(skaf45(X,nil),X) | -ss^list(X).
% 1908097 [binary:1907691,1907946,cut:1905971] rearseg^p(X,skaf45(X,nil)) | -ss^list(X).
% 1908367 [para:1907912.1.2,1906006.1.1,cut:1905932] ss^list(app(sk1,X)) | -ss^list(X).
% 1908369 [para:1907912.1.2,1906016.1.1.1,cut:1905932] equal(tl(app(sk1,X)),X) | -ss^list(X).
% 1908373 [para:1907912.1.2,1906029.1.1,demod:1907888,cut:1905928,cut:1906112,cut:1906106] equal(app(sk1,nil),sk1).
% 1908418 [binary:1906052,1906070,cut:1905971,factor:binarycut:1906165,binarycut:1906131] equal(skaf45(app(X,X),X),X) | -ss^list(X).
% 1908446 [para:1908373.1.1,1906155.1.1,cut:1905928,cut:1906106] rearseg^p(sk1,nil).
% 1908449 [para:1908373.1.1,1906064.1.1,cut:1906106,cut:1905928] -equal(sk1,X) | frontseg^p(X,sk1) | -ss^list(X).
% 1908453 [binary:1906048,1908446,cut:1906112,cut:1905928,cut:1906106] -rearseg^p(nil,sk1).
% 1908549 [binary:1908047,1906073,cut:1906108,cut:1906106] -rearseg^p(X,sk3) | rearseg^p(X,sk1) | -ss^list(X).
% 1908613 [binary:1906111,1908449,cut:1906108] frontseg^p(sk3,sk1).
% 1908617 [binary:1906074,1908613,cut:1906108,cut:1906106] -frontseg^p(X,sk3) | frontseg^p(X,sk1) | -ss^list(X).
% 1908870 [binary:1906159,1908549,cut:1906108,binarydemod:1906131,cut:1906108] rearseg^p(app(sk3,sk3),sk1).
% 1908873 [binary:1908090,1908549,cut:1905970,cut:1906108] rearseg^p(skaf46(sk3,nil),sk1).
% 1908874 [binary:1908096,1908549,cut:1905971,cut:1906108] rearseg^p(skaf45(sk3,nil),sk1).
% 1908879 [para:1906065.1.1,1908870.1.1,cut:1908453,cut:1906108] -equal(nil,sk3).
% 1908885 [para:1906111.1.2,1908874.1.1.1] rearseg^p(skaf45(sk1,nil),sk1).
% 1908892 [para:1906123.1.1,1906081.1.1,cut:1906905,cut:1905928,cut:1908879,binarycut:1905991] -member^p(sk3,X) | equal(X,sk6) | -ss^item(X).
% 1908959 [binary:1906048,1908885,cut:1906106,cut:1905971,binarydemod:1908097,cut:1906106] equal(sk1,skaf45(sk1,nil)).
% 1908999 [para:1908959.1.2,1906052.1.1.2,cut:1906106,cut:1905928] equal(app(nil,sk1),sk1) | -frontseg^p(sk1,nil).
% 1909002 [binary:1906165,1908617,cut:1906108,binarydemod:1906131,cut:1906108] frontseg^p(app(sk3,sk3),sk1).
% 1909005 [para:1906111.1.2,1909002.1.1.1] frontseg^p(app(sk1,sk3),sk1).
% 1909099 [binary:1907229,1908892,cut:1905967,cut:1907414,cut:1906108] equal(skaf44(sk3),sk6).
% 1909100 [binary:1907326,1908892,cut:1905932,cut:1908879,cut:1906108] equal(skaf83(sk3),sk6).
% 1909101 [binary:1907605,1908892,cut:1905932,cut:1908879] equal(skaf83(sk1),sk6).
% 1909102 [para:1909099.1.1,1906021.1.1.1,cut:1907414,cut:1906108] equal(cons(sk6,nil),sk3).
% 1909140 [para:1909100.1.1,1907730.1.1.1,demod:1909102,cut:1908879] equal(sk3,sk1).
% 1909141 [binary:1907946,1909140,cut:1906106,cut:1906108] rearseg^p(sk1,sk3).
% 1909142 [binary:1906073,1909141,cut:1906106,cut:1906108] -rearseg^p(X,sk1) | rearseg^p(X,sk3) | -ss^list(X).
% 1909144 [para:1909101.1.1,1907912.1.2.1] equal(app(sk1,X),cons(sk6,X)) | -ss^list(X).
% 1909154 [para:1909102.1.1,1906040.1.1.1,cut:1906905] equal(app(sk3,X),cons(sk6,X)) | -ss^list(X).
% 1909389 [binary:1908873,1909142,cut:1905970] rearseg^p(skaf46(sk3,nil),sk3).
% 1909646 [binary:1906048,1909389,cut:1906108,cut:1905970,binarydemod:1908091,cut:1906108] equal(sk3,skaf46(sk3,nil)).
% 1909655 [para:1909646.1.2,1906051.1.1.1,cut:1906108,cut:1905928] equal(app(sk3,nil),sk3) | -rearseg^p(sk3,nil).
% 1912417 [para:1909655.1.1,1906161.1.1,cut:1906108,cut:1905928] -rearseg^p(sk3,nil) | frontseg^p(sk3,sk3).
% 1912428 [para:1906111.1.2,1912417.1.1,cut:1908446] frontseg^p(sk3,sk3).
% 1912429 [para:1906111.1.2,1912428.1.1] frontseg^p(sk1,sk3).
% 1912448 [binary:1906074,1912429,cut:1906106,cut:1906108] -frontseg^p(X,sk1) | frontseg^p(X,sk3) | -ss^list(X).
% 1912451 [binary:1906165,1912448,cut:1906106,binarydemod:1908367,cut:1906106] frontseg^p(app(sk1,sk1),sk3).
% 1912458 [binary:1909005,1912448,binarydemod:1908367,cut:1906108] frontseg^p(app(sk1,sk3),sk3).
% 1912675 [para:1906153.1.1,1908369.1.1,demod:1907908,cut:1906112,cut:1906106] equal(app(nil,sk1),sk1).
% 1912677 [para:1912675.1.1,1906161.1.1,cut:1905928,cut:1906106] frontseg^p(sk1,nil).
% 1917017 [para:1909144.1.1,1906131.1.1,cut:1906106] ss^list(cons(sk6,sk1)).
% 1917020 [para:1909144.1.1,1906165.1.1,cut:1906106] frontseg^p(cons(sk6,sk1),sk1).
% 1917021 [para:1909144.1.1,1907096.1.1,cut:1906106] duplicatefree^p(cons(sk6,sk1)) | ss^item(X).
% 1917089 [para:1909144.1.1,1912451.1.1,cut:1906106] frontseg^p(cons(sk6,sk1),sk3).
% 1917090 [para:1909144.1.1,1912458.1.1,cut:1906108] frontseg^p(cons(sk6,sk3),sk3).
% 1917354 [para:1907243.1.1,1906258.1.1.1.2,demod:1909102,1909101,1907909,1912675,cut:1906905,cut:1905928,cut:1908879] -equal(app(sk1,sk3),X) | -ss^list(X) | -duplicatefree^p(X).
% 1921930 [para:1909154.1.1,1906131.1.1,cut:1906108] ss^list(cons(sk6,sk3)).
% 1921966 [para:1909154.1.1,1908418.1.1.1,cut:1906108] equal(skaf45(cons(sk6,sk3),sk3),sk3).
% 1922290 [para:1906111.1.2,1921966.1.1.1.2] equal(skaf45(cons(sk6,sk1),sk3),sk3).
% 1922291 [para:1906111.1.2,1921966.1.1.2] equal(skaf45(cons(sk6,sk3),sk1),sk3).
% 1922292 [para:1921966.1.1,1906052.1.1.2,cut:1917090,cut:1921930,cut:1906108] equal(app(sk3,sk3),cons(sk6,sk3)).
% 1922685 [para:1922290.1.1,1906052.1.1.2,demod:1922292,cut:1917089,cut:1917017,cut:1906108] equal(cons(sk6,sk3),cons(sk6,sk1)).
% 1922686 [para:1922291.1.1,1906052.1.1.2,demod:1922685,cut:1917020,cut:1917017,cut:1906106] equal(app(sk1,sk3),cons(sk6,sk1)).
% 1925323 [binary:1905920,1917354,demod:1922686,cut:1917017,binarydemod:1917021] ss^item(X).
% 1931707 [para:1906065.1.1,1906168.1.1,binarycut:1905991,cut:1925323] -equal(nil,X) | -member^p(X,Y) | -ss^list(X).
% 1931708 [binary:1905920,1931707,cut:1905928] -member^p(nil,X).
% 1932349 [para:1908999.1.1,1907181.1.1.1,demod:1909101,1907927,cut:1931708,cut:1907415,cut:1905928,cut:1906106,cut:1912677] -equal(app(sk1,X),sk1) | -ss^list(X).
% 1932387 [para:1905993.1.1,1932349.1.1,cut:1905920,cut:1905928,cut:1906106] 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: 27469
% derived clauses: 2777763
% kept clauses: 754404
% kept size sum: 516323
% kept mid-nuclei: 342830
% kept new demods: 75245
% forw unit-subs: 237301
% forw double-subs: 73097
% forw overdouble-subs: 98206
% backward subs: 1125
% fast unit cutoff: 280262
% full unit cutoff: 423
% dbl unit cutoff: 12056
% real runtime : 380.40
% process. runtime: 378.74
% specific non-discr-tree subsumption statistics:
% tried: 17858469
% length fails: 469307
% strength fails: 3605586
% predlist fails: 8089695
% aux str. fails: 243007
% by-lit fails: 422402
% full subs tried: 4813592
% full subs fail: 4680974
%
% ; 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/SWC219-1+eq_r.in")
%
%------------------------------------------------------------------------------