%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC153+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:04:53 PM UTC 2026
% Result : Theorem 0.13s 0.45s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 6
% Syntax : Number of formulae : 76 ( 18 unt; 5 def)
% Number of atoms : 402 ( 29 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 558 ( 232 ~; 225 |; 76 &)
% ( 5 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 6 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 103 ( 0 sgn 71 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X3 != X1
| X2 != X0
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) = X2
& leq(X5,X4)
& ( ~ leq(X4,X5)
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& ( ~ leq(X4,X9)
| ~ leq(X9,X5) ) ) ) ) ) ) ) )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ssList(X14)
=> ( app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X0
| ~ leq(X11,X10)
| ( ! [X15] :
( ssItem(X15)
=> ( ~ memberP(X13,X15)
| ( leq(X15,X11)
& leq(X10,X15) ) ) )
& leq(X10,X11) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X3 != X1
| X2 != X0
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) = X2
& leq(X5,X4)
& ( ~ leq(X4,X5)
| ? [X9] :
( ssItem(X9)
& memberP(X7,X9)
& ( ~ leq(X4,X9)
| ~ leq(X9,X5) ) ) ) ) ) ) ) )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ! [X14] :
( ssList(X14)
=> ( app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) != X0
| ~ leq(X11,X10)
| ( ! [X15] :
( ssItem(X15)
=> ( ~ memberP(X13,X15)
| ( leq(X15,X11)
& leq(X10,X15) ) ) )
& leq(X10,X11) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) != X2
| ~ leq(X5,X4)
| ( leq(X4,X5)
& ! [X9] :
( ~ ssItem(X9)
| ~ memberP(X7,X9)
| ( leq(X4,X9)
& leq(X9,X5) ) ) ) ) ) ) ) )
& ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) = X0
& leq(X11,X10)
& ( ? [X15] :
( memberP(X13,X15)
& ( ~ leq(X15,X11)
| ~ leq(X10,X15) )
& ssItem(X15) )
| ~ leq(X10,X11) )
& ssList(X14) )
& ssList(X13) )
& ssList(X12) )
& ssItem(X11) )
& ssItem(X10) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) != X2
| ~ leq(X5,X4)
| ( leq(X4,X5)
& ! [X9] :
( ~ ssItem(X9)
| ~ memberP(X7,X9)
| ( leq(X4,X9)
& leq(X9,X5) ) ) ) ) ) ) ) )
& ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( app(app(app(app(X12,cons(X10,nil)),X13),cons(X11,nil)),X14) = X0
& leq(X11,X10)
& ( ? [X15] :
( memberP(X13,X15)
& ( ~ leq(X15,X11)
| ~ leq(X10,X15) )
& ssItem(X15) )
| ~ leq(X10,X11) )
& ssList(X14) )
& ssList(X13) )
& ssList(X12) )
& ssItem(X11) )
& ssItem(X10) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ~ ssList(X8)
| app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) != sK55
| ~ leq(X5,X4)
| ( leq(X4,X5)
& ! [X9] :
( ~ ssItem(X9)
| ~ memberP(X7,X9)
| ( leq(X4,X9)
& leq(X9,X5) ) ) ) ) ) ) ) )
& sK53 = app(app(app(app(sK59,cons(sK57,nil)),sK60),cons(sK58,nil)),sK61)
& leq(sK58,sK57)
& ( ( memberP(sK60,sK62)
& ( ~ leq(sK62,sK58)
| ~ leq(sK57,sK62) )
& ssItem(sK62) )
| ~ leq(sK57,sK58) )
& ssList(sK61)
& ssList(sK60)
& ssList(sK59)
& ssItem(sK58)
& ssItem(sK57)
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59,sK60,sK61,sK62]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X10,sK57),skolemize(X11,sK58),skolemize(X12,sK59),skolemize(X13,sK60),skolemize(X14,sK61),skolemize(X15,sK62)],[f222]) ).
fof(f500,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
ssItem(sK58),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
ssList(sK59),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
ssList(sK60),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
ssList(sK61),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
( ssItem(sK62)
| ~ leq(sK57,sK58) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
( ~ leq(sK62,sK58)
| ~ leq(sK57,sK62)
| ~ leq(sK57,sK58) ),
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
( memberP(sK60,sK62)
| ~ leq(sK57,sK58) ),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
leq(sK58,sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
sK53 = app(app(app(app(sK59,cons(sK57,nil)),sK60),cons(sK58,nil)),sK61),
inference(cnf_transformation,[],[f296]) ).
fof(f510,plain,
! [X8,X6,X9,X7,X4,X5] :
( app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) != sK55
| ~ ssItem(X5)
| ~ ssList(X6)
| ~ ssList(X7)
| ~ ssList(X8)
| ~ ssItem(X4)
| ~ leq(X5,X4)
| ~ ssItem(X9)
| ~ memberP(X7,X9)
| leq(X9,X5) ),
inference(cnf_transformation,[],[f296]) ).
fof(f511,plain,
! [X8,X6,X9,X7,X4,X5] :
( app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) != sK55
| ~ ssItem(X5)
| ~ ssList(X6)
| ~ ssList(X7)
| ~ ssList(X8)
| ~ ssItem(X4)
| ~ leq(X5,X4)
| ~ ssItem(X9)
| ~ memberP(X7,X9)
| leq(X4,X9) ),
inference(cnf_transformation,[],[f296]) ).
fof(f512,plain,
! [X8,X6,X7,X4,X5] :
( app(app(app(app(X6,cons(X4,nil)),X7),cons(X5,nil)),X8) != sK55
| ~ ssItem(X5)
| ~ ssList(X6)
| ~ ssList(X7)
| ~ ssList(X8)
| ~ ssItem(X4)
| ~ leq(X5,X4)
| leq(X4,X5) ),
inference(cnf_transformation,[],[f296]) ).
fof(f513,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f515,plain,
sK55 = app(app(app(app(sK59,cons(sK57,nil)),sK60),cons(sK58,nil)),sK61),
inference(definition_unfolding,[],[f509,f513]) ).
fof(f553,definition,
( spl63_1
<=> leq(sK57,sK58) ),
introduced(definition,[new_symbols(definition,[spl63_1])],[avatar_definition]) ).
fof(f557,definition,
( spl63_2
<=> ssItem(sK62) ),
introduced(definition,[new_symbols(definition,[spl63_2])],[avatar_definition]) ).
fof(f559,plain,
( ssItem(sK62)
| ~ spl63_2 ),
inference(avatar_component_clause,[],[f557]) ).
fof(f560,plain,
( ~ spl63_1
| spl63_2 ),
inference(avatar_split_clause,[],[f505,f557,f553]) ).
fof(f562,definition,
( spl63_3
<=> leq(sK57,sK62) ),
introduced(definition,[new_symbols(definition,[spl63_3])],[avatar_definition]) ).
fof(f564,plain,
( ~ leq(sK57,sK62)
| spl63_3 ),
inference(avatar_component_clause,[],[f562]) ).
fof(f566,definition,
( spl63_4
<=> leq(sK62,sK58) ),
introduced(definition,[new_symbols(definition,[spl63_4])],[avatar_definition]) ).
fof(f569,plain,
( ~ spl63_1
| ~ spl63_3
| ~ spl63_4 ),
inference(avatar_split_clause,[],[f506,f566,f562,f553]) ).
fof(f571,definition,
( spl63_5
<=> memberP(sK60,sK62) ),
introduced(definition,[new_symbols(definition,[spl63_5])],[avatar_definition]) ).
fof(f573,plain,
( memberP(sK60,sK62)
| ~ spl63_5 ),
inference(avatar_component_clause,[],[f571]) ).
fof(f574,plain,
( ~ spl63_1
| spl63_5 ),
inference(avatar_split_clause,[],[f507,f571,f553]) ).
fof(f611,plain,
( sK55 != sK55
| ~ ssItem(sK58)
| ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| leq(sK57,sK58) ),
inference(superposition,[],[f512,f515]) ).
fof(f612,plain,
( ~ ssItem(sK58)
| ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| leq(sK57,sK58) ),
inference(trivial_inequality_removal,[],[f611]) ).
fof(f613,plain,
( ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| leq(sK57,sK58) ),
inference(forward_subsumption_resolution,[],[f612,f501]) ).
fof(f615,plain,
( ~ ssList(sK60)
| ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| leq(sK57,sK58) ),
inference(forward_subsumption_resolution,[],[f613,f502]) ).
fof(f617,plain,
( ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| leq(sK57,sK58) ),
inference(forward_subsumption_resolution,[],[f615,f503]) ).
fof(f626,plain,
( ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| leq(sK57,sK58) ),
inference(forward_subsumption_resolution,[],[f617,f504]) ).
fof(f627,plain,
( ~ leq(sK58,sK57)
| leq(sK57,sK58) ),
inference(forward_subsumption_resolution,[],[f626,f500]) ).
fof(f628,plain,
leq(sK57,sK58),
inference(forward_subsumption_resolution,[],[f627,f508]) ).
fof(f631,plain,
spl63_1,
inference(avatar_split_clause,[],[f628,f553]) ).
fof(f633,plain,
! [X0] :
( sK55 != sK55
| ~ ssItem(sK58)
| ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| ~ ssItem(X0)
| ~ memberP(sK60,X0)
| leq(X0,sK58) ),
inference(superposition,[],[f510,f515]) ).
fof(f634,plain,
! [X0] :
( ~ ssItem(sK58)
| ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| ~ ssItem(X0)
| ~ memberP(sK60,X0)
| leq(X0,sK58) ),
inference(trivial_inequality_removal,[],[f633]) ).
fof(f635,plain,
! [X0] :
( ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| ~ ssItem(X0)
| ~ memberP(sK60,X0)
| leq(X0,sK58) ),
inference(forward_subsumption_resolution,[],[f634,f501]) ).
fof(f636,plain,
! [X0] :
( ~ ssList(sK60)
| ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| ~ ssItem(X0)
| ~ memberP(sK60,X0)
| leq(X0,sK58) ),
inference(forward_subsumption_resolution,[],[f635,f502]) ).
fof(f637,plain,
! [X0] :
( ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| ~ ssItem(X0)
| ~ memberP(sK60,X0)
| leq(X0,sK58) ),
inference(forward_subsumption_resolution,[],[f636,f503]) ).
fof(f638,plain,
! [X0] :
( ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| ~ ssItem(X0)
| ~ memberP(sK60,X0)
| leq(X0,sK58) ),
inference(forward_subsumption_resolution,[],[f637,f504]) ).
fof(f639,plain,
! [X0] :
( ~ leq(sK58,sK57)
| ~ ssItem(X0)
| ~ memberP(sK60,X0)
| leq(X0,sK58) ),
inference(forward_subsumption_resolution,[],[f638,f500]) ).
fof(f640,plain,
! [X0] :
( ~ memberP(sK60,X0)
| ~ ssItem(X0)
| leq(X0,sK58) ),
inference(forward_subsumption_resolution,[],[f639,f508]) ).
fof(f641,plain,
( ~ ssItem(sK62)
| leq(sK62,sK58)
| ~ spl63_5 ),
inference(resolution,[],[f640,f573]) ).
fof(f642,plain,
( leq(sK62,sK58)
| ~ spl63_2
| ~ spl63_5 ),
inference(forward_subsumption_resolution,[],[f641,f559]) ).
fof(f643,plain,
( spl63_4
| ~ spl63_2
| ~ spl63_5 ),
inference(avatar_split_clause,[],[f642,f571,f557,f566]) ).
fof(f645,plain,
! [X0] :
( sK55 != sK55
| ~ ssItem(sK58)
| ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| ~ ssItem(X0)
| ~ memberP(sK60,X0)
| leq(sK57,X0) ),
inference(superposition,[],[f511,f515]) ).
fof(f646,plain,
! [X0] :
( ~ ssItem(sK58)
| ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| ~ ssItem(X0)
| ~ memberP(sK60,X0)
| leq(sK57,X0) ),
inference(trivial_inequality_removal,[],[f645]) ).
fof(f647,plain,
! [X0] :
( ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| ~ ssItem(X0)
| ~ memberP(sK60,X0)
| leq(sK57,X0) ),
inference(forward_subsumption_resolution,[],[f646,f501]) ).
fof(f648,plain,
! [X0] :
( ~ ssList(sK60)
| ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| ~ ssItem(X0)
| ~ memberP(sK60,X0)
| leq(sK57,X0) ),
inference(forward_subsumption_resolution,[],[f647,f502]) ).
fof(f649,plain,
! [X0] :
( ~ ssList(sK61)
| ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| ~ ssItem(X0)
| ~ memberP(sK60,X0)
| leq(sK57,X0) ),
inference(forward_subsumption_resolution,[],[f648,f503]) ).
fof(f650,plain,
! [X0] :
( ~ ssItem(sK57)
| ~ leq(sK58,sK57)
| ~ ssItem(X0)
| ~ memberP(sK60,X0)
| leq(sK57,X0) ),
inference(forward_subsumption_resolution,[],[f649,f504]) ).
fof(f651,plain,
! [X0] :
( ~ leq(sK58,sK57)
| ~ ssItem(X0)
| ~ memberP(sK60,X0)
| leq(sK57,X0) ),
inference(forward_subsumption_resolution,[],[f650,f500]) ).
fof(f652,plain,
! [X0] :
( ~ memberP(sK60,X0)
| ~ ssItem(X0)
| leq(sK57,X0) ),
inference(forward_subsumption_resolution,[],[f651,f508]) ).
fof(f692,plain,
( ~ ssItem(sK62)
| leq(sK57,sK62)
| ~ spl63_5 ),
inference(resolution,[],[f652,f573]) ).
fof(f693,plain,
( leq(sK57,sK62)
| ~ spl63_2
| ~ spl63_5 ),
inference(forward_subsumption_resolution,[],[f692,f559]) ).
fof(f694,plain,
( $false
| ~ spl63_2
| spl63_3
| ~ spl63_5 ),
inference(forward_subsumption_resolution,[],[f693,f564]) ).
fof(f695,plain,
( ~ spl63_2
| spl63_3
| ~ spl63_5 ),
inference(avatar_contradiction_clause,[],[f694]) ).
cnf(s1,plain,
( ~ spl63_1
| spl63_2 ),
inference(sat_conversion,[],[f560]) ).
cnf(s2,plain,
( ~ spl63_1
| ~ spl63_3
| ~ spl63_4 ),
inference(sat_conversion,[],[f569]) ).
cnf(s3,plain,
( ~ spl63_1
| spl63_5 ),
inference(sat_conversion,[],[f574]) ).
cnf(s15,plain,
spl63_1,
inference(sat_conversion,[],[f631]) ).
cnf(s16,plain,
( ~ spl63_2
| spl63_4
| ~ spl63_5 ),
inference(sat_conversion,[],[f643]) ).
cnf(s17,plain,
( ~ spl63_2
| spl63_3
| ~ spl63_5 ),
inference(sat_conversion,[],[f695]) ).
cnf(s22,plain,
spl63_5,
inference(rat,[],[s3,s15]) ).
cnf(s23,plain,
( ~ spl63_3
| ~ spl63_4 ),
inference(rat,[],[s2,s15]) ).
cnf(s24,plain,
spl63_2,
inference(rat,[],[s1,s15]) ).
cnf(s25,plain,
spl63_3,
inference(rat,[],[s17,s22,s24]) ).
cnf(s26,plain,
spl63_4,
inference(rat,[],[s16,s22,s24]) ).
cnf(s27,plain,
$false,
inference(rat,[],[s23,s26,s25]) ).
fof(f696,plain,
$false,
inference(avatar_sat_refutation,[],[s27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC153+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 08:15:33 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 Running first-order model finding
% 0.13/0.39 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.45 % (3471064)Will run a generic schedule for satisfiability detection.
% 0.13/0.45 % (3471074)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3372012495:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.13/0.45 % (3471069)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3887184361_2999 on theBenchmark for (2999ds/0Mi)
% 0.13/0.45 % (3471071)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1171981084:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.13/0.45 % (3471072)dis+10_1_sil=32000:sp=arity:random_seed=2903265893:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.13/0.45 % (3471073)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2790649073:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.45 % (3471075)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2815240531:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.13/0.45 % (3471070)% WARNING: option uhcvi not known.
% 0.13/0.45 % (3471070)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2899588314:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.13/0.45 % (3471072) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3471064-3471072"...
% 0.13/0.45 % (3471072)...printing done.
% 0.13/0.45 % (3471075) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3471064-3471075"...
% 0.13/0.45 % (3471071) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3471064-3471071"...
% 0.13/0.45 % (3471072)Refutation found. Thanks to Tanya!
% 0.13/0.45 % SZS status Theorem for theBenchmark
% 0.13/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.45 % (3471072)------------------------------
% 0.13/0.45 % (3471072)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.45 % (3471072)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.45 % (3471072)CaDiCaL version: 2.1.3
% 0.13/0.45 % (3471072)Termination reason: Refutation
% 0.13/0.45 % (3471072)Time elapsed: 0.010 s
% 0.13/0.45 % (3471072)Peak memory usage: 13 MB
% 0.13/0.45 % (3471072)Instructions burned: 15 (million)
% 0.13/0.45 % (3471064)Success in time 0.05 s
% 0.13/0.45 % Vampire exiting
%------------------------------------------------------------------------------