%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL520+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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 11:58:51 AM UTC 2026
% Result : Theorem 1.10s 0.59s
% Output : Refutation 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of formulae : 83 ( 44 unt; 0 def)
% Number of atoms : 133 ( 20 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 86 ( 36 ~; 32 |; 2 &)
% ( 5 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 124 ( 122 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(f16,axiom,
( kn1
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn1) ).
fof(f17,axiom,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn2) ).
fof(f18,axiom,
( kn3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn3) ).
fof(f24,axiom,
( r3
<=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r3) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(f28,axiom,
( op_and
=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_and) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_modus_ponens) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn1) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn2) ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn3) ).
fof(f40,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f41,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_and) ).
fof(f43,conjecture,
r3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r3) ).
fof(f44,negated_conjecture,
~ r3,
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f45,plain,
~ r3,
inference(flattening,[],[f44]) ).
fof(f46,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
=> r3 ),
inference(unused_predicate_definition_removal,[],[f24]) ).
fof(f47,plain,
( kn3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(unused_predicate_definition_removal,[],[f18]) ).
fof(f48,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f49,plain,
( kn1
=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f51,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f52,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f51]) ).
fof(f53,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f52]) ).
fof(f55,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(ennf_transformation,[],[f49]) ).
fof(f56,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f48]) ).
fof(f57,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(ennf_transformation,[],[f47]) ).
fof(f58,plain,
( r3
| ? [X0,X1] : ~ is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(ennf_transformation,[],[f46]) ).
fof(f59,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f60,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(ennf_transformation,[],[f28]) ).
fof(f61,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f62,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f64,plain,
( r3
| ~ is_a_theorem(implies(or(sK0,sK1),or(sK1,sK0))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f58]) ).
fof(f65,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f53]) ).
fof(f67,plain,
! [X0] :
( is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(cnf_transformation,[],[f55]) ).
fof(f68,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f56]) ).
fof(f69,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(cnf_transformation,[],[f57]) ).
fof(f70,plain,
( r3
| ~ is_a_theorem(implies(or(sK0,sK1),or(sK1,sK0))) ),
inference(cnf_transformation,[],[f64]) ).
fof(f71,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f59]) ).
fof(f72,plain,
! [X0,X1] :
( and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(cnf_transformation,[],[f60]) ).
fof(f73,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f61]) ).
fof(f74,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f62]) ).
fof(f76,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f77,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f79,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f80,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f81,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f82,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f40]) ).
fof(f85,plain,
op_and,
inference(cnf_transformation,[],[f41]) ).
fof(f87,plain,
~ r3,
inference(cnf_transformation,[],[f45]) ).
fof(f89,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(forward_subsumption_resolution,[],[f74,f84]) ).
fof(f90,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f73,f77]) ).
fof(f91,plain,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f72,f85]) ).
fof(f92,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f71,f76]) ).
fof(f93,plain,
~ is_a_theorem(implies(or(sK0,sK1),or(sK1,sK0))),
inference(forward_subsumption_resolution,[],[f70,f87]) ).
fof(f94,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))),
inference(forward_subsumption_resolution,[],[f69,f82]) ).
fof(f95,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(forward_subsumption_resolution,[],[f68,f81]) ).
fof(f96,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,X0))),
inference(forward_subsumption_resolution,[],[f67,f80]) ).
fof(f98,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_subsumption_resolution,[],[f65,f79]) ).
fof(f99,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[],[f91,f89]) ).
fof(f100,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f92,f90]) ).
fof(f101,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),or(and(X1,X2),not(and(X2,X0))))),
inference(backward_demodulation,[],[f94,f100]) ).
fof(f102,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(and(X1,X2),X1),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f98,f95]) ).
fof(f103,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X1,and(X1,X1)),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f98,f96]) ).
fof(f109,plain,
! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2),
inference(superposition,[],[f100,f90]) ).
fof(f127,plain,
! [X2,X0,X1] : implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(superposition,[],[f89,f99]) ).
fof(f149,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),X2),or(and(X2,X0),implies(X0,X1)))),
inference(superposition,[],[f101,f90]) ).
fof(f150,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),or(and(X2,X0),implies(X0,X1)))),
inference(forward_demodulation,[],[f149,f100]) ).
fof(f163,plain,
! [X0,X1] : is_a_theorem(or(and(and(X0,X0),X1),not(and(X1,X0)))),
inference(resolution,[],[f103,f101]) ).
fof(f319,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(and(and(not(X0),X1),X0),X2))
| is_a_theorem(X2) ),
inference(superposition,[],[f102,f127]) ).
fof(f374,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X2,X0),implies(implies(X0,X1),implies(not(X1),X2)))),
inference(superposition,[],[f150,f109]) ).
fof(f375,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X2,X0),implies(implies(X0,X1),or(X1,X2)))),
inference(forward_demodulation,[],[f374,f100]) ).
fof(f1240,plain,
! [X0] : is_a_theorem(not(and(X0,not(X0)))),
inference(resolution,[],[f319,f163]) ).
fof(f1265,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(forward_demodulation,[],[f1240,f90]) ).
fof(f1279,plain,
! [X0] : is_a_theorem(or(X0,not(X0))),
inference(superposition,[],[f1265,f100]) ).
fof(f1324,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(or(X1,not(X1)),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f1279,f98]) ).
fof(f2068,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),X1),or(X1,X0))),
inference(resolution,[],[f1324,f375]) ).
fof(f2083,plain,
! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))),
inference(forward_demodulation,[],[f2068,f100]) ).
fof(f2102,plain,
$false,
inference(resolution,[],[f2083,f93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL520+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.36 % Computer : n003.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 27 15:57:26 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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
% 1.10/0.58 % (740743)Will run a generic schedule for satisfiability detection.
% 1.10/0.58 % (740752)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4130448208:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.10/0.58 % (740749)% WARNING: option uhcvi not known.
% 1.10/0.58 % (740748)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2343936161_2999 on theBenchmark for (2999ds/0Mi)
% 1.10/0.58 % (740754)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1292895499:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.10/0.58 % (740750)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=480835363:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.10/0.58 % (740751)dis+10_1_sil=32000:sp=arity:random_seed=957613780:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.10/0.58 % (740753)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4072258290:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.10/0.58 % TRYING [1]
% 1.10/0.58 % TRYING [2]
% 1.10/0.58 % TRYING [3]
% 1.10/0.58 % (740749)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1964381708:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.10/0.58 % TRYING [4]
% 1.10/0.58 % (740752)Instruction limit reached!
% 1.10/0.58 % (740752)------------------------------
% 1.10/0.58 % (740752)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.10/0.58 % (740752)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.10/0.58 % (740752)CaDiCaL version: 2.1.3
% 1.10/0.58 % (740752)Termination reason: Instruction limit
% 1.10/0.58 % (740752)Termination phase: Saturation
% 1.10/0.58 % (740752)Time elapsed: 0.040 s
% 1.10/0.58 % (740752)Peak memory usage: 13 MB
% 1.10/0.58 % (740752)Instructions burned: 116 (million)
% 1.10/0.58 % (740762)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2833928899:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.10/0.58 % TRYING [1]
% 1.10/0.58 % TRYING [2]
% 1.10/0.58 % TRYING [3]
% 1.10/0.58 % (740751)Instruction limit reached!
% 1.10/0.58 % (740751)------------------------------
% 1.10/0.58 % (740751)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.10/0.58 % (740751)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.10/0.59 % (740751)CaDiCaL version: 2.1.3
% 1.10/0.59 % (740751)Termination reason: Instruction limit
% 1.10/0.59 % (740751)Termination phase: Saturation
% 1.10/0.59 % (740751)Time elapsed: 0.064 s
% 1.10/0.59 % (740751)Peak memory usage: 13 MB
% 1.10/0.59 % (740751)Instructions burned: 103 (million)
% 1.10/0.59 % TRYING [4]
% 1.10/0.59 % (740753)Instruction limit reached!
% 1.10/0.59 % (740753)------------------------------
% 1.10/0.59 % (740753)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.10/0.59 % (740753)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.10/0.59 % (740753)CaDiCaL version: 2.1.3
% 1.10/0.59 % (740753)Termination reason: Instruction limit
% 1.10/0.59 % (740753)Termination phase: Saturation
% 1.10/0.59 % (740753)Time elapsed: 0.083 s
% 1.10/0.59 % (740753)Peak memory usage: 14 MB
% 1.10/0.59 % (740753)Instructions burned: 132 (million)
% 1.10/0.59 % (740764)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2289283721:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.10/0.59 % (740766)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=187607794:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.10/0.59 % (740754)Instruction limit reached!
% 1.10/0.59 % (740754)------------------------------
% 1.10/0.59 % (740754)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.10/0.59 % (740754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.10/0.59 % (740754)CaDiCaL version: 2.1.3
% 1.10/0.59 % (740754)Termination reason: Instruction limit
% 1.10/0.59 % (740754)Termination phase: Saturation
% 1.10/0.59 % (740754)Time elapsed: 0.105 s
% 1.10/0.59 % (740754)Peak memory usage: 14 MB
% 1.10/0.59 % (740754)Instructions burned: 159 (million)
% 1.10/0.59 % (740768)ott-21_1_sil=16000:fs=off:random_seed=1954218122:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.10/0.59 % (740764) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-740743-740764"...
% 1.10/0.59 % (740764)...printing done.
% 1.10/0.59 % (740764)Refutation found. Thanks to Tanya!
% 1.10/0.59 % SZS status Theorem for theBenchmark
% 1.10/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.10/0.59 % (740764)------------------------------
% 1.10/0.59 % (740764)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.10/0.59 % (740764)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.10/0.59 % (740764)CaDiCaL version: 2.1.3
% 1.10/0.59 % (740764)Termination reason: Refutation
% 1.10/0.59 % (740764)Time elapsed: 0.058 s
% 1.10/0.59 % (740764)Peak memory usage: 13 MB
% 1.10/0.59 % (740764)Instructions burned: 87 (million)
% 1.10/0.59 % (740743)Success in time 0.178 s
% 1.10/0.59 % Vampire exiting
%------------------------------------------------------------------------------