%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC327+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 : n008.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:28 PM UTC 2026
% Result : Theorem 0.66s 0.99s
% Output : Refutation 2.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 12
% Syntax : Number of formulae : 89 ( 17 unt; 11 def)
% Number of atoms : 395 ( 103 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 501 ( 195 ~; 194 |; 90 &)
% ( 6 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 6 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 127 ( 0 sgn 89 !; 38 ?)
% 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
| ~ equalelemsP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssList(X7)
& app(X7,cons(X5,nil)) = X2 ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( ? [X8] :
( ssList(X8)
& app(X0,X8) = X1
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(cons(X9,nil),X10) != X8
| ! [X11] :
( ssList(X11)
=> app(X11,cons(X9,nil)) != X0 ) ) ) )
& equalelemsP(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
| ~ equalelemsP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssList(X7)
& app(X7,cons(X5,nil)) = X2 ) ) ) ) )
| ( nil != X3
& nil = X2 )
| ( ? [X8] :
( ssList(X8)
& app(X0,X8) = X1
& ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(cons(X9,nil),X10) != X8
| ! [X11] :
( ssList(X11)
=> app(X11,cons(X9,nil)) != X0 ) ) ) )
& equalelemsP(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
& equalelemsP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 ) ) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ! [X8] :
( ~ ssList(X8)
| app(X0,X8) != X1
| ? [X9] :
( ? [X10] :
( app(cons(X9,nil),X10) = X8
& ? [X11] :
( app(X11,cons(X9,nil)) = X0
& ssList(X11) )
& ssList(X10) )
& ssItem(X9) )
| ~ equalelemsP(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
& equalelemsP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 ) ) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ( ! [X8] :
( ~ ssList(X8)
| app(X0,X8) != X1
| ? [X9] :
( ? [X10] :
( app(cons(X9,nil),X10) = X8
& ? [X11] :
( app(X11,cons(X9,nil)) = X0
& ssList(X11) )
& ssList(X10) )
& ssItem(X9) )
| ~ equalelemsP(X0) )
| ( nil = X0
& nil != X1 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f121,definition,
! [X1,X0] :
( ! [X8] :
( ~ ssList(X8)
| app(X0,X8) != X1
| ? [X9] :
( ? [X10] :
( app(cons(X9,nil),X10) = X8
& ? [X11] :
( app(X11,cons(X9,nil)) = X0
& ssList(X11) )
& ssList(X10) )
& ssItem(X9) )
| ~ equalelemsP(X0) )
| ~ sP0(X1,X0) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f122,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( app(X2,X4) = X3
& equalelemsP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 ) ) )
& 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,f121]) ).
fof(f123,plain,
! [X1,X0] :
( ! [X8] :
( ~ ssList(X8)
| app(X0,X8) != X1
| ? [X9] :
( ? [X10] :
( app(cons(X9,nil),X10) = X8
& ? [X11] :
( app(X11,cons(X9,nil)) = X0
& ssList(X11) )
& ssList(X10) )
& ssItem(X9) )
| ~ equalelemsP(X0) )
| ~ sP0(X1,X0) ),
inference(nnf_transformation,[],[f121]) ).
fof(f124,plain,
! [X0,X1] :
( ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0
| ? [X3] :
( ? [X4] :
( app(cons(X3,nil),X4) = X2
& ? [X5] :
( app(X5,cons(X3,nil)) = X1
& ssList(X5) )
& ssList(X4) )
& ssItem(X3) )
| ~ equalelemsP(X1) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f123]) ).
fof(f125,plain,
! [X0,X1] :
( ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0
| ( app(cons(sK1(X1,X2),nil),sK2(X1,X2)) = X2
& app(sK3(X1,X2),cons(sK1(X1,X2),nil)) = X1
& ssList(sK3(X1,X2))
& ssList(sK2(X1,X2))
& ssItem(sK1(X1,X2)) )
| ~ equalelemsP(X1) )
| ~ sP0(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X3,sK1(X1,X2)),skolemize(X4,sK2(X1,X2)),skolemize(X5,sK3(X1,X2))],[f124]) ).
fof(f126,plain,
( sK5 = sK7
& sK4 = sK6
& sK7 = app(sK6,sK8)
& equalelemsP(sK6)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != sK8
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != sK6 ) ) )
& ssList(sK8)
& ( nil = sK7
| nil != sK6 )
& ( sP0(sK5,sK4)
| ( nil = sK4
& nil != sK5 ) )
& ssList(sK7)
& ssList(sK6)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6),skolemize(X3,sK7),skolemize(X4,sK8)],[f122]) ).
fof(f134,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| app(X1,X2) != X0
| ssItem(sK1(X1,X2))
| ~ equalelemsP(X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f135,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| app(X1,X2) != X0
| ssList(sK2(X1,X2))
| ~ equalelemsP(X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f136,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| app(X1,X2) != X0
| ssList(sK3(X1,X2))
| ~ equalelemsP(X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f137,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| app(X1,X2) != X0
| app(sK3(X1,X2),cons(sK1(X1,X2),nil)) = X1
| ~ equalelemsP(X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f138,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| app(X1,X2) != X0
| app(cons(sK1(X1,X2),nil),sK2(X1,X2)) = X2
| ~ equalelemsP(X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f143,plain,
( sP0(sK5,sK4)
| nil != sK5 ),
inference(cnf_transformation,[],[f126]) ).
fof(f144,plain,
( sP0(sK5,sK4)
| nil = sK4 ),
inference(cnf_transformation,[],[f126]) ).
fof(f145,plain,
( nil = sK7
| nil != sK6 ),
inference(cnf_transformation,[],[f126]) ).
fof(f146,plain,
ssList(sK8),
inference(cnf_transformation,[],[f126]) ).
fof(f147,plain,
! [X6,X7,X5] :
( ~ ssItem(X5)
| ~ ssList(X6)
| app(cons(X5,nil),X6) != sK8
| ~ ssList(X7)
| app(X7,cons(X5,nil)) != sK6 ),
inference(cnf_transformation,[],[f126]) ).
fof(f148,plain,
equalelemsP(sK6),
inference(cnf_transformation,[],[f126]) ).
fof(f149,plain,
sK7 = app(sK6,sK8),
inference(cnf_transformation,[],[f126]) ).
fof(f150,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f126]) ).
fof(f151,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f126]) ).
fof(f184,plain,
( sP0(sK7,sK6)
| nil = sK6 ),
inference(definition_unfolding,[],[f144,f151,f150,f150]) ).
fof(f185,plain,
( sP0(sK7,sK6)
| nil != sK7 ),
inference(definition_unfolding,[],[f143,f151,f150,f151]) ).
fof(f188,definition,
~ sP17(sK8),
introduced(definition,[new_symbols(definition,[sP17])],[inequality_splitting_name_introduction]) ).
fof(f189,definition,
~ sP18(sK6),
introduced(definition,[new_symbols(definition,[sP18])],[inequality_splitting_name_introduction]) ).
fof(f190,plain,
! [X6,X7,X5] :
( ~ ssItem(X5)
| ~ ssList(X6)
| sP17(app(cons(X5,nil),X6))
| ~ ssList(X7)
| sP18(app(X7,cons(X5,nil))) ),
inference(inequality_splitting,[],[f147,f189,f188]) ).
fof(f191,definition,
~ sP19(nil),
introduced(definition,[new_symbols(definition,[sP19])],[inequality_splitting_name_introduction]) ).
fof(f192,plain,
( nil = sK7
| sP19(sK6) ),
inference(inequality_splitting,[],[f145,f191]) ).
fof(f193,definition,
~ sP20(nil),
introduced(definition,[new_symbols(definition,[sP20])],[inequality_splitting_name_introduction]) ).
fof(f194,plain,
( sP0(sK7,sK6)
| sP20(sK7) ),
inference(inequality_splitting,[],[f185,f193]) ).
fof(f206,plain,
! [X2,X1] :
( app(cons(sK1(X1,X2),nil),sK2(X1,X2)) = X2
| ~ ssList(X2)
| ~ equalelemsP(X1)
| ~ sP0(app(X1,X2),X1) ),
inference(equality_resolution,[],[f138]) ).
fof(f207,plain,
! [X2,X1] :
( app(sK3(X1,X2),cons(sK1(X1,X2),nil)) = X1
| ~ ssList(X2)
| ~ equalelemsP(X1)
| ~ sP0(app(X1,X2),X1) ),
inference(equality_resolution,[],[f137]) ).
fof(f208,plain,
! [X2,X1] :
( ~ sP0(app(X1,X2),X1)
| ssList(sK3(X1,X2))
| ~ equalelemsP(X1)
| ~ ssList(X2) ),
inference(equality_resolution,[],[f136]) ).
fof(f209,plain,
! [X2,X1] :
( ~ sP0(app(X1,X2),X1)
| ssList(sK2(X1,X2))
| ~ equalelemsP(X1)
| ~ ssList(X2) ),
inference(equality_resolution,[],[f135]) ).
fof(f210,plain,
! [X2,X1] :
( ~ sP0(app(X1,X2),X1)
| ssItem(sK1(X1,X2))
| ~ equalelemsP(X1)
| ~ ssList(X2) ),
inference(equality_resolution,[],[f134]) ).
fof(f212,plain,
! [X6,X5] :
( sP17(app(cons(X5,nil),X6))
| ~ ssList(X6)
| sP27(X5) ),
inference(cnf_transformation,[],[f212_D]) ).
fof(f212_D,definition,
! [X5] :
( ! [X6] :
( sP17(app(cons(X5,nil),X6))
| ~ ssList(X6) )
<=> ~ sP27(X5) ),
introduced(definition,[new_symbols(definition,[sP27])],[general_splitting_component_introduction]) ).
fof(f213,plain,
! [X7,X5] :
( sP18(app(X7,cons(X5,nil)))
| ~ ssList(X7)
| ~ ssItem(X5)
| ~ sP27(X5) ),
inference(general_splitting,[],[f190,f212_D]) ).
fof(f215,definition,
( spl28_1
<=> sP20(sK7) ),
introduced(definition,[new_symbols(definition,[spl28_1])],[avatar_definition]) ).
fof(f217,plain,
( sP20(sK7)
| ~ spl28_1 ),
inference(avatar_component_clause,[],[f215]) ).
fof(f219,definition,
( spl28_2
<=> sP0(sK7,sK6) ),
introduced(definition,[new_symbols(definition,[spl28_2])],[avatar_definition]) ).
fof(f221,plain,
( sP0(sK7,sK6)
| ~ spl28_2 ),
inference(avatar_component_clause,[],[f219]) ).
fof(f222,plain,
( spl28_1
| spl28_2 ),
inference(avatar_split_clause,[],[f194,f219,f215]) ).
fof(f224,definition,
( spl28_3
<=> nil = sK6 ),
introduced(definition,[new_symbols(definition,[spl28_3])],[avatar_definition]) ).
fof(f226,plain,
( nil = sK6
| ~ spl28_3 ),
inference(avatar_component_clause,[],[f224]) ).
fof(f227,plain,
( spl28_3
| spl28_2 ),
inference(avatar_split_clause,[],[f184,f219,f224]) ).
fof(f229,definition,
( spl28_4
<=> sP19(sK6) ),
introduced(definition,[new_symbols(definition,[spl28_4])],[avatar_definition]) ).
fof(f231,plain,
( sP19(sK6)
| ~ spl28_4 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f233,definition,
( spl28_5
<=> nil = sK7 ),
introduced(definition,[new_symbols(definition,[spl28_5])],[avatar_definition]) ).
fof(f235,plain,
( nil = sK7
| ~ spl28_5 ),
inference(avatar_component_clause,[],[f233]) ).
fof(f236,plain,
( spl28_4
| spl28_5 ),
inference(avatar_split_clause,[],[f192,f233,f229]) ).
fof(f307,plain,
! [X0,X1] :
( sP17(X0)
| ~ ssList(sK2(X1,X0))
| sP27(sK1(X1,X0))
| ~ ssList(X0)
| ~ equalelemsP(X1)
| ~ sP0(app(X1,X0),X1) ),
inference(superposition,[],[f212,f206]) ).
fof(f328,plain,
! [X0,X1] :
( ~ sP0(app(X1,X0),X1)
| sP27(sK1(X1,X0))
| ~ ssList(X0)
| ~ equalelemsP(X1)
| sP17(X0) ),
inference(forward_subsumption_resolution,[],[f307,f209]) ).
fof(f335,plain,
! [X0,X1] :
( sP18(X0)
| ~ ssList(sK3(X0,X1))
| ~ ssItem(sK1(X0,X1))
| ~ sP27(sK1(X0,X1))
| ~ ssList(X1)
| ~ equalelemsP(X0)
| ~ sP0(app(X0,X1),X0) ),
inference(superposition,[],[f213,f207]) ).
fof(f337,plain,
! [X0,X1] :
( sP18(X0)
| ~ ssItem(sK1(X0,X1))
| ~ sP27(sK1(X0,X1))
| ~ ssList(X1)
| ~ equalelemsP(X0)
| ~ sP0(app(X0,X1),X0) ),
inference(forward_subsumption_resolution,[],[f335,f208]) ).
fof(f352,plain,
! [X0,X1] :
( ~ sP0(app(X0,X1),X0)
| ~ sP27(sK1(X0,X1))
| ~ ssList(X1)
| ~ equalelemsP(X0)
| sP18(X0) ),
inference(forward_subsumption_resolution,[],[f337,f210]) ).
fof(f487,plain,
( sP19(nil)
| ~ spl28_3
| ~ spl28_4 ),
inference(superposition,[],[f231,f226]) ).
fof(f508,plain,
( $false
| ~ spl28_3
| ~ spl28_4 ),
inference(forward_subsumption_resolution,[],[f487,f191]) ).
fof(f509,plain,
( ~ spl28_3
| ~ spl28_4 ),
inference(avatar_contradiction_clause,[],[f508]) ).
fof(f665,plain,
( ~ sP0(sK7,sK6)
| sP27(sK1(sK6,sK8))
| ~ ssList(sK8)
| ~ equalelemsP(sK6)
| sP17(sK8) ),
inference(superposition,[],[f328,f149]) ).
fof(f675,plain,
( sP27(sK1(sK6,sK8))
| ~ ssList(sK8)
| ~ equalelemsP(sK6)
| sP17(sK8)
| ~ spl28_2 ),
inference(forward_subsumption_resolution,[],[f665,f221]) ).
fof(f680,plain,
( sP27(sK1(sK6,sK8))
| ~ equalelemsP(sK6)
| sP17(sK8)
| ~ spl28_2 ),
inference(forward_subsumption_resolution,[],[f675,f146]) ).
fof(f682,plain,
( sP27(sK1(sK6,sK8))
| sP17(sK8)
| ~ spl28_2 ),
inference(forward_subsumption_resolution,[],[f680,f148]) ).
fof(f683,plain,
( sP27(sK1(sK6,sK8))
| ~ spl28_2 ),
inference(forward_subsumption_resolution,[],[f682,f188]) ).
fof(f692,plain,
( ~ sP0(sK7,sK6)
| ~ sP27(sK1(sK6,sK8))
| ~ ssList(sK8)
| ~ equalelemsP(sK6)
| sP18(sK6) ),
inference(superposition,[],[f352,f149]) ).
fof(f702,plain,
( ~ sP27(sK1(sK6,sK8))
| ~ ssList(sK8)
| ~ equalelemsP(sK6)
| sP18(sK6)
| ~ spl28_2 ),
inference(forward_subsumption_resolution,[],[f692,f221]) ).
fof(f708,plain,
( ~ ssList(sK8)
| ~ equalelemsP(sK6)
| sP18(sK6)
| ~ spl28_2 ),
inference(forward_subsumption_resolution,[],[f702,f683]) ).
fof(f714,plain,
( ~ equalelemsP(sK6)
| sP18(sK6)
| ~ spl28_2 ),
inference(forward_subsumption_resolution,[],[f708,f146]) ).
fof(f715,plain,
( sP18(sK6)
| ~ spl28_2 ),
inference(forward_subsumption_resolution,[],[f714,f148]) ).
fof(f716,plain,
( $false
| ~ spl28_2 ),
inference(forward_subsumption_resolution,[],[f715,f189]) ).
fof(f717,plain,
~ spl28_2,
inference(avatar_contradiction_clause,[],[f716]) ).
fof(f770,plain,
( sP20(nil)
| ~ spl28_1
| ~ spl28_5 ),
inference(superposition,[],[f217,f235]) ).
fof(f782,plain,
( $false
| ~ spl28_1
| ~ spl28_5 ),
inference(forward_subsumption_resolution,[],[f770,f193]) ).
fof(f783,plain,
( ~ spl28_1
| ~ spl28_5 ),
inference(avatar_contradiction_clause,[],[f782]) ).
cnf(s1,plain,
( spl28_1
| spl28_2 ),
inference(sat_conversion,[],[f222]) ).
cnf(s2,plain,
( spl28_2
| spl28_3 ),
inference(sat_conversion,[],[f227]) ).
cnf(s3,plain,
( spl28_4
| spl28_5 ),
inference(sat_conversion,[],[f236]) ).
cnf(s15,plain,
( ~ spl28_3
| ~ spl28_4 ),
inference(sat_conversion,[],[f509]) ).
cnf(s22,plain,
~ spl28_2,
inference(sat_conversion,[],[f717]) ).
cnf(s28,plain,
( ~ spl28_1
| ~ spl28_5 ),
inference(sat_conversion,[],[f783]) ).
cnf(s29,plain,
spl28_3,
inference(rat,[],[s2,s22]) ).
cnf(s31,plain,
~ spl28_4,
inference(rat,[],[s15,s29]) ).
cnf(s34,plain,
spl28_5,
inference(rat,[],[s3,s31]) ).
cnf(s35,plain,
~ spl28_1,
inference(rat,[],[s28,s34]) ).
cnf(s41,plain,
$false,
inference(rat,[],[s1,s22,s35]) ).
fof(f784,plain,
$false,
inference(avatar_sat_refutation,[],[s41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC327+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.09/0.20 % Computer : n008.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 09:06:54 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running first-order theorem proving
% 0.09/0.24 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
% 0.66/0.99 % (2114434)Detected formulas, will run a generic FOF schedule.
% 0.66/0.99 % (2114585)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=884337114:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.66/0.99 % (2114585)First to succeed.
% 0.66/0.99 % (2114585)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2114434"
% 0.66/0.99 % (2114584)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=2734813161:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.66/0.99 % (2114586)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1569988698:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.66/0.99 % (2114583)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=3771505791:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.66/0.99 % (2114587)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2498965323:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.66/0.99 % (2114582)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=3907379502:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.66/0.99 % (2114586)Also succeeded, but the first one will report.
% 0.66/0.99 % (2114589)dis-21_1_sil=8000:lcm=predicate:random_seed=3417159231: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)
% 0.66/0.99 % (2114587)Instruction limit reached!
% 0.66/0.99 % (2114587)------------------------------
% 0.66/0.99 % (2114587)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.66/0.99 % (2114587)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.66/0.99 % (2114587)CaDiCaL version: 2.1.3
% 0.66/0.99 % (2114587)Termination reason: Instruction limit
% 0.66/0.99 % (2114587)Termination phase: Saturation
% 0.66/0.99 % (2114587)Time elapsed: 0.093 s
% 0.66/0.99 % (2114587)Peak memory usage: 89 MB
% 0.66/0.99 % (2114587)Instructions burned: 140 (million)
% 0.66/0.99 % (2114589)Instruction limit reached!
% 0.66/0.99 % (2114589)------------------------------
% 0.66/0.99 % (2114589)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.66/0.99 % (2114589)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.66/0.99 % (2114589)CaDiCaL version: 2.1.3
% 0.66/0.99 % (2114589)Termination reason: Instruction limit
% 0.66/0.99 % (2114589)Termination phase: Saturation
% 0.66/0.99 % (2114589)Time elapsed: 0.074 s
% 0.66/0.99 % (2114589)Peak memory usage: 90 MB
% 0.66/0.99 % (2114589)Instructions burned: 130 (million)
% 0.66/0.99 % (2114585)Refutation found. Thanks to Tanya!
% 0.66/0.99 % SZS status Theorem for theBenchmark
% 0.66/0.99 % SZS output start Proof for theBenchmark
% See solution above
% 2.75/1.20 % (2114585)------------------------------
% 2.75/1.20 % (2114585)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.75/1.20 % (2114585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.75/1.20 % (2114585)CaDiCaL version: 2.1.3
% 2.75/1.20 % (2114585)Termination reason: Refutation
% 2.75/1.20 % (2114585)Time elapsed: 0.009 s
% 2.75/1.20 % (2114585)Peak memory usage: 90 MB
% 2.75/1.20 % (2114585)Instructions burned: 22 (million)
% 2.75/1.20 % (2114585)------------------------------
% 2.75/1.20 % (2114585)------------------------------
% 2.75/1.20 % (2114434)Success in time 0.296 s
% 2.75/1.20 % Vampire exiting
%------------------------------------------------------------------------------