%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC343+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:03:33 PM UTC 2026
% Result : Theorem 1.26s 0.92s
% Output : Refutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 13
% Syntax : Number of formulae : 103 ( 17 unt; 12 def)
% Number of atoms : 488 ( 105 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 643 ( 258 ~; 254 |; 106 &)
% ( 7 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 6 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 163 ( 0 sgn 118 !; 45 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ strictorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& lt(X7,X5) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( ? [X9] :
( ssList(X9)
& app(X0,X9) = X1
& ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(cons(X10,nil),X11) != X9
| ! [X12] :
( ssItem(X12)
=> ! [X13] :
( ssList(X13)
=> ( app(X13,cons(X12,nil)) != X0
| ~ lt(X12,X10) ) ) ) ) ) )
& strictorderedP(X0) )
& ( nil != X0
| nil = X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ strictorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& lt(X7,X5) ) ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( ? [X9] :
( ssList(X9)
& app(X0,X9) = X1
& ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(cons(X10,nil),X11) != X9
| ! [X12] :
( ssItem(X12)
=> ! [X13] :
( ssList(X13)
=> ( app(X13,cons(X12,nil)) != X0
| ~ lt(X12,X10) ) ) ) ) ) )
& strictorderedP(X0) )
& ( nil != X0
| nil = X1 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( app(X2,X4) = X3
& strictorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) ) ) ) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ! [X9] :
( ~ ssList(X9)
| app(X0,X9) != X1
| ? [X10] :
( ? [X11] :
( app(cons(X10,nil),X11) = X9
& ? [X12] :
( ? [X13] :
( app(X13,cons(X12,nil)) = X0
& lt(X12,X10)
& ssList(X13) )
& ssItem(X12) )
& ssList(X11) )
& ssItem(X10) )
| ~ strictorderedP(X0) )
| ( nil = X0
& nil != X1 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( app(X2,X4) = X3
& strictorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) ) ) ) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ! [X9] :
( ~ ssList(X9)
| app(X0,X9) != X1
| ? [X10] :
( ? [X11] :
( app(cons(X10,nil),X11) = X9
& ? [X12] :
( ? [X13] :
( app(X13,cons(X12,nil)) = X0
& lt(X12,X10)
& ssList(X13) )
& ssItem(X12) )
& ssList(X11) )
& ssItem(X10) )
| ~ strictorderedP(X0) )
| ( nil = X0
& nil != X1 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f132,definition,
! [X1,X0] :
( ! [X9] :
( ~ ssList(X9)
| app(X0,X9) != X1
| ? [X10] :
( ? [X11] :
( app(cons(X10,nil),X11) = X9
& ? [X12] :
( ? [X13] :
( app(X13,cons(X12,nil)) = X0
& lt(X12,X10)
& ssList(X13) )
& ssItem(X12) )
& ssList(X11) )
& ssItem(X10) )
| ~ strictorderedP(X0) )
| ~ sP0(X1,X0) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f133,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( app(X2,X4) = X3
& strictorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ lt(X7,X5) ) ) ) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( sP0(X1,X0)
| ( nil = X0
& nil != X1 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f132]) ).
fof(f134,plain,
! [X1,X0] :
( ! [X9] :
( ~ ssList(X9)
| app(X0,X9) != X1
| ? [X10] :
( ? [X11] :
( app(cons(X10,nil),X11) = X9
& ? [X12] :
( ? [X13] :
( app(X13,cons(X12,nil)) = X0
& lt(X12,X10)
& ssList(X13) )
& ssItem(X12) )
& ssList(X11) )
& ssItem(X10) )
| ~ strictorderedP(X0) )
| ~ sP0(X1,X0) ),
inference(nnf_transformation,[],[f132]) ).
fof(f135,plain,
! [X0,X1] :
( ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0
| ? [X3] :
( ? [X4] :
( app(cons(X3,nil),X4) = X2
& ? [X5] :
( ? [X6] :
( app(X6,cons(X5,nil)) = X1
& lt(X5,X3)
& ssList(X6) )
& ssItem(X5) )
& ssList(X4) )
& ssItem(X3) )
| ~ strictorderedP(X1) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f134]) ).
fof(f136,plain,
! [X0,X1] :
( ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0
| ( app(cons(sK1(X1,X2),nil),sK2(X1,X2)) = X2
& app(sK4(X1,X2),cons(sK3(X1,X2),nil)) = X1
& lt(sK3(X1,X2),sK1(X1,X2))
& ssList(sK4(X1,X2))
& ssItem(sK3(X1,X2))
& ssList(sK2(X1,X2))
& ssItem(sK1(X1,X2)) )
| ~ strictorderedP(X1) )
| ~ sP0(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4]),skolemize(X3,sK1(X1,X2)),skolemize(X4,sK2(X1,X2)),skolemize(X5,sK3(X1,X2)),skolemize(X6,sK4(X1,X2))],[f135]) ).
fof(f137,plain,
( sK6 = sK8
& sK5 = sK7
& sK8 = app(sK7,sK9)
& strictorderedP(sK7)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != sK9
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK7
| ~ lt(X7,X5) ) ) ) )
& ssList(sK9)
& ( nil = sK8
| nil != sK7 )
& ( sP0(sK6,sK5)
| ( nil = sK5
& nil != sK6 ) )
& ssList(sK8)
& ssList(sK7)
& ssList(sK6)
& ssList(sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8,sK9]),skolemize(X0,sK5),skolemize(X1,sK6),skolemize(X2,sK7),skolemize(X3,sK8),skolemize(X4,sK9)],[f133]) ).
fof(f149,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| app(X1,X2) != X0
| ssItem(sK1(X1,X2))
| ~ strictorderedP(X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
fof(f150,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| app(X1,X2) != X0
| ssList(sK2(X1,X2))
| ~ strictorderedP(X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
fof(f151,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| app(X1,X2) != X0
| ssItem(sK3(X1,X2))
| ~ strictorderedP(X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
fof(f152,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| app(X1,X2) != X0
| ssList(sK4(X1,X2))
| ~ strictorderedP(X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
fof(f153,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| app(X1,X2) != X0
| lt(sK3(X1,X2),sK1(X1,X2))
| ~ strictorderedP(X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
fof(f154,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| app(X1,X2) != X0
| app(sK4(X1,X2),cons(sK3(X1,X2),nil)) = X1
| ~ strictorderedP(X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
fof(f155,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| app(X1,X2) != X0
| app(cons(sK1(X1,X2),nil),sK2(X1,X2)) = X2
| ~ strictorderedP(X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
fof(f160,plain,
( sP0(sK6,sK5)
| nil != sK6 ),
inference(cnf_transformation,[],[f137]) ).
fof(f161,plain,
( sP0(sK6,sK5)
| nil = sK5 ),
inference(cnf_transformation,[],[f137]) ).
fof(f162,plain,
( nil = sK8
| nil != sK7 ),
inference(cnf_transformation,[],[f137]) ).
fof(f163,plain,
ssList(sK9),
inference(cnf_transformation,[],[f137]) ).
fof(f164,plain,
! [X8,X6,X7,X5] :
( ~ ssItem(X5)
| ~ ssList(X6)
| app(cons(X5,nil),X6) != sK9
| ~ ssItem(X7)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK7
| ~ lt(X7,X5) ),
inference(cnf_transformation,[],[f137]) ).
fof(f165,plain,
strictorderedP(sK7),
inference(cnf_transformation,[],[f137]) ).
fof(f166,plain,
sK8 = app(sK7,sK9),
inference(cnf_transformation,[],[f137]) ).
fof(f167,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f137]) ).
fof(f168,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f137]) ).
fof(f215,plain,
( sP0(sK8,sK7)
| nil = sK7 ),
inference(definition_unfolding,[],[f161,f168,f167,f167]) ).
fof(f216,plain,
( sP0(sK8,sK7)
| nil != sK8 ),
inference(definition_unfolding,[],[f160,f168,f167,f168]) ).
fof(f219,definition,
~ sP19(sK9),
introduced(definition,[new_symbols(definition,[sP19])],[inequality_splitting_name_introduction]) ).
fof(f220,definition,
~ sP20(sK7),
introduced(definition,[new_symbols(definition,[sP20])],[inequality_splitting_name_introduction]) ).
fof(f221,plain,
! [X8,X6,X7,X5] :
( ~ ssItem(X5)
| ~ ssList(X6)
| sP19(app(cons(X5,nil),X6))
| ~ ssItem(X7)
| ~ ssList(X8)
| sP20(app(X8,cons(X7,nil)))
| ~ lt(X7,X5) ),
inference(inequality_splitting,[],[f164,f220,f219]) ).
fof(f222,definition,
~ sP21(nil),
introduced(definition,[new_symbols(definition,[sP21])],[inequality_splitting_name_introduction]) ).
fof(f223,plain,
( nil = sK8
| sP21(sK7) ),
inference(inequality_splitting,[],[f162,f222]) ).
fof(f224,definition,
~ sP22(nil),
introduced(definition,[new_symbols(definition,[sP22])],[inequality_splitting_name_introduction]) ).
fof(f225,plain,
( sP0(sK8,sK7)
| sP22(sK8) ),
inference(inequality_splitting,[],[f216,f224]) ).
fof(f241,plain,
! [X2,X1] :
( app(cons(sK1(X1,X2),nil),sK2(X1,X2)) = X2
| ~ ssList(X2)
| ~ strictorderedP(X1)
| ~ sP0(app(X1,X2),X1) ),
inference(equality_resolution,[],[f155]) ).
fof(f242,plain,
! [X2,X1] :
( app(sK4(X1,X2),cons(sK3(X1,X2),nil)) = X1
| ~ ssList(X2)
| ~ strictorderedP(X1)
| ~ sP0(app(X1,X2),X1) ),
inference(equality_resolution,[],[f154]) ).
fof(f243,plain,
! [X2,X1] :
( lt(sK3(X1,X2),sK1(X1,X2))
| ~ ssList(X2)
| ~ strictorderedP(X1)
| ~ sP0(app(X1,X2),X1) ),
inference(equality_resolution,[],[f153]) ).
fof(f244,plain,
! [X2,X1] :
( ~ sP0(app(X1,X2),X1)
| ssList(sK4(X1,X2))
| ~ strictorderedP(X1)
| ~ ssList(X2) ),
inference(equality_resolution,[],[f152]) ).
fof(f245,plain,
! [X2,X1] :
( ~ sP0(app(X1,X2),X1)
| ssItem(sK3(X1,X2))
| ~ strictorderedP(X1)
| ~ ssList(X2) ),
inference(equality_resolution,[],[f151]) ).
fof(f246,plain,
! [X2,X1] :
( ~ sP0(app(X1,X2),X1)
| ssList(sK2(X1,X2))
| ~ strictorderedP(X1)
| ~ ssList(X2) ),
inference(equality_resolution,[],[f150]) ).
fof(f247,plain,
! [X2,X1] :
( ~ sP0(app(X1,X2),X1)
| ssItem(sK1(X1,X2))
| ~ strictorderedP(X1)
| ~ ssList(X2) ),
inference(equality_resolution,[],[f149]) ).
fof(f250,plain,
! [X8,X7] :
( sP20(app(X8,cons(X7,nil)))
| ~ ssList(X8)
| sP31(X7) ),
inference(cnf_transformation,[],[f250_D]) ).
fof(f250_D,definition,
! [X7] :
( ! [X8] :
( sP20(app(X8,cons(X7,nil)))
| ~ ssList(X8) )
<=> ~ sP31(X7) ),
introduced(definition,[new_symbols(definition,[sP31])],[general_splitting_component_introduction]) ).
fof(f251,plain,
! [X6,X7,X5] :
( ~ ssItem(X5)
| ~ ssList(X6)
| sP19(app(cons(X5,nil),X6))
| ~ ssItem(X7)
| ~ lt(X7,X5)
| ~ sP31(X7) ),
inference(general_splitting,[],[f221,f250_D]) ).
fof(f252,plain,
! [X6,X5] :
( sP19(app(cons(X5,nil),X6))
| ~ ssList(X6)
| sP32(X5) ),
inference(cnf_transformation,[],[f252_D]) ).
fof(f252_D,definition,
! [X5] :
( ! [X6] :
( sP19(app(cons(X5,nil),X6))
| ~ ssList(X6) )
<=> ~ sP32(X5) ),
introduced(definition,[new_symbols(definition,[sP32])],[general_splitting_component_introduction]) ).
fof(f253,plain,
! [X7,X5] :
( ~ lt(X7,X5)
| ~ ssItem(X7)
| ~ ssItem(X5)
| ~ sP31(X7)
| ~ sP32(X5) ),
inference(general_splitting,[],[f251,f252_D]) ).
fof(f256,definition,
( spl33_1
<=> sP22(sK8) ),
introduced(definition,[new_symbols(definition,[spl33_1])],[avatar_definition]) ).
fof(f258,plain,
( sP22(sK8)
| ~ spl33_1 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f260,definition,
( spl33_2
<=> sP0(sK8,sK7) ),
introduced(definition,[new_symbols(definition,[spl33_2])],[avatar_definition]) ).
fof(f262,plain,
( sP0(sK8,sK7)
| ~ spl33_2 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f263,plain,
( spl33_1
| spl33_2 ),
inference(avatar_split_clause,[],[f225,f260,f256]) ).
fof(f265,definition,
( spl33_3
<=> nil = sK7 ),
introduced(definition,[new_symbols(definition,[spl33_3])],[avatar_definition]) ).
fof(f267,plain,
( nil = sK7
| ~ spl33_3 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f268,plain,
( spl33_3
| spl33_2 ),
inference(avatar_split_clause,[],[f215,f260,f265]) ).
fof(f270,definition,
( spl33_4
<=> sP21(sK7) ),
introduced(definition,[new_symbols(definition,[spl33_4])],[avatar_definition]) ).
fof(f272,plain,
( sP21(sK7)
| ~ spl33_4 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f274,definition,
( spl33_5
<=> nil = sK8 ),
introduced(definition,[new_symbols(definition,[spl33_5])],[avatar_definition]) ).
fof(f276,plain,
( nil = sK8
| ~ spl33_5 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f277,plain,
( spl33_4
| spl33_5 ),
inference(avatar_split_clause,[],[f223,f274,f270]) ).
fof(f357,plain,
! [X0,X1] :
( sP20(X0)
| ~ ssList(sK4(X0,X1))
| sP31(sK3(X0,X1))
| ~ ssList(X1)
| ~ strictorderedP(X0)
| ~ sP0(app(X0,X1),X0) ),
inference(superposition,[],[f250,f242]) ).
fof(f359,plain,
! [X0,X1] :
( ~ sP0(app(X0,X1),X0)
| sP31(sK3(X0,X1))
| ~ ssList(X1)
| ~ strictorderedP(X0)
| sP20(X0) ),
inference(forward_subsumption_resolution,[],[f357,f244]) ).
fof(f375,plain,
! [X0,X1] :
( sP19(X0)
| ~ ssList(sK2(X1,X0))
| sP32(sK1(X1,X0))
| ~ ssList(X0)
| ~ strictorderedP(X1)
| ~ sP0(app(X1,X0),X1) ),
inference(superposition,[],[f252,f241]) ).
fof(f396,plain,
! [X0,X1] :
( ~ sP0(app(X1,X0),X1)
| sP32(sK1(X1,X0))
| ~ ssList(X0)
| ~ strictorderedP(X1)
| sP19(X0) ),
inference(forward_subsumption_resolution,[],[f375,f246]) ).
fof(f401,plain,
! [X0,X1] :
( ~ ssItem(sK3(X0,X1))
| ~ ssItem(sK1(X0,X1))
| ~ sP31(sK3(X0,X1))
| ~ sP32(sK1(X0,X1))
| ~ ssList(X1)
| ~ strictorderedP(X0)
| ~ sP0(app(X0,X1),X0) ),
inference(resolution,[],[f253,f243]) ).
fof(f402,plain,
! [X0,X1] :
( ~ ssItem(sK1(X0,X1))
| ~ sP31(sK3(X0,X1))
| ~ sP32(sK1(X0,X1))
| ~ ssList(X1)
| ~ strictorderedP(X0)
| ~ sP0(app(X0,X1),X0) ),
inference(forward_subsumption_resolution,[],[f401,f245]) ).
fof(f403,plain,
! [X0,X1] :
( ~ sP0(app(X0,X1),X0)
| ~ sP32(sK1(X0,X1))
| ~ ssList(X1)
| ~ strictorderedP(X0)
| ~ sP31(sK3(X0,X1)) ),
inference(forward_subsumption_resolution,[],[f402,f247]) ).
fof(f547,plain,
( sP21(nil)
| ~ spl33_3
| ~ spl33_4 ),
inference(superposition,[],[f272,f267]) ).
fof(f571,plain,
( $false
| ~ spl33_3
| ~ spl33_4 ),
inference(forward_subsumption_resolution,[],[f547,f222]) ).
fof(f572,plain,
( ~ spl33_3
| ~ spl33_4 ),
inference(avatar_contradiction_clause,[],[f571]) ).
fof(f724,plain,
( ~ sP0(sK8,sK7)
| sP31(sK3(sK7,sK9))
| ~ ssList(sK9)
| ~ strictorderedP(sK7)
| sP20(sK7) ),
inference(superposition,[],[f359,f166]) ).
fof(f733,plain,
( sP31(sK3(sK7,sK9))
| ~ ssList(sK9)
| ~ strictorderedP(sK7)
| sP20(sK7)
| ~ spl33_2 ),
inference(forward_subsumption_resolution,[],[f724,f262]) ).
fof(f739,plain,
( sP31(sK3(sK7,sK9))
| ~ strictorderedP(sK7)
| sP20(sK7)
| ~ spl33_2 ),
inference(forward_subsumption_resolution,[],[f733,f163]) ).
fof(f744,plain,
( sP31(sK3(sK7,sK9))
| sP20(sK7)
| ~ spl33_2 ),
inference(forward_subsumption_resolution,[],[f739,f165]) ).
fof(f745,plain,
( sP31(sK3(sK7,sK9))
| ~ spl33_2 ),
inference(forward_subsumption_resolution,[],[f744,f220]) ).
fof(f755,plain,
( ~ sP0(sK8,sK7)
| sP32(sK1(sK7,sK9))
| ~ ssList(sK9)
| ~ strictorderedP(sK7)
| sP19(sK9) ),
inference(superposition,[],[f396,f166]) ).
fof(f764,plain,
( sP32(sK1(sK7,sK9))
| ~ ssList(sK9)
| ~ strictorderedP(sK7)
| sP19(sK9)
| ~ spl33_2 ),
inference(forward_subsumption_resolution,[],[f755,f262]) ).
fof(f769,plain,
( sP32(sK1(sK7,sK9))
| ~ strictorderedP(sK7)
| sP19(sK9)
| ~ spl33_2 ),
inference(forward_subsumption_resolution,[],[f764,f163]) ).
fof(f771,plain,
( sP32(sK1(sK7,sK9))
| sP19(sK9)
| ~ spl33_2 ),
inference(forward_subsumption_resolution,[],[f769,f165]) ).
fof(f772,plain,
( sP32(sK1(sK7,sK9))
| ~ spl33_2 ),
inference(forward_subsumption_resolution,[],[f771,f219]) ).
fof(f782,plain,
( ~ sP0(sK8,sK7)
| ~ sP32(sK1(sK7,sK9))
| ~ ssList(sK9)
| ~ strictorderedP(sK7)
| ~ sP31(sK3(sK7,sK9)) ),
inference(superposition,[],[f403,f166]) ).
fof(f791,plain,
( ~ sP32(sK1(sK7,sK9))
| ~ ssList(sK9)
| ~ strictorderedP(sK7)
| ~ sP31(sK3(sK7,sK9))
| ~ spl33_2 ),
inference(forward_subsumption_resolution,[],[f782,f262]) ).
fof(f797,plain,
( ~ ssList(sK9)
| ~ strictorderedP(sK7)
| ~ sP31(sK3(sK7,sK9))
| ~ spl33_2 ),
inference(forward_subsumption_resolution,[],[f791,f772]) ).
fof(f800,plain,
( ~ strictorderedP(sK7)
| ~ sP31(sK3(sK7,sK9))
| ~ spl33_2 ),
inference(forward_subsumption_resolution,[],[f797,f163]) ).
fof(f801,plain,
( ~ sP31(sK3(sK7,sK9))
| ~ spl33_2 ),
inference(forward_subsumption_resolution,[],[f800,f165]) ).
fof(f802,plain,
( $false
| ~ spl33_2 ),
inference(forward_subsumption_resolution,[],[f801,f745]) ).
fof(f803,plain,
~ spl33_2,
inference(avatar_contradiction_clause,[],[f802]) ).
fof(f856,plain,
( sP22(nil)
| ~ spl33_1
| ~ spl33_5 ),
inference(superposition,[],[f258,f276]) ).
fof(f868,plain,
( $false
| ~ spl33_1
| ~ spl33_5 ),
inference(forward_subsumption_resolution,[],[f856,f224]) ).
fof(f869,plain,
( ~ spl33_1
| ~ spl33_5 ),
inference(avatar_contradiction_clause,[],[f868]) ).
cnf(s1,plain,
( spl33_1
| spl33_2 ),
inference(sat_conversion,[],[f263]) ).
cnf(s2,plain,
( spl33_2
| spl33_3 ),
inference(sat_conversion,[],[f268]) ).
cnf(s3,plain,
( spl33_4
| spl33_5 ),
inference(sat_conversion,[],[f277]) ).
cnf(s15,plain,
( ~ spl33_3
| ~ spl33_4 ),
inference(sat_conversion,[],[f572]) ).
cnf(s23,plain,
~ spl33_2,
inference(sat_conversion,[],[f803]) ).
cnf(s29,plain,
( ~ spl33_1
| ~ spl33_5 ),
inference(sat_conversion,[],[f869]) ).
cnf(s30,plain,
spl33_3,
inference(rat,[],[s2,s23]) ).
cnf(s32,plain,
~ spl33_4,
inference(rat,[],[s15,s30]) ).
cnf(s35,plain,
spl33_5,
inference(rat,[],[s3,s32]) ).
cnf(s36,plain,
~ spl33_1,
inference(rat,[],[s29,s35]) ).
cnf(s42,plain,
$false,
inference(rat,[],[s1,s23,s36]) ).
fof(f870,plain,
$false,
inference(avatar_sat_refutation,[],[s42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC343+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n026.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 09:14:12 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running first-order theorem proving
% 0.08/0.21 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.26/0.92 % (3712390)Detected formulas, will run a generic FOF schedule.
% 1.26/0.92 % (3712398)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3083312386:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.26/0.92 % (3712398)First to succeed.
% 1.26/0.92 % (3712398)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3712390"
% 1.26/0.92 % (3712396)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3379210222:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.26/0.92 % (3712400)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3104478325:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.26/0.92 % (3712397)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2390335408:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.26/0.92 % (3712395)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=180947989:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.26/0.92 % (3712401)dis-21_1_sil=8000:lcm=predicate:random_seed=731278167:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 1.26/0.92 % (3712399)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2256913883:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.26/0.92 % (3712401)Instruction limit reached!
% 1.26/0.92 % (3712401)------------------------------
% 1.26/0.92 % (3712401)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.26/0.92 % (3712401)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.26/0.92 % (3712401)CaDiCaL version: 2.1.3
% 1.26/0.92 % (3712401)Termination reason: Instruction limit
% 1.26/0.92 % (3712401)Termination phase: Saturation
% 1.26/0.92 % (3712401)Time elapsed: 0.070 s
% 1.26/0.92 % (3712401)Peak memory usage: 90 MB
% 1.26/0.92 % (3712401)Instructions burned: 129 (million)
% 1.26/0.92 % (3712399)Instruction limit reached!
% 1.26/0.92 % (3712399)------------------------------
% 1.26/0.92 % (3712399)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.26/0.92 % (3712399)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.26/0.92 % (3712399)CaDiCaL version: 2.1.3
% 1.26/0.92 % (3712399)Termination reason: Instruction limit
% 1.26/0.92 % (3712399)Termination phase: Saturation
% 1.26/0.92 % (3712399)Time elapsed: 0.070 s
% 1.26/0.92 % (3712399)Peak memory usage: 88 MB
% 1.26/0.92 % (3712399)Instructions burned: 119 (million)
% 1.26/0.92 % (3712400)Instruction limit reached!
% 1.26/0.92 % (3712400)------------------------------
% 1.26/0.92 % (3712400)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.26/0.92 % (3712400)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.26/0.92 % (3712400)CaDiCaL version: 2.1.3
% 1.26/0.92 % (3712400)Termination reason: Instruction limit
% 1.26/0.92 % (3712400)Termination phase: Saturation
% 1.26/0.92 % (3712400)Time elapsed: 0.091 s
% 1.26/0.92 % (3712400)Peak memory usage: 90 MB
% 1.26/0.92 % (3712400)Instructions burned: 139 (million)
% 1.26/0.92 % (3712398)Refutation found. Thanks to Tanya!
% 1.26/0.92 % SZS status Theorem for theBenchmark
% 1.26/0.92 % SZS output start Proof for theBenchmark
% See solution above
% 2.50/1.06 % (3712398)------------------------------
% 2.50/1.06 % (3712398)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.50/1.06 % (3712398)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.50/1.06 % (3712398)CaDiCaL version: 2.1.3
% 2.50/1.06 % (3712398)Termination reason: Refutation
% 2.50/1.06 % (3712398)Time elapsed: 0.011 s
% 2.50/1.06 % (3712398)Peak memory usage: 90 MB
% 2.50/1.06 % (3712398)Instructions burned: 26 (million)
% 2.50/1.06 % (3712398)------------------------------
% 2.50/1.06 % (3712398)------------------------------
% 2.50/1.06 % (3712390)Success in time 0.271 s
% 2.50/1.06 % Vampire exiting
%------------------------------------------------------------------------------