%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL489+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 : n008.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:47 AM UTC 2026
% Result : Theorem 5.04s 1.17s
% Output : Refutation 5.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 18
% Syntax : Number of formulae : 94 ( 52 unt; 0 def)
% Number of atoms : 148 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 95 ( 41 ~; 36 |; 2 &)
% ( 5 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 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 : 165 ( 163 !; 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(f9,axiom,
( and_3
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_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(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(f45,conjecture,
and_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_3) ).
fof(f46,negated_conjecture,
~ and_3,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ and_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(X0,implies(X1,and(X0,X1))))
=> and_3 ),
inference(unused_predicate_definition_removal,[],[f9]) ).
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,
( and_3
| ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(X1,and(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(f70,plain,
( and_3
| ~ is_a_theorem(implies(sK0,implies(sK1,and(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,
( and_3
| ~ is_a_theorem(implies(sK0,implies(sK1,and(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(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(f97,plain,
~ and_3,
inference(cnf_transformation,[],[f47]) ).
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(sK0,implies(sK1,and(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(f145,plain,
~ is_a_theorem(implies(sK0,implies(sK1,not(implies(sK0,not(sK1)))))),
inference(superposition,[],[f108,f111]) ).
fof(f150,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(f159,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X2,X0),implies(not(X2),X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f150,f112]) ).
fof(f160,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,[],[f159,f112]) ).
fof(f171,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(not(X0),or(X2,X1)),or(X2,implies(X0,X1)))),
inference(superposition,[],[f104,f99]) ).
fof(f173,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,or(not(X0),X2)),implies(X0,or(X1,X2)))),
inference(superposition,[],[f104,f99]) ).
fof(f176,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,or(not(X0),X2)),implies(X0,implies(not(X1),X2)))),
inference(forward_demodulation,[],[f173,f112]) ).
fof(f178,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(not(X0),or(X2,X1)),implies(not(X2),implies(X0,X1)))),
inference(forward_demodulation,[],[f171,f112]) ).
fof(f185,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),or(not(X0),X2)),implies(X0,implies(not(X1),X2)))),
inference(forward_demodulation,[],[f176,f112]) ).
fof(f187,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,or(X2,X1)),implies(not(X2),implies(X0,X1)))),
inference(forward_demodulation,[],[f178,f99]) ).
fof(f194,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),implies(X0,X2)),implies(X0,implies(not(X1),X2)))),
inference(forward_demodulation,[],[f185,f99]) ).
fof(f196,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X2),X1)),implies(not(X2),implies(X0,X1)))),
inference(forward_demodulation,[],[f187,f112]) ).
fof(f249,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
inference(superposition,[],[f117,f132]) ).
fof(f389,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,[],[f160,f110]) ).
fof(f409,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(not(X0)),implies(X2,X1)),implies(X2,implies(X0,X1)))),
inference(superposition,[],[f194,f132]) ).
fof(f412,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X2,X1)),implies(X2,implies(X0,X1)))),
inference(forward_demodulation,[],[f409,f132]) ).
fof(f419,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X2)))
| is_a_theorem(implies(not(X1),implies(X0,X2))) ),
inference(resolution,[],[f196,f110]) ).
fof(f1151,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X1,implies(X0,X2))) ),
inference(resolution,[],[f412,f110]) ).
fof(f1527,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(implies(X1,X0),not(X1)))),
inference(resolution,[],[f419,f118]) ).
fof(f3525,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(implies(X0,X1),not(X0)),X2))
| is_a_theorem(implies(not(X1),X2)) ),
inference(resolution,[],[f1527,f389]) ).
fof(f35290,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X1,not(implies(X1,X0))))),
inference(resolution,[],[f3525,f249]) ).
fof(f35483,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X1),not(implies(X0,X1))))),
inference(resolution,[],[f35290,f1151]) ).
fof(f37257,plain,
! [X0,X1] : is_a_theorem(implies(X1,implies(X0,not(implies(X1,not(X0)))))),
inference(superposition,[],[f35483,f132]) ).
fof(f38189,plain,
$false,
inference(resolution,[],[f37257,f145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL489+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 % Computer : n008.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 15:51:24 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/0.42 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
% 5.04/1.17 % (1410604)Will run a generic schedule for satisfiability detection.
% 5.04/1.17 % (1410619)dis+10_1_sil=32000:sp=arity:random_seed=3022284343:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.04/1.17 % (1410617)% WARNING: option uhcvi not known.
% 5.04/1.17 % (1410616)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3550172042_2999 on theBenchmark for (2999ds/0Mi)
% 5.04/1.17 % (1410617)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3306903084:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.04/1.17 % (1410618)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2462334019:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.04/1.17 % (1410620)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4277635795:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.04/1.17 % (1410622)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2279806109:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.04/1.17 % (1410621)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3258852264:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.04/1.17 % TRYING [1]
% 5.04/1.17 % TRYING [2]
% 5.04/1.17 % TRYING [3]
% 5.04/1.17 % TRYING [4]
% 5.04/1.17 % (1410619)Instruction limit reached!
% 5.04/1.17 % (1410619)------------------------------
% 5.04/1.17 % (1410619)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.04/1.17 % (1410619)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.04/1.17 % (1410619)CaDiCaL version: 2.1.3
% 5.04/1.17 % (1410619)Termination reason: Instruction limit
% 5.04/1.17 % (1410619)Termination phase: Saturation
% 5.04/1.17 % (1410619)Time elapsed: 0.037 s
% 5.04/1.17 % (1410619)Peak memory usage: 13 MB
% 5.04/1.17 % (1410619)Instructions burned: 104 (million)
% 5.04/1.17 % (1410651)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4238313394:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 5.04/1.17 % TRYING [1]
% 5.04/1.17 % TRYING [2]
% 5.04/1.17 % TRYING [3]
% 5.04/1.17 % TRYING [4]
% 5.04/1.17 % (1410620)Instruction limit reached!
% 5.04/1.17 % (1410620)------------------------------
% 5.04/1.17 % (1410620)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.04/1.17 % (1410620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.04/1.17 % (1410620)CaDiCaL version: 2.1.3
% 5.04/1.17 % (1410620)Termination reason: Instruction limit
% 5.04/1.17 % (1410620)Termination phase: Saturation
% 5.04/1.17 % (1410620)Time elapsed: 0.078 s
% 5.04/1.17 % (1410620)Peak memory usage: 13 MB
% 5.04/1.17 % (1410620)Instructions burned: 117 (million)
% 5.04/1.17 % (1410621)Instruction limit reached!
% 5.04/1.17 % (1410621)------------------------------
% 5.04/1.17 % (1410621)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.04/1.17 % (1410621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.04/1.17 % (1410621)CaDiCaL version: 2.1.3
% 5.04/1.17 % (1410621)Termination reason: Instruction limit
% 5.04/1.17 % (1410621)Termination phase: Saturation
% 5.04/1.17 % (1410621)Time elapsed: 0.086 s
% 5.04/1.17 % (1410621)Peak memory usage: 14 MB
% 5.04/1.17 % (1410621)Instructions burned: 132 (million)
% 5.04/1.17 % (1410670)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3985928183:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 5.04/1.17 % (1410674)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=2458490390:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 5.04/1.17 % (1410622)Instruction limit reached!
% 5.04/1.17 % (1410622)------------------------------
% 5.04/1.17 % (1410622)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.04/1.17 % (1410622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.04/1.17 % (1410622)CaDiCaL version: 2.1.3
% 5.04/1.17 % (1410622)Termination reason: Instruction limit
% 5.04/1.17 % (1410622)Termination phase: Saturation
% 5.04/1.17 % (1410622)Time elapsed: 0.116 s
% 5.04/1.17 % (1410622)Peak memory usage: 14 MB
% 5.04/1.17 % (1410622)Instructions burned: 160 (million)
% 5.04/1.17 % (1410685)ott-21_1_sil=16000:fs=off:random_seed=1821114820:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 5.04/1.17 % TRYING [5]
% 5.04/1.17 % (1410670)Instruction limit reached!
% 5.04/1.17 % (1410670)------------------------------
% 5.04/1.17 % (1410670)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.04/1.17 % (1410670)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.04/1.17 % (1410670)CaDiCaL version: 2.1.3
% 5.04/1.17 % (1410670)Termination reason: Instruction limit
% 5.04/1.17 % (1410670)Termination phase: Saturation
% 5.04/1.17 % (1410670)Time elapsed: 0.088 s
% 5.04/1.17 % (1410670)Peak memory usage: 14 MB
% 5.04/1.17 % (1410670)Instructions burned: 131 (million)
% 5.04/1.17 % TRYING [5]
% 5.04/1.17 % (1410700)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=966851270:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 5.04/1.17 % (1410685)Instruction limit reached!
% 5.04/1.17 % (1410685)------------------------------
% 5.04/1.17 % (1410685)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.04/1.17 % (1410685)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.04/1.17 % (1410685)CaDiCaL version: 2.1.3
% 5.04/1.17 % (1410685)Termination reason: Instruction limit
% 5.04/1.17 % (1410685)Termination phase: Saturation
% 5.04/1.17 % (1410685)Time elapsed: 0.115 s
% 5.04/1.17 % (1410685)Peak memory usage: 13 MB
% 5.04/1.17 % (1410685)Instructions burned: 181 (million)
% 5.04/1.17 % (1410710)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1755214280:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 5.04/1.17 % (1410651)Instruction limit reached!
% 5.04/1.17 % (1410651)------------------------------
% 5.04/1.17 % (1410651)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.04/1.17 % (1410651)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.04/1.17 % (1410651)CaDiCaL version: 2.1.3
% 5.04/1.17 % (1410651)Termination reason: Instruction limit
% 5.04/1.17 % (1410651)Termination phase: Finite model building SAT solving
% 5.04/1.17 % (1410651)Time elapsed: 0.236 s
% 5.04/1.17 % (1410651)Peak memory usage: 19 MB
% 5.04/1.17 % (1410651)Instructions burned: 715 (million)
% 5.04/1.17 % TRYING [1]
% 5.04/1.17 % TRYING [2]
% 5.04/1.17 % (1410715)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3806555955:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 5.04/1.17 % TRYING [3]
% 5.04/1.17 % TRYING [4]
% 5.04/1.17 % (1410700)Instruction limit reached!
% 5.04/1.17 % (1410700)------------------------------
% 5.04/1.17 % (1410700)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.04/1.17 % (1410700)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.04/1.17 % (1410700)CaDiCaL version: 2.1.3
% 5.04/1.17 % (1410700)Termination reason: Instruction limit
% 5.04/1.17 % (1410700)Termination phase: Saturation
% 5.04/1.17 % (1410700)Time elapsed: 0.314 s
% 5.04/1.17 % (1410700)Peak memory usage: 14 MB
% 5.04/1.17 % (1410700)Instructions burned: 478 (million)
% 5.04/1.17 % (1410725)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2113034801:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 5.04/1.17 % (1410674)Instruction limit reached!
% 5.04/1.17 % (1410674)------------------------------
% 5.04/1.17 % (1410674)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.04/1.17 % (1410674)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.04/1.17 % (1410674)CaDiCaL version: 2.1.3
% 5.04/1.17 % (1410674)Termination reason: Instruction limit
% 5.04/1.17 % (1410674)Termination phase: Saturation
% 5.04/1.17 % (1410674)Time elapsed: 0.455 s
% 5.04/1.17 % (1410674)Peak memory usage: 20 MB
% 5.04/1.17 % (1410674)Instructions burned: 684 (million)
% 5.04/1.17 % (1410740)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=881486885:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 5.04/1.17 % TRYING [5]
% 5.04/1.17 % TRYING [14]
% 5.04/1.17 % (1410710)Instruction limit reached!
% 5.04/1.17 % (1410710)------------------------------
% 5.04/1.17 % (1410710)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.04/1.17 % (1410710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.04/1.17 % (1410710)CaDiCaL version: 2.1.3
% 5.04/1.17 % (1410710)Termination reason: Instruction limit
% 5.04/1.17 % (1410710)Termination phase: Finite model building constraint generation
% 5.04/1.17 % (1410710)Time elapsed: 0.390 s
% 5.04/1.17 % (1410710)Peak memory usage: 20 MB
% 5.04/1.17 % (1410710)Instructions burned: 866 (million)
% 5.04/1.17 % (1410749)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=25139896:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 5.04/1.17 % (1410715) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1410604-1410715"...
% 5.04/1.17 % (1410715)...printing done.
% 5.04/1.17 % (1410715)Refutation found. Thanks to Tanya!
% 5.04/1.17 % SZS status Theorem for theBenchmark
% 5.04/1.17 % SZS output start Proof for theBenchmark
% See solution above
% 5.04/1.17 % (1410715)------------------------------
% 5.04/1.17 % (1410715)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.04/1.17 % (1410715)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.04/1.17 % (1410715)CaDiCaL version: 2.1.3
% 5.04/1.17 % (1410715)Termination reason: Refutation
% 5.04/1.17 % (1410715)Time elapsed: 0.410 s
% 5.04/1.17 % (1410715)Peak memory usage: 21 MB
% 5.04/1.17 % (1410715)Instructions burned: 1166 (million)
% 5.04/1.17 % (1410604)Success in time 0.74 s
% 5.04/1.17 % Vampire exiting
%------------------------------------------------------------------------------