%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU239+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 : n019.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:57 PM UTC 2026
% Result : Theorem 1.65s 1.13s
% Output : Refutation 2.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 88 ( 12 unt; 8 def)
% Number of atoms : 253 ( 2 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 283 ( 118 ~; 123 |; 20 &)
% ( 14 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 9 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 50 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( is_reflexive_in(X0,X1)
<=> ! [X2] :
( in(X2,X1)
=> in(ordered_pair(X2,X2),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_relat_2) ).
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(f9,axiom,
! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> is_reflexive_in(X0,relation_field(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_relat_2) ).
fof(f25,conjecture,
! [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(f26,negated_conjecture,
~ ! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> ! [X1] :
( in(X1,relation_field(X0))
=> in(ordered_pair(X1,X1),X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f25]) ).
fof(f45,plain,
! [X0] :
( ! [X1] :
( is_reflexive_in(X0,X1)
<=> ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,X1) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f47,plain,
! [X0] :
( ( reflexive(X0)
<=> is_reflexive_in(X0,relation_field(X0)) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f50,plain,
? [X0] :
( ( reflexive(X0)
<~> ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) ) )
& relation(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f57,plain,
! [X0] :
( ! [X1] :
( ( is_reflexive_in(X0,X1)
| ? [X2] :
( ~ in(ordered_pair(X2,X2),X0)
& in(X2,X1) ) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,X1) )
| ~ is_reflexive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f45]) ).
fof(f58,plain,
! [X0] :
( ! [X1] :
( ( is_reflexive_in(X0,X1)
| ? [X2] :
( ~ in(ordered_pair(X2,X2),X0)
& in(X2,X1) ) )
& ( ! [X3] :
( in(ordered_pair(X3,X3),X0)
| ~ in(X3,X1) )
| ~ is_reflexive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(rectify,[],[f57]) ).
fof(f59,plain,
! [X0] :
( ! [X1] :
( ( is_reflexive_in(X0,X1)
| ( ~ in(ordered_pair(sK0(X0,X1),sK0(X0,X1)),X0)
& in(sK0(X0,X1),X1) ) )
& ( ! [X3] :
( in(ordered_pair(X3,X3),X0)
| ~ in(X3,X1) )
| ~ is_reflexive_in(X0,X1) ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f58]) ).
fof(f60,plain,
! [X0] :
( ( ( reflexive(X0)
| ~ is_reflexive_in(X0,relation_field(X0)) )
& ( is_reflexive_in(X0,relation_field(X0))
| ~ reflexive(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f47]) ).
fof(f62,plain,
? [X0] :
( ( ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) )
| ~ reflexive(X0) )
& ( ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) )
| reflexive(X0) )
& relation(X0) ),
inference(nnf_transformation,[],[f50]) ).
fof(f63,plain,
? [X0] :
( ( ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) )
| ~ reflexive(X0) )
& ( ! [X1] :
( in(ordered_pair(X1,X1),X0)
| ~ in(X1,relation_field(X0)) )
| reflexive(X0) )
& relation(X0) ),
inference(flattening,[],[f62]) ).
fof(f64,plain,
? [X0] :
( ( ? [X1] :
( ~ in(ordered_pair(X1,X1),X0)
& in(X1,relation_field(X0)) )
| ~ reflexive(X0) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),X0)
| ~ in(X2,relation_field(X0)) )
| reflexive(X0) )
& relation(X0) ),
inference(rectify,[],[f63]) ).
fof(f65,plain,
( ( ( ~ in(ordered_pair(sK3,sK3),sK2)
& in(sK3,relation_field(sK2)) )
| ~ reflexive(sK2) )
& ( ! [X2] :
( in(ordered_pair(X2,X2),sK2)
| ~ in(X2,relation_field(sK2)) )
| reflexive(sK2) )
& relation(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f64]) ).
fof(f77,plain,
! [X3,X0,X1] :
( in(ordered_pair(X3,X3),X0)
| ~ in(X3,X1)
| ~ is_reflexive_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f78,plain,
! [X0,X1] :
( is_reflexive_in(X0,X1)
| in(sK0(X0,X1),X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f79,plain,
! [X0,X1] :
( is_reflexive_in(X0,X1)
| ~ in(ordered_pair(sK0(X0,X1),sK0(X0,X1)),X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f80,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f7]) ).
fof(f82,plain,
! [X0] :
( ~ reflexive(X0)
| is_reflexive_in(X0,relation_field(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f83,plain,
! [X0] :
( reflexive(X0)
| ~ is_reflexive_in(X0,relation_field(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f90,plain,
relation(sK2),
inference(cnf_transformation,[],[f65]) ).
fof(f91,plain,
! [X2] :
( in(ordered_pair(X2,X2),sK2)
| ~ in(X2,relation_field(sK2))
| reflexive(sK2) ),
inference(cnf_transformation,[],[f65]) ).
fof(f92,plain,
( in(sK3,relation_field(sK2))
| ~ reflexive(sK2) ),
inference(cnf_transformation,[],[f65]) ).
fof(f93,plain,
( ~ in(ordered_pair(sK3,sK3),sK2)
| ~ reflexive(sK2) ),
inference(cnf_transformation,[],[f65]) ).
fof(f109,plain,
! [X0,X1] :
( is_reflexive_in(X0,X1)
| ~ in(unordered_pair(unordered_pair(sK0(X0,X1),sK0(X0,X1)),singleton(sK0(X0,X1))),X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f79,f80]) ).
fof(f110,plain,
! [X3,X0,X1] :
( ~ is_reflexive_in(X0,X1)
| ~ in(X3,X1)
| in(unordered_pair(unordered_pair(X3,X3),singleton(X3)),X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f77,f80]) ).
fof(f112,plain,
( ~ in(unordered_pair(unordered_pair(sK3,sK3),singleton(sK3)),sK2)
| ~ reflexive(sK2) ),
inference(definition_unfolding,[],[f93,f80]) ).
fof(f113,plain,
! [X2] :
( in(unordered_pair(unordered_pair(X2,X2),singleton(X2)),sK2)
| ~ in(X2,relation_field(sK2))
| reflexive(sK2) ),
inference(definition_unfolding,[],[f91,f80]) ).
fof(f125,definition,
( spl10_1
<=> reflexive(sK2) ),
introduced(definition,[new_symbols(definition,[spl10_1])],[avatar_definition]) ).
fof(f126,plain,
( reflexive(sK2)
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f125]) ).
fof(f128,definition,
( spl10_2
<=> ! [X2] :
( in(unordered_pair(unordered_pair(X2,X2),singleton(X2)),sK2)
| ~ in(X2,relation_field(sK2)) ) ),
introduced(definition,[new_symbols(definition,[spl10_2])],[avatar_definition]) ).
fof(f129,plain,
( ! [X2] :
( in(unordered_pair(unordered_pair(X2,X2),singleton(X2)),sK2)
| ~ in(X2,relation_field(sK2)) )
| ~ spl10_2 ),
inference(avatar_component_clause,[],[f128]) ).
fof(f130,plain,
( spl10_1
| spl10_2 ),
inference(avatar_split_clause,[],[f113,f128,f125]) ).
fof(f131,plain,
( ~ reflexive(sK2)
| spl10_1 ),
inference(avatar_component_clause,[],[f125]) ).
fof(f133,definition,
( spl10_3
<=> in(sK3,relation_field(sK2)) ),
introduced(definition,[new_symbols(definition,[spl10_3])],[avatar_definition]) ).
fof(f134,plain,
( in(sK3,relation_field(sK2))
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f133]) ).
fof(f135,plain,
( ~ spl10_1
| spl10_3 ),
inference(avatar_split_clause,[],[f92,f133,f125]) ).
fof(f137,definition,
( spl10_4
<=> in(unordered_pair(unordered_pair(sK3,sK3),singleton(sK3)),sK2) ),
introduced(definition,[new_symbols(definition,[spl10_4])],[avatar_definition]) ).
fof(f138,plain,
( ~ in(unordered_pair(unordered_pair(sK3,sK3),singleton(sK3)),sK2)
| spl10_4 ),
inference(avatar_component_clause,[],[f137]) ).
fof(f139,plain,
( ~ spl10_1
| ~ spl10_4 ),
inference(avatar_split_clause,[],[f112,f137,f125]) ).
fof(f151,plain,
( ~ is_reflexive_in(sK2,relation_field(sK2))
| ~ relation(sK2)
| spl10_1 ),
inference(resolution,[],[f83,f131]) ).
fof(f155,definition,
( spl10_7
<=> relation(sK2) ),
introduced(definition,[new_symbols(definition,[spl10_7])],[avatar_definition]) ).
fof(f156,plain,
( ~ relation(sK2)
| spl10_7 ),
inference(avatar_component_clause,[],[f155]) ).
fof(f158,definition,
( spl10_8
<=> is_reflexive_in(sK2,relation_field(sK2)) ),
introduced(definition,[new_symbols(definition,[spl10_8])],[avatar_definition]) ).
fof(f159,plain,
( ~ is_reflexive_in(sK2,relation_field(sK2))
| spl10_8 ),
inference(avatar_component_clause,[],[f158]) ).
fof(f160,plain,
( ~ spl10_7
| ~ spl10_8
| spl10_1 ),
inference(avatar_split_clause,[],[f151,f125,f158,f155]) ).
fof(f161,plain,
( $false
| spl10_7 ),
inference(resolution,[],[f156,f90]) ).
fof(f162,plain,
spl10_7,
inference(avatar_contradiction_clause,[],[f161]) ).
fof(f165,plain,
( in(sK0(sK2,relation_field(sK2)),relation_field(sK2))
| ~ relation(sK2)
| spl10_8 ),
inference(resolution,[],[f78,f159]) ).
fof(f167,definition,
( spl10_9
<=> in(sK0(sK2,relation_field(sK2)),relation_field(sK2)) ),
introduced(definition,[new_symbols(definition,[spl10_9])],[avatar_definition]) ).
fof(f168,plain,
( in(sK0(sK2,relation_field(sK2)),relation_field(sK2))
| ~ spl10_9 ),
inference(avatar_component_clause,[],[f167]) ).
fof(f169,plain,
( ~ spl10_7
| spl10_9
| spl10_8 ),
inference(avatar_split_clause,[],[f165,f158,f167,f155]) ).
fof(f178,plain,
( ~ in(unordered_pair(unordered_pair(sK0(sK2,relation_field(sK2)),sK0(sK2,relation_field(sK2))),singleton(sK0(sK2,relation_field(sK2)))),sK2)
| ~ relation(sK2)
| spl10_8 ),
inference(resolution,[],[f109,f159]) ).
fof(f182,definition,
( spl10_10
<=> in(unordered_pair(unordered_pair(sK0(sK2,relation_field(sK2)),sK0(sK2,relation_field(sK2))),singleton(sK0(sK2,relation_field(sK2)))),sK2) ),
introduced(definition,[new_symbols(definition,[spl10_10])],[avatar_definition]) ).
fof(f183,plain,
( ~ in(unordered_pair(unordered_pair(sK0(sK2,relation_field(sK2)),sK0(sK2,relation_field(sK2))),singleton(sK0(sK2,relation_field(sK2)))),sK2)
| spl10_10 ),
inference(avatar_component_clause,[],[f182]) ).
fof(f184,plain,
( ~ spl10_7
| ~ spl10_10
| spl10_8 ),
inference(avatar_split_clause,[],[f178,f158,f182,f155]) ).
fof(f185,plain,
( ~ in(sK0(sK2,relation_field(sK2)),relation_field(sK2))
| ~ spl10_2
| spl10_10 ),
inference(resolution,[],[f183,f129]) ).
fof(f186,plain,
( $false
| ~ spl10_2
| ~ spl10_9
| spl10_10 ),
inference(resolution,[],[f185,f168]) ).
fof(f187,plain,
( ~ spl10_2
| ~ spl10_9
| spl10_10 ),
inference(avatar_contradiction_clause,[],[f186]) ).
fof(f192,plain,
( is_reflexive_in(sK2,relation_field(sK2))
| ~ relation(sK2)
| ~ spl10_1 ),
inference(resolution,[],[f126,f82]) ).
fof(f193,plain,
( is_reflexive_in(sK2,relation_field(sK2))
| ~ spl10_8 ),
inference(avatar_component_clause,[],[f158]) ).
fof(f194,plain,
( ~ spl10_7
| spl10_8
| ~ spl10_1 ),
inference(avatar_split_clause,[],[f192,f125,f158,f155]) ).
fof(f196,plain,
( ~ in(sK3,relation_field(sK2))
| ~ spl10_2
| spl10_4 ),
inference(resolution,[],[f138,f129]) ).
fof(f197,plain,
( ! [X0] :
( ~ in(X0,relation_field(sK2))
| in(unordered_pair(unordered_pair(X0,X0),singleton(X0)),sK2)
| ~ relation(sK2) )
| ~ spl10_8 ),
inference(resolution,[],[f193,f110]) ).
fof(f198,plain,
( $false
| ~ spl10_2
| ~ spl10_3
| spl10_4 ),
inference(resolution,[],[f196,f134]) ).
fof(f199,plain,
( ~ spl10_2
| ~ spl10_3
| spl10_4 ),
inference(avatar_contradiction_clause,[],[f198]) ).
fof(f200,plain,
( ~ spl10_7
| spl10_2
| ~ spl10_8 ),
inference(avatar_split_clause,[],[f197,f158,f128,f155]) ).
cnf(s1,plain,
( spl10_1
| spl10_2 ),
inference(sat_conversion,[],[f130]) ).
cnf(s2,plain,
( ~ spl10_1
| spl10_3 ),
inference(sat_conversion,[],[f135]) ).
cnf(s3,plain,
( ~ spl10_1
| ~ spl10_4 ),
inference(sat_conversion,[],[f139]) ).
cnf(s5,plain,
( spl10_1
| ~ spl10_7
| ~ spl10_8 ),
inference(sat_conversion,[],[f160]) ).
cnf(s6,plain,
spl10_7,
inference(sat_conversion,[],[f162]) ).
cnf(s7,plain,
( ~ spl10_7
| spl10_8
| spl10_9 ),
inference(sat_conversion,[],[f169]) ).
cnf(s8,plain,
( ~ spl10_7
| spl10_8
| ~ spl10_10 ),
inference(sat_conversion,[],[f184]) ).
cnf(s9,plain,
( ~ spl10_2
| ~ spl10_9
| spl10_10 ),
inference(sat_conversion,[],[f187]) ).
cnf(s10,plain,
( ~ spl10_1
| ~ spl10_7
| spl10_8 ),
inference(sat_conversion,[],[f194]) ).
cnf(s11,plain,
( ~ spl10_2
| ~ spl10_3
| spl10_4 ),
inference(sat_conversion,[],[f199]) ).
cnf(s12,plain,
( spl10_2
| ~ spl10_7
| ~ spl10_8 ),
inference(sat_conversion,[],[f200]) ).
cnf(s13,plain,
( spl10_1
| ~ spl10_8 ),
inference(rat,[],[s5,s6]) ).
cnf(s14,plain,
spl10_1,
inference(rat,[],[s9,s7,s8,s1,s13,s6]) ).
cnf(s15,plain,
spl10_8,
inference(rat,[],[s10,s6,s14]) ).
cnf(s16,plain,
~ spl10_4,
inference(rat,[],[s3,s14]) ).
cnf(s17,plain,
spl10_3,
inference(rat,[],[s2,s14]) ).
cnf(s18,plain,
spl10_2,
inference(rat,[],[s12,s6,s15]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s11,s18,s16,s17]) ).
fof(f201,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU239+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n019.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:16:04 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.42 Running first-order theorem proving
% 0.12/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
% 1.65/1.13 % (3652995)Detected formulas, will run a generic FOF schedule.
% 1.65/1.13 % (3653006)dis-21_1_sil=8000:lcm=predicate:random_seed=2140513424: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.65/1.13 % (3653006)First to succeed.
% 1.65/1.13 % (3653006)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3652995"
% 1.65/1.13 % (3653004)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1980129964:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.65/1.13 % (3653001)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=1943671982:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.65/1.13 % (3653000)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=2723304346:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.65/1.13 % (3653003)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1213701750:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.65/1.13 % (3653002)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=186563826:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.65/1.13 % (3653005)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1526161768:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.65/1.13 % (3653003)Refutation not found, incomplete strategy
% 1.65/1.13 % (3653003)------------------------------
% 1.65/1.13 % (3653003)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.65/1.13 % (3653003)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.65/1.13 % (3653003)CaDiCaL version: 2.1.3
% 1.65/1.13 % (3653003)Termination reason: Refutation not found, incomplete strategy
% 1.65/1.13 % (3653003)Time elapsed: 0.001 s
% 1.65/1.13 % (3653003)Peak memory usage: 88 MB
% 1.65/1.13 % (3653004)Also succeeded, but the first one will report.
% 1.65/1.13 % (3653005)Also succeeded, but the first one will report.
% 1.65/1.13 % (3653006)Refutation found. Thanks to Tanya!
% 1.65/1.13 % SZS status Theorem for theBenchmark
% 1.65/1.13 % SZS output start Proof for theBenchmark
% See solution above
% 2.55/1.32 % (3653006)------------------------------
% 2.55/1.32 % (3653006)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.55/1.32 % (3653006)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.55/1.32 % (3653006)CaDiCaL version: 2.1.3
% 2.55/1.32 % (3653006)Termination reason: Refutation
% 2.55/1.32 % (3653006)Time elapsed: 0.003 s
% 2.55/1.32 % (3653006)Peak memory usage: 89 MB
% 2.55/1.32 % (3653006)Instructions burned: 4 (million)
% 2.55/1.32 % (3653006)------------------------------
% 2.55/1.32 % (3653006)------------------------------
% 2.55/1.32 % (3652995)Success in time 0.272 s
% 2.55/1.32 % Vampire exiting
%------------------------------------------------------------------------------