%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWX070+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:45:48 PM UTC 2026
% Result : Theorem 7.50s 1.64s
% Output : Refutation 9.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 18
% Syntax : Number of formulae : 116 ( 16 unt; 10 def)
% Number of atoms : 410 ( 92 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 464 ( 170 ~; 204 |; 72 &)
% ( 16 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 8 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 3 con; 0-3 aty)
% Number of variables : 207 ( 0 sgn 155 !; 52 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [X0,X1] : p(X0) != neg(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id26) ).
fof(f29,axiom,
! [X0,X1] :
( neg(X0) = neg(X1)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id29) ).
fof(f30,axiom,
! [X0,X1,X2] : neg(X0) != and(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id30) ).
fof(f31,axiom,
! [X0,X1,X2] : neg(X0) != or(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id31) ).
fof(f80,axiom,
! [X0,X1,X2] :
( true_succeeds(X0,X1,X2)
<=> ( ? [X3,X4] :
( X0 = or(X3,X4)
& true_succeeds(X4,X1,X2) )
| ? [X5,X6] :
( X0 = or(X5,X6)
& true_succeeds(X5,X1,X2) )
| ? [X7,X8,X9] :
( X0 = and(X7,X8)
& true_succeeds(X7,X1,X9)
& true_succeeds(X8,X9,X2) )
| ? [X10] :
( X0 = neg(X10)
& false_succeeds(X10,X1,X2) )
| ? [X11] :
( X0 = p(X11)
& X2 = cons(p(X11),X1)
& member_fails(neg(p(X11)),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id80) ).
fof(f83,axiom,
! [X0] :
( satisfiable_succeeds(X0)
<=> ? [X1] : true_succeeds(X0,nil,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id83) ).
fof(f87,axiom,
! [X0] :
( valid_fails(X0)
<=> satisfiable_succeeds(neg(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id87) ).
fof(f149,conjecture,
! [X0] :
( valid_fails(X0)
<=> ? [X1] : false_succeeds(X0,nil,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','theorem-(valid:fail)') ).
fof(f150,negated_conjecture,
~ ! [X0] :
( valid_fails(X0)
<=> ? [X1] : false_succeeds(X0,nil,X1) ),
inference(negated_conjecture,[status(cth)],[f149]) ).
fof(f175,plain,
! [X0,X1] :
( X0 = X1
| neg(X0) != neg(X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f277,plain,
? [X0] :
( valid_fails(X0)
<~> ? [X1] : false_succeeds(X0,nil,X1) ),
inference(ennf_transformation,[],[f150]) ).
fof(f335,definition,
! [X0,X2,X1] :
( sP48(X0,X2,X1)
<=> ? [X11] :
( X0 = p(X11)
& X2 = cons(p(X11),X1)
& member_fails(neg(p(X11)),X1) ) ),
introduced(definition,[new_symbols(definition,[sP48])],[predicate_definition_introduction]) ).
fof(f336,definition,
! [X0,X1,X2] :
( sP49(X0,X1,X2)
<=> ? [X7,X8,X9] :
( X0 = and(X7,X8)
& true_succeeds(X7,X1,X9)
& true_succeeds(X8,X9,X2) ) ),
introduced(definition,[new_symbols(definition,[sP49])],[predicate_definition_introduction]) ).
fof(f337,definition,
! [X0,X2,X1] :
( sP50(X0,X2,X1)
<=> ( ? [X3,X4] :
( X0 = or(X3,X4)
& true_succeeds(X4,X1,X2) )
| ? [X5,X6] :
( X0 = or(X5,X6)
& true_succeeds(X5,X1,X2) )
| sP49(X0,X1,X2)
| ? [X10] :
( X0 = neg(X10)
& false_succeeds(X10,X1,X2) )
| sP48(X0,X2,X1) ) ),
introduced(definition,[new_symbols(definition,[sP50])],[predicate_definition_introduction]) ).
fof(f338,plain,
! [X0,X1,X2] :
( true_succeeds(X0,X1,X2)
<=> sP50(X0,X2,X1) ),
inference(definition_folding,[],[f80,f337,f336,f335]) ).
fof(f526,plain,
! [X0,X2,X1] :
( ( sP50(X0,X2,X1)
| ( ! [X3,X4] :
( or(X3,X4) != X0
| ~ true_succeeds(X4,X1,X2) )
& ! [X5,X6] :
( or(X5,X6) != X0
| ~ true_succeeds(X5,X1,X2) )
& ~ sP49(X0,X1,X2)
& ! [X10] :
( neg(X10) != X0
| ~ false_succeeds(X10,X1,X2) )
& ~ sP48(X0,X2,X1) ) )
& ( ? [X3,X4] :
( X0 = or(X3,X4)
& true_succeeds(X4,X1,X2) )
| ? [X5,X6] :
( X0 = or(X5,X6)
& true_succeeds(X5,X1,X2) )
| sP49(X0,X1,X2)
| ? [X10] :
( X0 = neg(X10)
& false_succeeds(X10,X1,X2) )
| sP48(X0,X2,X1)
| ~ sP50(X0,X2,X1) ) ),
inference(nnf_transformation,[],[f337]) ).
fof(f527,plain,
! [X0,X2,X1] :
( ( sP50(X0,X2,X1)
| ( ! [X3,X4] :
( or(X3,X4) != X0
| ~ true_succeeds(X4,X1,X2) )
& ! [X5,X6] :
( or(X5,X6) != X0
| ~ true_succeeds(X5,X1,X2) )
& ~ sP49(X0,X1,X2)
& ! [X10] :
( neg(X10) != X0
| ~ false_succeeds(X10,X1,X2) )
& ~ sP48(X0,X2,X1) ) )
& ( ? [X3,X4] :
( X0 = or(X3,X4)
& true_succeeds(X4,X1,X2) )
| ? [X5,X6] :
( X0 = or(X5,X6)
& true_succeeds(X5,X1,X2) )
| sP49(X0,X1,X2)
| ? [X10] :
( X0 = neg(X10)
& false_succeeds(X10,X1,X2) )
| sP48(X0,X2,X1)
| ~ sP50(X0,X2,X1) ) ),
inference(flattening,[],[f526]) ).
fof(f528,plain,
! [X0,X1,X2] :
( ( sP50(X0,X1,X2)
| ( ! [X3,X4] :
( or(X3,X4) != X0
| ~ true_succeeds(X4,X2,X1) )
& ! [X5,X6] :
( or(X5,X6) != X0
| ~ true_succeeds(X5,X2,X1) )
& ~ sP49(X0,X2,X1)
& ! [X7] :
( neg(X7) != X0
| ~ false_succeeds(X7,X2,X1) )
& ~ sP48(X0,X1,X2) ) )
& ( ? [X8,X9] :
( or(X8,X9) = X0
& true_succeeds(X9,X2,X1) )
| ? [X10,X11] :
( or(X10,X11) = X0
& true_succeeds(X10,X2,X1) )
| sP49(X0,X2,X1)
| ? [X12] :
( neg(X12) = X0
& false_succeeds(X12,X2,X1) )
| sP48(X0,X1,X2)
| ~ sP50(X0,X1,X2) ) ),
inference(rectify,[],[f527]) ).
fof(f529,plain,
! [X0,X1,X2] :
( ( sP50(X0,X1,X2)
| ( ! [X3,X4] :
( or(X3,X4) != X0
| ~ true_succeeds(X4,X2,X1) )
& ! [X5,X6] :
( or(X5,X6) != X0
| ~ true_succeeds(X5,X2,X1) )
& ~ sP49(X0,X2,X1)
& ! [X7] :
( neg(X7) != X0
| ~ false_succeeds(X7,X2,X1) )
& ~ sP48(X0,X1,X2) ) )
& ( ( or(sK159(X0,X1,X2),sK160(X0,X1,X2)) = X0
& true_succeeds(sK160(X0,X1,X2),X2,X1) )
| ( or(sK161(X0,X1,X2),sK162(X0,X1,X2)) = X0
& true_succeeds(sK161(X0,X1,X2),X2,X1) )
| sP49(X0,X2,X1)
| ( neg(sK163(X0,X1,X2)) = X0
& false_succeeds(sK163(X0,X1,X2),X2,X1) )
| sP48(X0,X1,X2)
| ~ sP50(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK159,sK160,sK161,sK162,sK163]),skolemize(X8,sK159(X0,X1,X2)),skolemize(X9,sK160(X0,X1,X2)),skolemize(X10,sK161(X0,X1,X2)),skolemize(X11,sK162(X0,X1,X2)),skolemize(X12,sK163(X0,X1,X2))],[f528]) ).
fof(f530,plain,
! [X0,X1,X2] :
( ( sP49(X0,X1,X2)
| ! [X7,X8,X9] :
( and(X7,X8) != X0
| ~ true_succeeds(X7,X1,X9)
| ~ true_succeeds(X8,X9,X2) ) )
& ( ? [X7,X8,X9] :
( X0 = and(X7,X8)
& true_succeeds(X7,X1,X9)
& true_succeeds(X8,X9,X2) )
| ~ sP49(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f336]) ).
fof(f531,plain,
! [X0,X1,X2] :
( ( sP49(X0,X1,X2)
| ! [X3,X4,X5] :
( and(X3,X4) != X0
| ~ true_succeeds(X3,X1,X5)
| ~ true_succeeds(X4,X5,X2) ) )
& ( ? [X6,X7,X8] :
( and(X6,X7) = X0
& true_succeeds(X6,X1,X8)
& true_succeeds(X7,X8,X2) )
| ~ sP49(X0,X1,X2) ) ),
inference(rectify,[],[f530]) ).
fof(f532,plain,
! [X0,X1,X2] :
( ( sP49(X0,X1,X2)
| ! [X3,X4,X5] :
( and(X3,X4) != X0
| ~ true_succeeds(X3,X1,X5)
| ~ true_succeeds(X4,X5,X2) ) )
& ( ( and(sK164(X0,X1,X2),sK165(X0,X1,X2)) = X0
& true_succeeds(sK164(X0,X1,X2),X1,sK166(X0,X1,X2))
& true_succeeds(sK165(X0,X1,X2),sK166(X0,X1,X2),X2) )
| ~ sP49(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK164,sK165,sK166]),skolemize(X6,sK164(X0,X1,X2)),skolemize(X7,sK165(X0,X1,X2)),skolemize(X8,sK166(X0,X1,X2))],[f531]) ).
fof(f533,plain,
! [X0,X2,X1] :
( ( sP48(X0,X2,X1)
| ! [X11] :
( p(X11) != X0
| cons(p(X11),X1) != X2
| ~ member_fails(neg(p(X11)),X1) ) )
& ( ? [X11] :
( X0 = p(X11)
& X2 = cons(p(X11),X1)
& member_fails(neg(p(X11)),X1) )
| ~ sP48(X0,X2,X1) ) ),
inference(nnf_transformation,[],[f335]) ).
fof(f534,plain,
! [X0,X1,X2] :
( ( sP48(X0,X1,X2)
| ! [X3] :
( p(X3) != X0
| cons(p(X3),X2) != X1
| ~ member_fails(neg(p(X3)),X2) ) )
& ( ? [X4] :
( p(X4) = X0
& cons(p(X4),X2) = X1
& member_fails(neg(p(X4)),X2) )
| ~ sP48(X0,X1,X2) ) ),
inference(rectify,[],[f533]) ).
fof(f535,plain,
! [X0,X1,X2] :
( ( sP48(X0,X1,X2)
| ! [X3] :
( p(X3) != X0
| cons(p(X3),X2) != X1
| ~ member_fails(neg(p(X3)),X2) ) )
& ( ( p(sK167(X0,X1,X2)) = X0
& cons(p(sK167(X0,X1,X2)),X2) = X1
& member_fails(neg(p(sK167(X0,X1,X2))),X2) )
| ~ sP48(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK167]),skolemize(X4,sK167(X0,X1,X2))],[f534]) ).
fof(f536,plain,
! [X0,X1,X2] :
( ( true_succeeds(X0,X1,X2)
| ~ sP50(X0,X2,X1) )
& ( sP50(X0,X2,X1)
| ~ true_succeeds(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f338]) ).
fof(f559,plain,
! [X0] :
( ( satisfiable_succeeds(X0)
| ! [X1] : ~ true_succeeds(X0,nil,X1) )
& ( ? [X1] : true_succeeds(X0,nil,X1)
| ~ satisfiable_succeeds(X0) ) ),
inference(nnf_transformation,[],[f83]) ).
fof(f560,plain,
! [X0] :
( ( satisfiable_succeeds(X0)
| ! [X1] : ~ true_succeeds(X0,nil,X1) )
& ( ? [X2] : true_succeeds(X0,nil,X2)
| ~ satisfiable_succeeds(X0) ) ),
inference(rectify,[],[f559]) ).
fof(f561,plain,
! [X0] :
( ( satisfiable_succeeds(X0)
| ! [X1] : ~ true_succeeds(X0,nil,X1) )
& ( true_succeeds(X0,nil,sK186(X0))
| ~ satisfiable_succeeds(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK186]),skolemize(X2,sK186(X0))],[f560]) ).
fof(f569,plain,
! [X0] :
( ( valid_fails(X0)
| ~ satisfiable_succeeds(neg(X0)) )
& ( satisfiable_succeeds(neg(X0))
| ~ valid_fails(X0) ) ),
inference(nnf_transformation,[],[f87]) ).
fof(f654,plain,
? [X0] :
( ( ! [X1] : ~ false_succeeds(X0,nil,X1)
| ~ valid_fails(X0) )
& ( ? [X1] : false_succeeds(X0,nil,X1)
| valid_fails(X0) ) ),
inference(nnf_transformation,[],[f277]) ).
fof(f655,plain,
? [X0] :
( ( ! [X1] : ~ false_succeeds(X0,nil,X1)
| ~ valid_fails(X0) )
& ( ? [X2] : false_succeeds(X0,nil,X2)
| valid_fails(X0) ) ),
inference(rectify,[],[f654]) ).
fof(f656,plain,
( ( ! [X1] : ~ false_succeeds(sK235,nil,X1)
| ~ valid_fails(sK235) )
& ( false_succeeds(sK235,nil,sK236)
| valid_fails(sK235) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK235,sK236]),skolemize(X0,sK235),skolemize(X2,sK236)],[f655]) ).
fof(f682,plain,
! [X0,X1] : p(X0) != neg(X1),
inference(cnf_transformation,[],[f26]) ).
fof(f685,plain,
! [X0,X1] :
( neg(X0) != neg(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f175]) ).
fof(f686,plain,
! [X2,X0,X1] : neg(X0) != and(X1,X2),
inference(cnf_transformation,[],[f30]) ).
fof(f687,plain,
! [X2,X0,X1] : neg(X0) != or(X1,X2),
inference(cnf_transformation,[],[f31]) ).
fof(f1045,plain,
! [X2,X0,X1] :
( false_succeeds(sK163(X0,X1,X2),X2,X1)
| or(sK161(X0,X1,X2),sK162(X0,X1,X2)) = X0
| sP49(X0,X2,X1)
| or(sK159(X0,X1,X2),sK160(X0,X1,X2)) = X0
| sP48(X0,X1,X2)
| ~ sP50(X0,X1,X2) ),
inference(cnf_transformation,[],[f529]) ).
fof(f1046,plain,
! [X2,X0,X1] :
( ~ sP50(X0,X1,X2)
| or(sK161(X0,X1,X2),sK162(X0,X1,X2)) = X0
| sP49(X0,X2,X1)
| neg(sK163(X0,X1,X2)) = X0
| sP48(X0,X1,X2)
| or(sK159(X0,X1,X2),sK160(X0,X1,X2)) = X0 ),
inference(cnf_transformation,[],[f529]) ).
fof(f1048,plain,
! [X2,X0,X1,X7] :
( sP50(X0,X1,X2)
| neg(X7) != X0
| ~ false_succeeds(X7,X2,X1) ),
inference(cnf_transformation,[],[f529]) ).
fof(f1054,plain,
! [X2,X0,X1] :
( ~ sP49(X0,X1,X2)
| and(sK164(X0,X1,X2),sK165(X0,X1,X2)) = X0 ),
inference(cnf_transformation,[],[f532]) ).
fof(f1058,plain,
! [X2,X0,X1] :
( ~ sP48(X0,X1,X2)
| p(sK167(X0,X1,X2)) = X0 ),
inference(cnf_transformation,[],[f535]) ).
fof(f1060,plain,
! [X2,X0,X1] :
( ~ true_succeeds(X0,X1,X2)
| sP50(X0,X2,X1) ),
inference(cnf_transformation,[],[f536]) ).
fof(f1061,plain,
! [X2,X0,X1] :
( ~ sP50(X0,X2,X1)
| true_succeeds(X0,X1,X2) ),
inference(cnf_transformation,[],[f536]) ).
fof(f1111,plain,
! [X0] :
( true_succeeds(X0,nil,sK186(X0))
| ~ satisfiable_succeeds(X0) ),
inference(cnf_transformation,[],[f561]) ).
fof(f1112,plain,
! [X0,X1] :
( ~ true_succeeds(X0,nil,X1)
| satisfiable_succeeds(X0) ),
inference(cnf_transformation,[],[f561]) ).
fof(f1119,plain,
! [X0] :
( satisfiable_succeeds(neg(X0))
| ~ valid_fails(X0) ),
inference(cnf_transformation,[],[f569]) ).
fof(f1120,plain,
! [X0] :
( ~ satisfiable_succeeds(neg(X0))
| valid_fails(X0) ),
inference(cnf_transformation,[],[f569]) ).
fof(f1284,plain,
( false_succeeds(sK235,nil,sK236)
| valid_fails(sK235) ),
inference(cnf_transformation,[],[f656]) ).
fof(f1285,plain,
! [X1] :
( ~ false_succeeds(sK235,nil,X1)
| ~ valid_fails(sK235) ),
inference(cnf_transformation,[],[f656]) ).
fof(f1392,plain,
! [X2,X1,X7] :
( sP50(neg(X7),X1,X2)
| ~ false_succeeds(X7,X2,X1) ),
inference(equality_resolution,[],[f1048]) ).
fof(f1447,definition,
( spl237_1
<=> valid_fails(sK235) ),
introduced(definition,[new_symbols(definition,[spl237_1])],[avatar_definition]) ).
fof(f1448,plain,
( ~ valid_fails(sK235)
| spl237_1 ),
inference(avatar_component_clause,[],[f1447]) ).
fof(f1449,plain,
( valid_fails(sK235)
| ~ spl237_1 ),
inference(avatar_component_clause,[],[f1447]) ).
fof(f1451,definition,
( spl237_2
<=> false_succeeds(sK235,nil,sK236) ),
introduced(definition,[new_symbols(definition,[spl237_2])],[avatar_definition]) ).
fof(f1453,plain,
( false_succeeds(sK235,nil,sK236)
| ~ spl237_2 ),
inference(avatar_component_clause,[],[f1451]) ).
fof(f1454,plain,
( spl237_1
| spl237_2 ),
inference(avatar_split_clause,[],[f1284,f1451,f1447]) ).
fof(f1456,definition,
( spl237_3
<=> ! [X1] : ~ false_succeeds(sK235,nil,X1) ),
introduced(definition,[new_symbols(definition,[spl237_3])],[avatar_definition]) ).
fof(f1457,plain,
( ! [X1] : ~ false_succeeds(sK235,nil,X1)
| ~ spl237_3 ),
inference(avatar_component_clause,[],[f1456]) ).
fof(f1458,plain,
( ~ spl237_1
| spl237_3 ),
inference(avatar_split_clause,[],[f1285,f1456,f1447]) ).
fof(f1498,plain,
! [X2,X0,X1] :
( true_succeeds(neg(X0),X1,X2)
| ~ false_succeeds(X0,X1,X2) ),
inference(resolution,[],[f1392,f1061]) ).
fof(f1610,plain,
! [X0,X1] :
( ~ false_succeeds(X0,nil,X1)
| satisfiable_succeeds(neg(X0)) ),
inference(resolution,[],[f1112,f1498]) ).
fof(f1622,plain,
( satisfiable_succeeds(neg(sK235))
| ~ spl237_2 ),
inference(resolution,[],[f1610,f1453]) ).
fof(f1623,plain,
( valid_fails(sK235)
| ~ spl237_2 ),
inference(resolution,[],[f1622,f1120]) ).
fof(f1624,plain,
( $false
| spl237_1
| ~ spl237_2 ),
inference(forward_subsumption_resolution,[],[f1623,f1448]) ).
fof(f1625,plain,
( spl237_1
| ~ spl237_2 ),
inference(avatar_contradiction_clause,[],[f1624]) ).
fof(f1869,definition,
( spl237_10
<=> true_succeeds(neg(sK235),nil,sK186(neg(sK235))) ),
introduced(definition,[new_symbols(definition,[spl237_10])],[avatar_definition]) ).
fof(f1870,plain,
( ~ true_succeeds(neg(sK235),nil,sK186(neg(sK235)))
| spl237_10 ),
inference(avatar_component_clause,[],[f1869]) ).
fof(f1871,plain,
( true_succeeds(neg(sK235),nil,sK186(neg(sK235)))
| ~ spl237_10 ),
inference(avatar_component_clause,[],[f1869]) ).
fof(f1876,plain,
( ~ satisfiable_succeeds(neg(sK235))
| spl237_10 ),
inference(resolution,[],[f1870,f1111]) ).
fof(f1877,plain,
( ~ valid_fails(sK235)
| spl237_10 ),
inference(resolution,[],[f1876,f1119]) ).
fof(f1878,plain,
( $false
| ~ spl237_1
| spl237_10 ),
inference(forward_subsumption_resolution,[],[f1877,f1449]) ).
fof(f1879,plain,
( ~ spl237_1
| spl237_10 ),
inference(avatar_contradiction_clause,[],[f1878]) ).
fof(f1882,plain,
( sP50(neg(sK235),sK186(neg(sK235)),nil)
| ~ spl237_10 ),
inference(resolution,[],[f1871,f1060]) ).
fof(f1891,plain,
( neg(sK235) = or(sK161(neg(sK235),sK186(neg(sK235)),nil),sK162(neg(sK235),sK186(neg(sK235)),nil))
| sP49(neg(sK235),nil,sK186(neg(sK235)))
| neg(sK235) = neg(sK163(neg(sK235),sK186(neg(sK235)),nil))
| sP48(neg(sK235),sK186(neg(sK235)),nil)
| neg(sK235) = or(sK159(neg(sK235),sK186(neg(sK235)),nil),sK160(neg(sK235),sK186(neg(sK235)),nil))
| ~ spl237_10 ),
inference(resolution,[],[f1882,f1046]) ).
fof(f1893,plain,
( neg(sK235) = or(sK161(neg(sK235),sK186(neg(sK235)),nil),sK162(neg(sK235),sK186(neg(sK235)),nil))
| sP49(neg(sK235),nil,sK186(neg(sK235)))
| neg(sK235) = neg(sK163(neg(sK235),sK186(neg(sK235)),nil))
| sP48(neg(sK235),sK186(neg(sK235)),nil)
| ~ spl237_10 ),
inference(forward_subsumption_resolution,[],[f1891,f687]) ).
fof(f1894,plain,
( sP49(neg(sK235),nil,sK186(neg(sK235)))
| neg(sK235) = neg(sK163(neg(sK235),sK186(neg(sK235)),nil))
| sP48(neg(sK235),sK186(neg(sK235)),nil)
| ~ spl237_10 ),
inference(forward_subsumption_resolution,[],[f1893,f687]) ).
fof(f1896,definition,
( spl237_11
<=> sP48(neg(sK235),sK186(neg(sK235)),nil) ),
introduced(definition,[new_symbols(definition,[spl237_11])],[avatar_definition]) ).
fof(f1897,plain,
( ~ sP48(neg(sK235),sK186(neg(sK235)),nil)
| spl237_11 ),
inference(avatar_component_clause,[],[f1896]) ).
fof(f1898,plain,
( sP48(neg(sK235),sK186(neg(sK235)),nil)
| ~ spl237_11 ),
inference(avatar_component_clause,[],[f1896]) ).
fof(f1900,definition,
( spl237_12
<=> neg(sK235) = neg(sK163(neg(sK235),sK186(neg(sK235)),nil)) ),
introduced(definition,[new_symbols(definition,[spl237_12])],[avatar_definition]) ).
fof(f1902,plain,
( neg(sK235) = neg(sK163(neg(sK235),sK186(neg(sK235)),nil))
| ~ spl237_12 ),
inference(avatar_component_clause,[],[f1900]) ).
fof(f1904,definition,
( spl237_13
<=> sP49(neg(sK235),nil,sK186(neg(sK235))) ),
introduced(definition,[new_symbols(definition,[spl237_13])],[avatar_definition]) ).
fof(f1906,plain,
( sP49(neg(sK235),nil,sK186(neg(sK235)))
| ~ spl237_13 ),
inference(avatar_component_clause,[],[f1904]) ).
fof(f1907,plain,
( spl237_11
| spl237_12
| spl237_13
| ~ spl237_10 ),
inference(avatar_split_clause,[],[f1894,f1869,f1904,f1900,f1896]) ).
fof(f1911,plain,
( neg(sK235) = p(sK167(neg(sK235),sK186(neg(sK235)),nil))
| ~ spl237_11 ),
inference(resolution,[],[f1898,f1058]) ).
fof(f1913,plain,
( $false
| ~ spl237_11 ),
inference(forward_subsumption_resolution,[],[f1911,f682]) ).
fof(f1914,plain,
~ spl237_11,
inference(avatar_contradiction_clause,[],[f1913]) ).
fof(f1918,plain,
( ! [X0] :
( neg(X0) != neg(sK235)
| sK163(neg(sK235),sK186(neg(sK235)),nil) = X0 )
| ~ spl237_12 ),
inference(superposition,[],[f685,f1902]) ).
fof(f1935,plain,
( sK235 = sK163(neg(sK235),sK186(neg(sK235)),nil)
| ~ spl237_12 ),
inference(equality_resolution,[],[f1918]) ).
fof(f1937,plain,
( false_succeeds(sK235,nil,sK186(neg(sK235)))
| neg(sK235) = or(sK161(neg(sK235),sK186(neg(sK235)),nil),sK162(neg(sK235),sK186(neg(sK235)),nil))
| sP49(neg(sK235),nil,sK186(neg(sK235)))
| neg(sK235) = or(sK159(neg(sK235),sK186(neg(sK235)),nil),sK160(neg(sK235),sK186(neg(sK235)),nil))
| sP48(neg(sK235),sK186(neg(sK235)),nil)
| ~ sP50(neg(sK235),sK186(neg(sK235)),nil)
| ~ spl237_12 ),
inference(superposition,[],[f1045,f1935]) ).
fof(f1938,plain,
( neg(sK235) = or(sK161(neg(sK235),sK186(neg(sK235)),nil),sK162(neg(sK235),sK186(neg(sK235)),nil))
| sP49(neg(sK235),nil,sK186(neg(sK235)))
| neg(sK235) = or(sK159(neg(sK235),sK186(neg(sK235)),nil),sK160(neg(sK235),sK186(neg(sK235)),nil))
| sP48(neg(sK235),sK186(neg(sK235)),nil)
| ~ sP50(neg(sK235),sK186(neg(sK235)),nil)
| ~ spl237_3
| ~ spl237_12 ),
inference(forward_subsumption_resolution,[],[f1937,f1457]) ).
fof(f1939,plain,
( neg(sK235) = or(sK161(neg(sK235),sK186(neg(sK235)),nil),sK162(neg(sK235),sK186(neg(sK235)),nil))
| sP49(neg(sK235),nil,sK186(neg(sK235)))
| sP48(neg(sK235),sK186(neg(sK235)),nil)
| ~ sP50(neg(sK235),sK186(neg(sK235)),nil)
| ~ spl237_3
| ~ spl237_12 ),
inference(forward_subsumption_resolution,[],[f1938,f687]) ).
fof(f1940,plain,
( sP49(neg(sK235),nil,sK186(neg(sK235)))
| sP48(neg(sK235),sK186(neg(sK235)),nil)
| ~ sP50(neg(sK235),sK186(neg(sK235)),nil)
| ~ spl237_3
| ~ spl237_12 ),
inference(forward_subsumption_resolution,[],[f1939,f687]) ).
fof(f1941,plain,
( sP49(neg(sK235),nil,sK186(neg(sK235)))
| ~ sP50(neg(sK235),sK186(neg(sK235)),nil)
| ~ spl237_3
| spl237_11
| ~ spl237_12 ),
inference(forward_subsumption_resolution,[],[f1940,f1897]) ).
fof(f1942,plain,
( sP49(neg(sK235),nil,sK186(neg(sK235)))
| ~ spl237_3
| ~ spl237_10
| spl237_11
| ~ spl237_12 ),
inference(forward_subsumption_resolution,[],[f1941,f1882]) ).
fof(f1943,plain,
( spl237_13
| ~ spl237_3
| ~ spl237_10
| spl237_11
| ~ spl237_12 ),
inference(avatar_split_clause,[],[f1942,f1900,f1896,f1869,f1456,f1904]) ).
fof(f1945,plain,
( neg(sK235) = and(sK164(neg(sK235),nil,sK186(neg(sK235))),sK165(neg(sK235),nil,sK186(neg(sK235))))
| ~ spl237_13 ),
inference(resolution,[],[f1906,f1054]) ).
fof(f1947,plain,
( $false
| ~ spl237_13 ),
inference(forward_subsumption_resolution,[],[f1945,f686]) ).
fof(f1948,plain,
~ spl237_13,
inference(avatar_contradiction_clause,[],[f1947]) ).
cnf(s1,plain,
( spl237_1
| spl237_2 ),
inference(sat_conversion,[],[f1454]) ).
cnf(s2,plain,
( ~ spl237_1
| spl237_3 ),
inference(sat_conversion,[],[f1458]) ).
cnf(s3,plain,
( spl237_1
| ~ spl237_2 ),
inference(sat_conversion,[],[f1625]) ).
cnf(s9,plain,
( ~ spl237_1
| spl237_10 ),
inference(sat_conversion,[],[f1879]) ).
cnf(s10,plain,
( ~ spl237_10
| spl237_11
| spl237_12
| spl237_13 ),
inference(sat_conversion,[],[f1907]) ).
cnf(s11,plain,
~ spl237_11,
inference(sat_conversion,[],[f1914]) ).
cnf(s12,plain,
( ~ spl237_3
| ~ spl237_10
| spl237_11
| ~ spl237_12
| spl237_13 ),
inference(sat_conversion,[],[f1943]) ).
cnf(s13,plain,
~ spl237_13,
inference(sat_conversion,[],[f1948]) ).
cnf(s14,plain,
( ~ spl237_3
| ~ spl237_10
| spl237_11
| ~ spl237_12 ),
inference(rat,[],[s12,s13]) ).
cnf(s15,plain,
( ~ spl237_10
| spl237_12 ),
inference(rat,[],[s10,s13,s11]) ).
cnf(s16,plain,
spl237_1,
inference(rat,[],[s1,s3]) ).
cnf(s17,plain,
spl237_10,
inference(rat,[],[s9,s16]) ).
cnf(s18,plain,
spl237_3,
inference(rat,[],[s2,s16]) ).
cnf(s19,plain,
spl237_12,
inference(rat,[],[s15,s17]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s14,s19,s11,s17,s18]) ).
fof(f1949,plain,
$false,
inference(avatar_sat_refutation,[],[s21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWX070+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n018.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Mon Sep 28 14:59:55 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 Running first-order theorem proving
% 0.09/0.20 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.50/1.64 % (3462206)Detected formulas, will run a generic FOF schedule.
% 7.50/1.64 % (3462216)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2933895781:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 7.50/1.64 % (3462213)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=1129407833:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 7.50/1.64 % (3462217)dis-21_1_sil=8000:lcm=predicate:random_seed=936660765: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)
% 7.50/1.64 % (3462214)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3556829475:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 7.50/1.64 % (3462215)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=260974198:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 7.50/1.64 % (3462212)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=3856498079:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 7.50/1.64 % (3462211)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=2815038425:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 7.50/1.64 % (3462214)Refutation not found, incomplete strategy
% 7.50/1.64 % (3462214)------------------------------
% 7.50/1.64 % (3462214)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.50/1.64 % (3462214)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.50/1.64 % (3462214)CaDiCaL version: 2.1.3
% 7.50/1.64 % (3462214)Termination reason: Refutation not found, incomplete strategy
% 7.50/1.64 % (3462214)Time elapsed: 0.002 s
% 7.50/1.64 % (3462214)Peak memory usage: 88 MB
% 7.50/1.64 % (3462214)Instructions burned: 1 (million)
% 7.50/1.64 % (3462216)Instruction limit reached!
% 7.50/1.64 % (3462216)------------------------------
% 7.50/1.64 % (3462216)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.50/1.64 % (3462216)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.50/1.64 % (3462216)CaDiCaL version: 2.1.3
% 7.50/1.64 % (3462216)Termination reason: Instruction limit
% 7.50/1.64 % (3462216)Termination phase: Saturation
% 7.50/1.64 % (3462216)Time elapsed: 0.050 s
% 7.50/1.64 % (3462216)Peak memory usage: 90 MB
% 7.50/1.64 % (3462216)Instructions burned: 142 (million)
% 7.50/1.64 % (3462217)Instruction limit reached!
% 7.50/1.64 % (3462217)------------------------------
% 7.50/1.64 % (3462217)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.50/1.64 % (3462217)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.50/1.64 % (3462217)CaDiCaL version: 2.1.3
% 7.50/1.64 % (3462217)Termination reason: Instruction limit
% 7.50/1.64 % (3462217)Termination phase: Saturation
% 7.50/1.64 % (3462217)Time elapsed: 0.069 s
% 7.50/1.64 % (3462217)Peak memory usage: 89 MB
% 7.50/1.64 % (3462217)Instructions burned: 130 (million)
% 7.50/1.64 % (3462215)Instruction limit reached!
% 7.50/1.64 % (3462215)------------------------------
% 7.50/1.64 % (3462215)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.50/1.64 % (3462215)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.50/1.64 % (3462215)CaDiCaL version: 2.1.3
% 7.50/1.64 % (3462215)Termination reason: Instruction limit
% 7.50/1.64 % (3462215)Termination phase: Saturation
% 7.50/1.64 % (3462215)Time elapsed: 0.071 s
% 7.50/1.64 % (3462215)Peak memory usage: 88 MB
% 7.50/1.64 % (3462215)Instructions burned: 121 (million)
% 7.50/1.64 % (3462225)lrs+10_1_sil=8000:sp=occurrence:random_seed=835024774:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 7.50/1.64 % (3462226)lrs+10_1_sil=32000:urr=on:br=off:random_seed=264920216:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 7.50/1.64 % (3462226)Refutation not found, incomplete strategy
% 7.50/1.64 % (3462226)------------------------------
% 7.50/1.64 % (3462226)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.50/1.64 % (3462226)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.50/1.64 % (3462226)CaDiCaL version: 2.1.3
% 7.50/1.64 % (3462226)Termination reason: Refutation not found, incomplete strategy
% 7.50/1.64 % (3462226)Time elapsed: 0.003 s
% 7.50/1.64 % (3462226)Peak memory usage: 89 MB
% 7.50/1.64 % (3462226)Instructions burned: 2 (million)
% 7.50/1.64 % (3462225)Instruction limit reached!
% 7.50/1.64 % (3462225)------------------------------
% 7.50/1.64 % (3462225)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.50/1.64 % (3462225)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.50/1.64 % (3462225)CaDiCaL version: 2.1.3
% 7.50/1.64 % (3462225)Termination reason: Instruction limit
% 7.50/1.64 % (3462225)Termination phase: Saturation
% 7.50/1.64 % (3462225)Time elapsed: 0.092 s
% 7.50/1.64 % (3462225)Peak memory usage: 91 MB
% 7.50/1.64 % (3462225)Instructions burned: 287 (million)
% 7.50/1.64 % (3462227)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1809844429:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 7.50/1.64 % (3462214)------------------------------
% 7.50/1.64 % (3462214)------------------------------
% 7.50/1.64 % (3462230)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=2843708923:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 7.50/1.64 % (3462230)Instruction limit reached!
% 7.50/1.64 % (3462230)------------------------------
% 7.50/1.64 % (3462230)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.50/1.64 % (3462230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.50/1.64 % (3462230)CaDiCaL version: 2.1.3
% 7.50/1.64 % (3462230)Termination reason: Instruction limit
% 7.50/1.64 % (3462230)Termination phase: Saturation
% 7.50/1.64 % (3462230)Time elapsed: 0.071 s
% 7.50/1.64 % (3462230)Peak memory usage: 95 MB
% 7.50/1.64 % (3462230)Instructions burned: 251 (million)
% 7.50/1.64 % (3462232)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1818431188:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2996 on theBenchmark for (2996ds/294Mi)
% 7.50/1.64 % (3462227)Instruction limit reached!
% 7.50/1.64 % (3462227)------------------------------
% 7.50/1.64 % (3462227)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.50/1.64 % (3462227)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.50/1.64 % (3462227)CaDiCaL version: 2.1.3
% 7.50/1.64 % (3462227)Termination reason: Instruction limit
% 7.50/1.64 % (3462227)Termination phase: Saturation
% 7.50/1.64 % (3462227)Time elapsed: 0.203 s
% 7.50/1.64 % (3462227)Peak memory usage: 91 MB
% 7.50/1.64 % (3462227)Instructions burned: 326 (million)
% 7.50/1.64 % (3462226)------------------------------
% 7.50/1.64 % (3462226)------------------------------
% 7.50/1.64 % (3462234)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=921447675:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 7.50/1.64 % (3462232)Instruction limit reached!
% 7.50/1.64 % (3462232)------------------------------
% 7.50/1.64 % (3462232)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.50/1.64 % (3462232)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.50/1.64 % (3462232)CaDiCaL version: 2.1.3
% 7.50/1.64 % (3462232)Termination reason: Instruction limit
% 7.50/1.64 % (3462232)Termination phase: Saturation
% 7.50/1.64 % (3462232)Time elapsed: 0.132 s
% 7.50/1.64 % (3462232)Peak memory usage: 89 MB
% 7.50/1.64 % (3462232)Instructions burned: 295 (million)
% 7.50/1.64 % (3462236)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=52115636:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 7.50/1.64 % (3462237)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=3525265871:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 7.50/1.64 % (3462236)Instruction limit reached!
% 7.50/1.64 % (3462236)------------------------------
% 7.50/1.64 % (3462236)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.50/1.64 % (3462236)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.50/1.64 % (3462236)CaDiCaL version: 2.1.3
% 7.50/1.64 % (3462236)Termination reason: Instruction limit
% 7.50/1.64 % (3462236)Termination phase: Saturation
% 7.50/1.64 % (3462236)Time elapsed: 0.070 s
% 7.50/1.64 % (3462236)Peak memory usage: 90 MB
% 7.50/1.64 % (3462236)Instructions burned: 114 (million)
% 7.50/1.64 % (3462239)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=628873337:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2993 on theBenchmark for (2993ds/114Mi)
% 7.50/1.64 % (3462237)Instruction limit reached!
% 7.50/1.64 % (3462237)------------------------------
% 7.50/1.64 % (3462237)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.50/1.64 % (3462237)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.50/1.64 % (3462237)CaDiCaL version: 2.1.3
% 7.50/1.64 % (3462237)Termination reason: Instruction limit
% 7.50/1.64 % (3462237)Termination phase: Saturation
% 7.50/1.64 % (3462237)Time elapsed: 0.068 s
% 7.50/1.64 % (3462237)Peak memory usage: 90 MB
% 7.50/1.64 % (3462237)Instructions burned: 129 (million)
% 7.50/1.64 % (3462239)Instruction limit reached!
% 7.50/1.64 % (3462239)------------------------------
% 7.50/1.64 % (3462239)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.50/1.64 % (3462239)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.50/1.64 % (3462239)CaDiCaL version: 2.1.3
% 7.50/1.64 % (3462239)Termination reason: Instruction limit
% 7.50/1.64 % (3462239)Termination phase: Saturation
% 7.50/1.64 % (3462239)Time elapsed: 0.067 s
% 7.50/1.64 % (3462239)Peak memory usage: 89 MB
% 7.50/1.64 % (3462239)Instructions burned: 114 (million)
% 7.50/1.64 % (3462242)lrs+10_1_sil=8000:sp=occurrence:random_seed=2137921935:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2992 on theBenchmark for (2992ds/907Mi)
% 7.50/1.64 % (3462244)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=2425456680:i=437:sd=1:aac=none:ss=included_2992 on theBenchmark for (2992ds/437Mi)
% 7.50/1.64 % (3462244)Refutation not found, incomplete strategy
% 7.50/1.64 % (3462244)------------------------------
% 7.50/1.64 % (3462244)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.50/1.64 % (3462244)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.50/1.64 % (3462244)CaDiCaL version: 2.1.3
% 7.50/1.64 % (3462244)Termination reason: Refutation not found, incomplete strategy
% 7.50/1.64 % (3462244)Time elapsed: 0.019 s
% 7.50/1.64 % (3462244)Peak memory usage: 90 MB
% 7.50/1.64 % (3462244)Instructions burned: 34 (million)
% 7.50/1.64 % (3462245)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=453648909:i=5202:ss=axioms:sgt=16_2991 on theBenchmark for (2991ds/5202Mi)
% 7.50/1.64 % (3462234)First to succeed.
% 7.50/1.64 % (3462234)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3462206"
% 7.50/1.64 % (3462211)Also succeeded, but the first one will report.
% 7.50/1.64 % (3462244)------------------------------
% 7.50/1.64 % (3462244)------------------------------
% 7.50/1.64 % (3462234)Refutation found. Thanks to Tanya!
% 7.50/1.64 % SZS status Theorem for theBenchmark
% 7.50/1.64 % SZS output start Proof for theBenchmark
% See solution above
% 9.16/1.83 % (3462234)------------------------------
% 9.16/1.83 % (3462234)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.16/1.83 % (3462234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.16/1.83 % (3462234)CaDiCaL version: 2.1.3
% 9.16/1.83 % (3462234)Termination reason: Refutation
% 9.16/1.83 % (3462234)Time elapsed: 0.471 s
% 9.16/1.83 % (3462234)Peak memory usage: 138 MB
% 9.16/1.83 % (3462234)Instructions burned: 1332 (million)
% 9.16/1.83 % (3462234)------------------------------
% 9.16/1.83 % (3462234)------------------------------
% 9.16/1.83 % (3462206)Success in time 1.242 s
% 9.16/1.83 % Vampire exiting
%------------------------------------------------------------------------------