%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL495+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 : n012.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:48 AM UTC 2026
% Result : Theorem 4.69s 1.05s
% Output : Refutation 4.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 20
% Syntax : Number of formulae : 101 ( 56 unt; 0 def)
% Number of atoms : 158 ( 24 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 100 ( 43 ~; 38 |; 2 &)
% ( 5 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 11 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 175 ( 173 !; 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(f15,axiom,
( equivalence_3
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',equivalence_3) ).
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(f25,axiom,
( r4
<=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r4) ).
fof(f26,axiom,
( r5
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r5) ).
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(f31,axiom,
( op_equiv
=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
fof(f33,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_modus_ponens) ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r3) ).
fof(f39,axiom,
r4,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r4) ).
fof(f40,axiom,
r5,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r5) ).
fof(f42,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f43,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f44,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_equiv) ).
fof(f45,conjecture,
equivalence_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_equivalence_3) ).
fof(f46,negated_conjecture,
~ equivalence_3,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ equivalence_3,
inference(flattening,[],[f46]) ).
fof(f48,plain,
( r5
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f26]) ).
fof(f49,plain,
( r4
=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f25]) ).
fof(f50,plain,
( r3
=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f24]) ).
fof(f53,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
=> equivalence_3 ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f55,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(f56,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f55]) ).
fof(f57,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f56]) ).
fof(f59,plain,
( equivalence_3
| ? [X0,X1] : ~ is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
inference(ennf_transformation,[],[f53]) ).
fof(f62,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(ennf_transformation,[],[f50]) ).
fof(f63,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(ennf_transformation,[],[f49]) ).
fof(f64,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(ennf_transformation,[],[f48]) ).
fof(f65,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f66,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(ennf_transformation,[],[f28]) ).
fof(f67,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f68,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f69,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f70,plain,
( equivalence_3
| ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK0),equiv(sK0,sK1)))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f59]) ).
fof(f71,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f57]) ).
fof(f73,plain,
( equivalence_3
| ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK0),equiv(sK0,sK1)))) ),
inference(cnf_transformation,[],[f70]) ).
fof(f76,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(cnf_transformation,[],[f62]) ).
fof(f77,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(cnf_transformation,[],[f63]) ).
fof(f78,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(cnf_transformation,[],[f64]) ).
fof(f79,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f65]) ).
fof(f80,plain,
! [X0,X1] :
( and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(cnf_transformation,[],[f66]) ).
fof(f81,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f67]) ).
fof(f82,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f68]) ).
fof(f83,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f69]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f85,plain,
op_and,
inference(cnf_transformation,[],[f33]) ).
fof(f87,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f90,plain,
r3,
inference(cnf_transformation,[],[f38]) ).
fof(f91,plain,
r4,
inference(cnf_transformation,[],[f39]) ).
fof(f92,plain,
r5,
inference(cnf_transformation,[],[f40]) ).
fof(f94,plain,
op_or,
inference(cnf_transformation,[],[f42]) ).
fof(f95,plain,
op_implies_and,
inference(cnf_transformation,[],[f43]) ).
fof(f96,plain,
op_equiv,
inference(cnf_transformation,[],[f44]) ).
fof(f97,plain,
~ equivalence_3,
inference(cnf_transformation,[],[f47]) ).
fof(f98,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(forward_subsumption_resolution,[],[f83,f96]) ).
fof(f99,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(forward_subsumption_resolution,[],[f82,f84]) ).
fof(f100,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f81,f95]) ).
fof(f101,plain,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f80,f85]) ).
fof(f102,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f79,f94]) ).
fof(f103,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))),
inference(forward_subsumption_resolution,[],[f78,f92]) ).
fof(f104,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(forward_subsumption_resolution,[],[f77,f91]) ).
fof(f105,plain,
! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))),
inference(forward_subsumption_resolution,[],[f76,f90]) ).
fof(f108,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK0),equiv(sK0,sK1)))),
inference(forward_subsumption_resolution,[],[f73,f97]) ).
fof(f110,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f71,f87]) ).
fof(f111,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[],[f101,f99]) ).
fof(f112,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f102,f100]) ).
fof(f115,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),or(X1,not(X0)))),
inference(superposition,[],[f105,f99]) ).
fof(f116,plain,
! [X0,X1] : is_a_theorem(implies(or(X1,not(X0)),implies(X0,X1))),
inference(superposition,[],[f105,f99]) ).
fof(f117,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))),
inference(forward_demodulation,[],[f116,f112]) ).
fof(f118,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(X1),not(X0)))),
inference(forward_demodulation,[],[f115,f112]) ).
fof(f132,plain,
! [X0,X1] : implies(X0,X1) = implies(not(not(X0)),X1),
inference(superposition,[],[f99,f112]) ).
fof(f146,plain,
! [X0,X1] : equiv(X0,X1) = not(implies(implies(X0,X1),not(implies(X1,X0)))),
inference(superposition,[],[f111,f98]) ).
fof(f152,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(or(X2,X0),or(X2,X1))) ),
inference(resolution,[],[f103,f110]) ).
fof(f161,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X2,X0),implies(not(X2),X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f152,f112]) ).
fof(f162,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(not(X2),X0),implies(not(X2),X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f161,f112]) ).
fof(f174,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(not(X0),or(X2,X1)),or(X2,implies(X0,X1)))),
inference(superposition,[],[f104,f99]) ).
fof(f176,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,or(not(X0),X2)),implies(X0,or(X1,X2)))),
inference(superposition,[],[f104,f99]) ).
fof(f179,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,or(not(X0),X2)),implies(X0,implies(not(X1),X2)))),
inference(forward_demodulation,[],[f176,f112]) ).
fof(f181,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(not(X0),or(X2,X1)),implies(not(X2),implies(X0,X1)))),
inference(forward_demodulation,[],[f174,f112]) ).
fof(f188,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),or(not(X0),X2)),implies(X0,implies(not(X1),X2)))),
inference(forward_demodulation,[],[f179,f112]) ).
fof(f190,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,or(X2,X1)),implies(not(X2),implies(X0,X1)))),
inference(forward_demodulation,[],[f181,f99]) ).
fof(f197,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),implies(X0,X2)),implies(X0,implies(not(X1),X2)))),
inference(forward_demodulation,[],[f188,f99]) ).
fof(f199,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X2),X1)),implies(not(X2),implies(X0,X1)))),
inference(forward_demodulation,[],[f190,f112]) ).
fof(f240,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
inference(superposition,[],[f117,f132]) ).
fof(f373,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK0),not(implies(implies(sK0,sK1),not(implies(sK1,sK0))))))),
inference(superposition,[],[f108,f146]) ).
fof(f383,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(not(X2),X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(not(X2),X1)) ),
inference(resolution,[],[f162,f110]) ).
fof(f395,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(not(X0)),implies(X2,X1)),implies(X2,implies(X0,X1)))),
inference(superposition,[],[f197,f132]) ).
fof(f398,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X2,X1)),implies(X2,implies(X0,X1)))),
inference(forward_demodulation,[],[f395,f132]) ).
fof(f403,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X2)))
| is_a_theorem(implies(not(X1),implies(X0,X2))) ),
inference(resolution,[],[f199,f110]) ).
fof(f1129,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X1,implies(X0,X2))) ),
inference(resolution,[],[f398,f110]) ).
fof(f1510,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(implies(X1,X0),not(X1)))),
inference(resolution,[],[f403,f118]) ).
fof(f3434,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(implies(X0,X1),not(X0)),X2))
| is_a_theorem(implies(not(X1),X2)) ),
inference(resolution,[],[f1510,f383]) ).
fof(f34969,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X1,not(implies(X1,X0))))),
inference(resolution,[],[f3434,f240]) ).
fof(f35160,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X1),not(implies(X0,X1))))),
inference(resolution,[],[f34969,f1129]) ).
fof(f36921,plain,
! [X0,X1] : is_a_theorem(implies(X1,implies(X0,not(implies(X1,not(X0)))))),
inference(superposition,[],[f35160,f132]) ).
fof(f37818,plain,
$false,
inference(resolution,[],[f36921,f373]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL495+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Sun Sep 27 15:51:04 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.32 Running first-order model finding
% 0.04/0.32 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
% 4.69/1.05 % (2543405)Will run a generic schedule for satisfiability detection.
% 4.69/1.05 % (2543411)% WARNING: option uhcvi not known.
% 4.69/1.05 % (2543410)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3030149929_2999 on theBenchmark for (2999ds/0Mi)
% 4.69/1.05 % (2543412)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4055576165:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.69/1.05 % (2543411)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1240411709:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.69/1.05 % (2543413)dis+10_1_sil=32000:sp=arity:random_seed=1681005816:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.69/1.05 % (2543414)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=309661058:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.69/1.05 % (2543415)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=424794874:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.69/1.05 % (2543416)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1947630222:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.69/1.05 % TRYING [1]
% 4.69/1.05 % TRYING [2]
% 4.69/1.05 % TRYING [3]
% 4.69/1.05 % TRYING [4]
% 4.69/1.05 % (2543413)Instruction limit reached!
% 4.69/1.05 % (2543413)------------------------------
% 4.69/1.05 % (2543413)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.69/1.05 % (2543413)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.69/1.05 % (2543413)CaDiCaL version: 2.1.3
% 4.69/1.05 % (2543413)Termination reason: Instruction limit
% 4.69/1.05 % (2543413)Termination phase: Saturation
% 4.69/1.05 % (2543413)Time elapsed: 0.038 s
% 4.69/1.05 % (2543413)Peak memory usage: 13 MB
% 4.69/1.05 % (2543413)Instructions burned: 103 (million)
% 4.69/1.05 % (2543414)Instruction limit reached!
% 4.69/1.05 % (2543414)------------------------------
% 4.69/1.05 % (2543414)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.69/1.05 % (2543414)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.69/1.05 % (2543414)CaDiCaL version: 2.1.3
% 4.69/1.05 % (2543414)Termination reason: Instruction limit
% 4.69/1.05 % (2543414)Termination phase: Saturation
% 4.69/1.05 % (2543414)Time elapsed: 0.043 s
% 4.69/1.05 % (2543414)Peak memory usage: 13 MB
% 4.69/1.05 % (2543414)Instructions burned: 116 (million)
% 4.69/1.05 % (2543415)Instruction limit reached!
% 4.69/1.05 % (2543415)------------------------------
% 4.69/1.05 % (2543415)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.69/1.05 % (2543415)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.69/1.05 % (2543415)CaDiCaL version: 2.1.3
% 4.69/1.05 % (2543415)Termination reason: Instruction limit
% 4.69/1.05 % (2543415)Termination phase: Saturation
% 4.69/1.05 % (2543415)Time elapsed: 0.048 s
% 4.69/1.05 % (2543415)Peak memory usage: 14 MB
% 4.69/1.05 % (2543415)Instructions burned: 132 (million)
% 4.69/1.05 % (2543424)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3376102707:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.69/1.05 % TRYING [1]
% 4.69/1.05 % TRYING [2]
% 4.69/1.05 % TRYING [3]
% 4.69/1.05 % (2543425)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2844127652:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 4.69/1.05 % (2543426)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=2736033453:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 4.69/1.05 % TRYING [4]
% 4.69/1.05 % (2543416)Instruction limit reached!
% 4.69/1.05 % (2543416)------------------------------
% 4.69/1.05 % (2543416)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.69/1.05 % (2543416)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.69/1.05 % (2543416)CaDiCaL version: 2.1.3
% 4.69/1.05 % (2543416)Termination reason: Instruction limit
% 4.69/1.05 % (2543416)Termination phase: Saturation
% 4.69/1.05 % (2543416)Time elapsed: 0.063 s
% 4.69/1.05 % (2543416)Peak memory usage: 14 MB
% 4.69/1.05 % (2543416)Instructions burned: 161 (million)
% 4.69/1.05 % (2543430)ott-21_1_sil=16000:fs=off:random_seed=3866403621:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 4.69/1.05 % (2543425)Instruction limit reached!
% 4.69/1.05 % (2543425)------------------------------
% 4.69/1.05 % (2543425)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.69/1.05 % (2543425)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.69/1.05 % (2543425)CaDiCaL version: 2.1.3
% 4.69/1.05 % (2543425)Termination reason: Instruction limit
% 4.69/1.05 % (2543425)Termination phase: Saturation
% 4.69/1.05 % (2543425)Time elapsed: 0.048 s
% 4.69/1.05 % (2543425)Peak memory usage: 14 MB
% 4.69/1.05 % (2543425)Instructions burned: 132 (million)
% 4.69/1.05 % TRYING [5]
% 4.69/1.05 % (2543432)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=547408962:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 4.69/1.05 % (2543430)Instruction limit reached!
% 4.69/1.05 % (2543430)------------------------------
% 4.69/1.05 % (2543430)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.69/1.05 % (2543430)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.69/1.05 % (2543430)CaDiCaL version: 2.1.3
% 4.69/1.05 % (2543430)Termination reason: Instruction limit
% 4.69/1.05 % (2543430)Termination phase: Saturation
% 4.69/1.05 % (2543430)Time elapsed: 0.054 s
% 4.69/1.05 % (2543430)Peak memory usage: 13 MB
% 4.69/1.05 % (2543430)Instructions burned: 181 (million)
% 4.69/1.05 % (2543434)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4120243744:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 4.69/1.05 % TRYING [1]
% 4.69/1.05 % TRYING [2]
% 4.69/1.05 % TRYING [3]
% 4.69/1.05 % TRYING [4]
% 4.69/1.05 % TRYING [5]
% 4.69/1.05 % (2543432)Instruction limit reached!
% 4.69/1.05 % (2543432)------------------------------
% 4.69/1.05 % (2543432)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.69/1.05 % (2543432)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.69/1.05 % (2543432)CaDiCaL version: 2.1.3
% 4.69/1.05 % (2543432)Termination reason: Instruction limit
% 4.69/1.05 % (2543432)Termination phase: Saturation
% 4.69/1.05 % (2543432)Time elapsed: 0.165 s
% 4.69/1.05 % (2543432)Peak memory usage: 14 MB
% 4.69/1.05 % (2543432)Instructions burned: 477 (million)
% 4.69/1.05 % (2543424)Instruction limit reached!
% 4.69/1.05 % (2543424)------------------------------
% 4.69/1.05 % (2543424)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.69/1.05 % (2543424)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.69/1.05 % (2543424)CaDiCaL version: 2.1.3
% 4.69/1.05 % (2543424)Termination reason: Instruction limit
% 4.69/1.05 % (2543424)Termination phase: Finite model building SAT solving
% 4.69/1.05 % (2543424)Time elapsed: 0.230 s
% 4.69/1.05 % (2543424)Peak memory usage: 18 MB
% 4.69/1.05 % (2543424)Instructions burned: 714 (million)
% 4.69/1.05 % (2543436)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2538248808:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 4.69/1.05 % (2543437)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1868067002:i=889:ins=1_2996 on theBenchmark for (2996ds/889Mi)
% 4.69/1.05 % (2543426)Instruction limit reached!
% 4.69/1.05 % (2543426)------------------------------
% 4.69/1.05 % (2543426)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.69/1.05 % (2543426)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.69/1.05 % (2543426)CaDiCaL version: 2.1.3
% 4.69/1.05 % (2543426)Termination reason: Instruction limit
% 4.69/1.05 % (2543426)Termination phase: Saturation
% 4.69/1.05 % (2543426)Time elapsed: 0.244 s
% 4.69/1.05 % (2543426)Peak memory usage: 20 MB
% 4.69/1.05 % (2543426)Instructions burned: 685 (million)
% 4.69/1.05 % (2543440)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=2728195732:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2996 on theBenchmark for (2996ds/692Mi)
% 4.69/1.05 % TRYING [14]
% 4.69/1.05 % TRYING [5]
% 4.69/1.05 % (2543434)Instruction limit reached!
% 4.69/1.05 % (2543434)------------------------------
% 4.69/1.05 % (2543434)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.69/1.05 % (2543434)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.69/1.05 % (2543434)CaDiCaL version: 2.1.3
% 4.69/1.05 % (2543434)Termination reason: Instruction limit
% 4.69/1.05 % (2543434)Termination phase: Finite model building constraint generation
% 4.69/1.05 % (2543434)Time elapsed: 0.213 s
% 4.69/1.05 % (2543434)Peak memory usage: 18 MB
% 4.69/1.05 % (2543434)Instructions burned: 869 (million)
% 4.69/1.05 % (2543442)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3493880240:i=879:kws=inv_precedence:fsr=off_2996 on theBenchmark for (2996ds/879Mi)
% 4.69/1.05 % (2543437)Instruction limit reached!
% 4.69/1.05 % (2543437)------------------------------
% 4.69/1.05 % (2543437)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.69/1.05 % (2543437)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.69/1.05 % (2543437)CaDiCaL version: 2.1.3
% 4.69/1.05 % (2543437)Termination reason: Instruction limit
% 4.69/1.05 % (2543437)Termination phase: Finite model building constraint generation
% 4.69/1.05 % (2543437)Time elapsed: 0.172 s
% 4.69/1.05 % (2543437)Peak memory usage: 67 MB
% 4.69/1.05 % (2543437)Instructions burned: 894 (million)
% 4.69/1.05 % (2543444)fmb+10_1_sil=64000:random_seed=3161478146:i=22061:nm=2:gsp=on_2994 on theBenchmark for (2994ds/22061Mi)
% 4.69/1.05 % TRYING [1]
% 4.69/1.05 % TRYING [2]
% 4.69/1.05 % TRYING [3]
% 4.69/1.05 % TRYING [4]
% 4.69/1.05 % TRYING [5]
% 4.69/1.05 % (2543440)Instruction limit reached!
% 4.69/1.05 % (2543440)------------------------------
% 4.69/1.05 % (2543440)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.69/1.05 % (2543440)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.69/1.05 % (2543440)CaDiCaL version: 2.1.3
% 4.69/1.05 % (2543440)Termination reason: Instruction limit
% 4.69/1.05 % (2543440)Termination phase: Saturation
% 4.69/1.05 % (2543440)Time elapsed: 0.240 s
% 4.69/1.05 % (2543440)Peak memory usage: 20 MB
% 4.69/1.05 % (2543440)Instructions burned: 692 (million)
% 4.69/1.05 % (2543446)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=273218252:i=9515:nm=5_2994 on theBenchmark for (2994ds/9515Mi)
% 4.69/1.05 % TRYING [20]
% 4.69/1.05 % (2543442)Instruction limit reached!
% 4.69/1.05 % (2543442)------------------------------
% 4.69/1.05 % (2543442)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.69/1.05 % (2543442)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.69/1.05 % (2543442)CaDiCaL version: 2.1.3
% 4.69/1.05 % (2543442)Termination reason: Instruction limit
% 4.69/1.05 % (2543442)Termination phase: Saturation
% 4.69/1.05 % (2543442)Time elapsed: 0.274 s
% 4.69/1.05 % (2543442)Peak memory usage: 24 MB
% 4.69/1.05 % (2543442)Instructions burned: 885 (million)
% 4.69/1.05 % (2543448)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1837690556:fmbsr=1.7:i=920_2993 on theBenchmark for (2993ds/920Mi)
% 4.69/1.05 % TRYING [8]
% 4.69/1.05 % (2543436) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2543405-2543436"...
% 4.69/1.05 % (2543436)...printing done.
% 4.69/1.05 % (2543436)Refutation found. Thanks to Tanya!
% 4.69/1.05 % SZS status Theorem for theBenchmark
% 4.69/1.05 % SZS output start Proof for theBenchmark
% See solution above
% 4.69/1.05 % (2543436)------------------------------
% 4.69/1.05 % (2543436)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.69/1.05 % (2543436)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.69/1.05 % (2543436)CaDiCaL version: 2.1.3
% 4.69/1.05 % (2543436)Termination reason: Refutation
% 4.69/1.05 % (2543436)Time elapsed: 0.394 s
% 4.69/1.05 % (2543436)Peak memory usage: 21 MB
% 4.69/1.05 % (2543436)Instructions burned: 1157 (million)
% 4.69/1.05 % (2543405)Success in time 0.725 s
% 4.69/1.05 % Vampire exiting
%------------------------------------------------------------------------------