%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU212+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:52:24 PM UTC 2026
% Result : Theorem 0.12s 0.44s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 76 ( 11 unt; 3 def)
% Number of atoms : 280 ( 54 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 338 ( 134 ~; 143 |; 38 &)
% ( 15 <=>; 6 =>; 0 <=; 2 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 103 ( 0 sgn 83 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f5,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/sandbox/benchmark/theBenchmark.p',d4_funct_1) ).
fof(f6,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( X1 = relation_dom(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_relat_1) ).
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(f35,conjecture,
! [X0,X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( in(ordered_pair(X0,X1),X2)
<=> ( in(X0,relation_dom(X2))
& X1 = apply(X2,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_funct_1) ).
fof(f36,negated_conjecture,
~ ! [X0,X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( in(ordered_pair(X0,X1),X2)
<=> ( in(X0,relation_dom(X2))
& X1 = apply(X2,X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f35]) ).
fof(f42,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,[],[f5]) ).
fof(f43,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,[],[f42]) ).
fof(f44,plain,
! [X0] :
( ! [X1] :
( X1 = relation_dom(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f54,plain,
? [X0,X1,X2] :
( ( in(ordered_pair(X0,X1),X2)
<~> ( in(X0,relation_dom(X2))
& X1 = apply(X2,X0) ) )
& relation(X2)
& function(X2) ),
inference(ennf_transformation,[],[f36]) ).
fof(f55,plain,
? [X0,X1,X2] :
( ( in(ordered_pair(X0,X1),X2)
<~> ( in(X0,relation_dom(X2))
& X1 = apply(X2,X0) ) )
& relation(X2)
& function(X2) ),
inference(flattening,[],[f54]) ).
fof(f56,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,[],[f43]) ).
fof(f57,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_dom(X0)
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X3] : in(ordered_pair(X2,X3),X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] : ~ in(ordered_pair(X2,X3),X0) )
& ( ? [X3] : in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f44]) ).
fof(f58,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_dom(X0)
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X4] : in(ordered_pair(X2,X4),X0)
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X5,X6),X0) )
& ( ? [X7] : in(ordered_pair(X5,X7),X0)
| ~ in(X5,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(rectify,[],[f57]) ).
fof(f59,plain,
! [X0] :
( ! [X1] :
( ( X1 = relation_dom(X0)
| ( ( ! [X3] : ~ in(ordered_pair(sK0(X0,X1),X3),X0)
| ~ in(sK0(X0,X1),X1) )
& ( in(ordered_pair(sK0(X0,X1),sK1(X0,X1)),X0)
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X5,X6),X0) )
& ( in(ordered_pair(X5,sK2(X0,X5)),X0)
| ~ in(X5,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X2,sK0(X0,X1)),skolemize(X4,sK1(X0,X1)),skolemize(X7,sK2(X0,X5))],[f58]) ).
fof(f67,plain,
? [X0,X1,X2] :
( ( ~ in(X0,relation_dom(X2))
| apply(X2,X0) != X1
| ~ in(ordered_pair(X0,X1),X2) )
& ( ( in(X0,relation_dom(X2))
& X1 = apply(X2,X0) )
| in(ordered_pair(X0,X1),X2) )
& relation(X2)
& function(X2) ),
inference(nnf_transformation,[],[f55]) ).
fof(f68,plain,
? [X0,X1,X2] :
( ( ~ in(X0,relation_dom(X2))
| apply(X2,X0) != X1
| ~ in(ordered_pair(X0,X1),X2) )
& ( ( in(X0,relation_dom(X2))
& X1 = apply(X2,X0) )
| in(ordered_pair(X0,X1),X2) )
& relation(X2)
& function(X2) ),
inference(flattening,[],[f67]) ).
fof(f69,plain,
( ( ~ in(sK10,relation_dom(sK12))
| sK11 != apply(sK12,sK10)
| ~ in(ordered_pair(sK10,sK11),sK12) )
& ( ( in(sK10,relation_dom(sK12))
& sK11 = apply(sK12,sK10) )
| in(ordered_pair(sK10,sK11),sK12) )
& relation(sK12)
& function(sK12) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12]),skolemize(X0,sK10),skolemize(X1,sK11),skolemize(X2,sK12)],[f68]) ).
fof(f73,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f76,plain,
! [X2,X0,X1] :
( in(ordered_pair(X1,X2),X0)
| apply(X0,X1) != X2
| ~ in(X1,relation_dom(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f77,plain,
! [X2,X0,X1] :
( apply(X0,X1) = X2
| ~ in(ordered_pair(X1,X2),X0)
| ~ in(X1,relation_dom(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f79,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(ordered_pair(X5,X6),X0)
| relation_dom(X0) != X1
| ~ relation(X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f82,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f7]) ).
fof(f109,plain,
function(sK12),
inference(cnf_transformation,[],[f69]) ).
fof(f110,plain,
relation(sK12),
inference(cnf_transformation,[],[f69]) ).
fof(f111,plain,
( sK11 = apply(sK12,sK10)
| in(ordered_pair(sK10,sK11),sK12) ),
inference(cnf_transformation,[],[f69]) ).
fof(f112,plain,
( in(sK10,relation_dom(sK12))
| in(ordered_pair(sK10,sK11),sK12) ),
inference(cnf_transformation,[],[f69]) ).
fof(f113,plain,
( ~ in(sK10,relation_dom(sK12))
| sK11 != apply(sK12,sK10)
| ~ in(ordered_pair(sK10,sK11),sK12) ),
inference(cnf_transformation,[],[f69]) ).
fof(f114,plain,
! [X2,X0,X1] :
( apply(X0,X1) = X2
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X0)
| ~ in(X1,relation_dom(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(definition_unfolding,[],[f77,f82]) ).
fof(f115,plain,
! [X2,X0,X1] :
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X0)
| apply(X0,X1) != X2
| ~ in(X1,relation_dom(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(definition_unfolding,[],[f76,f82]) ).
fof(f118,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X0)
| relation_dom(X0) != X1
| ~ relation(X0) ),
inference(definition_unfolding,[],[f79,f82]) ).
fof(f121,plain,
( ~ in(sK10,relation_dom(sK12))
| sK11 != apply(sK12,sK10)
| ~ in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12) ),
inference(definition_unfolding,[],[f113,f82]) ).
fof(f122,plain,
( in(sK10,relation_dom(sK12))
| in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12) ),
inference(definition_unfolding,[],[f112,f82]) ).
fof(f123,plain,
( sK11 = apply(sK12,sK10)
| in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12) ),
inference(definition_unfolding,[],[f111,f82]) ).
fof(f124,plain,
! [X0,X1] :
( in(unordered_pair(unordered_pair(X1,apply(X0,X1)),singleton(X1)),X0)
| ~ in(X1,relation_dom(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(equality_resolution,[],[f115]) ).
fof(f127,plain,
! [X0,X6,X5] :
( in(X5,relation_dom(X0))
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X0)
| ~ relation(X0) ),
inference(equality_resolution,[],[f118]) ).
fof(f130,definition,
( spl13_1
<=> in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12) ),
introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).
fof(f131,plain,
( ~ in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12)
| spl13_1 ),
inference(avatar_component_clause,[],[f130]) ).
fof(f132,plain,
( in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12)
| ~ spl13_1 ),
inference(avatar_component_clause,[],[f130]) ).
fof(f134,definition,
( spl13_2
<=> sK11 = apply(sK12,sK10) ),
introduced(definition,[new_symbols(definition,[spl13_2])],[avatar_definition]) ).
fof(f136,plain,
( sK11 = apply(sK12,sK10)
| ~ spl13_2 ),
inference(avatar_component_clause,[],[f134]) ).
fof(f137,plain,
( spl13_1
| spl13_2 ),
inference(avatar_split_clause,[],[f123,f134,f130]) ).
fof(f139,definition,
( spl13_3
<=> in(sK10,relation_dom(sK12)) ),
introduced(definition,[new_symbols(definition,[spl13_3])],[avatar_definition]) ).
fof(f141,plain,
( in(sK10,relation_dom(sK12))
| ~ spl13_3 ),
inference(avatar_component_clause,[],[f139]) ).
fof(f142,plain,
( spl13_1
| spl13_3 ),
inference(avatar_split_clause,[],[f122,f139,f130]) ).
fof(f143,plain,
( ~ spl13_1
| ~ spl13_2
| ~ spl13_3 ),
inference(avatar_split_clause,[],[f121,f139,f134,f130]) ).
fof(f160,plain,
( ~ in(unordered_pair(singleton(sK10),unordered_pair(sK10,sK11)),sK12)
| spl13_1 ),
inference(superposition,[],[f131,f73]) ).
fof(f181,plain,
! [X0,X6,X5] :
( ~ in(unordered_pair(singleton(X5),unordered_pair(X5,X6)),X0)
| in(X5,relation_dom(X0))
| ~ relation(X0) ),
inference(forward_demodulation,[],[f127,f73]) ).
fof(f206,plain,
! [X0,X1] :
( in(unordered_pair(singleton(X1),unordered_pair(X1,apply(X0,X1))),X0)
| ~ in(X1,relation_dom(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(forward_demodulation,[],[f124,f73]) ).
fof(f211,plain,
( in(unordered_pair(singleton(sK10),unordered_pair(sK10,sK11)),sK12)
| ~ in(sK10,relation_dom(sK12))
| ~ relation(sK12)
| ~ function(sK12)
| ~ spl13_2 ),
inference(superposition,[],[f206,f136]) ).
fof(f213,plain,
( ~ in(sK10,relation_dom(sK12))
| ~ relation(sK12)
| ~ function(sK12)
| spl13_1
| ~ spl13_2 ),
inference(forward_subsumption_resolution,[],[f211,f160]) ).
fof(f215,plain,
( ~ relation(sK12)
| ~ function(sK12)
| spl13_1
| ~ spl13_2
| ~ spl13_3 ),
inference(forward_subsumption_resolution,[],[f213,f141]) ).
fof(f217,plain,
( ~ function(sK12)
| spl13_1
| ~ spl13_2
| ~ spl13_3 ),
inference(forward_subsumption_resolution,[],[f215,f110]) ).
fof(f218,plain,
( $false
| spl13_1
| ~ spl13_2
| ~ spl13_3 ),
inference(forward_subsumption_resolution,[],[f217,f109]) ).
fof(f219,plain,
( spl13_1
| ~ spl13_2
| ~ spl13_3 ),
inference(avatar_contradiction_clause,[],[f218]) ).
fof(f220,plain,
( in(unordered_pair(singleton(sK10),unordered_pair(sK10,sK11)),sK12)
| ~ spl13_1 ),
inference(forward_demodulation,[],[f132,f73]) ).
fof(f221,plain,
( in(sK10,relation_dom(sK12))
| ~ relation(sK12)
| ~ spl13_1 ),
inference(resolution,[],[f220,f181]) ).
fof(f226,plain,
! [X2,X0,X1] :
( ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X0)
| apply(X0,X1) = X2
| ~ in(X1,relation_dom(X0))
| ~ relation(X0)
| ~ function(X0) ),
inference(forward_demodulation,[],[f114,f73]) ).
fof(f227,plain,
! [X2,X0,X1] :
( ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X0)
| apply(X0,X1) = X2
| ~ relation(X0)
| ~ function(X0) ),
inference(forward_subsumption_resolution,[],[f226,f181]) ).
fof(f231,plain,
( sK11 = apply(sK12,sK10)
| ~ relation(sK12)
| ~ function(sK12)
| ~ spl13_1 ),
inference(resolution,[],[f227,f220]) ).
fof(f240,plain,
( in(sK10,relation_dom(sK12))
| ~ spl13_1 ),
inference(forward_subsumption_resolution,[],[f221,f110]) ).
fof(f241,plain,
( sK11 = apply(sK12,sK10)
| ~ function(sK12)
| ~ spl13_1 ),
inference(forward_subsumption_resolution,[],[f231,f110]) ).
fof(f242,plain,
( spl13_3
| ~ spl13_1 ),
inference(avatar_split_clause,[],[f240,f130,f139]) ).
fof(f243,plain,
( sK11 = apply(sK12,sK10)
| ~ spl13_1 ),
inference(forward_subsumption_resolution,[],[f241,f109]) ).
fof(f244,plain,
( spl13_2
| ~ spl13_1 ),
inference(avatar_split_clause,[],[f243,f130,f134]) ).
cnf(s1,plain,
( spl13_1
| spl13_2 ),
inference(sat_conversion,[],[f137]) ).
cnf(s2,plain,
( spl13_1
| spl13_3 ),
inference(sat_conversion,[],[f142]) ).
cnf(s3,plain,
( ~ spl13_1
| ~ spl13_2
| ~ spl13_3 ),
inference(sat_conversion,[],[f143]) ).
cnf(s4,plain,
( spl13_1
| ~ spl13_2
| ~ spl13_3 ),
inference(sat_conversion,[],[f219]) ).
cnf(s6,plain,
( ~ spl13_1
| spl13_3 ),
inference(sat_conversion,[],[f242]) ).
cnf(s7,plain,
( ~ spl13_1
| spl13_2 ),
inference(sat_conversion,[],[f244]) ).
cnf(s8,plain,
spl13_1,
inference(rat,[],[s4,s1,s2]) ).
cnf(s9,plain,
spl13_2,
inference(rat,[],[s7,s8]) ).
cnf(s10,plain,
spl13_3,
inference(rat,[],[s6,s8]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s3,s9,s10,s8]) ).
fof(f245,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU212+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.36 % Computer : n016.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 28 04:09:03 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 Running first-order model finding
% 0.12/0.39 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.44 % (3247914)Will run a generic schedule for satisfiability detection.
% 0.12/0.44 % (3247921)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4204149222:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.44 % (3247920)% WARNING: option uhcvi not known.
% 0.12/0.44 % (3247919)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4023417638_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.44 % (3247925)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=797690505:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.44 % (3247922)dis+10_1_sil=32000:sp=arity:random_seed=2462482214:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.44 % (3247923)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=320051532:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.44 % (3247924)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4266322048:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.44 % (3247920)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=351839870:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.44 % TRYING [1]
% 0.12/0.44 % TRYING [2]
% 0.12/0.44 % TRYING [3]
% 0.12/0.44 % (3247922) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3247914-3247922"...
% 0.12/0.44 % (3247923) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3247914-3247923"...
% 0.12/0.44 % (3247922)...printing done.
% 0.12/0.44 % (3247920) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3247914-3247920"...
% 0.12/0.44 % (3247923)...printing done.
% 0.12/0.44 % (3247922)Refutation found. Thanks to Tanya!
% 0.12/0.44 % SZS status Theorem for theBenchmark
% 0.12/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.45 % (3247922)------------------------------
% 0.12/0.45 % (3247922)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.45 % (3247922)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.45 % (3247922)CaDiCaL version: 2.1.3
% 0.12/0.45 % (3247922)Termination reason: Refutation
% 0.12/0.45 % (3247922)Time elapsed: 0.007 s
% 0.12/0.45 % (3247922)Peak memory usage: 12 MB
% 0.12/0.45 % (3247922)Instructions burned: 8 (million)
% 0.12/0.45 % (3247914)Success in time 0.044 s
% 0.12/0.45 % Vampire exiting
%------------------------------------------------------------------------------