%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU252+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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:36 PM UTC 2026
% Result : Theorem 0.35s 0.47s
% Output : Refutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 91 ( 18 unt; 5 def)
% Number of atoms : 223 ( 4 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 215 ( 83 ~; 102 |; 10 &)
% ( 10 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 95 ( 0 sgn 91 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f7,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f15,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',t19_wellord1) ).
fof(f40,conjecture,
! [X0,X1] :
( relation(X1)
=> ( reflexive(X1)
=> reflexive(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox2/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(f74,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f77,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f7]) ).
fof(f80,plain,
! [X0,X1] :
( ~ relation(X0)
| relation(relation_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f57]) ).
fof(f88,plain,
! [X0,X1] :
( ~ relation(X0)
| ~ in(X1,relation_field(X0))
| in(ordered_pair(X1,X1),X0)
| ~ reflexive(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f89,plain,
! [X0] :
( ~ relation(X0)
| in(sK1(X0),relation_field(X0))
| reflexive(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f90,plain,
! [X0] :
( ~ relation(X0)
| ~ in(ordered_pair(sK1(X0),sK1(X0)),X0)
| reflexive(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f102,plain,
! [X2,X3,X0,X1] :
( ~ in(X1,X3)
| ~ in(X0,X2)
| in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ),
inference(cnf_transformation,[],[f35]) ).
fof(f105,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(X0,cartesian_product2(X1,X1))
| ~ in(X0,X2)
| in(X0,relation_restriction(X2,X1)) ),
inference(cnf_transformation,[],[f61]) ).
fof(f106,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| in(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f107,plain,
! [X2,X0,X1] :
( ~ relation(X2)
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| in(X0,relation_field(X2)) ),
inference(cnf_transformation,[],[f63]) ).
fof(f110,plain,
relation(sK8),
inference(cnf_transformation,[],[f66]) ).
fof(f111,plain,
reflexive(sK8),
inference(cnf_transformation,[],[f66]) ).
fof(f112,plain,
~ reflexive(relation_restriction(sK8,sK7)),
inference(cnf_transformation,[],[f66]) ).
fof(f119,plain,
! [X0] :
( ~ relation(X0)
| ~ in(unordered_pair(unordered_pair(sK1(X0),sK1(X0)),singleton(sK1(X0))),X0)
| reflexive(X0) ),
inference(definition_unfolding,[],[f90,f77]) ).
fof(f120,plain,
! [X0,X1] :
( ~ relation(X0)
| ~ in(X1,relation_field(X0))
| in(unordered_pair(unordered_pair(X1,X1),singleton(X1)),X0)
| ~ reflexive(X0) ),
inference(definition_unfolding,[],[f88,f77]) ).
fof(f121,plain,
! [X2,X3,X0,X1] :
( ~ in(X1,X3)
| ~ in(X0,X2)
| in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),cartesian_product2(X2,X3)) ),
inference(definition_unfolding,[],[f102,f77]) ).
fof(f127,plain,
! [X0,X1] :
( ~ relation(relation_restriction(X0,X1))
| relation(X0) ),
inference(consistent_polarity_flipping,[],[f80]) ).
fof(f128,plain,
! [X0] :
( relation(X0)
| in(unordered_pair(unordered_pair(sK1(X0),sK1(X0)),singleton(sK1(X0))),X0)
| ~ reflexive(X0) ),
inference(consistent_polarity_flipping,[],[f119]) ).
fof(f129,plain,
! [X0] :
( ~ reflexive(X0)
| ~ in(sK1(X0),relation_field(X0))
| relation(X0) ),
inference(consistent_polarity_flipping,[],[f89]) ).
fof(f130,plain,
! [X0,X1] :
( relation(X0)
| in(X1,relation_field(X0))
| ~ in(unordered_pair(unordered_pair(X1,X1),singleton(X1)),X0)
| reflexive(X0) ),
inference(consistent_polarity_flipping,[],[f120]) ).
fof(f134,plain,
! [X2,X3,X0,X1] :
( in(X1,X3)
| in(X0,X2)
| ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),cartesian_product2(X2,X3)) ),
inference(consistent_polarity_flipping,[],[f121]) ).
fof(f137,plain,
! [X2,X0,X1] :
( ~ in(X0,relation_restriction(X2,X1))
| in(X0,cartesian_product2(X1,X1))
| in(X0,X2)
| relation(X2) ),
inference(consistent_polarity_flipping,[],[f105]) ).
fof(f140,plain,
! [X2,X0,X1] :
( in(X0,relation_field(relation_restriction(X2,X1)))
| relation(X2)
| ~ in(X0,relation_field(X2)) ),
inference(consistent_polarity_flipping,[],[f107]) ).
fof(f141,plain,
! [X2,X0,X1] :
( in(X0,relation_field(relation_restriction(X2,X1)))
| relation(X2)
| ~ in(X0,X1) ),
inference(consistent_polarity_flipping,[],[f106]) ).
fof(f143,plain,
reflexive(relation_restriction(sK8,sK7)),
inference(consistent_polarity_flipping,[],[f112]) ).
fof(f144,plain,
~ reflexive(sK8),
inference(consistent_polarity_flipping,[],[f111]) ).
fof(f145,plain,
~ relation(sK8),
inference(consistent_polarity_flipping,[],[f110]) ).
fof(f192,plain,
( ~ in(sK1(relation_restriction(sK8,sK7)),relation_field(relation_restriction(sK8,sK7)))
| relation(relation_restriction(sK8,sK7)) ),
inference(resolution,[],[f129,f143]) ).
fof(f194,definition,
( spl9_1
<=> relation(relation_restriction(sK8,sK7)) ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
fof(f196,plain,
( relation(relation_restriction(sK8,sK7))
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f198,definition,
( spl9_2
<=> in(sK1(relation_restriction(sK8,sK7)),relation_field(relation_restriction(sK8,sK7))) ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
fof(f200,plain,
( ~ in(sK1(relation_restriction(sK8,sK7)),relation_field(relation_restriction(sK8,sK7)))
| spl9_2 ),
inference(avatar_component_clause,[],[f198]) ).
fof(f201,plain,
( spl9_1
| ~ spl9_2 ),
inference(avatar_split_clause,[],[f192,f198,f194]) ).
fof(f244,plain,
! [X0] :
( ~ reflexive(X0)
| relation(X0)
| in(unordered_pair(singleton(sK1(X0)),unordered_pair(sK1(X0),sK1(X0))),X0) ),
inference(forward_demodulation,[],[f128,f74]) ).
fof(f251,plain,
( relation(relation_restriction(sK8,sK7))
| in(unordered_pair(singleton(sK1(relation_restriction(sK8,sK7))),unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7)))),relation_restriction(sK8,sK7)) ),
inference(resolution,[],[f244,f143]) ).
fof(f253,definition,
( spl9_6
<=> in(unordered_pair(singleton(sK1(relation_restriction(sK8,sK7))),unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7)))),relation_restriction(sK8,sK7)) ),
introduced(definition,[new_symbols(definition,[spl9_6])],[avatar_definition]) ).
fof(f255,plain,
( in(unordered_pair(singleton(sK1(relation_restriction(sK8,sK7))),unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7)))),relation_restriction(sK8,sK7))
| ~ spl9_6 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f256,plain,
( spl9_6
| spl9_1 ),
inference(avatar_split_clause,[],[f251,f194,f253]) ).
fof(f257,plain,
! [X0,X1] :
( ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X1)),X0)
| relation(X0)
| in(X1,relation_field(X0))
| reflexive(X0) ),
inference(forward_demodulation,[],[f130,f74]) ).
fof(f258,plain,
! [X2,X3,X0,X1] :
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),cartesian_product2(X2,X3))
| in(X1,X3)
| in(X0,X2) ),
inference(forward_demodulation,[],[f134,f74]) ).
fof(f276,plain,
( relation(sK8)
| ~ in(sK1(relation_restriction(sK8,sK7)),relation_field(sK8))
| spl9_2 ),
inference(resolution,[],[f200,f140]) ).
fof(f277,plain,
( relation(sK8)
| ~ in(sK1(relation_restriction(sK8,sK7)),sK7)
| spl9_2 ),
inference(resolution,[],[f200,f141]) ).
fof(f281,plain,
( ~ in(sK1(relation_restriction(sK8,sK7)),sK7)
| spl9_2 ),
inference(forward_subsumption_resolution,[],[f277,f145]) ).
fof(f282,plain,
( ~ in(sK1(relation_restriction(sK8,sK7)),relation_field(sK8))
| spl9_2 ),
inference(forward_subsumption_resolution,[],[f276,f145]) ).
fof(f287,definition,
( spl9_7
<=> in(unordered_pair(singleton(sK1(relation_restriction(sK8,sK7))),unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7)))),sK8) ),
introduced(definition,[new_symbols(definition,[spl9_7])],[avatar_definition]) ).
fof(f289,plain,
( in(unordered_pair(singleton(sK1(relation_restriction(sK8,sK7))),unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7)))),sK8)
| ~ spl9_7 ),
inference(avatar_component_clause,[],[f287]) ).
fof(f291,definition,
( spl9_8
<=> in(unordered_pair(singleton(sK1(relation_restriction(sK8,sK7))),unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7)))),cartesian_product2(sK7,sK7)) ),
introduced(definition,[new_symbols(definition,[spl9_8])],[avatar_definition]) ).
fof(f293,plain,
( in(unordered_pair(singleton(sK1(relation_restriction(sK8,sK7))),unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7)))),cartesian_product2(sK7,sK7))
| ~ spl9_8 ),
inference(avatar_component_clause,[],[f291]) ).
fof(f295,plain,
( relation(sK8)
| ~ spl9_1 ),
inference(resolution,[],[f196,f127]) ).
fof(f296,plain,
( $false
| ~ spl9_1 ),
inference(forward_subsumption_resolution,[],[f295,f145]) ).
fof(f297,plain,
~ spl9_1,
inference(avatar_contradiction_clause,[],[f296]) ).
fof(f302,plain,
( in(unordered_pair(singleton(sK1(relation_restriction(sK8,sK7))),unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7)))),cartesian_product2(sK7,sK7))
| in(unordered_pair(singleton(sK1(relation_restriction(sK8,sK7))),unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7)))),sK8)
| relation(sK8)
| ~ spl9_6 ),
inference(resolution,[],[f255,f137]) ).
fof(f303,plain,
( in(unordered_pair(singleton(sK1(relation_restriction(sK8,sK7))),unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7)))),cartesian_product2(sK7,sK7))
| in(unordered_pair(singleton(sK1(relation_restriction(sK8,sK7))),unordered_pair(sK1(relation_restriction(sK8,sK7)),sK1(relation_restriction(sK8,sK7)))),sK8)
| ~ spl9_6 ),
inference(forward_subsumption_resolution,[],[f302,f145]) ).
fof(f304,plain,
( spl9_7
| spl9_8
| ~ spl9_6 ),
inference(avatar_split_clause,[],[f303,f253,f291,f287]) ).
fof(f410,plain,
( relation(sK8)
| in(sK1(relation_restriction(sK8,sK7)),relation_field(sK8))
| reflexive(sK8)
| ~ spl9_7 ),
inference(resolution,[],[f289,f257]) ).
fof(f411,plain,
( in(sK1(relation_restriction(sK8,sK7)),relation_field(sK8))
| reflexive(sK8)
| ~ spl9_7 ),
inference(forward_subsumption_resolution,[],[f410,f145]) ).
fof(f412,plain,
( reflexive(sK8)
| spl9_2
| ~ spl9_7 ),
inference(forward_subsumption_resolution,[],[f411,f282]) ).
fof(f413,plain,
( $false
| spl9_2
| ~ spl9_7 ),
inference(forward_subsumption_resolution,[],[f412,f144]) ).
fof(f414,plain,
( spl9_2
| ~ spl9_7 ),
inference(avatar_contradiction_clause,[],[f413]) ).
fof(f559,plain,
( in(sK1(relation_restriction(sK8,sK7)),sK7)
| in(sK1(relation_restriction(sK8,sK7)),sK7)
| ~ spl9_8 ),
inference(resolution,[],[f293,f258]) ).
fof(f566,plain,
( in(sK1(relation_restriction(sK8,sK7)),sK7)
| ~ spl9_8 ),
inference(duplicate_literal_removal,[],[f559]) ).
fof(f586,plain,
( $false
| spl9_2
| ~ spl9_8 ),
inference(forward_subsumption_resolution,[],[f566,f281]) ).
fof(f587,plain,
( spl9_2
| ~ spl9_8 ),
inference(avatar_contradiction_clause,[],[f586]) ).
cnf(s1,plain,
( spl9_1
| ~ spl9_2 ),
inference(sat_conversion,[],[f201]) ).
cnf(s4,plain,
( spl9_1
| spl9_6 ),
inference(sat_conversion,[],[f256]) ).
cnf(s6,plain,
~ spl9_1,
inference(sat_conversion,[],[f297]) ).
cnf(s8,plain,
( ~ spl9_6
| spl9_7
| spl9_8 ),
inference(sat_conversion,[],[f304]) ).
cnf(s18,plain,
( spl9_2
| ~ spl9_7 ),
inference(sat_conversion,[],[f414]) ).
cnf(s22,plain,
( spl9_2
| ~ spl9_8 ),
inference(sat_conversion,[],[f587]) ).
cnf(s23,plain,
spl9_6,
inference(rat,[],[s4,s6]) ).
cnf(s24,plain,
~ spl9_2,
inference(rat,[],[s1,s6]) ).
cnf(s25,plain,
~ spl9_8,
inference(rat,[],[s22,s24]) ).
cnf(s26,plain,
~ spl9_7,
inference(rat,[],[s18,s24]) ).
cnf(s27,plain,
$false,
inference(rat,[],[s8,s23,s25,s26]) ).
fof(f588,plain,
$false,
inference(avatar_sat_refutation,[],[s27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU252+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37 % Computer : n005.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 28 04:19:47 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.35/0.47 % (429342)Will run a generic schedule for satisfiability detection.
% 0.35/0.47 % (429352)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=862697434:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.35/0.47 % (429348)% WARNING: option uhcvi not known.
% 0.35/0.47 % (429347)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1673331688_2999 on theBenchmark for (2999ds/0Mi)
% 0.35/0.47 % (429349)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1199920462:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.35/0.47 % (429350)dis+10_1_sil=32000:sp=arity:random_seed=1935850261:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.35/0.47 % (429351)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3332999161:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.35/0.47 % (429353)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2845052351:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.35/0.47 % (429348)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=363549225:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.35/0.47 % TRYING [1]
% 0.35/0.47 % TRYING [2]
% 0.35/0.47 % TRYING [3]
% 0.35/0.47 % TRYING [4]
% 0.35/0.47 % (429348) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-429342-429348"...
% 0.35/0.47 % (429348)...printing done.
% 0.35/0.47 % (429348)Refutation found. Thanks to Tanya!
% 0.35/0.47 % SZS status Theorem for theBenchmark
% 0.35/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.35/0.47 % (429348)------------------------------
% 0.35/0.47 % (429348)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.47 % (429348)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.47 % (429348)CaDiCaL version: 2.1.3
% 0.35/0.47 % (429348)Termination reason: Refutation
% 0.35/0.47 % (429348)Time elapsed: 0.019 s
% 0.35/0.47 % (429348)Peak memory usage: 13 MB
% 0.35/0.47 % (429348)Instructions burned: 23 (million)
% 0.35/0.47 % (429342)Success in time 0.054 s
% 0.35/0.47 % Vampire exiting
%------------------------------------------------------------------------------