%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL488+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 : 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 0.22s 0.54s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 32
% Syntax : Number of formulae : 125 ( 44 unt; 16 def)
% Number of atoms : 261 ( 23 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 246 ( 110 ~; 104 |; 2 &)
% ( 20 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 27 ( 25 usr; 25 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 101 ( 0 sgn 99 !; 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(f8,axiom,
( and_2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_2) ).
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(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(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(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(f45,conjecture,
and_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_2) ).
fof(f46,negated_conjecture,
~ and_2,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ and_2,
inference(flattening,[],[f46]) ).
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(and(X0,X1),X1))
=> and_2 ),
inference(unused_predicate_definition_removal,[],[f8]) ).
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_2
| ? [X0,X1] : ~ is_a_theorem(implies(and(X0,X1),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(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_2
| ~ is_a_theorem(implies(and(sK0,sK1),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_2
| ~ is_a_theorem(implies(and(sK0,sK1),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(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(f89,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f90,plain,
r3,
inference(cnf_transformation,[],[f38]) ).
fof(f94,plain,
op_or,
inference(cnf_transformation,[],[f42]) ).
fof(f95,plain,
op_implies_and,
inference(cnf_transformation,[],[f43]) ).
fof(f97,plain,
~ and_2,
inference(cnf_transformation,[],[f47]) ).
fof(f107,definition,
( spl2_3
<=> op_implies_or ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f111,definition,
( spl2_4
<=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
fof(f112,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f111]) ).
fof(f113,plain,
( ~ spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f82,f111,f107]) ).
fof(f115,definition,
( spl2_5
<=> op_implies_and ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
fof(f119,definition,
( spl2_6
<=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).
fof(f120,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ spl2_6 ),
inference(avatar_component_clause,[],[f119]) ).
fof(f121,plain,
( ~ spl2_5
| spl2_6 ),
inference(avatar_split_clause,[],[f81,f119,f115]) ).
fof(f123,definition,
( spl2_7
<=> op_and ),
introduced(definition,[new_symbols(definition,[spl2_7])],[avatar_definition]) ).
fof(f127,definition,
( spl2_8
<=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
introduced(definition,[new_symbols(definition,[spl2_8])],[avatar_definition]) ).
fof(f128,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ spl2_8 ),
inference(avatar_component_clause,[],[f127]) ).
fof(f129,plain,
( ~ spl2_7
| spl2_8 ),
inference(avatar_split_clause,[],[f80,f127,f123]) ).
fof(f131,definition,
( spl2_9
<=> op_or ),
introduced(definition,[new_symbols(definition,[spl2_9])],[avatar_definition]) ).
fof(f135,definition,
( spl2_10
<=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
introduced(definition,[new_symbols(definition,[spl2_10])],[avatar_definition]) ).
fof(f136,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ spl2_10 ),
inference(avatar_component_clause,[],[f135]) ).
fof(f137,plain,
( ~ spl2_9
| spl2_10 ),
inference(avatar_split_clause,[],[f79,f135,f131]) ).
fof(f155,definition,
( spl2_15
<=> r3 ),
introduced(definition,[new_symbols(definition,[spl2_15])],[avatar_definition]) ).
fof(f159,definition,
( spl2_16
<=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
introduced(definition,[new_symbols(definition,[spl2_16])],[avatar_definition]) ).
fof(f160,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ spl2_16 ),
inference(avatar_component_clause,[],[f159]) ).
fof(f161,plain,
( ~ spl2_15
| spl2_16 ),
inference(avatar_split_clause,[],[f76,f159,f155]) ).
fof(f163,definition,
( spl2_17
<=> r2 ),
introduced(definition,[new_symbols(definition,[spl2_17])],[avatar_definition]) ).
fof(f167,definition,
( spl2_18
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
introduced(definition,[new_symbols(definition,[spl2_18])],[avatar_definition]) ).
fof(f168,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ spl2_18 ),
inference(avatar_component_clause,[],[f167]) ).
fof(f169,plain,
( ~ spl2_17
| spl2_18 ),
inference(avatar_split_clause,[],[f75,f167,f163]) ).
fof(f179,definition,
( spl2_21
<=> is_a_theorem(implies(and(sK0,sK1),sK1)) ),
introduced(definition,[new_symbols(definition,[spl2_21])],[avatar_definition]) ).
fof(f181,plain,
( ~ is_a_theorem(implies(and(sK0,sK1),sK1))
| spl2_21 ),
inference(avatar_component_clause,[],[f179]) ).
fof(f183,definition,
( spl2_22
<=> and_2 ),
introduced(definition,[new_symbols(definition,[spl2_22])],[avatar_definition]) ).
fof(f186,plain,
( ~ spl2_21
| spl2_22 ),
inference(avatar_split_clause,[],[f73,f183,f179]) ).
fof(f196,definition,
( spl2_25
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[spl2_25])],[avatar_definition]) ).
fof(f200,definition,
( spl2_26
<=> ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ) ),
introduced(definition,[new_symbols(definition,[spl2_26])],[avatar_definition]) ).
fof(f201,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) )
| ~ spl2_26 ),
inference(avatar_component_clause,[],[f200]) ).
fof(f202,plain,
( ~ spl2_25
| spl2_26 ),
inference(avatar_split_clause,[],[f71,f200,f196]) ).
fof(f203,plain,
~ spl2_22,
inference(avatar_split_clause,[],[f97,f183]) ).
fof(f204,plain,
spl2_3,
inference(avatar_split_clause,[],[f84,f107]) ).
fof(f205,plain,
spl2_7,
inference(avatar_split_clause,[],[f85,f123]) ).
fof(f207,plain,
spl2_25,
inference(avatar_split_clause,[],[f87,f196]) ).
fof(f209,plain,
spl2_17,
inference(avatar_split_clause,[],[f89,f163]) ).
fof(f210,plain,
spl2_15,
inference(avatar_split_clause,[],[f90,f155]) ).
fof(f214,plain,
spl2_9,
inference(avatar_split_clause,[],[f94,f131]) ).
fof(f215,plain,
spl2_5,
inference(avatar_split_clause,[],[f95,f115]) ).
fof(f216,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,implies(X0,X1)))
| ~ spl2_4
| ~ spl2_18 ),
inference(superposition,[],[f168,f112]) ).
fof(f223,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(X1,X0)) )
| ~ spl2_16
| ~ spl2_26 ),
inference(resolution,[],[f201,f160]) ).
fof(f227,plain,
( ! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1)))
| ~ spl2_4
| ~ spl2_8 ),
inference(forward_demodulation,[],[f128,f112]) ).
fof(f236,plain,
( ! [X0,X1] : or(X0,X1) = implies(not(X0),X1)
| ~ spl2_6
| ~ spl2_10 ),
inference(forward_demodulation,[],[f136,f120]) ).
fof(f238,plain,
( ! [X2,X0,X1] : or(implies(X0,not(X1)),X2) = implies(and(X0,X1),X2)
| ~ spl2_4
| ~ spl2_6
| ~ spl2_8
| ~ spl2_10 ),
inference(superposition,[],[f236,f227]) ).
fof(f242,plain,
( ! [X0,X1] : is_a_theorem(or(X0,implies(X1,not(X0))))
| ~ spl2_4
| ~ spl2_6
| ~ spl2_10
| ~ spl2_18 ),
inference(superposition,[],[f216,f236]) ).
fof(f276,plain,
( ! [X0,X1] : is_a_theorem(or(implies(X0,not(X1)),X1))
| ~ spl2_4
| ~ spl2_6
| ~ spl2_10
| ~ spl2_16
| ~ spl2_18
| ~ spl2_26 ),
inference(resolution,[],[f223,f242]) ).
fof(f439,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1))
| ~ spl2_4
| ~ spl2_6
| ~ spl2_8
| ~ spl2_10
| ~ spl2_16
| ~ spl2_18
| ~ spl2_26 ),
inference(superposition,[],[f276,f238]) ).
fof(f488,plain,
( $false
| ~ spl2_4
| ~ spl2_6
| ~ spl2_8
| ~ spl2_10
| ~ spl2_16
| ~ spl2_18
| spl2_21
| ~ spl2_26 ),
inference(resolution,[],[f439,f181]) ).
fof(f492,plain,
( ~ spl2_4
| ~ spl2_6
| ~ spl2_8
| ~ spl2_10
| ~ spl2_16
| ~ spl2_18
| spl2_21
| ~ spl2_26 ),
inference(avatar_contradiction_clause,[],[f488]) ).
cnf(s2,plain,
( ~ spl2_3
| spl2_4 ),
inference(sat_conversion,[],[f113]) ).
cnf(s3,plain,
( ~ spl2_5
| spl2_6 ),
inference(sat_conversion,[],[f121]) ).
cnf(s4,plain,
( ~ spl2_7
| spl2_8 ),
inference(sat_conversion,[],[f129]) ).
cnf(s5,plain,
( ~ spl2_9
| spl2_10 ),
inference(sat_conversion,[],[f137]) ).
cnf(s8,plain,
( ~ spl2_15
| spl2_16 ),
inference(sat_conversion,[],[f161]) ).
cnf(s9,plain,
( ~ spl2_17
| spl2_18 ),
inference(sat_conversion,[],[f169]) ).
cnf(s11,plain,
( ~ spl2_21
| spl2_22 ),
inference(sat_conversion,[],[f186]) ).
cnf(s13,plain,
( ~ spl2_25
| spl2_26 ),
inference(sat_conversion,[],[f202]) ).
cnf(s14,plain,
~ spl2_22,
inference(sat_conversion,[],[f203]) ).
cnf(s15,plain,
spl2_3,
inference(sat_conversion,[],[f204]) ).
cnf(s16,plain,
spl2_7,
inference(sat_conversion,[],[f205]) ).
cnf(s18,plain,
spl2_25,
inference(sat_conversion,[],[f207]) ).
cnf(s20,plain,
spl2_17,
inference(sat_conversion,[],[f209]) ).
cnf(s21,plain,
spl2_15,
inference(sat_conversion,[],[f210]) ).
cnf(s25,plain,
spl2_9,
inference(sat_conversion,[],[f214]) ).
cnf(s26,plain,
spl2_5,
inference(sat_conversion,[],[f215]) ).
cnf(s29,plain,
( ~ spl2_4
| ~ spl2_6
| ~ spl2_8
| ~ spl2_10
| ~ spl2_16
| ~ spl2_18
| spl2_21
| ~ spl2_26 ),
inference(sat_conversion,[],[f492]) ).
cnf(s30,plain,
spl2_26,
inference(rat,[],[s13,s18]) ).
cnf(s32,plain,
~ spl2_21,
inference(rat,[],[s11,s14]) ).
cnf(s34,plain,
spl2_18,
inference(rat,[],[s9,s20]) ).
cnf(s35,plain,
spl2_16,
inference(rat,[],[s8,s21]) ).
cnf(s38,plain,
spl2_10,
inference(rat,[],[s5,s25]) ).
cnf(s39,plain,
spl2_8,
inference(rat,[],[s4,s16]) ).
cnf(s40,plain,
spl2_6,
inference(rat,[],[s3,s26]) ).
cnf(s41,plain,
~ spl2_4,
inference(rat,[],[s29,s30,s32,s34,s35,s38,s39,s40]) ).
cnf(s42,plain,
$false,
inference(rat,[],[s2,s41,s15]) ).
fof(f493,plain,
$false,
inference(avatar_sat_refutation,[],[s42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL488+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.41 % Computer : n008.cluster.edu
% 0.14/0.41 % Model : x86_64 x86_64
% 0.14/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41 % Memory : 8046.5625MB
% 0.14/0.41 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.42 % WCLimit : 300
% 0.14/0.42 % DateTime : Sun Sep 27 15:51:25 UTC 2026
% 0.14/0.42 % CPUTime :
% 0.14/0.42 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.47 Running first-order model finding
% 0.14/0.47 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
% 0.22/0.54 % (1410726)Will run a generic schedule for satisfiability detection.
% 0.22/0.54 % (1410735)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3994570878:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.54 % (1410732)% WARNING: option uhcvi not known.
% 0.22/0.54 % (1410736)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=729009279:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.54 % (1410731)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2242081975_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.54 % (1410732)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3896427099:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.54 % (1410734)dis+10_1_sil=32000:sp=arity:random_seed=3925357825:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.54 % (1410733)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2130385782:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.54 % (1410738)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3441390125:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.54 % TRYING [1]
% 0.22/0.54 % TRYING [2]
% 0.22/0.54 % TRYING [3]
% 0.22/0.54 % (1410734) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1410726-1410734"...
% 0.22/0.54 % (1410734)...printing done.
% 0.22/0.54 % (1410734)Refutation found. Thanks to Tanya!
% 0.22/0.54 % SZS status Theorem for theBenchmark
% 0.22/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.54 % (1410734)------------------------------
% 0.22/0.54 % (1410734)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.54 % (1410734)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.54 % (1410734)CaDiCaL version: 2.1.3
% 0.22/0.54 % (1410734)Termination reason: Refutation
% 0.22/0.54 % (1410734)Time elapsed: 0.017 s
% 0.22/0.54 % (1410734)Peak memory usage: 12 MB
% 0.22/0.54 % (1410734)Instructions burned: 14 (million)
% 0.22/0.54 % (1410726)Success in time 0.058 s
% 0.22/0.54 % Vampire exiting
%------------------------------------------------------------------------------