TSTP Solution File: SWC239-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC239-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 377.6s
% Output : Assurance 377.6s
% 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/SWC239-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,2,54285,4,2167,61792,5,2804,61793,1,2806,61793,50,2809,61793,40,2809,61999,0,2809,143002,3,4210,155451,4,4910,173415,5,5634,173415,5,5635,173415,1,5635,173415,50,5639,173415,40,5639,173621,0,5639,215075,3,6190,227996,4,6468,240947,5,6740,240948,5,6741,240949,1,6741,240949,50,6743,240949,40,6743,241155,0,6744,304935,3,7596,320038,4,8020,338303,5,8446,338304,5,8447,338305,1,8447,338305,50,8449,338305,40,8449,338511,0,8449,396935,3,9303,416639,4,9753,428915,5,10150,428916,5,10152,428917,1,10152,428917,50,10155,428917,40,10155,429123,0,10155,702530,3,14506,791975,4,16684,894254,5,18882,894254,5,18884,894255,1,18884,894255,50,18887,894255,40,18887,894461,0,18888,937400,3,20289,938396,4,20989,944630,5,21689,944631,1,21689,944631,50,21690,944631,40,21690,944837,0,21690,1175976,3,24592,1273700,4,26042,1331310,5,27491,1331311,1,27491,1331311,50,27497,1331311,40,27497,1331517,0,27527,1487424,3,28928,1522751,4,29628,1568976,5,30328,1568976,5,30329,1568977,1,30329,1568977,50,30335,1568977,40,30335,1569183,0,30371,1619248,3,30932,1634905,4,31197,1680992,5,31472,1680992,1,31472,1680992,50,31477,1680992,40,31477,1681198,0,31478,1726716,3,32879,1729101,4,33579,1736226,5,34279,1736227,5,34279,1736227,1,34279,1736227,50,34281,1736227,40,34281,1736433,0,34281,1834816,3,35682,1906398,4,36382,1929341,5,37083,1929342,5,37084,1929343,1,37084,1929343,50,37086,1929343,40,37086,1929549,0,37086)
%
%
% START OF PROOF
% 1929344 [] equal(X,X).
% 1929352 [] ss^list(nil).
% 1929356 [] ss^item(skaf83(X)).
% 1929357 [] ss^list(skaf82(X)).
% 1929391 [] ss^item(skaf44(X)).
% 1929394 [] ss^list(skaf46(X,Y)).
% 1929395 [] ss^list(skaf45(X,Y)).
% 1929402 [] rearseg^p(X,nil) | -ss^list(X).
% 1929403 [] rearseg^p(X,X) | -ss^list(X).
% 1929404 [] frontseg^p(X,nil) | -ss^list(X).
% 1929405 [] frontseg^p(X,X) | -ss^list(X).
% 1929415 [] -member^p(nil,X) | -ss^item(X).
% 1929416 [] -ss^list(X) | ss^item(Y) | duplicatefree^p(X).
% 1929417 [] equal(app(X,nil),X) | -ss^list(X).
% 1929418 [] equal(app(nil,X),X) | -ss^list(X).
% 1929425 [] -equal(nil,X) | rearseg^p(nil,X) | -ss^list(X).
% 1929426 [] -rearseg^p(nil,X) | equal(nil,X) | -ss^list(X).
% 1929429 [] ss^list(app(X,Y)) | -ss^list(X) | -ss^list(Y).
% 1929430 [] ss^list(cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 1929440 [] equal(tl(cons(X,Y)),Y) | -ss^item(X) | -ss^list(Y).
% 1929441 [] equal(hd(cons(X,Y)),X) | -ss^item(X) | -ss^list(Y).
% 1929445 [] equal(cons(skaf44(X),nil),X) | -singleton^p(X) | -ss^list(X).
% 1929448 [] equal(cons(hd(X),tl(X)),X) | equal(nil,X) | -ss^list(X).
% 1929453 [] equal(cons(skaf83(X),skaf82(X)),X) | equal(nil,X) | -ss^list(X).
% 1929460 [] -equal(cons(X,nil),Y) | -ss^item(X) | -ss^list(Y) | singleton^p(Y).
% 1929464 [] equal(app(cons(X,nil),Y),cons(X,Y)) | -ss^item(X) | -ss^list(Y).
% 1929472 [] -rearseg^p(X,Y) | -rearseg^p(Y,X) | equal(Y,X) | -ss^list(Y) | -ss^list(X).
% 1929475 [] equal(app(skaf46(X,Y),Y),X) | -rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 1929476 [] equal(app(X,skaf45(Y,X)),Y) | -frontseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1929477 [] equal(tl(app(X,Y)),app(tl(X),Y)) | equal(nil,X) | -ss^list(Y) | -ss^list(X).
% 1929480 [] rearseg^p(app(X,Y),Z) | -rearseg^p(Y,Z) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 1929481 [] frontseg^p(app(X,Y),Z) | -frontseg^p(X,Z) | -ss^list(X) | -ss^list(Z) | -ss^list(Y).
% 1929482 [] member^p(cons(X,Y),Z) | -equal(Z,X) | -ss^item(Z) | -ss^item(X) | -ss^list(Y).
% 1929484 [] member^p(app(X,Y),Z) | -member^p(X,Z) | -ss^item(Z) | -ss^list(X) | -ss^list(Y).
% 1929487 [] -equal(app(X,Y),Z) | rearseg^p(Z,Y) | -ss^list(Z) | -ss^list(Y) | -ss^list(X).
% 1929488 [] -equal(app(X,Y),Z) | frontseg^p(Z,X) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 1929489 [] equal(app(X,Y),nil) | -equal(nil,X) | -equal(nil,Y) | -ss^list(X) | -ss^list(Y).
% 1929494 [] -equal(app(X,Y),app(X,Z)) | equal(Y,Z) | -ss^list(Z) | -ss^list(X) | -ss^list(Y).
% 1929497 [] -rearseg^p(Y,Z) | -rearseg^p(X,Y) | rearseg^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 1929498 [] -frontseg^p(Y,Z) | -frontseg^p(X,Y) | frontseg^p(X,Z) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 1929505 [] -member^p(cons(X,Y),Z) | member^p(Y,Z) | equal(Z,X) | -ss^item(Z) | -ss^item(X) | -ss^list(Y).
% 1929523 [] -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).
% 1929530 [] ss^list(sk1).
% 1929532 [] ss^list(sk3).
% 1929535 [] equal(sk1,sk3).
% 1929536 [] -equal(nil,sk1).
% 1929538 [] -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).
% 1929543 [] equal(nil,sk3) | ss^item(sk6).
% 1929547 [] equal(cons(sk6,nil),sk3) | equal(nil,sk3).
% 1929555 [input:1929429,factor] ss^list(app(X,X)) | -ss^list(X).
% 1929577 [input:1929477,factor] equal(tl(app(X,X)),app(tl(X),X)) | equal(nil,X) | -ss^list(X).
% 1929579 [input:1929480,factor:binarycut:1929403] rearseg^p(app(X,Y),Y) | -ss^list(Y) | -ss^list(X).
% 1929583 [input:1929480,factor:factor:factor:factor:binarycut:1929403] rearseg^p(app(X,X),X) | -ss^list(X).
% 1929585 [input:1929481,factor:binarycut:1929405] frontseg^p(app(X,Y),X) | -ss^list(X) | -ss^list(Y).
% 1929589 [input:1929481,factor:factor:factor:factor:binarycut:1929405] frontseg^p(app(X,X),X) | -ss^list(X).
% 1929590 [input:1929482,factor:cut:1929344] member^p(cons(X,Y),X) | -ss^item(X) | -ss^list(Y).
% 1929592 [input:1929484,factor] member^p(app(X,X),Y) | -member^p(X,Y) | -ss^item(Y) | -ss^list(X).
% 1929682 [input:1929523,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).
% 1930329 [para:1929535.1.2,1929543.1.2,cut:1929536] ss^item(sk6).
% 1930520 [binary:1929416,1929555] duplicatefree^p(app(X,X)) | -ss^list(X) | ss^item(Y).
% 1930554 [para:1929547.1.1,1929440.1.1.1,cut:1930329,cut:1929352] equal(tl(sk3),nil) | equal(nil,sk3).
% 1930567 [para:1929535.1.2,1930554.1.1.1] equal(tl(sk1),nil) | equal(nil,sk3).
% 1930605 [para:1929445.1.1,1929538.1.1.1.2,cut:1929391] -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).
% 1930626 [para:1929445.1.1,1929441.1.1.1,cut:1929391,cut:1929352] equal(hd(X),skaf44(X)) | -singleton^p(X) | -ss^list(X).
% 1930653 [para:1929445.1.1,1929590.1.1,cut:1929391,cut:1929352] member^p(X,skaf44(X)) | -singleton^p(X) | -ss^list(X).
% 1930667 [para:1930567.1.1,1929448.1.1.2,cut:1929536,cut:1929530] equal(cons(hd(sk1),nil),sk1) | equal(nil,sk3).
% 1930747 [para:1929453.1.1,1929440.1.1.1,cut:1929356,cut:1929357] equal(tl(X),skaf82(X)) | equal(nil,X) | -ss^list(X).
% 1930750 [para:1929453.1.1,1929590.1.1,cut:1929356,cut:1929357] member^p(X,skaf83(X)) | equal(nil,X) | -ss^list(X).
% 1930820 [binary:1929547,1929460,cut:1930329,cut:1929532] equal(nil,sk3) | singleton^p(sk3).
% 1930838 [para:1929535.1.2,1930820.1.2,cut:1929536] singleton^p(sk3).
% 1930839 [para:1929535.1.2,1930838.1.1] singleton^p(sk1).
% 1930891 [para:1930747.1.1,1930554.1.1,cut:1929532] equal(skaf82(sk3),nil) | equal(nil,sk3).
% 1930892 [para:1930554.1.1,1930747.1.1,cut:1929532] equal(nil,skaf82(sk3)) | equal(nil,sk3).
% 1930913 [para:1930891.1.1,1929453.1.1.2,cut:1929532] equal(cons(skaf83(sk3),nil),sk3) | equal(nil,sk3).
% 1930919 [binary:1929425,1930892,cut:1929357] rearseg^p(nil,skaf82(sk3)) | equal(nil,sk3).
% 1931021 [para:1930913.1.1,1929441.1.1.1,cut:1929356,cut:1929352] equal(hd(sk3),skaf83(sk3)) | equal(nil,sk3).
% 1931022 [para:1930913.1.1,1929590.1.1,cut:1929356,cut:1929352] member^p(sk3,skaf83(sk3)) | equal(nil,sk3).
% 1931029 [para:1929535.1.2,1931022.1.2.1] member^p(sk3,skaf83(sk1)) | equal(nil,sk3).
% 1931035 [para:1929535.1.2,1931021.1.1.1] equal(hd(sk1),skaf83(sk3)) | equal(nil,sk3).
% 1931070 [para:1929475.1.1,1929417.1.1,cut:1929352,cut:1929394,binarycut:1929402] equal(X,skaf46(X,nil)) | -ss^list(X).
% 1931072 [para:1929417.1.1,1929475.1.1,cut:1929352,cut:1929394,binarycut:1929402] equal(skaf46(X,nil),X) | -ss^list(X).
% 1931113 [para:1929476.1.1,1929418.1.1,cut:1929352,cut:1929395,binarycut:1929404] equal(X,skaf45(X,nil)) | -ss^list(X).
% 1931115 [para:1929418.1.1,1929476.1.1,cut:1929352,cut:1929395,binarycut:1929404] equal(skaf45(X,nil),X) | -ss^list(X).
% 1931154 [para:1931035.1.1,1930667.1.1.1] equal(cons(skaf83(sk3),nil),sk1) | equal(nil,sk3).
% 1931187 [para:1929417.1.1,1929480.1.1,cut:1929352] -rearseg^p(nil,X) | rearseg^p(Y,X) | -ss^list(X) | -ss^list(Y).
% 1931291 [binary:1930919,1931187,cut:1929357] equal(nil,sk3) | rearseg^p(X,skaf82(sk3)) | -ss^list(X).
% 1931308 [para:1929535.1.2,1931291.1.2,cut:1929536] rearseg^p(X,skaf82(sk3)) | -ss^list(X).
% 1931311 [binary:1929426,1931308,cut:1929352,cut:1929357] equal(nil,skaf82(sk3)).
% 1931312 [para:1929535.1.2,1931311.1.2.1] equal(nil,skaf82(sk1)).
% 1931320 [para:1931312.1.2,1929453.1.1.2,cut:1929536,cut:1929530] equal(cons(skaf83(sk1),nil),sk1).
% 1931332 [para:1931320.1.1,1929440.1.1.1,cut:1929356,cut:1929352] equal(tl(sk1),nil).
% 1931333 [para:1931320.1.1,1929441.1.1.1,cut:1929356,cut:1929352] equal(hd(sk1),skaf83(sk1)).
% 1931336 [para:1931320.1.1,1929464.1.1.1,cut:1929356] equal(app(sk1,X),cons(skaf83(sk1),X)) | -ss^list(X).
% 1931351 [para:1931333.1.1,1930626.1.1,cut:1930839,cut:1929530] equal(skaf83(sk1),skaf44(sk1)).
% 1931370 [para:1929418.1.1,1929487.1.1,cut:1929352] -equal(X,Y) | rearseg^p(Y,X) | -ss^list(Y) | -ss^list(X).
% 1931471 [binary:1929535,1931370,cut:1929532,cut:1929530] rearseg^p(sk3,sk1).
% 1931514 [binary:1931070,1931370,cut:1929394] rearseg^p(skaf46(X,nil),X) | -ss^list(X).
% 1931515 [binary:1931072,1931370,cut:1929394] rearseg^p(X,skaf46(X,nil)) | -ss^list(X).
% 1931520 [binary:1931113,1931370,cut:1929395] rearseg^p(skaf45(X,nil),X) | -ss^list(X).
% 1931521 [binary:1931115,1931370,cut:1929395] rearseg^p(X,skaf45(X,nil)) | -ss^list(X).
% 1931791 [para:1931336.1.2,1929430.1.1,cut:1929356] ss^list(app(sk1,X)) | -ss^list(X).
% 1931793 [para:1931336.1.2,1929440.1.1.1,cut:1929356] equal(tl(app(sk1,X)),X) | -ss^list(X).
% 1931797 [para:1931336.1.2,1929453.1.1,demod:1931312,cut:1929352,cut:1929536,cut:1929530] equal(app(sk1,nil),sk1).
% 1931842 [binary:1929476,1929494,cut:1929395,factor:binarycut:1929589,binarycut:1929555] equal(skaf45(app(X,X),X),X) | -ss^list(X).
% 1931870 [para:1931797.1.1,1929579.1.1,cut:1929352,cut:1929530] rearseg^p(sk1,nil).
% 1931873 [para:1931797.1.1,1929488.1.1,cut:1929530,cut:1929352] -equal(sk1,X) | frontseg^p(X,sk1) | -ss^list(X).
% 1931877 [binary:1929472,1931870,cut:1929536,cut:1929352,cut:1929530] -rearseg^p(nil,sk1).
% 1931973 [binary:1931471,1929497,cut:1929532,cut:1929530] -rearseg^p(X,sk3) | rearseg^p(X,sk1) | -ss^list(X).
% 1932037 [binary:1929535,1931873,cut:1929532] frontseg^p(sk3,sk1).
% 1932041 [binary:1929498,1932037,cut:1929532,cut:1929530] -frontseg^p(X,sk3) | frontseg^p(X,sk1) | -ss^list(X).
% 1932294 [binary:1929583,1931973,cut:1929532,binarydemod:1929555,cut:1929532] rearseg^p(app(sk3,sk3),sk1).
% 1932297 [binary:1931514,1931973,cut:1929394,cut:1929532] rearseg^p(skaf46(sk3,nil),sk1).
% 1932298 [binary:1931520,1931973,cut:1929395,cut:1929532] rearseg^p(skaf45(sk3,nil),sk1).
% 1932303 [para:1929489.1.1,1932294.1.1,cut:1931877,cut:1929532] -equal(nil,sk3).
% 1932309 [para:1929535.1.2,1932298.1.1.1] rearseg^p(skaf45(sk1,nil),sk1).
% 1932316 [para:1929547.1.1,1929505.1.1,cut:1930329,cut:1929352,cut:1932303,binarycut:1929415] -member^p(sk3,X) | equal(X,sk6) | -ss^item(X).
% 1932383 [binary:1929472,1932309,cut:1929530,cut:1929395,binarydemod:1931521,cut:1929530] equal(sk1,skaf45(sk1,nil)).
% 1932423 [para:1932383.1.2,1929476.1.1.2,cut:1929530,cut:1929352] equal(app(nil,sk1),sk1) | -frontseg^p(sk1,nil).
% 1932426 [binary:1929589,1932041,cut:1929532,binarydemod:1929555,cut:1929532] frontseg^p(app(sk3,sk3),sk1).
% 1932429 [para:1929535.1.2,1932426.1.1.1] frontseg^p(app(sk1,sk3),sk1).
% 1932523 [binary:1930653,1932316,cut:1929391,cut:1930838,cut:1929532] equal(skaf44(sk3),sk6).
% 1932524 [binary:1930750,1932316,cut:1929356,cut:1932303,cut:1929532] equal(skaf83(sk3),sk6).
% 1932525 [binary:1931029,1932316,cut:1929356,cut:1932303] equal(skaf83(sk1),sk6).
% 1932526 [para:1932523.1.1,1929445.1.1.1,cut:1930838,cut:1929532] equal(cons(sk6,nil),sk3).
% 1932564 [para:1932524.1.1,1931154.1.1.1,demod:1932526,cut:1932303] equal(sk3,sk1).
% 1932565 [binary:1931370,1932564,cut:1929530,cut:1929532] rearseg^p(sk1,sk3).
% 1932566 [binary:1929497,1932565,cut:1929530,cut:1929532] -rearseg^p(X,sk1) | rearseg^p(X,sk3) | -ss^list(X).
% 1932568 [para:1932525.1.1,1931336.1.2.1] equal(app(sk1,X),cons(sk6,X)) | -ss^list(X).
% 1932578 [para:1932526.1.1,1929464.1.1.1,cut:1930329] equal(app(sk3,X),cons(sk6,X)) | -ss^list(X).
% 1932813 [binary:1932297,1932566,cut:1929394] rearseg^p(skaf46(sk3,nil),sk3).
% 1933070 [binary:1929472,1932813,cut:1929532,cut:1929394,binarydemod:1931515,cut:1929532] equal(sk3,skaf46(sk3,nil)).
% 1933079 [para:1933070.1.2,1929475.1.1.1,cut:1929532,cut:1929352] equal(app(sk3,nil),sk3) | -rearseg^p(sk3,nil).
% 1935841 [para:1933079.1.1,1929585.1.1,cut:1929532,cut:1929352] -rearseg^p(sk3,nil) | frontseg^p(sk3,sk3).
% 1935852 [para:1929535.1.2,1935841.1.1,cut:1931870] frontseg^p(sk3,sk3).
% 1935853 [para:1929535.1.2,1935852.1.1] frontseg^p(sk1,sk3).
% 1935872 [binary:1929498,1935853,cut:1929530,cut:1929532] -frontseg^p(X,sk1) | frontseg^p(X,sk3) | -ss^list(X).
% 1935875 [binary:1929589,1935872,cut:1929530,binarydemod:1931791,cut:1929530] frontseg^p(app(sk1,sk1),sk3).
% 1935882 [binary:1932429,1935872,binarydemod:1931791,cut:1929532] frontseg^p(app(sk1,sk3),sk3).
% 1936099 [para:1929577.1.1,1931793.1.1,demod:1931332,cut:1929536,cut:1929530] equal(app(nil,sk1),sk1).
% 1936101 [para:1936099.1.1,1929585.1.1,cut:1929352,cut:1929530] frontseg^p(sk1,nil).
% 1940441 [para:1932568.1.1,1929555.1.1,cut:1929530] ss^list(cons(sk6,sk1)).
% 1940444 [para:1932568.1.1,1929589.1.1,cut:1929530] frontseg^p(cons(sk6,sk1),sk1).
% 1940445 [para:1932568.1.1,1930520.1.1,cut:1929530] duplicatefree^p(cons(sk6,sk1)) | ss^item(X).
% 1940513 [para:1932568.1.1,1935875.1.1,cut:1929530] frontseg^p(cons(sk6,sk1),sk3).
% 1940514 [para:1932568.1.1,1935882.1.1,cut:1929532] frontseg^p(cons(sk6,sk3),sk3).
% 1940778 [para:1930667.1.1,1929682.1.1.1.2,demod:1932526,1932525,1931333,1936099,cut:1930329,cut:1929352,cut:1932303] -equal(app(sk1,sk3),X) | -ss^list(X) | -duplicatefree^p(X).
% 1945354 [para:1932578.1.1,1929555.1.1,cut:1929532] ss^list(cons(sk6,sk3)).
% 1945390 [para:1932578.1.1,1931842.1.1.1,cut:1929532] equal(skaf45(cons(sk6,sk3),sk3),sk3).
% 1945714 [para:1929535.1.2,1945390.1.1.1.2] equal(skaf45(cons(sk6,sk1),sk3),sk3).
% 1945715 [para:1929535.1.2,1945390.1.1.2] equal(skaf45(cons(sk6,sk3),sk1),sk3).
% 1945716 [para:1945390.1.1,1929476.1.1.2,cut:1940514,cut:1945354,cut:1929532] equal(app(sk3,sk3),cons(sk6,sk3)).
% 1946109 [para:1945714.1.1,1929476.1.1.2,demod:1945716,cut:1940513,cut:1940441,cut:1929532] equal(cons(sk6,sk3),cons(sk6,sk1)).
% 1946110 [para:1945715.1.1,1929476.1.1.2,demod:1946109,cut:1940444,cut:1940441,cut:1929530] equal(app(sk1,sk3),cons(sk6,sk1)).
% 1948747 [binary:1929344,1940778,demod:1946110,cut:1940441,binarydemod:1940445] ss^item(X).
% 1955131 [para:1929489.1.1,1929592.1.1,binarycut:1929415,cut:1948747] -equal(nil,X) | -member^p(X,Y) | -ss^list(X).
% 1955132 [binary:1929344,1955131,cut:1929352] -member^p(nil,X).
% 1955785 [para:1932423.1.1,1930605.1.1.1,demod:1932525,1931351,cut:1955132,cut:1930839,cut:1929352,cut:1929530,cut:1936101] -equal(app(sk1,X),sk1) | -ss^list(X).
% 1955823 [para:1929417.1.1,1955785.1.1,cut:1929344,cut:1929352,cut:1929530] 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: 27596
% derived clauses: 2829871
% kept clauses: 753223
% kept size sum: 516622
% kept mid-nuclei: 343122
% kept new demods: 75236
% forw unit-subs: 236977
% forw double-subs: 72583
% forw overdouble-subs: 98658
% backward subs: 1126
% fast unit cutoff: 279938
% full unit cutoff: 423
% dbl unit cutoff: 12127
% real runtime : 382.8
% process. runtime: 379.29
% specific non-discr-tree subsumption statistics:
% tried: 18024512
% length fails: 469534
% strength fails: 3620901
% predlist fails: 8169943
% aux str. fails: 256201
% by-lit fails: 432672
% full subs tried: 4858958
% full subs fail: 4725973
%
% ; 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/SWC239-1+eq_r.in")
%
%------------------------------------------------------------------------------