%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU157+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 : n009.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:09 PM UTC 2026
% Result : Theorem 0.12s 0.46s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 85 ( 9 unt; 3 def)
% Number of atoms : 203 ( 50 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 199 ( 81 ~; 102 |; 7 &)
% ( 7 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 132 ( 0 sgn 126 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f3,axiom,
! [X0,X1,X2] :
( X2 = cartesian_product2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4,X5] :
( in(X4,X0)
& in(X5,X1)
& X3 = ordered_pair(X4,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_zfmisc_1) ).
fof(f4,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(f10,conjecture,
! [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',l55_zfmisc_1) ).
fof(f11,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<=> ( in(X0,X2)
& in(X1,X3) ) ),
inference(negated_conjecture,[status(cth)],[f10]) ).
fof(f14,axiom,
! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X0 = X2
& X1 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(f16,plain,
? [X0,X1,X2,X3] :
( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
<~> ( in(X0,X2)
& in(X1,X3) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f17,plain,
! [X0,X1,X2,X3] :
( ( X0 = X2
& X1 = X3 )
| ordered_pair(X0,X1) != ordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f14]) ).
fof(f19,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f24,plain,
! [X2,X3,X0,X1] :
( ordered_pair(sK1(X0,X1,X3),sK2(X0,X1,X3)) = X3
| ~ in(X3,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f25,plain,
! [X2,X3,X0,X1] :
( in(sK2(X0,X1,X3),X1)
| ~ in(X3,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f26,plain,
! [X2,X3,X0,X1] :
( in(sK1(X0,X1,X3),X0)
| ~ in(X3,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f27,plain,
! [X2,X3,X0,X1,X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0)
| in(X3,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f28,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f4]) ).
fof(f30,plain,
( ~ in(sK6,sK8)
| ~ in(sK5,sK7)
| ~ in(ordered_pair(sK5,sK6),cartesian_product2(sK7,sK8)) ),
inference(cnf_transformation,[],[f16]) ).
fof(f31,plain,
( in(sK6,sK8)
| in(ordered_pair(sK5,sK6),cartesian_product2(sK7,sK8)) ),
inference(cnf_transformation,[],[f16]) ).
fof(f32,plain,
( in(sK5,sK7)
| in(ordered_pair(sK5,sK6),cartesian_product2(sK7,sK8)) ),
inference(cnf_transformation,[],[f16]) ).
fof(f35,plain,
! [X2,X3,X0,X1] :
( ordered_pair(X0,X1) != ordered_pair(X2,X3)
| X1 = X3 ),
inference(cnf_transformation,[],[f17]) ).
fof(f36,plain,
! [X2,X3,X0,X1] :
( ordered_pair(X0,X1) != ordered_pair(X2,X3)
| X0 = X2 ),
inference(cnf_transformation,[],[f17]) ).
fof(f37,plain,
! [X2,X3,X0,X1,X4,X5] :
( unordered_pair(unordered_pair(X4,X5),singleton(X4)) != X3
| ~ in(X5,X1)
| ~ in(X4,X0)
| in(X3,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(definition_unfolding,[],[f27,f28]) ).
fof(f38,plain,
! [X2,X3,X0,X1] :
( unordered_pair(unordered_pair(sK1(X0,X1,X3),sK2(X0,X1,X3)),singleton(sK1(X0,X1,X3))) = X3
| ~ in(X3,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(definition_unfolding,[],[f24,f28]) ).
fof(f42,plain,
( in(sK5,sK7)
| in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8)) ),
inference(definition_unfolding,[],[f32,f28]) ).
fof(f43,plain,
( in(sK6,sK8)
| in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8)) ),
inference(definition_unfolding,[],[f31,f28]) ).
fof(f44,plain,
( ~ in(sK6,sK8)
| ~ in(sK5,sK7)
| ~ in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8)) ),
inference(definition_unfolding,[],[f30,f28]) ).
fof(f45,plain,
! [X2,X3,X0,X1] :
( unordered_pair(unordered_pair(X0,X1),singleton(X0)) != unordered_pair(unordered_pair(X2,X3),singleton(X2))
| X0 = X2 ),
inference(definition_unfolding,[],[f36,f28,f28]) ).
fof(f46,plain,
! [X2,X3,X0,X1] :
( unordered_pair(unordered_pair(X0,X1),singleton(X0)) != unordered_pair(unordered_pair(X2,X3),singleton(X2))
| X1 = X3 ),
inference(definition_unfolding,[],[f35,f28,f28]) ).
fof(f47,plain,
! [X2,X0,X1,X4,X5] :
( ~ in(X5,X1)
| ~ in(X4,X0)
| in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X2)
| cartesian_product2(X0,X1) != X2 ),
inference(equality_resolution,[],[f37]) ).
fof(f48,plain,
! [X0,X1,X4,X5] :
( ~ in(X5,X1)
| ~ in(X4,X0)
| in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f47]) ).
fof(f49,plain,
! [X3,X0,X1] :
( in(sK1(X0,X1,X3),X0)
| ~ in(X3,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f26]) ).
fof(f50,plain,
! [X3,X0,X1] :
( in(sK2(X0,X1,X3),X1)
| ~ in(X3,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f25]) ).
fof(f51,plain,
! [X3,X0,X1] :
( unordered_pair(unordered_pair(sK1(X0,X1,X3),sK2(X0,X1,X3)),singleton(sK1(X0,X1,X3))) = X3
| ~ in(X3,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f38]) ).
fof(f53,plain,
! [X0,X1,X4,X5] :
( in(X5,X1)
| in(X4,X0)
| ~ in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),cartesian_product2(X0,X1)) ),
inference(consistent_polarity_flipping,[],[f48]) ).
fof(f54,plain,
! [X3,X0,X1] :
( ~ in(sK1(X0,X1,X3),X0)
| in(X3,cartesian_product2(X0,X1)) ),
inference(consistent_polarity_flipping,[],[f49]) ).
fof(f55,plain,
! [X3,X0,X1] :
( ~ in(sK2(X0,X1,X3),X1)
| in(X3,cartesian_product2(X0,X1)) ),
inference(consistent_polarity_flipping,[],[f50]) ).
fof(f56,plain,
! [X3,X0,X1] :
( unordered_pair(unordered_pair(sK1(X0,X1,X3),sK2(X0,X1,X3)),singleton(sK1(X0,X1,X3))) = X3
| in(X3,cartesian_product2(X0,X1)) ),
inference(consistent_polarity_flipping,[],[f51]) ).
fof(f61,plain,
( ~ in(sK5,sK7)
| ~ in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8)) ),
inference(consistent_polarity_flipping,[],[f42]) ).
fof(f62,plain,
( ~ in(sK6,sK8)
| ~ in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8)) ),
inference(consistent_polarity_flipping,[],[f43]) ).
fof(f63,plain,
( in(sK6,sK8)
| in(sK5,sK7)
| in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8)) ),
inference(consistent_polarity_flipping,[],[f44]) ).
fof(f65,definition,
( spl11_1
<=> in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8)) ),
introduced(definition,[new_symbols(definition,[spl11_1])],[avatar_definition]) ).
fof(f66,plain,
( ~ in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8))
| spl11_1 ),
inference(avatar_component_clause,[],[f65]) ).
fof(f67,plain,
( in(unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)),cartesian_product2(sK7,sK8))
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f65]) ).
fof(f69,definition,
( spl11_2
<=> in(sK5,sK7) ),
introduced(definition,[new_symbols(definition,[spl11_2])],[avatar_definition]) ).
fof(f70,plain,
( ~ in(sK5,sK7)
| spl11_2 ),
inference(avatar_component_clause,[],[f69]) ).
fof(f73,definition,
( spl11_3
<=> in(sK6,sK8) ),
introduced(definition,[new_symbols(definition,[spl11_3])],[avatar_definition]) ).
fof(f74,plain,
( ~ in(sK6,sK8)
| spl11_3 ),
inference(avatar_component_clause,[],[f73]) ).
fof(f75,plain,
( in(sK6,sK8)
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f73]) ).
fof(f76,plain,
( spl11_1
| spl11_2
| spl11_3 ),
inference(avatar_split_clause,[],[f63,f73,f69,f65]) ).
fof(f77,plain,
( ~ spl11_1
| ~ spl11_3 ),
inference(avatar_split_clause,[],[f62,f73,f65]) ).
fof(f78,plain,
( ~ spl11_1
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f61,f69,f65]) ).
fof(f83,plain,
( ~ in(unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)),cartesian_product2(sK7,sK8))
| spl11_1 ),
inference(superposition,[],[f66,f19]) ).
fof(f97,plain,
! [X2,X3,X0,X1] :
( unordered_pair(unordered_pair(X2,X3),singleton(X2)) != unordered_pair(singleton(X0),unordered_pair(X0,X1))
| X0 = X2 ),
inference(superposition,[],[f45,f19]) ).
fof(f106,plain,
! [X2,X3,X0,X1] :
( unordered_pair(unordered_pair(X2,X3),singleton(X2)) != unordered_pair(singleton(X0),unordered_pair(X0,X1))
| X1 = X3 ),
inference(superposition,[],[f46,f19]) ).
fof(f113,plain,
! [X0,X1,X4,X5] :
( ~ in(unordered_pair(singleton(X4),unordered_pair(X4,X5)),cartesian_product2(X0,X1))
| in(X5,X1)
| in(X4,X0) ),
inference(forward_demodulation,[],[f53,f19]) ).
fof(f124,plain,
! [X3,X0,X1] :
( in(X3,cartesian_product2(X0,X1))
| unordered_pair(singleton(sK1(X0,X1,X3)),unordered_pair(sK1(X0,X1,X3),sK2(X0,X1,X3))) = X3 ),
inference(forward_demodulation,[],[f56,f19]) ).
fof(f125,plain,
( unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)) = unordered_pair(singleton(sK1(sK7,sK8,unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)))),unordered_pair(sK1(sK7,sK8,unordered_pair(unordered_pair(sK5,sK6),singleton(sK5))),sK2(sK7,sK8,unordered_pair(unordered_pair(sK5,sK6),singleton(sK5)))))
| spl11_1 ),
inference(resolution,[],[f124,f66]) ).
fof(f132,plain,
( unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)) = unordered_pair(singleton(sK1(sK7,sK8,unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)))),unordered_pair(sK1(sK7,sK8,unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))),sK2(sK7,sK8,unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)))))
| spl11_1 ),
inference(forward_demodulation,[],[f125,f19]) ).
fof(f174,plain,
( ! [X0,X1] :
( unordered_pair(unordered_pair(X0,X1),singleton(X0)) != unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))
| sK1(sK7,sK8,unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))) = X0 )
| spl11_1 ),
inference(superposition,[],[f97,f132]) ).
fof(f178,plain,
( ! [X0,X1] :
( unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)) != unordered_pair(singleton(X0),unordered_pair(X0,X1))
| sK1(sK7,sK8,unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))) = X0 )
| spl11_1 ),
inference(superposition,[],[f174,f19]) ).
fof(f222,plain,
( ! [X0,X1] :
( unordered_pair(unordered_pair(X0,X1),singleton(X0)) != unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))
| sK2(sK7,sK8,unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))) = X1 )
| spl11_1 ),
inference(superposition,[],[f106,f132]) ).
fof(f227,plain,
( ! [X0,X1] :
( unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)) != unordered_pair(singleton(X0),unordered_pair(X0,X1))
| sK2(sK7,sK8,unordered_pair(singleton(sK5),unordered_pair(sK5,sK6))) = X1 )
| spl11_1 ),
inference(superposition,[],[f222,f19]) ).
fof(f242,plain,
( sK5 = sK1(sK7,sK8,unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)))
| spl11_1 ),
inference(equality_resolution,[],[f178]) ).
fof(f258,plain,
( ~ in(sK5,sK7)
| in(unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)),cartesian_product2(sK7,sK8))
| spl11_1 ),
inference(superposition,[],[f54,f242]) ).
fof(f264,plain,
( ~ in(sK5,sK7)
| spl11_1 ),
inference(forward_subsumption_resolution,[],[f258,f83]) ).
fof(f265,plain,
( ~ spl11_2
| spl11_1 ),
inference(avatar_split_clause,[],[f264,f65,f69]) ).
fof(f462,plain,
( sK6 = sK2(sK7,sK8,unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)))
| spl11_1 ),
inference(equality_resolution,[],[f227]) ).
fof(f556,plain,
( ~ in(sK6,sK8)
| in(unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)),cartesian_product2(sK7,sK8))
| spl11_1 ),
inference(superposition,[],[f55,f462]) ).
fof(f557,plain,
( in(unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)),cartesian_product2(sK7,sK8))
| spl11_1
| ~ spl11_3 ),
inference(forward_subsumption_resolution,[],[f556,f75]) ).
fof(f561,plain,
( $false
| spl11_1
| ~ spl11_3 ),
inference(forward_subsumption_resolution,[],[f557,f83]) ).
fof(f562,plain,
( spl11_1
| ~ spl11_3 ),
inference(avatar_contradiction_clause,[],[f561]) ).
fof(f564,plain,
( in(unordered_pair(singleton(sK5),unordered_pair(sK5,sK6)),cartesian_product2(sK7,sK8))
| ~ spl11_1 ),
inference(forward_demodulation,[],[f67,f19]) ).
fof(f569,plain,
( in(sK6,sK8)
| in(sK5,sK7)
| ~ spl11_1 ),
inference(resolution,[],[f564,f113]) ).
fof(f570,plain,
( in(sK5,sK7)
| ~ spl11_1
| spl11_3 ),
inference(forward_subsumption_resolution,[],[f569,f74]) ).
fof(f571,plain,
( $false
| ~ spl11_1
| spl11_2
| spl11_3 ),
inference(forward_subsumption_resolution,[],[f570,f70]) ).
fof(f572,plain,
( ~ spl11_1
| spl11_2
| spl11_3 ),
inference(avatar_contradiction_clause,[],[f571]) ).
cnf(s1,plain,
( spl11_1
| spl11_2
| spl11_3 ),
inference(sat_conversion,[],[f76]) ).
cnf(s2,plain,
( ~ spl11_1
| ~ spl11_3 ),
inference(sat_conversion,[],[f77]) ).
cnf(s3,plain,
( ~ spl11_1
| ~ spl11_2 ),
inference(sat_conversion,[],[f78]) ).
cnf(s9,plain,
( spl11_1
| ~ spl11_2 ),
inference(sat_conversion,[],[f265]) ).
cnf(s16,plain,
( spl11_1
| ~ spl11_3 ),
inference(sat_conversion,[],[f562]) ).
cnf(s17,plain,
( ~ spl11_1
| spl11_2
| spl11_3 ),
inference(sat_conversion,[],[f572]) ).
cnf(s18,plain,
spl11_1,
inference(rat,[],[s1,s9,s16]) ).
cnf(s19,plain,
~ spl11_2,
inference(rat,[],[s3,s18]) ).
cnf(s20,plain,
~ spl11_3,
inference(rat,[],[s2,s18]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s17,s20,s18,s19]) ).
fof(f573,plain,
$false,
inference(avatar_sat_refutation,[],[s21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU157+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.38 % Computer : n009.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.39 % DateTime : Mon Sep 28 03:47:45 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 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.12/0.46 % (2642700)Will run a generic schedule for satisfiability detection.
% 0.12/0.46 % (2642706)% WARNING: option uhcvi not known.
% 0.12/0.46 % (2642706)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=132662066:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.46 % (2642705)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2131947772_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.46 % (2642707)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1295024577:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.46 % (2642708)dis+10_1_sil=32000:sp=arity:random_seed=3977282256:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.46 % (2642709)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1184728248:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.46 % (2642711)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=179465839:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.46 % (2642710)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2510635084:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.46 % TRYING [1]
% 0.12/0.46 % TRYING [2]
% 0.12/0.46 % TRYING [3]
% 0.12/0.46 % (2642706) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2642700-2642706"...
% 0.12/0.46 % (2642706)...printing done.
% 0.12/0.46 % (2642706)Refutation found. Thanks to Tanya!
% 0.12/0.46 % SZS status Theorem for theBenchmark
% 0.12/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.46 % (2642706)------------------------------
% 0.12/0.46 % (2642706)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.46 % (2642706)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.46 % (2642706)CaDiCaL version: 2.1.3
% 0.12/0.46 % (2642706)Termination reason: Refutation
% 0.12/0.46 % (2642706)Time elapsed: 0.015 s
% 0.12/0.46 % (2642706)Peak memory usage: 13 MB
% 0.12/0.46 % (2642706)Instructions burned: 42 (million)
% 0.12/0.46 % (2642700)Success in time 0.041 s
% 0.12/0.46 % Vampire exiting
%------------------------------------------------------------------------------