%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU225+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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 12:47:51 PM UTC 2026
% Result : Theorem 1.75s 1.12s
% Output : Refutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 10
% Syntax : Number of formulae : 78 ( 13 unt; 4 def)
% Number of atoms : 311 ( 67 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 383 ( 150 ~; 157 |; 47 &)
% ( 16 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 108 ( 0 sgn 99 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] :
( ( relation(X0)
& function(X0) )
=> ! [X1,X2] :
( ( in(X1,relation_dom(X0))
=> ( X2 = apply(X0,X1)
<=> in(ordered_pair(X1,X2),X0) ) )
& ( ~ in(X1,relation_dom(X0))
=> ( X2 = apply(X0,X1)
<=> X2 = empty_set ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_funct_1) ).
fof(f16,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_dom_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_relat_1) ).
fof(f26,axiom,
! [X0,X1] :
( ( relation(X0)
& function(X0) )
=> ( relation(relation_dom_restriction(X0,X1))
& function(relation_dom_restriction(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_funct_1) ).
fof(f31,axiom,
! [X0,X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<=> ( in(X1,relation_dom(X2))
& in(X1,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l82_funct_1) ).
fof(f43,axiom,
! [X0,X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( X1 = relation_dom_restriction(X2,X0)
<=> ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X3] :
( in(X3,relation_dom(X1))
=> apply(X1,X3) = apply(X2,X3) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t68_funct_1) ).
fof(f45,conjecture,
! [X0,X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( in(X1,X0)
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t72_funct_1) ).
fof(f46,negated_conjecture,
~ ! [X0,X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( in(X1,X0)
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f57,plain,
! [X0] :
( ! [X1,X2] :
( ( ( X2 = apply(X0,X1)
<=> in(ordered_pair(X1,X2),X0) )
| ~ in(X1,relation_dom(X0)) )
& ( ( X2 = apply(X0,X1)
<=> X2 = empty_set )
| in(X1,relation_dom(X0)) ) )
| ~ relation(X0)
| ~ function(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f58,plain,
! [X0] :
( ! [X1,X2] :
( ( ( X2 = apply(X0,X1)
<=> in(ordered_pair(X1,X2),X0) )
| ~ in(X1,relation_dom(X0)) )
& ( ( X2 = apply(X0,X1)
<=> X2 = empty_set )
| in(X1,relation_dom(X0)) ) )
| ~ relation(X0)
| ~ function(X0) ),
inference(flattening,[],[f57]) ).
fof(f59,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f64,plain,
! [X0,X1] :
( ( relation(relation_dom_restriction(X0,X1))
& function(relation_dom_restriction(X0,X1)) )
| ~ relation(X0)
| ~ function(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f65,plain,
! [X0,X1] :
( ( relation(relation_dom_restriction(X0,X1))
& function(relation_dom_restriction(X0,X1)) )
| ~ relation(X0)
| ~ function(X0) ),
inference(flattening,[],[f64]) ).
fof(f69,plain,
! [X0,X1,X2] :
( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<=> ( in(X1,relation_dom(X2))
& in(X1,X0) ) )
| ~ relation(X2)
| ~ function(X2) ),
inference(ennf_transformation,[],[f31]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<=> ( in(X1,relation_dom(X2))
& in(X1,X0) ) )
| ~ relation(X2)
| ~ function(X2) ),
inference(flattening,[],[f69]) ).
fof(f74,plain,
! [X0,X1] :
( ! [X2] :
( ( X1 = relation_dom_restriction(X2,X0)
<=> ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) ) ) )
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(ennf_transformation,[],[f43]) ).
fof(f75,plain,
! [X0,X1] :
( ! [X2] :
( ( X1 = relation_dom_restriction(X2,X0)
<=> ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) ) ) )
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(flattening,[],[f74]) ).
fof(f77,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,X0)
& relation(X2)
& function(X2) ),
inference(ennf_transformation,[],[f46]) ).
fof(f78,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,X0)
& relation(X2)
& function(X2) ),
inference(flattening,[],[f77]) ).
fof(f81,plain,
! [X0] :
( ! [X1,X2] :
( ( ( ( X2 = apply(X0,X1)
| ~ in(ordered_pair(X1,X2),X0) )
& ( in(ordered_pair(X1,X2),X0)
| apply(X0,X1) != X2 ) )
| ~ in(X1,relation_dom(X0)) )
& ( ( ( X2 = apply(X0,X1)
| empty_set != X2 )
& ( X2 = empty_set
| apply(X0,X1) != X2 ) )
| in(X1,relation_dom(X0)) ) )
| ~ relation(X0)
| ~ function(X0) ),
inference(nnf_transformation,[],[f58]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| ~ in(X1,relation_dom(X2))
| ~ in(X1,X0) )
& ( ( in(X1,relation_dom(X2))
& in(X1,X0) )
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X0))) ) )
| ~ relation(X2)
| ~ function(X2) ),
inference(nnf_transformation,[],[f70]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| ~ in(X1,relation_dom(X2))
| ~ in(X1,X0) )
& ( ( in(X1,relation_dom(X2))
& in(X1,X0) )
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X0))) ) )
| ~ relation(X2)
| ~ function(X2) ),
inference(flattening,[],[f83]) ).
fof(f93,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X1 = relation_dom_restriction(X2,X0)
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0)
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) ) )
& ( ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) ) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(nnf_transformation,[],[f75]) ).
fof(f94,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X1 = relation_dom_restriction(X2,X0)
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0)
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) ) )
& ( ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) ) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(flattening,[],[f93]) ).
fof(f95,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X1 = relation_dom_restriction(X2,X0)
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0)
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) ) )
& ( ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1)) ) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(rectify,[],[f94]) ).
fof(f96,plain,
! [X0,X1] :
( ! [X2] :
( ( ( X1 = relation_dom_restriction(X2,X0)
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0)
| ( apply(X1,sK9(X1,X2)) != apply(X2,sK9(X1,X2))
& in(sK9(X1,X2),relation_dom(X1)) ) )
& ( ( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
& ! [X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1)) ) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ relation(X2)
| ~ function(X2) )
| ~ relation(X1)
| ~ function(X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X1,X2))],[f95]) ).
fof(f97,plain,
( apply(relation_dom_restriction(sK12,sK10),sK11) != apply(sK12,sK11)
& in(sK11,sK10)
& relation(sK12)
& function(sK12) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12]),skolemize(X0,sK10),skolemize(X1,sK11),skolemize(X2,sK12)],[f78]) ).
fof(f106,plain,
! [X2,X0,X1] :
( apply(X0,X1) = X2
| empty_set != X2
| in(X1,relation_dom(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f110,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f122,plain,
! [X0,X1] :
( function(relation_dom_restriction(X0,X1))
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f132,plain,
! [X2,X0,X1] :
( ~ in(X1,relation_dom(X2))
| in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| ~ in(X1,X0)
| ~ relation(X2)
| ~ function(X2) ),
inference(cnf_transformation,[],[f84]) ).
fof(f151,plain,
! [X2,X0,X1,X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1))
| relation_dom_restriction(X2,X0) != X1
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X1)
| ~ function(X1) ),
inference(cnf_transformation,[],[f96]) ).
fof(f156,plain,
function(sK12),
inference(cnf_transformation,[],[f97]) ).
fof(f157,plain,
relation(sK12),
inference(cnf_transformation,[],[f97]) ).
fof(f158,plain,
in(sK11,sK10),
inference(cnf_transformation,[],[f97]) ).
fof(f159,plain,
apply(relation_dom_restriction(sK12,sK10),sK11) != apply(sK12,sK11),
inference(cnf_transformation,[],[f97]) ).
fof(f163,plain,
! [X0,X1] :
( apply(X0,X1) = empty_set
| in(X1,relation_dom(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(equality_resolution,[],[f106]) ).
fof(f166,plain,
! [X2,X0,X4] :
( apply(X2,X4) = apply(relation_dom_restriction(X2,X0),X4)
| ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
| ~ relation(X2)
| ~ function(X2)
| ~ relation(relation_dom_restriction(X2,X0))
| ~ function(relation_dom_restriction(X2,X0)) ),
inference(equality_resolution,[],[f151]) ).
fof(f240,plain,
( empty_set != apply(sK12,sK11)
| in(sK11,relation_dom(relation_dom_restriction(sK12,sK10)))
| ~ relation(relation_dom_restriction(sK12,sK10))
| ~ function(relation_dom_restriction(sK12,sK10)) ),
inference(superposition,[],[f159,f163]) ).
fof(f242,definition,
( spl13_1
<=> function(relation_dom_restriction(sK12,sK10)) ),
introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).
fof(f244,plain,
( ~ function(relation_dom_restriction(sK12,sK10))
| spl13_1 ),
inference(avatar_component_clause,[],[f242]) ).
fof(f246,definition,
( spl13_2
<=> relation(relation_dom_restriction(sK12,sK10)) ),
introduced(definition,[new_symbols(definition,[spl13_2])],[avatar_definition]) ).
fof(f248,plain,
( ~ relation(relation_dom_restriction(sK12,sK10))
| spl13_2 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f250,definition,
( spl13_3
<=> in(sK11,relation_dom(relation_dom_restriction(sK12,sK10))) ),
introduced(definition,[new_symbols(definition,[spl13_3])],[avatar_definition]) ).
fof(f252,plain,
( in(sK11,relation_dom(relation_dom_restriction(sK12,sK10)))
| ~ spl13_3 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f254,definition,
( spl13_4
<=> empty_set = apply(sK12,sK11) ),
introduced(definition,[new_symbols(definition,[spl13_4])],[avatar_definition]) ).
fof(f256,plain,
( empty_set != apply(sK12,sK11)
| spl13_4 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f257,plain,
( ~ spl13_1
| ~ spl13_2
| spl13_3
| ~ spl13_4 ),
inference(avatar_split_clause,[],[f240,f254,f250,f246,f242]) ).
fof(f258,plain,
( ~ relation(sK12)
| ~ function(sK12)
| spl13_1 ),
inference(resolution,[],[f244,f122]) ).
fof(f260,plain,
( ~ function(sK12)
| spl13_1 ),
inference(forward_subsumption_resolution,[],[f258,f157]) ).
fof(f261,plain,
( $false
| spl13_1 ),
inference(forward_subsumption_resolution,[],[f260,f156]) ).
fof(f262,plain,
spl13_1,
inference(avatar_contradiction_clause,[],[f261]) ).
fof(f265,plain,
( ~ relation(sK12)
| spl13_2 ),
inference(resolution,[],[f248,f110]) ).
fof(f267,plain,
( $false
| spl13_2 ),
inference(forward_subsumption_resolution,[],[f265,f157]) ).
fof(f268,plain,
spl13_2,
inference(avatar_contradiction_clause,[],[f267]) ).
fof(f286,plain,
( empty_set != empty_set
| in(sK11,relation_dom(sK12))
| ~ relation(sK12)
| ~ function(sK12)
| spl13_4 ),
inference(superposition,[],[f256,f163]) ).
fof(f287,plain,
( in(sK11,relation_dom(sK12))
| ~ relation(sK12)
| ~ function(sK12)
| spl13_4 ),
inference(trivial_inequality_removal,[],[f286]) ).
fof(f288,plain,
( in(sK11,relation_dom(sK12))
| ~ function(sK12)
| spl13_4 ),
inference(forward_subsumption_resolution,[],[f287,f157]) ).
fof(f289,plain,
( in(sK11,relation_dom(sK12))
| spl13_4 ),
inference(forward_subsumption_resolution,[],[f288,f156]) ).
fof(f290,plain,
( ! [X0] :
( in(sK11,relation_dom(relation_dom_restriction(sK12,X0)))
| ~ in(sK11,X0)
| ~ relation(sK12)
| ~ function(sK12) )
| spl13_4 ),
inference(resolution,[],[f289,f132]) ).
fof(f305,plain,
( ! [X0] :
( in(sK11,relation_dom(relation_dom_restriction(sK12,X0)))
| ~ in(sK11,X0)
| ~ function(sK12) )
| spl13_4 ),
inference(forward_subsumption_resolution,[],[f290,f157]) ).
fof(f307,plain,
( ! [X0] :
( ~ in(sK11,X0)
| in(sK11,relation_dom(relation_dom_restriction(sK12,X0))) )
| spl13_4 ),
inference(forward_subsumption_resolution,[],[f305,f156]) ).
fof(f341,plain,
! [X2,X0,X4] :
( apply(X2,X4) = apply(relation_dom_restriction(X2,X0),X4)
| ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
| ~ relation(X2)
| ~ function(X2)
| ~ function(relation_dom_restriction(X2,X0)) ),
inference(forward_subsumption_resolution,[],[f166,f110]) ).
fof(f342,plain,
! [X2,X0,X4] :
( ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
| apply(X2,X4) = apply(relation_dom_restriction(X2,X0),X4)
| ~ relation(X2)
| ~ function(X2) ),
inference(forward_subsumption_resolution,[],[f341,f122]) ).
fof(f2072,plain,
( in(sK11,relation_dom(relation_dom_restriction(sK12,sK10)))
| spl13_4 ),
inference(resolution,[],[f307,f158]) ).
fof(f2075,plain,
( spl13_3
| spl13_4 ),
inference(avatar_split_clause,[],[f2072,f254,f250]) ).
fof(f2077,plain,
( apply(relation_dom_restriction(sK12,sK10),sK11) = apply(sK12,sK11)
| ~ relation(sK12)
| ~ function(sK12)
| ~ spl13_3 ),
inference(resolution,[],[f252,f342]) ).
fof(f2089,plain,
( ~ relation(sK12)
| ~ function(sK12)
| ~ spl13_3 ),
inference(forward_subsumption_resolution,[],[f2077,f159]) ).
fof(f2093,plain,
( ~ function(sK12)
| ~ spl13_3 ),
inference(forward_subsumption_resolution,[],[f2089,f157]) ).
fof(f2094,plain,
( $false
| ~ spl13_3 ),
inference(forward_subsumption_resolution,[],[f2093,f156]) ).
fof(f2095,plain,
~ spl13_3,
inference(avatar_contradiction_clause,[],[f2094]) ).
cnf(s1,plain,
( ~ spl13_1
| ~ spl13_2
| spl13_3
| ~ spl13_4 ),
inference(sat_conversion,[],[f257]) ).
cnf(s2,plain,
spl13_1,
inference(sat_conversion,[],[f262]) ).
cnf(s3,plain,
spl13_2,
inference(sat_conversion,[],[f268]) ).
cnf(s164,plain,
( spl13_3
| spl13_4 ),
inference(sat_conversion,[],[f2075]) ).
cnf(s165,plain,
~ spl13_3,
inference(sat_conversion,[],[f2095]) ).
cnf(s166,plain,
spl13_4,
inference(rat,[],[s164,s165]) ).
cnf(s270,plain,
$false,
inference(rat,[],[s1,s166,s165,s3,s2]) ).
fof(f2096,plain,
$false,
inference(avatar_sat_refutation,[],[s270]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU225+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n016.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 04:14:33 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.75/1.12 % (3250507)Detected formulas, will run a generic FOF schedule.
% 1.75/1.12 % (3250593)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=727047446:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.75/1.12 % (3250593)First to succeed.
% 1.75/1.12 % (3250593)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3250507"
% 1.75/1.12 % (3250589)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=2367609003:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.75/1.12 % (3250590)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=1892344344:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.75/1.12 % (3250588)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=3570565735:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.75/1.12 % (3250592)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2477047844:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.75/1.12 % (3250594)dis-21_1_sil=8000:lcm=predicate:random_seed=3442826189: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.75/1.12 % (3250591)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1156970630:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.75/1.12 % (3250591)Refutation not found, incomplete strategy
% 1.75/1.12 % (3250591)------------------------------
% 1.75/1.12 % (3250591)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.75/1.12 % (3250591)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.75/1.12 % (3250591)CaDiCaL version: 2.1.3
% 1.75/1.12 % (3250591)Termination reason: Refutation not found, incomplete strategy
% 1.75/1.12 % (3250591)Time elapsed: 0.003 s
% 1.75/1.12 % (3250591)Peak memory usage: 88 MB
% 1.75/1.12 % (3250591)Instructions burned: 3 (million)
% 1.75/1.12 % (3250592)Also succeeded, but the first one will report.
% 1.75/1.12 % (3250594)Instruction limit reached!
% 1.75/1.12 % (3250594)------------------------------
% 1.75/1.12 % (3250594)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.75/1.12 % (3250594)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.75/1.12 % (3250594)CaDiCaL version: 2.1.3
% 1.75/1.12 % (3250594)Termination reason: Instruction limit
% 1.75/1.12 % (3250594)Termination phase: Saturation
% 1.75/1.12 % (3250594)Time elapsed: 0.075 s
% 1.75/1.12 % (3250594)Peak memory usage: 90 MB
% 1.75/1.12 % (3250594)Instructions burned: 129 (million)
% 1.75/1.12 % (3250593)Refutation found. Thanks to Tanya!
% 1.75/1.12 % SZS status Theorem for theBenchmark
% 1.75/1.12 % SZS output start Proof for theBenchmark
% See solution above
% 2.64/1.32 % (3250593)------------------------------
% 2.64/1.32 % (3250593)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.64/1.32 % (3250593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.64/1.32 % (3250593)CaDiCaL version: 2.1.3
% 2.64/1.32 % (3250593)Termination reason: Refutation
% 2.64/1.32 % (3250593)Time elapsed: 0.024 s
% 2.64/1.32 % (3250593)Peak memory usage: 90 MB
% 2.64/1.32 % (3250593)Instructions burned: 59 (million)
% 2.64/1.32 % (3250593)------------------------------
% 2.64/1.32 % (3250593)------------------------------
% 2.64/1.32 % (3250507)Success in time 0.283 s
% 2.64/1.32 % Vampire exiting
%------------------------------------------------------------------------------