%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU252+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:48:01 PM UTC 2026
% Result : Theorem 2.59s 1.27s
% Output : Refutation 3.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 92 ( 16 unt; 7 def)
% Number of atoms : 251 ( 2 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 274 ( 115 ~; 111 |; 26 &)
% ( 12 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn 93 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f15,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_restriction(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_wellord1) ).
fof(f29,axiom,
! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> ! [X1] :
( in(X1,relation_field(X0))
=> in(ordered_pair(X1,X1),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1_wellord1) ).
fof(f35,axiom,
! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X0,X2)
& in(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t106_zfmisc_1) ).
fof(f36,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_restriction(X2,X1))
<=> ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_wellord1) ).
fof(f37,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_field(relation_restriction(X2,X1)))
=> ( in(X0,relation_field(X2))
& in(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_wellord1) ).
fof(f40,conjecture,
! [X0,X1] :
( relation(X1)
=> ( reflexive(X1)
=> reflexive(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t22_wellord1) ).
fof(f41,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> ( reflexive(X1)
=> reflexive(relation_restriction(X1,X0)) ) ),
inference(negated_conjecture,[status(cth)],[f40]) ).
fof(f57,plain,
! [X0,X1] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f60,plain,
! [X0] :
( ( reflexive(X0)
<=> ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f29]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ( in(X0,relation_restriction(X2,X1))
<=> ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) ) )
| ~ relation(X2) ),
inference(ennf_transformation,[],[f36]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ( in(X0,relation_field(X2))
& in(X0,X1) )
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| ~ relation(X2) ),
inference(ennf_transformation,[],[f37]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ( in(X0,relation_field(X2))
& in(X0,X1) )
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| ~ relation(X2) ),
inference(flattening,[],[f62]) ).
fof(f65,plain,
? [X0,X1] :
( ~ reflexive(relation_restriction(X1,X0))
& reflexive(X1)
& relation(X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f66,plain,
? [X0,X1] :
( ~ reflexive(relation_restriction(X1,X0))
& reflexive(X1)
& relation(X1) ),
inference(flattening,[],[f65]) ).
fof(f73,plain,
! [X0] :
( ( ( reflexive(X0)
| ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) ) )
& ( ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) )
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f60]) ).
fof(f74,plain,
! [X0] :
( ( ( reflexive(X0)
| ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) ) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0)) )
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(rectify,[],[f73]) ).
fof(f75,plain,
! [X0] :
( ( ( reflexive(X0)
| ( ~ in(ordered_pair(sK1(X0),sK1(X0)),X0)
& in(sK1(X0),relation_field(X0)) ) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0)) )
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f74]) ).
fof(f81,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X0,X2)
| ~ in(X1,X3) )
& ( ( in(X0,X2)
& in(X1,X3) )
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f82,plain,
! [X0,X1,X2,X3] :
( ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X0,X2)
| ~ in(X1,X3) )
& ( ( in(X0,X2)
& in(X1,X3) )
| ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
inference(flattening,[],[f81]) ).
fof(f83,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_restriction(X2,X1))
| ~ in(X0,X2)
| ~ in(X0,cartesian_product2(X1,X1)) )
& ( ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) )
| ~ in(X0,relation_restriction(X2,X1)) ) )
| ~ relation(X2) ),
inference(nnf_transformation,[],[f61]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_restriction(X2,X1))
| ~ in(X0,X2)
| ~ in(X0,cartesian_product2(X1,X1)) )
& ( ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) )
| ~ in(X0,relation_restriction(X2,X1)) ) )
| ~ relation(X2) ),
inference(flattening,[],[f83]) ).
fof(f85,plain,
( ~ reflexive(relation_restriction(sK8,sK7))
& reflexive(sK8)
& relation(sK8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X0,sK7),skolemize(X1,sK8)],[f66]) ).
fof(f93,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f7]) ).
fof(f96,plain,
! [X0,X1] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f104,plain,
! [X2,X0] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0))
| ~ reflexive(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f105,plain,
! [X0] :
( reflexive(X0)
| in(sK1(X0),relation_field(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f106,plain,
! [X0] :
( reflexive(X0)
| ~ in(ordered_pair(sK1(X0),sK1(X0)),X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f118,plain,
! [X2,X3,X0,X1] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
| ~ in(X0,X2)
| ~ in(X1,X3) ),
inference(cnf_transformation,[],[f82]) ).
fof(f121,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(X0,X2)
| ~ in(X0,cartesian_product2(X1,X1))
| in(X0,relation_restriction(X2,X1)) ),
inference(cnf_transformation,[],[f84]) ).
fof(f122,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| in(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f123,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| in(X0,relation_field(X2)) ),
inference(cnf_transformation,[],[f63]) ).
fof(f126,plain,
relation(sK8),
inference(cnf_transformation,[],[f85]) ).
fof(f127,plain,
reflexive(sK8),
inference(cnf_transformation,[],[f85]) ).
fof(f128,plain,
~ reflexive(relation_restriction(sK8,sK7)),
inference(cnf_transformation,[],[f85]) ).
fof(f135,plain,
! [X0] :
( reflexive(X0)
| ~ in(unordered_pair(unordered_pair(sK1(X0),sK1(X0)),singleton(sK1(X0))),X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f106,f93]) ).
fof(f136,plain,
! [X2,X0] :
( ~ reflexive(X0)
| ~ in(X2,relation_field(X0))
| in(unordered_pair(unordered_pair(X2,X2),singleton(X2)),X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f104,f93]) ).
fof(f137,plain,
! [X2,X3,X0,X1] :
( in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),cartesian_product2(X2,X3))
| ~ in(X0,X2)
| ~ in(X1,X3) ),
inference(definition_unfolding,[],[f118,f93]) ).
fof(f165,plain,
( in(sK1(relation_restriction(sK8,sK7)),relation_field(relation_restriction(sK8,sK7)))
| ~ relation(relation_restriction(sK8,sK7)) ),
inference(resolution,[],[f105,f128]) ).
fof(f167,definition,
( spl10_1
<=> relation(relation_restriction(sK8,sK7)) ),
introduced(definition,[new_symbols(definition,[spl10_1])],[avatar_definition]) ).
fof(f168,plain,
( ~ relation(relation_restriction(sK8,sK7))
| spl10_1 ),
inference(avatar_component_clause,[],[f167]) ).
fof(f170,definition,
( spl10_2
<=> in(sK1(relation_restriction(sK8,sK7)),relation_field(relation_restriction(sK8,sK7))) ),
introduced(definition,[new_symbols(definition,[spl10_2])],[avatar_definition]) ).
fof(f171,plain,
( in(sK1(relation_restriction(sK8,sK7)),relation_field(relation_restriction(sK8,sK7)))
| ~ spl10_2 ),
inference(avatar_component_clause,[],[f170]) ).
fof(f172,plain,
( ~ spl10_1
| spl10_2 ),
inference(avatar_split_clause,[],[f165,f170,f167]) ).
fof(f173,plain,
( ~ relation(sK8)
| spl10_1 ),
inference(resolution,[],[f168,f96]) ).
fof(f174,plain,
( $false
| spl10_1 ),
inference(resolution,[],[f173,f126]) ).
fof(f175,plain,
spl10_1,
inference(avatar_contradiction_clause,[],[f174]) ).
fof(f189,plain,
! [X0,X1] :
( ~ in(X0,relation_field(relation_restriction(sK8,X1)))
| in(X0,X1) ),
inference(resolution,[],[f122,f126]) ).
fof(f190,plain,
( in(sK1(relation_restriction(sK8,sK7)),sK7)
| ~ spl10_2 ),
inference(resolution,[],[f189,f171]) ).
fof(f205,plain,
! [X0,X1] :
( ~ in(X0,relation_field(relation_restriction(sK8,X1)))
| in(X0,relation_field(sK8)) ),
inference(resolution,[],[f123,f126]) ).
fof(f207,plain,
( in(sK1(relation_restriction(sK8,sK7)),relation_field(sK8))
| ~ spl10_2 ),
inference(resolution,[],[f205,f171]) ).
fof(f216,plain,
! [X0,X1] :
( ~ in(X0,cartesian_product2(X1,X1))
| ~ in(X0,sK8)
| in(X0,relation_restriction(sK8,X1)) ),
inference(resolution,[],[f121,f126]) ).
fof(f217,plain,
( ~ in(unordered_pair(unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7))),singleton(sK1(relation_restriction(sK8,sK7)))),relation_restriction(sK8,sK7))
| ~ relation(relation_restriction(sK8,sK7)) ),
inference(resolution,[],[f135,f128]) ).
fof(f219,definition,
( spl10_3
<=> in(unordered_pair(unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7))),singleton(sK1(relation_restriction(sK8,sK7)))),relation_restriction(sK8,sK7)) ),
introduced(definition,[new_symbols(definition,[spl10_3])],[avatar_definition]) ).
fof(f220,plain,
( ~ in(unordered_pair(unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7))),singleton(sK1(relation_restriction(sK8,sK7)))),relation_restriction(sK8,sK7))
| spl10_3 ),
inference(avatar_component_clause,[],[f219]) ).
fof(f221,plain,
( ~ spl10_1
| ~ spl10_3 ),
inference(avatar_split_clause,[],[f217,f219,f167]) ).
fof(f223,plain,
! [X0] :
( ~ in(X0,relation_field(sK8))
| in(unordered_pair(unordered_pair(X0,X0),singleton(X0)),sK8)
| ~ relation(sK8) ),
inference(resolution,[],[f136,f127]) ).
fof(f229,definition,
( spl10_4
<=> relation(sK8) ),
introduced(definition,[new_symbols(definition,[spl10_4])],[avatar_definition]) ).
fof(f230,plain,
( ~ relation(sK8)
| spl10_4 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f232,definition,
( spl10_5
<=> ! [X0] :
( ~ in(X0,relation_field(sK8))
| in(unordered_pair(unordered_pair(X0,X0),singleton(X0)),sK8) ) ),
introduced(definition,[new_symbols(definition,[spl10_5])],[avatar_definition]) ).
fof(f233,plain,
( ! [X0] :
( in(unordered_pair(unordered_pair(X0,X0),singleton(X0)),sK8)
| ~ in(X0,relation_field(sK8)) )
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f232]) ).
fof(f234,plain,
( ~ spl10_4
| spl10_5 ),
inference(avatar_split_clause,[],[f223,f232,f229]) ).
fof(f235,plain,
( $false
| spl10_4 ),
inference(resolution,[],[f230,f126]) ).
fof(f236,plain,
spl10_4,
inference(avatar_contradiction_clause,[],[f235]) ).
fof(f241,plain,
! [X2,X0,X1] :
( in(unordered_pair(unordered_pair(X0,X2),singleton(X0)),relation_restriction(sK8,X1))
| ~ in(X2,X1)
| ~ in(unordered_pair(unordered_pair(X0,X2),singleton(X0)),sK8)
| ~ in(X0,X1) ),
inference(resolution,[],[f137,f216]) ).
fof(f245,plain,
( ~ in(sK1(relation_restriction(sK8,sK7)),sK7)
| ~ in(unordered_pair(unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7))),singleton(sK1(relation_restriction(sK8,sK7)))),sK8)
| ~ in(sK1(relation_restriction(sK8,sK7)),sK7)
| spl10_3 ),
inference(resolution,[],[f241,f220]) ).
fof(f252,plain,
( ~ in(sK1(relation_restriction(sK8,sK7)),sK7)
| ~ in(unordered_pair(unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7))),singleton(sK1(relation_restriction(sK8,sK7)))),sK8)
| spl10_3 ),
inference(duplicate_literal_removal,[],[f245]) ).
fof(f254,definition,
( spl10_6
<=> in(unordered_pair(unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7))),singleton(sK1(relation_restriction(sK8,sK7)))),sK8) ),
introduced(definition,[new_symbols(definition,[spl10_6])],[avatar_definition]) ).
fof(f255,plain,
( ~ in(unordered_pair(unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7))),singleton(sK1(relation_restriction(sK8,sK7)))),sK8)
| spl10_6 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f257,definition,
( spl10_7
<=> in(sK1(relation_restriction(sK8,sK7)),sK7) ),
introduced(definition,[new_symbols(definition,[spl10_7])],[avatar_definition]) ).
fof(f258,plain,
( ~ in(sK1(relation_restriction(sK8,sK7)),sK7)
| spl10_7 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f259,plain,
( ~ spl10_6
| ~ spl10_7
| spl10_3 ),
inference(avatar_split_clause,[],[f252,f219,f257,f254]) ).
fof(f260,plain,
( ~ in(sK1(relation_restriction(sK8,sK7)),relation_field(sK8))
| ~ spl10_5
| spl10_6 ),
inference(resolution,[],[f255,f233]) ).
fof(f261,plain,
( $false
| ~ spl10_2
| ~ spl10_5
| spl10_6 ),
inference(resolution,[],[f260,f207]) ).
fof(f262,plain,
( ~ spl10_2
| ~ spl10_5
| spl10_6 ),
inference(avatar_contradiction_clause,[],[f261]) ).
fof(f263,plain,
( $false
| ~ spl10_2
| spl10_7 ),
inference(resolution,[],[f258,f190]) ).
fof(f264,plain,
( ~ spl10_2
| spl10_7 ),
inference(avatar_contradiction_clause,[],[f263]) ).
cnf(s1,plain,
( ~ spl10_1
| spl10_2 ),
inference(sat_conversion,[],[f172]) ).
cnf(s2,plain,
spl10_1,
inference(sat_conversion,[],[f175]) ).
cnf(s3,plain,
( ~ spl10_1
| ~ spl10_3 ),
inference(sat_conversion,[],[f221]) ).
cnf(s4,plain,
( ~ spl10_4
| spl10_5 ),
inference(sat_conversion,[],[f234]) ).
cnf(s5,plain,
spl10_4,
inference(sat_conversion,[],[f236]) ).
cnf(s6,plain,
( spl10_3
| ~ spl10_6
| ~ spl10_7 ),
inference(sat_conversion,[],[f259]) ).
cnf(s7,plain,
( ~ spl10_2
| ~ spl10_5
| spl10_6 ),
inference(sat_conversion,[],[f262]) ).
cnf(s8,plain,
( ~ spl10_2
| spl10_7 ),
inference(sat_conversion,[],[f264]) ).
cnf(s9,plain,
spl10_5,
inference(rat,[],[s4,s5]) ).
cnf(s10,plain,
~ spl10_3,
inference(rat,[],[s3,s2]) ).
cnf(s11,plain,
spl10_2,
inference(rat,[],[s1,s2]) ).
cnf(s12,plain,
spl10_7,
inference(rat,[],[s8,s11]) ).
cnf(s13,plain,
spl10_6,
inference(rat,[],[s7,s9,s11]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s6,s10,s12,s13]) ).
fof(f265,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU252+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.12/0.38 % Computer : n003.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 04:21:42 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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
% 2.59/1.27 % (1183774)Detected formulas, will run a generic FOF schedule.
% 2.59/1.27 % (1183783)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1178551545:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.59/1.27 % (1183781)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=2185242427:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.59/1.27 % (1183779)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=622232542:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.59/1.27 % (1183780)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=3567449805:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.59/1.27 % (1183782)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3067442297:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.59/1.27 % (1183783)Instruction limit reached!
% 2.59/1.27 % (1183783)------------------------------
% 2.59/1.27 % (1183783)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/1.27 % (1183783)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/1.27 % (1183783)CaDiCaL version: 2.1.3
% 2.59/1.27 % (1183783)Termination reason: Instruction limit
% 2.59/1.27 % (1183783)Termination phase: Saturation
% 2.59/1.27 % (1183783)Time elapsed: 0.036 s
% 2.59/1.27 % (1183783)Peak memory usage: 89 MB
% 2.59/1.27 % (1183783)Instructions burned: 119 (million)
% 2.59/1.27 % (1183782)Refutation not found, incomplete strategy
% 2.59/1.27 % (1183782)------------------------------
% 2.59/1.27 % (1183782)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/1.27 % (1183782)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/1.27 % (1183782)CaDiCaL version: 2.1.3
% 2.59/1.27 % (1183782)Termination reason: Refutation not found, incomplete strategy
% 2.59/1.27 % (1183782)Time elapsed: 0.001 s
% 2.59/1.27 % (1183782)Peak memory usage: 88 MB
% 2.59/1.27 % (1183784)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=239038505:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.59/1.27 % (1183785)dis-21_1_sil=8000:lcm=predicate:random_seed=1902689434: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)
% 2.59/1.27 % (1183785)First to succeed.
% 2.59/1.27 % (1183785)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1183774"
% 2.59/1.27 % (1183784)Instruction limit reached!
% 2.59/1.27 % (1183784)------------------------------
% 2.59/1.27 % (1183784)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/1.27 % (1183784)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/1.27 % (1183784)CaDiCaL version: 2.1.3
% 2.59/1.27 % (1183784)Termination reason: Instruction limit
% 2.59/1.27 % (1183784)Termination phase: Saturation
% 2.59/1.27 % (1183784)Time elapsed: 0.087 s
% 2.59/1.27 % (1183784)Peak memory usage: 90 MB
% 2.59/1.27 % (1183784)Instructions burned: 140 (million)
% 2.59/1.27 % (1183793)lrs+10_1_sil=8000:sp=occurrence:random_seed=951294237:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.59/1.27 % (1183793)Also succeeded, but the first one will report.
% 2.59/1.27 % (1183794)lrs+10_1_sil=32000:urr=on:br=off:random_seed=372848415:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.59/1.27 % (1183782)------------------------------
% 2.59/1.27 % (1183782)------------------------------
% 2.59/1.27 % (1183785)Refutation found. Thanks to Tanya!
% 2.59/1.27 % SZS status Theorem for theBenchmark
% 2.59/1.27 % SZS output start Proof for theBenchmark
% See solution above
% 3.55/1.44 % (1183785)------------------------------
% 3.55/1.44 % (1183785)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.55/1.44 % (1183785)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.55/1.44 % (1183785)CaDiCaL version: 2.1.3
% 3.55/1.44 % (1183785)Termination reason: Refutation
% 3.55/1.44 % (1183785)Time elapsed: 0.006 s
% 3.55/1.44 % (1183785)Peak memory usage: 89 MB
% 3.55/1.44 % (1183785)Instructions burned: 7 (million)
% 3.55/1.44 % (1183785)------------------------------
% 3.55/1.44 % (1183785)------------------------------
% 3.55/1.44 % (1183774)Success in time 0.421 s
% 3.55/1.44 % Vampire exiting
%------------------------------------------------------------------------------