%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU194+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:40 PM UTC 2026
% Result : Theorem 0.75s 1.03s
% Output : Refutation 3.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 81 ( 9 unt; 5 def)
% Number of atoms : 249 ( 24 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 281 ( 113 ~; 122 |; 31 &)
% ( 10 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 98 ( 0 sgn 91 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X0)
& in(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f24,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
fof(f27,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_dom(relation_dom_restriction(X2,X1)))
<=> ( in(X0,X1)
& in(X0,relation_dom(X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t86_relat_1) ).
fof(f29,conjecture,
! [X0,X1] :
( relation(X1)
=> relation_dom(relation_dom_restriction(X1,X0)) = set_intersection2(relation_dom(X1),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t90_relat_1) ).
fof(f30,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> relation_dom(relation_dom_restriction(X1,X0)) = set_intersection2(relation_dom(X1),X0) ),
inference(negated_conjecture,[status(cth)],[f29]) ).
fof(f43,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( in(X2,X0)
<~> in(X2,X1) ) ),
inference(ennf_transformation,[],[f24]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ( in(X0,relation_dom(relation_dom_restriction(X2,X1)))
<=> ( in(X0,X1)
& in(X0,relation_dom(X2)) ) )
| ~ relation(X2) ),
inference(ennf_transformation,[],[f27]) ).
fof(f48,plain,
? [X0,X1] :
( relation_dom(relation_dom_restriction(X1,X0)) != set_intersection2(relation_dom(X1),X0)
& relation(X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X0)
| ~ in(X3,X1) )
& ( ( in(X3,X0)
& in(X3,X1) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f49]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( ( in(X3,X0)
& in(X3,X1) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f50]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ( X2 = set_intersection2(X0,X1)
| ( ( ~ in(sK0(X0,X1,X2),X0)
| ~ in(sK0(X0,X1,X2),X1)
| ~ in(sK0(X0,X1,X2),X2) )
& ( ( in(sK0(X0,X1,X2),X0)
& in(sK0(X0,X1,X2),X1) )
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1) )
& ( ( in(X4,X0)
& in(X4,X1) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f51]) ).
fof(f58,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f43]) ).
fof(f59,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ in(sK6(X0,X1),X1)
| ~ in(sK6(X0,X1),X0) )
& ( in(sK6(X0,X1),X1)
| in(sK6(X0,X1),X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X2,sK6(X0,X1))],[f58]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_dom(relation_dom_restriction(X2,X1)))
| ~ in(X0,X1)
| ~ in(X0,relation_dom(X2)) )
& ( ( in(X0,X1)
& in(X0,relation_dom(X2)) )
| ~ in(X0,relation_dom(relation_dom_restriction(X2,X1))) ) )
| ~ relation(X2) ),
inference(nnf_transformation,[],[f46]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_dom(relation_dom_restriction(X2,X1)))
| ~ in(X0,X1)
| ~ in(X0,relation_dom(X2)) )
& ( ( in(X0,X1)
& in(X0,relation_dom(X2)) )
| ~ in(X0,relation_dom(relation_dom_restriction(X2,X1))) ) )
| ~ relation(X2) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
( relation_dom(relation_dom_restriction(sK8,sK7)) != set_intersection2(relation_dom(sK8),sK7)
& relation(sK8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X0,sK7),skolemize(X1,sK8)],[f48]) ).
fof(f66,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f52]) ).
fof(f67,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f52]) ).
fof(f68,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| ~ in(X4,X1)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f52]) ).
fof(f91,plain,
! [X0,X1] :
( X0 = X1
| in(sK6(X0,X1),X1)
| in(sK6(X0,X1),X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f92,plain,
! [X0,X1] :
( X0 = X1
| ~ in(sK6(X0,X1),X1)
| ~ in(sK6(X0,X1),X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f95,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(X0,relation_dom(relation_dom_restriction(X2,X1)))
| in(X0,relation_dom(X2)) ),
inference(cnf_transformation,[],[f61]) ).
fof(f96,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(X0,relation_dom(relation_dom_restriction(X2,X1)))
| in(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f97,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(X0,X1)
| ~ in(X0,relation_dom(X2))
| in(X0,relation_dom(relation_dom_restriction(X2,X1))) ),
inference(cnf_transformation,[],[f61]) ).
fof(f99,plain,
relation(sK8),
inference(cnf_transformation,[],[f62]) ).
fof(f100,plain,
relation_dom(relation_dom_restriction(sK8,sK7)) != set_intersection2(relation_dom(sK8),sK7),
inference(cnf_transformation,[],[f62]) ).
fof(f101,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X0)
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f68]) ).
fof(f102,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f67]) ).
fof(f103,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f66]) ).
fof(f104,definition,
! [X0,X1] :
( sQ9_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ9_eqProxy])],[equality_proxy_definition]) ).
fof(f111,plain,
! [X0,X1] :
( sQ9_eqProxy(X0,X1)
| ~ in(sK6(X0,X1),X1)
| ~ in(sK6(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f92,f104]) ).
fof(f112,plain,
! [X0,X1] :
( sQ9_eqProxy(X0,X1)
| in(sK6(X0,X1),X1)
| in(sK6(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f91,f104]) ).
fof(f115,plain,
~ sQ9_eqProxy(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),
inference(equality_proxy_replacement,[],[f100,f104]) ).
fof(f196,plain,
! [X0,X1] :
( ~ in(X0,relation_dom(relation_dom_restriction(sK8,X1)))
| in(X0,X1) ),
inference(resolution,[],[f96,f99]) ).
fof(f212,plain,
! [X0,X1] :
( ~ in(X0,relation_dom(relation_dom_restriction(sK8,X1)))
| in(X0,relation_dom(sK8)) ),
inference(resolution,[],[f95,f99]) ).
fof(f216,plain,
( ~ in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),set_intersection2(relation_dom(sK8),sK7))
| ~ in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),relation_dom(relation_dom_restriction(sK8,sK7))) ),
inference(resolution,[],[f111,f115]) ).
fof(f226,definition,
( spl10_9
<=> in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),relation_dom(relation_dom_restriction(sK8,sK7))) ),
introduced(definition,[new_symbols(definition,[spl10_9])],[avatar_definition]) ).
fof(f227,plain,
( ~ in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),relation_dom(relation_dom_restriction(sK8,sK7)))
| spl10_9 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f229,definition,
( spl10_10
<=> in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),set_intersection2(relation_dom(sK8),sK7)) ),
introduced(definition,[new_symbols(definition,[spl10_10])],[avatar_definition]) ).
fof(f230,plain,
( ~ in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),set_intersection2(relation_dom(sK8),sK7))
| spl10_10 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f231,plain,
( ~ spl10_9
| ~ spl10_10 ),
inference(avatar_split_clause,[],[f216,f229,f226]) ).
fof(f232,plain,
( ~ in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),relation_dom(sK8))
| ~ in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),sK7)
| spl10_10 ),
inference(resolution,[],[f230,f101]) ).
fof(f234,definition,
( spl10_11
<=> in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),sK7) ),
introduced(definition,[new_symbols(definition,[spl10_11])],[avatar_definition]) ).
fof(f235,plain,
( ~ in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),sK7)
| spl10_11 ),
inference(avatar_component_clause,[],[f234]) ).
fof(f237,definition,
( spl10_12
<=> in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),relation_dom(sK8)) ),
introduced(definition,[new_symbols(definition,[spl10_12])],[avatar_definition]) ).
fof(f238,plain,
( ~ in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),relation_dom(sK8))
| spl10_12 ),
inference(avatar_component_clause,[],[f237]) ).
fof(f239,plain,
( ~ spl10_11
| ~ spl10_12
| spl10_10 ),
inference(avatar_split_clause,[],[f232,f229,f237,f234]) ).
fof(f248,plain,
( in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),set_intersection2(relation_dom(sK8),sK7))
| in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),relation_dom(relation_dom_restriction(sK8,sK7))) ),
inference(resolution,[],[f112,f115]) ).
fof(f253,plain,
( in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),relation_dom(relation_dom_restriction(sK8,sK7)))
| ~ spl10_9 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f254,plain,
( in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),set_intersection2(relation_dom(sK8),sK7))
| ~ spl10_10 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f255,plain,
( spl10_9
| spl10_10 ),
inference(avatar_split_clause,[],[f248,f229,f226]) ).
fof(f256,plain,
( in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),relation_dom(sK8))
| ~ spl10_9 ),
inference(resolution,[],[f253,f212]) ).
fof(f257,plain,
( in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),sK7)
| ~ spl10_9 ),
inference(resolution,[],[f253,f196]) ).
fof(f260,plain,
( $false
| ~ spl10_9
| spl10_11 ),
inference(resolution,[],[f257,f235]) ).
fof(f263,plain,
( ~ spl10_9
| spl10_11 ),
inference(avatar_contradiction_clause,[],[f260]) ).
fof(f264,plain,
( in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),sK7)
| ~ spl10_10 ),
inference(resolution,[],[f254,f103]) ).
fof(f265,plain,
( in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),relation_dom(sK8))
| ~ spl10_10 ),
inference(resolution,[],[f254,f102]) ).
fof(f268,plain,
( $false
| ~ spl10_10
| spl10_11 ),
inference(resolution,[],[f264,f235]) ).
fof(f271,plain,
( ~ spl10_10
| spl10_11 ),
inference(avatar_contradiction_clause,[],[f268]) ).
fof(f291,plain,
! [X0,X1] :
( in(X0,relation_dom(relation_dom_restriction(sK8,X1)))
| ~ in(X0,relation_dom(sK8))
| ~ in(X0,X1) ),
inference(resolution,[],[f97,f99]) ).
fof(f297,plain,
( ~ in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),relation_dom(sK8))
| ~ in(sK6(relation_dom(relation_dom_restriction(sK8,sK7)),set_intersection2(relation_dom(sK8),sK7)),sK7)
| spl10_9 ),
inference(resolution,[],[f291,f227]) ).
fof(f300,plain,
( ~ spl10_11
| ~ spl10_12
| spl10_9 ),
inference(avatar_split_clause,[],[f297,f226,f237,f234]) ).
fof(f301,plain,
( $false
| ~ spl10_10
| spl10_12 ),
inference(resolution,[],[f238,f265]) ).
fof(f302,plain,
( ~ spl10_10
| spl10_12 ),
inference(avatar_contradiction_clause,[],[f301]) ).
fof(f310,plain,
( $false
| ~ spl10_9
| spl10_12 ),
inference(resolution,[],[f256,f238]) ).
fof(f313,plain,
( ~ spl10_9
| spl10_12 ),
inference(avatar_contradiction_clause,[],[f310]) ).
cnf(s6,plain,
( ~ spl10_9
| ~ spl10_10 ),
inference(sat_conversion,[],[f231]) ).
cnf(s7,plain,
( spl10_10
| ~ spl10_11
| ~ spl10_12 ),
inference(sat_conversion,[],[f239]) ).
cnf(s10,plain,
( spl10_9
| spl10_10 ),
inference(sat_conversion,[],[f255]) ).
cnf(s11,plain,
( ~ spl10_9
| spl10_11 ),
inference(sat_conversion,[],[f263]) ).
cnf(s12,plain,
( ~ spl10_10
| spl10_11 ),
inference(sat_conversion,[],[f271]) ).
cnf(s15,plain,
( spl10_9
| ~ spl10_11
| ~ spl10_12 ),
inference(sat_conversion,[],[f300]) ).
cnf(s16,plain,
( ~ spl10_10
| spl10_12 ),
inference(sat_conversion,[],[f302]) ).
cnf(s17,plain,
( ~ spl10_9
| spl10_12 ),
inference(sat_conversion,[],[f313]) ).
cnf(s18,plain,
spl10_9,
inference(rat,[],[s15,s12,s16,s10]) ).
cnf(s19,plain,
spl10_12,
inference(rat,[],[s17,s18]) ).
cnf(s20,plain,
spl10_11,
inference(rat,[],[s11,s18]) ).
cnf(s21,plain,
~ spl10_10,
inference(rat,[],[s6,s18]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s7,s19,s20,s21]) ).
fof(f314,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU194+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n003.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 04:00:46 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 0.75/1.03 % (1173805)Detected formulas, will run a generic FOF schedule.
% 0.75/1.03 % (1173815)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=237730573:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.75/1.03 % (1173810)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=2767423480:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.75/1.03 % (1173814)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=486334961:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.75/1.03 % (1173811)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=3890974289:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.75/1.03 % (1173813)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=250047899:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.75/1.03 % (1173816)dis-21_1_sil=8000:lcm=predicate:random_seed=4229550003: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.75/1.03 % (1173812)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=280130981:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.75/1.03 % (1173813)Refutation not found, incomplete strategy
% 0.75/1.03 % (1173813)------------------------------
% 0.75/1.03 % (1173813)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.75/1.03 % (1173813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.75/1.03 % (1173813)CaDiCaL version: 2.1.3
% 0.75/1.03 % (1173813)Termination reason: Refutation not found, incomplete strategy
% 0.75/1.03 % (1173813)Time elapsed: 0.002 s
% 0.75/1.03 % (1173813)Peak memory usage: 88 MB
% 0.75/1.03 % (1173813)Instructions burned: 1 (million)
% 0.75/1.03 % (1173816)First to succeed.
% 0.75/1.03 % (1173816)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1173805"
% 0.75/1.03 % (1173815)Instruction limit reached!
% 0.75/1.03 % (1173815)------------------------------
% 0.75/1.03 % (1173815)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.75/1.03 % (1173815)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.75/1.03 % (1173815)CaDiCaL version: 2.1.3
% 0.75/1.03 % (1173815)Termination reason: Instruction limit
% 0.75/1.03 % (1173815)Termination phase: Saturation
% 0.75/1.03 % (1173815)Time elapsed: 0.047 s
% 0.75/1.03 % (1173815)Peak memory usage: 89 MB
% 0.75/1.03 % (1173815)Instructions burned: 140 (million)
% 0.75/1.03 % (1173814)Instruction limit reached!
% 0.75/1.03 % (1173814)------------------------------
% 0.75/1.03 % (1173814)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.75/1.03 % (1173814)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.75/1.03 % (1173814)CaDiCaL version: 2.1.3
% 0.75/1.03 % (1173814)Termination reason: Instruction limit
% 0.75/1.03 % (1173814)Termination phase: Saturation
% 0.75/1.03 % (1173814)Time elapsed: 0.067 s
% 0.75/1.03 % (1173814)Peak memory usage: 88 MB
% 0.75/1.03 % (1173814)Instructions burned: 120 (million)
% 0.75/1.03 % (1173824)lrs+10_1_sil=8000:sp=occurrence:random_seed=780851732:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 0.75/1.03 % (1173825)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3447656363:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 0.75/1.03 % (1173813)------------------------------
% 0.75/1.03 % (1173813)------------------------------
% 0.75/1.03 % (1173816)Refutation found. Thanks to Tanya!
% 0.75/1.03 % SZS status Theorem for theBenchmark
% 0.75/1.03 % SZS output start Proof for theBenchmark
% See solution above
% 3.31/1.22 % (1173816)------------------------------
% 3.31/1.22 % (1173816)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.31/1.22 % (1173816)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.31/1.22 % (1173816)CaDiCaL version: 2.1.3
% 3.31/1.22 % (1173816)Termination reason: Refutation
% 3.31/1.22 % (1173816)Time elapsed: 0.006 s
% 3.31/1.22 % (1173816)Peak memory usage: 89 MB
% 3.31/1.22 % (1173816)Instructions burned: 7 (million)
% 3.31/1.22 % (1173816)------------------------------
% 3.31/1.22 % (1173816)------------------------------
% 3.31/1.22 % (1173805)Success in time 0.409 s
% 3.31/1.22 % Vampire exiting
%------------------------------------------------------------------------------