%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL493+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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 1.73s 0.79s
% Output : Refutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 20
% Syntax : Number of formulae : 87 ( 41 unt; 0 def)
% Number of atoms : 145 ( 23 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 102 ( 44 ~; 39 |; 2 &)
% ( 5 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 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 : 130 ( 128 !; 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/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(f13,axiom,
( equivalence_1
<=> ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',equivalence_1) ).
fof(f23,axiom,
( r2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(f24,axiom,
( r3
<=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r3) ).
fof(f26,axiom,
( r5
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
fof(f33,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_op_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_modus_ponens) ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r3) ).
fof(f40,axiom,
r5,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r5) ).
fof(f42,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f43,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f44,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_equiv) ).
fof(f45,conjecture,
equivalence_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_equivalence_1) ).
fof(f46,negated_conjecture,
~ equivalence_1,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ equivalence_1,
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(f50,plain,
( r3
=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f24]) ).
fof(f51,plain,
( r2
=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f23]) ).
fof(f53,plain,
( ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1)))
=> equivalence_1 ),
inference(unused_predicate_definition_removal,[],[f13]) ).
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_1
| ? [X0,X1] : ~ is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))) ),
inference(ennf_transformation,[],[f53]) ).
fof(f61,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(ennf_transformation,[],[f51]) ).
fof(f62,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(ennf_transformation,[],[f50]) ).
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_1
| ~ is_a_theorem(implies(equiv(sK0,sK1),implies(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_1
| ~ is_a_theorem(implies(equiv(sK0,sK1),implies(sK0,sK1))) ),
inference(cnf_transformation,[],[f70]) ).
fof(f75,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(cnf_transformation,[],[f61]) ).
fof(f76,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(cnf_transformation,[],[f62]) ).
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(f89,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f90,plain,
r3,
inference(cnf_transformation,[],[f38]) ).
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_1,
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(f105,plain,
! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))),
inference(forward_subsumption_resolution,[],[f76,f90]) ).
fof(f106,plain,
! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))),
inference(forward_subsumption_resolution,[],[f75,f89]) ).
fof(f108,plain,
~ is_a_theorem(implies(equiv(sK0,sK1),implies(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(f113,plain,
! [X0,X1] : is_a_theorem(implies(X1,implies(X0,X1))),
inference(superposition,[],[f106,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(f122,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(X1,X0)) ),
inference(resolution,[],[f110,f105]) ).
fof(f123,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| is_a_theorem(or(X1,X0)) ),
inference(forward_demodulation,[],[f122,f112]) ).
fof(f126,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| is_a_theorem(implies(not(X1),X0)) ),
inference(forward_demodulation,[],[f123,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(f372,plain,
~ is_a_theorem(implies(not(implies(implies(sK0,sK1),not(implies(sK1,sK0)))),implies(sK0,sK1))),
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(f1387,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,not(X1)),X2))
| is_a_theorem(implies(not(X1),X2)) ),
inference(resolution,[],[f383,f113]) ).
fof(f4967,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[],[f1387,f117]) ).
fof(f5035,plain,
! [X0,X1] : is_a_theorem(implies(not(implies(X0,X1)),X0)),
inference(resolution,[],[f4967,f126]) ).
fof(f5110,plain,
$false,
inference(resolution,[],[f5035,f372]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL493+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n016.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 15:55:47 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.73/0.79 % (2808692)Will run a generic schedule for satisfiability detection.
% 1.73/0.79 % (2808701)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1050631986:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.73/0.79 % (2808698)% WARNING: option uhcvi not known.
% 1.73/0.79 % (2808700)dis+10_1_sil=32000:sp=arity:random_seed=3307594286:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.73/0.79 % (2808697)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=181738147_2999 on theBenchmark for (2999ds/0Mi)
% 1.73/0.79 % (2808698)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=875581758:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.73/0.79 % (2808699)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1766921786:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.73/0.79 % (2808703)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2948251140:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.73/0.79 % (2808702)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1635616401:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.73/0.79 % TRYING [1]
% 1.73/0.79 % TRYING [2]
% 1.73/0.79 % TRYING [3]
% 1.73/0.79 % TRYING [4]
% 1.73/0.79 % (2808701)Instruction limit reached!
% 1.73/0.79 % (2808701)------------------------------
% 1.73/0.79 % (2808701)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.79 % (2808701)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.79 % (2808701)CaDiCaL version: 2.1.3
% 1.73/0.79 % (2808701)Termination reason: Instruction limit
% 1.73/0.79 % (2808701)Termination phase: Saturation
% 1.73/0.79 % (2808701)Time elapsed: 0.043 s
% 1.73/0.79 % (2808701)Peak memory usage: 13 MB
% 1.73/0.79 % (2808701)Instructions burned: 118 (million)
% 1.73/0.79 % (2808711)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2199092690:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.73/0.79 % TRYING [1]
% 1.73/0.79 % TRYING [2]
% 1.73/0.79 % TRYING [3]
% 1.73/0.79 % TRYING [4]
% 1.73/0.79 % (2808700)Instruction limit reached!
% 1.73/0.79 % (2808700)------------------------------
% 1.73/0.79 % (2808700)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.79 % (2808700)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.79 % (2808700)CaDiCaL version: 2.1.3
% 1.73/0.79 % (2808700)Termination reason: Instruction limit
% 1.73/0.79 % (2808700)Termination phase: Saturation
% 1.73/0.79 % (2808700)Time elapsed: 0.067 s
% 1.73/0.79 % (2808700)Peak memory usage: 13 MB
% 1.73/0.79 % (2808700)Instructions burned: 103 (million)
% 1.73/0.79 % (2808702)Instruction limit reached!
% 1.73/0.79 % (2808702)------------------------------
% 1.73/0.79 % (2808702)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.79 % (2808702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.79 % (2808702)CaDiCaL version: 2.1.3
% 1.73/0.79 % (2808702)Termination reason: Instruction limit
% 1.73/0.79 % (2808702)Termination phase: Saturation
% 1.73/0.79 % (2808702)Time elapsed: 0.085 s
% 1.73/0.79 % (2808702)Peak memory usage: 14 MB
% 1.73/0.79 % (2808702)Instructions burned: 131 (million)
% 1.73/0.79 % (2808713)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=969570374:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.73/0.79 % (2808715)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=501241371:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.73/0.79 % (2808703)Instruction limit reached!
% 1.73/0.79 % (2808703)------------------------------
% 1.73/0.79 % (2808703)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.79 % (2808703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.79 % (2808703)CaDiCaL version: 2.1.3
% 1.73/0.79 % (2808703)Termination reason: Instruction limit
% 1.73/0.79 % (2808703)Termination phase: Saturation
% 1.73/0.79 % (2808703)Time elapsed: 0.112 s
% 1.73/0.79 % (2808703)Peak memory usage: 14 MB
% 1.73/0.79 % (2808703)Instructions burned: 160 (million)
% 1.73/0.79 % (2808717)ott-21_1_sil=16000:fs=off:random_seed=2492473392:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.73/0.79 % TRYING [5]
% 1.73/0.79 % (2808713)Instruction limit reached!
% 1.73/0.79 % (2808713)------------------------------
% 1.73/0.79 % (2808713)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.79 % (2808713)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.79 % (2808713)CaDiCaL version: 2.1.3
% 1.73/0.79 % (2808713)Termination reason: Instruction limit
% 1.73/0.79 % (2808713)Termination phase: Saturation
% 1.73/0.79 % (2808713)Time elapsed: 0.090 s
% 1.73/0.79 % (2808713)Peak memory usage: 14 MB
% 1.73/0.79 % (2808713)Instructions burned: 132 (million)
% 1.73/0.79 % TRYING [5]
% 1.73/0.79 % (2808719)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3813411639:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.73/0.79 % (2808717)Instruction limit reached!
% 1.73/0.79 % (2808717)------------------------------
% 1.73/0.79 % (2808717)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.79 % (2808717)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.79 % (2808717)CaDiCaL version: 2.1.3
% 1.73/0.79 % (2808717)Termination reason: Instruction limit
% 1.73/0.79 % (2808717)Termination phase: Saturation
% 1.73/0.79 % (2808717)Time elapsed: 0.099 s
% 1.73/0.79 % (2808717)Peak memory usage: 13 MB
% 1.73/0.79 % (2808717)Instructions burned: 181 (million)
% 1.73/0.79 % (2808721)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1519467250:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.73/0.79 % TRYING [1]
% 1.73/0.79 % TRYING [2]
% 1.73/0.79 % (2808711)Instruction limit reached!
% 1.73/0.79 % (2808711)------------------------------
% 1.73/0.79 % (2808711)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.79 % (2808711)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.79 % (2808711)CaDiCaL version: 2.1.3
% 1.73/0.79 % (2808711)Termination reason: Instruction limit
% 1.73/0.79 % (2808711)Termination phase: Finite model building SAT solving
% 1.73/0.79 % (2808711)Time elapsed: 0.220 s
% 1.73/0.79 % (2808711)Peak memory usage: 19 MB
% 1.73/0.79 % (2808711)Instructions burned: 716 (million)
% 1.73/0.79 % (2808723)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1451166401:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.73/0.79 % TRYING [3]
% 1.73/0.79 % TRYING [4]
% 1.73/0.79 % (2808723) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2808692-2808723"...
% 1.73/0.79 % (2808723)...printing done.
% 1.73/0.79 % (2808723)Refutation found. Thanks to Tanya!
% 1.73/0.79 % SZS status Theorem for theBenchmark
% 1.73/0.79 % SZS output start Proof for theBenchmark
% See solution above
% 1.73/0.79 % (2808723)------------------------------
% 1.73/0.79 % (2808723)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.73/0.79 % (2808723)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.73/0.79 % (2808723)CaDiCaL version: 2.1.3
% 1.73/0.79 % (2808723)Termination reason: Refutation
% 1.73/0.79 % (2808723)Time elapsed: 0.055 s
% 1.73/0.79 % (2808723)Peak memory usage: 13 MB
% 1.73/0.79 % (2808723)Instructions burned: 161 (million)
% 1.73/0.79 % (2808692)Success in time 0.367 s
% 1.73/0.79 % Vampire exiting
%------------------------------------------------------------------------------