%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL509+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 : 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 11:58:50 AM UTC 2026
% Result : Theorem 20.11s 6.67s
% Output : Refutation 20.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 14
% Syntax : Number of formulae : 96 ( 36 unt; 0 def)
% Number of atoms : 181 ( 13 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 179 ( 94 ~; 69 |; 2 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 173 ( 171 !; 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(f10,axiom,
( or_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',or_1) ).
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(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(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(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(f43,conjecture,
or_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_or_1) ).
fof(f44,negated_conjecture,
~ or_1,
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f45,plain,
~ or_1,
inference(flattening,[],[f44]) ).
fof(f46,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(f47,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f48,plain,
( kn1
=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f49,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
=> or_1 ),
inference(unused_predicate_definition_removal,[],[f10]) ).
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(f54,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f51]) ).
fof(f55,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f54]) ).
fof(f57,plain,
( or_1
| ? [X0,X1] : ~ is_a_theorem(implies(X0,or(X0,X1))) ),
inference(ennf_transformation,[],[f49]) ).
fof(f58,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(ennf_transformation,[],[f48]) ).
fof(f59,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f47]) ).
fof(f60,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(ennf_transformation,[],[f46]) ).
fof(f61,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f62,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f64,plain,
! [X0,X1] :
( ~ modus_ponens
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f55]) ).
fof(f66,plain,
( ~ is_a_theorem(implies(sK0,or(sK0,sK1)))
| or_1 ),
inference(cnf_transformation,[],[f57]) ).
fof(f67,plain,
! [X0] :
( ~ kn1
| is_a_theorem(implies(X0,and(X0,X0))) ),
inference(cnf_transformation,[],[f58]) ).
fof(f68,plain,
! [X0,X1] :
( ~ kn2
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(cnf_transformation,[],[f59]) ).
fof(f69,plain,
! [X2,X0,X1] :
( ~ kn3
| is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(cnf_transformation,[],[f60]) ).
fof(f70,plain,
! [X0,X1] :
( ~ op_or
| or(X0,X1) = not(and(not(X0),not(X1))) ),
inference(cnf_transformation,[],[f61]) ).
fof(f71,plain,
! [X0,X1] :
( ~ op_implies_and
| implies(X0,X1) = not(and(X0,not(X1))) ),
inference(cnf_transformation,[],[f62]) ).
fof(f73,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f74,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f76,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f77,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f78,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f79,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f84,plain,
~ or_1,
inference(cnf_transformation,[],[f45]) ).
fof(f85,plain,
~ is_a_theorem(implies(sK0,or(sK0,sK1))),
inference(forward_subsumption_resolution,[],[f66,f84]) ).
fof(f86,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,X0))),
inference(forward_subsumption_resolution,[],[f67,f77]) ).
fof(f87,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(forward_subsumption_resolution,[],[f68,f78]) ).
fof(f89,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f64,f76]) ).
fof(f92,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f71,f74]) ).
fof(f95,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f70,f73]) ).
fof(f96,plain,
! [X2,X0,X1] : or(and(X0,not(X1)),X2) = not(and(implies(X0,X1),not(X2))),
inference(superposition,[],[f95,f92]) ).
fof(f98,plain,
! [X2,X0,X1] : or(X2,and(X0,not(X1))) = not(and(not(X2),implies(X0,X1))),
inference(superposition,[],[f95,f92]) ).
fof(f100,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(superposition,[],[f95,f92]) ).
fof(f102,plain,
! [X2,X0,X1] : implies(X2,and(not(X0),not(X1))) = not(and(X2,or(X0,X1))),
inference(superposition,[],[f92,f95]) ).
fof(f104,plain,
! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2),
inference(forward_demodulation,[],[f96,f92]) ).
fof(f107,plain,
! [X0] : is_a_theorem(or(X0,and(not(X0),not(X0)))),
inference(superposition,[],[f86,f100]) ).
fof(f108,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| ~ is_a_theorem(not(X0))
| is_a_theorem(X1) ),
inference(superposition,[],[f89,f100]) ).
fof(f118,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,f79]) ).
fof(f119,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),or(and(X1,X2),not(and(X2,X0))))),
inference(forward_demodulation,[],[f118,f100]) ).
fof(f122,plain,
! [X2,X0,X1] :
( is_a_theorem(or(and(X1,X2),not(and(X2,X0))))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f119,f89]) ).
fof(f126,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),X2),or(and(X2,X0),implies(X0,X1)))),
inference(superposition,[],[f119,f92]) ).
fof(f129,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),or(and(X2,X0),implies(X0,X1)))),
inference(forward_demodulation,[],[f126,f100]) ).
fof(f139,plain,
! [X2,X0,X1] :
( is_a_theorem(or(and(X1,X2),implies(X2,X0)))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[],[f129,f89]) ).
fof(f179,plain,
! [X2,X0,X1] :
( is_a_theorem(or(and(X2,not(X0)),or(X0,X1)))
| ~ is_a_theorem(implies(not(X1),X2)) ),
inference(superposition,[],[f122,f95]) ).
fof(f181,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),not(and(not(X1),X2))))
| ~ is_a_theorem(implies(X2,X0)) ),
inference(superposition,[],[f122,f104]) ).
fof(f183,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X2,X0),or(X0,X1)))
| ~ is_a_theorem(implies(not(X1),X2)) ),
inference(forward_demodulation,[],[f179,f104]) ).
fof(f185,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X2,X0),or(X0,X1)))
| ~ is_a_theorem(or(X1,X2)) ),
inference(forward_demodulation,[],[f183,f100]) ).
fof(f195,plain,
! [X2,X0,X1] :
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(not(and(X0,X1)))
| ~ is_a_theorem(implies(X2,X0)) ),
inference(resolution,[],[f108,f122]) ).
fof(f208,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(or(and(X3,not(X0)),or(X0,and(X1,not(X2)))))
| ~ is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(superposition,[],[f122,f98]) ).
fof(f221,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(implies(X3,X0),or(X0,and(X1,not(X2)))))
| ~ is_a_theorem(implies(implies(X1,X2),X3)) ),
inference(forward_demodulation,[],[f208,f104]) ).
fof(f247,plain,
! [X0] : is_a_theorem(not(and(not(X0),or(X0,X0)))),
inference(superposition,[],[f86,f102]) ).
fof(f389,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[],[f139,f108]) ).
fof(f400,plain,
! [X2,X0,X1] :
( is_a_theorem(or(X2,X0))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[],[f185,f89]) ).
fof(f597,plain,
! [X0] :
( ~ is_a_theorem(or(or(sK0,sK1),X0))
| ~ is_a_theorem(not(and(X0,sK0))) ),
inference(resolution,[],[f389,f85]) ).
fof(f608,plain,
! [X0,X1] :
( ~ is_a_theorem(not(and(X0,sK0)))
| ~ is_a_theorem(implies(X1,or(sK0,sK1)))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[],[f597,f400]) ).
fof(f610,plain,
! [X2,X0,X1] :
( is_a_theorem(not(and(not(X2),X0)))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f181,f89]) ).
fof(f671,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X1,and(or(sK0,sK1),X0)))
| ~ is_a_theorem(not(and(X1,sK0))) ),
inference(resolution,[],[f608,f87]) ).
fof(f708,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(not(and(X0,sK0)))
| ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(or(and(or(sK0,sK1),X2),X1)) ),
inference(resolution,[],[f671,f400]) ).
fof(f1309,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(X1,or(sK0,sK1)))
| ~ is_a_theorem(implies(implies(X0,X1),X2))
| ~ is_a_theorem(not(and(X2,sK0))) ),
inference(resolution,[],[f708,f139]) ).
fof(f1344,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(or(X3,and(X0,not(X1))))
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(resolution,[],[f221,f89]) ).
fof(f1998,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(not(and(or(X1,X2),sK0)))
| ~ is_a_theorem(or(X2,X0))
| ~ is_a_theorem(or(X1,or(sK0,sK1))) ),
inference(resolution,[],[f1309,f185]) ).
fof(f3298,plain,
! [X0,X1] :
( ~ is_a_theorem(not(and(or(X1,X0),sK0)))
| ~ is_a_theorem(or(X1,or(sK0,sK1))) ),
inference(resolution,[],[f1998,f107]) ).
fof(f6433,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(not(and(X0,or(X1,X2))))
| ~ is_a_theorem(implies(sK0,X0))
| ~ is_a_theorem(or(X1,or(sK0,sK1))) ),
inference(resolution,[],[f195,f3298]) ).
fof(f21787,plain,
! [X0] :
( ~ is_a_theorem(or(X0,or(sK0,sK1)))
| ~ is_a_theorem(implies(sK0,not(X0))) ),
inference(resolution,[],[f6433,f247]) ).
fof(f21921,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(sK0,not(X0)))
| ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(or(or(sK0,sK1),X1)) ),
inference(resolution,[],[f21787,f400]) ).
fof(f23608,plain,
! [X0,X1] :
( ~ is_a_theorem(or(or(sK0,sK1),and(X0,X1)))
| ~ is_a_theorem(implies(sK0,not(X0))) ),
inference(resolution,[],[f21921,f87]) ).
fof(f23694,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,or(sK0,sK1)))
| ~ is_a_theorem(implies(implies(X0,X2),X1))
| ~ is_a_theorem(implies(sK0,not(X0))) ),
inference(resolution,[],[f23608,f1344]) ).
fof(f72858,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X2),and(or(sK0,sK1),X0)))
| ~ is_a_theorem(implies(sK0,not(X1))) ),
inference(resolution,[],[f23694,f87]) ).
fof(f73060,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(or(X0,X1),and(or(sK0,sK1),X2)))
| ~ is_a_theorem(implies(sK0,not(not(X0)))) ),
inference(superposition,[],[f72858,f100]) ).
fof(f73298,plain,
~ is_a_theorem(implies(sK0,not(not(sK0)))),
inference(resolution,[],[f73060,f86]) ).
fof(f73362,plain,
! [X0] :
( ~ is_a_theorem(or(not(not(sK0)),X0))
| ~ is_a_theorem(not(and(X0,sK0))) ),
inference(resolution,[],[f73298,f389]) ).
fof(f73489,plain,
! [X0,X1] :
( ~ is_a_theorem(not(and(X0,sK0)))
| ~ is_a_theorem(implies(X1,not(not(sK0))))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[],[f73362,f400]) ).
fof(f75024,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X1,and(not(not(sK0)),X0)))
| ~ is_a_theorem(not(and(X1,sK0))) ),
inference(resolution,[],[f73489,f87]) ).
fof(f75523,plain,
~ is_a_theorem(not(and(not(sK0),sK0))),
inference(resolution,[],[f75024,f107]) ).
fof(f75653,plain,
! [X0] :
( ~ is_a_theorem(implies(X0,sK0))
| ~ is_a_theorem(implies(sK0,X0)) ),
inference(resolution,[],[f75523,f610]) ).
fof(f75847,plain,
! [X0] : ~ is_a_theorem(implies(sK0,and(sK0,X0))),
inference(resolution,[],[f75653,f87]) ).
fof(f75930,plain,
$false,
inference(resolution,[],[f75847,f86]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL509+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.18/0.44 % Computer : n019.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Sun Sep 27 15:54:33 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.23/0.48 Running first-order model finding
% 0.23/0.48 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
% 42.75/6.55 % (3232325)Will run a generic schedule for satisfiability detection.
% 42.75/6.55 % (3232331)% WARNING: option uhcvi not known.
% 42.75/6.55 % (3232331)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3384106588:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 42.75/6.55 % (3232330)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3115022580_2999 on theBenchmark for (2999ds/0Mi)
% 42.75/6.55 % TRYING [1]
% 42.75/6.55 % TRYING [2]
% 42.75/6.55 % TRYING [3]
% 42.75/6.55 % (3232334)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2408329885:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 42.75/6.55 % (3232332)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1732360094:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 42.75/6.55 % (3232336)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=874893428:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 42.75/6.55 % (3232333)dis+10_1_sil=32000:sp=arity:random_seed=580970:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 42.75/6.55 % (3232335)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2993158106:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 42.75/6.55 % TRYING [4]
% 42.75/6.55 % (3232333)Instruction limit reached!
% 42.75/6.55 % (3232333)------------------------------
% 42.75/6.55 % (3232333)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.75/6.55 % (3232333)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.75/6.55 % (3232333)CaDiCaL version: 2.1.3
% 42.75/6.55 % (3232333)Termination reason: Instruction limit
% 42.75/6.55 % (3232333)Termination phase: Saturation
% 42.75/6.55 % (3232333)Time elapsed: 0.114 s
% 42.75/6.55 % (3232333)Peak memory usage: 12 MB
% 42.75/6.55 % (3232333)Instructions burned: 103 (million)
% 42.75/6.55 % (3232334)Instruction limit reached!
% 42.75/6.55 % (3232334)------------------------------
% 42.75/6.55 % (3232334)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.75/6.55 % (3232334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.75/6.55 % (3232334)CaDiCaL version: 2.1.3
% 42.75/6.55 % (3232334)Termination reason: Instruction limit
% 42.75/6.55 % (3232334)Termination phase: Saturation
% 42.75/6.55 % (3232334)Time elapsed: 0.124 s
% 42.75/6.55 % (3232334)Peak memory usage: 13 MB
% 42.75/6.55 % (3232334)Instructions burned: 116 (million)
% 42.75/6.55 % (3232335)Instruction limit reached!
% 42.75/6.55 % (3232335)------------------------------
% 42.75/6.55 % (3232335)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.75/6.55 % (3232335)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.75/6.55 % (3232335)CaDiCaL version: 2.1.3
% 42.75/6.55 % (3232335)Termination reason: Instruction limit
% 42.75/6.55 % (3232335)Termination phase: Saturation
% 42.75/6.55 % (3232335)Time elapsed: 0.143 s
% 42.75/6.55 % (3232335)Peak memory usage: 13 MB
% 42.75/6.55 % (3232335)Instructions burned: 132 (million)
% 42.75/6.55 % (3232345)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3668724979:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 42.75/6.55 % (3232344)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4051027933:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 42.75/6.55 % TRYING [1]
% 42.75/6.55 % TRYING [2]
% 42.75/6.55 % TRYING [3]
% 42.75/6.55 % (3232336)Instruction limit reached!
% 42.75/6.55 % (3232336)------------------------------
% 42.75/6.55 % (3232336)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.75/6.55 % (3232336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.75/6.55 % (3232336)CaDiCaL version: 2.1.3
% 42.75/6.55 % (3232336)Termination reason: Instruction limit
% 42.75/6.55 % (3232336)Termination phase: Saturation
% 42.75/6.55 % (3232336)Time elapsed: 0.180 s
% 42.75/6.55 % (3232336)Peak memory usage: 14 MB
% 42.75/6.55 % (3232336)Instructions burned: 160 (million)
% 42.75/6.55 % TRYING [4]
% 42.75/6.55 % (3232346)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=1093531161:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 42.75/6.55 % (3232349)ott-21_1_sil=16000:fs=off:random_seed=1240033786:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 42.75/6.55 % TRYING [5]
% 42.75/6.55 % (3232345)Instruction limit reached!
% 42.75/6.55 % (3232345)------------------------------
% 42.75/6.55 % (3232345)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.11/6.67 % (3232345)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.11/6.67 % (3232345)CaDiCaL version: 2.1.3
% 20.11/6.67 % (3232345)Termination reason: Instruction limit
% 20.11/6.67 % (3232345)Termination phase: Saturation
% 20.11/6.67 % (3232345)Time elapsed: 0.148 s
% 20.11/6.67 % (3232345)Peak memory usage: 14 MB
% 20.11/6.67 % (3232345)Instructions burned: 131 (million)
% 20.11/6.67 % (3232352)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=66682359:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 20.11/6.67 % (3232349)Instruction limit reached!
% 20.11/6.67 % (3232349)------------------------------
% 20.11/6.67 % (3232349)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.11/6.67 % (3232349)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.11/6.67 % (3232349)CaDiCaL version: 2.1.3
% 20.11/6.67 % (3232349)Termination reason: Instruction limit
% 20.11/6.67 % (3232349)Termination phase: Saturation
% 20.11/6.67 % (3232349)Time elapsed: 0.147 s
% 20.11/6.67 % (3232349)Peak memory usage: 12 MB
% 20.11/6.67 % (3232349)Instructions burned: 181 (million)
% 20.11/6.67 % (3232354)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1509739230:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 20.11/6.67 % TRYING [1]
% 20.11/6.67 % TRYING [2]
% 20.11/6.67 % TRYING [3]
% 20.11/6.67 % TRYING [4]
% 20.11/6.67 % TRYING [5]
% 20.11/6.67 % (3232344)Instruction limit reached!
% 20.11/6.67 % (3232344)------------------------------
% 20.11/6.67 % (3232344)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.11/6.67 % (3232344)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.11/6.67 % (3232344)CaDiCaL version: 2.1.3
% 20.11/6.67 % (3232344)Termination reason: Instruction limit
% 20.11/6.67 % (3232344)Termination phase: Finite model building SAT solving
% 20.11/6.67 % (3232344)Time elapsed: 0.681 s
% 20.11/6.67 % (3232344)Peak memory usage: 17 MB
% 20.11/6.67 % (3232344)Instructions burned: 715 (million)
% 20.11/6.67 % (3232352)Instruction limit reached!
% 20.11/6.67 % (3232352)------------------------------
% 20.11/6.67 % (3232352)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.11/6.67 % (3232352)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.11/6.67 % (3232352)CaDiCaL version: 2.1.3
% 20.11/6.67 % (3232352)Termination reason: Instruction limit
% 20.11/6.67 % (3232352)Termination phase: Saturation
% 20.11/6.67 % (3232352)Time elapsed: 0.528 s
% 20.11/6.67 % (3232352)Peak memory usage: 13 MB
% 20.11/6.67 % (3232352)Instructions burned: 477 (million)
% 20.11/6.67 % (3232356)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2108992695:i=1179_2991 on theBenchmark for (2991ds/1179Mi)
% 20.11/6.67 % (3232357)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=491382850:i=889:ins=1_2990 on theBenchmark for (2990ds/889Mi)
% 20.11/6.67 % (3232346)Instruction limit reached!
% 20.11/6.67 % (3232346)------------------------------
% 20.11/6.67 % (3232346)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.11/6.67 % (3232346)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.11/6.67 % (3232346)CaDiCaL version: 2.1.3
% 20.11/6.67 % (3232346)Termination reason: Instruction limit
% 20.11/6.67 % (3232346)Termination phase: Saturation
% 20.11/6.67 % (3232346)Time elapsed: 0.746 s
% 20.11/6.67 % (3232346)Peak memory usage: 19 MB
% 20.11/6.67 % (3232346)Instructions burned: 684 (million)
% 20.11/6.67 % TRYING [14]
% 20.11/6.67 % (3232360)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3285535631:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2990 on theBenchmark for (2990ds/692Mi)
% 20.11/6.67 % TRYING [5]
% 20.11/6.67 % (3232354)Instruction limit reached!
% 20.11/6.67 % (3232354)------------------------------
% 20.11/6.67 % (3232354)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.11/6.67 % (3232354)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.11/6.67 % (3232354)CaDiCaL version: 2.1.3
% 20.11/6.67 % (3232354)Termination reason: Instruction limit
% 20.11/6.67 % (3232354)Termination phase: Finite model building constraint generation
% 20.11/6.67 % (3232354)Time elapsed: 0.653 s
% 20.11/6.67 % (3232354)Peak memory usage: 19 MB
% 20.11/6.67 % (3232354)Instructions burned: 866 (million)
% 20.11/6.67 % (3232362)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=723139912:i=879:kws=inv_precedence:fsr=off_2988 on theBenchmark for (2988ds/879Mi)
% 20.11/6.67 % (3232357)Instruction limit reached!
% 20.11/6.67 % (3232357)------------------------------
% 20.11/6.67 % (3232357)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.11/6.67 % (3232357)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.11/6.67 % (3232357)CaDiCaL version: 2.1.3
% 20.11/6.67 % (3232357)Termination reason: Instruction limit
% 20.11/6.67 % (3232357)Termination phase: Finite model building constraint generation
% 20.11/6.67 % (3232357)Time elapsed: 0.392 s
% 20.11/6.67 % (3232357)Peak memory usage: 66 MB
% 20.11/6.67 % (3232357)Instructions burned: 890 (million)
% 20.11/6.67 % (3232364)fmb+10_1_sil=64000:random_seed=3885234662:i=22061:nm=2:gsp=on_2986 on theBenchmark for (2986ds/22061Mi)
% 20.11/6.67 % TRYING [1]
% 20.11/6.67 % TRYING [2]
% 20.11/6.67 % TRYING [3]
% 20.11/6.67 % TRYING [4]
% 20.11/6.67 % TRYING [5]
% 20.11/6.67 % (3232360)Instruction limit reached!
% 20.11/6.67 % (3232360)------------------------------
% 20.11/6.67 % (3232360)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.11/6.67 % (3232360)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.11/6.67 % (3232360)CaDiCaL version: 2.1.3
% 20.11/6.67 % (3232360)Termination reason: Instruction limit
% 20.11/6.67 % (3232360)Termination phase: Saturation
% 20.11/6.67 % (3232360)Time elapsed: 0.696 s
% 20.11/6.67 % (3232360)Peak memory usage: 19 MB
% 20.11/6.67 % (3232360)Instructions burned: 692 (million)
% 20.11/6.67 % (3232366)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3701792125:i=9515:nm=5_2982 on theBenchmark for (2982ds/9515Mi)
% 20.11/6.67 % TRYING [20]
% 20.11/6.67 % (3232362)Instruction limit reached!
% 20.11/6.67 % (3232362)------------------------------
% 20.11/6.67 % (3232362)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.11/6.67 % (3232362)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.11/6.67 % (3232362)CaDiCaL version: 2.1.3
% 20.11/6.67 % (3232362)Termination reason: Instruction limit
% 20.11/6.67 % (3232362)Termination phase: Saturation
% 20.11/6.67 % (3232362)Time elapsed: 0.878 s
% 20.11/6.67 % (3232362)Peak memory usage: 21 MB
% 20.11/6.67 % (3232362)Instructions burned: 880 (million)
% 20.11/6.67 % (3232368)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3917637092:fmbsr=1.7:i=920_2979 on theBenchmark for (2979ds/920Mi)
% 20.11/6.67 % TRYING [8]
% 20.11/6.67 % (3232356)Instruction limit reached!
% 20.11/6.67 % (3232356)------------------------------
% 20.11/6.67 % (3232356)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.11/6.67 % (3232356)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.11/6.67 % (3232356)CaDiCaL version: 2.1.3
% 20.11/6.67 % (3232356)Termination reason: Instruction limit
% 20.11/6.67 % (3232356)Termination phase: Saturation
% 20.11/6.67 % (3232356)Time elapsed: 1.222 s
% 20.11/6.67 % (3232356)Peak memory usage: 26 MB
% 20.11/6.67 % (3232356)Instructions burned: 1179 (million)
% 20.11/6.67 % (3232370)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=1681189177:i=5131_2978 on theBenchmark for (2978ds/5131Mi)
% 20.11/6.67 % (3232368)Instruction limit reached!
% 20.11/6.67 % (3232368)------------------------------
% 20.11/6.67 % (3232368)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.11/6.67 % (3232368)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.11/6.67 % (3232368)CaDiCaL version: 2.1.3
% 20.11/6.67 % (3232368)Termination reason: Instruction limit
% 20.11/6.67 % (3232368)Termination phase: Finite model building SAT solving
% 20.11/6.67 % (3232368)Time elapsed: 0.774 s
% 20.11/6.67 % (3232368)Peak memory usage: 52 MB
% 20.11/6.67 % (3232368)Instructions burned: 920 (million)
% 20.11/6.67 % (3232372)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2846363187:i=1472:ins=7:fdi=8:gsp=on_2971 on theBenchmark for (2971ds/1472Mi)
% 20.11/6.67 % (3232372)Instruction limit reached!
% 20.11/6.67 % (3232372)------------------------------
% 20.11/6.67 % (3232372)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.11/6.67 % (3232372)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.11/6.67 % (3232372)CaDiCaL version: 2.1.3
% 20.11/6.67 % (3232372)Termination reason: Instruction limit
% 20.11/6.67 % (3232372)Termination phase: Saturation
% 20.11/6.67 % (3232372)Time elapsed: 1.409 s
% 20.11/6.67 % (3232372)Peak memory usage: 29 MB
% 20.11/6.67 % (3232372)Instructions burned: 1473 (million)
% 20.11/6.67 % (3232374)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=917586014:i=6324_2956 on theBenchmark for (2956ds/6324Mi)
% 20.11/6.67 % TRYING [77]
% 20.11/6.67 % TRYING [6]
% 20.11/6.67 % TRYING [6]
% 20.11/6.67 % (3232370) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3232325-3232370"...
% 20.11/6.67 % (3232370)...printing done.
% 20.11/6.67 % (3232370)Refutation found. Thanks to Tanya!
% 20.11/6.67 % SZS status Theorem for theBenchmark
% 20.11/6.67 % SZS output start Proof for theBenchmark
% See solution above
% 20.11/6.67 % (3232370)------------------------------
% 20.11/6.67 % (3232370)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 20.11/6.67 % (3232370)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 20.11/6.67 % (3232370)CaDiCaL version: 2.1.3
% 20.11/6.67 % (3232370)Termination reason: Refutation
% 20.11/6.67 % (3232370)Time elapsed: 3.871 s
% 20.11/6.67 % (3232370)Peak memory usage: 44 MB
% 20.11/6.67 % (3232370)Instructions burned: 3970 (million)
% 20.11/6.67 % (3232325)Success in time 6.177 s
% 20.11/6.67 % Vampire exiting
%------------------------------------------------------------------------------