%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL519+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 : n013.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:51 AM UTC 2026
% Result : Theorem 2.65s 0.80s
% Output : Refutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 40
% Syntax : Number of formulae : 211 ( 54 unt; 20 def)
% Number of atoms : 622 ( 33 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 780 ( 369 ~; 372 |; 2 &)
% ( 25 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 33 ( 31 usr; 31 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 207 ( 0 sgn 205 !; 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(f16,axiom,
( kn1
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',kn1) ).
fof(f17,axiom,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',kn2) ).
fof(f18,axiom,
( kn3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',kn3) ).
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(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_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_op_implies_and) ).
fof(f34,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_op_equiv) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_modus_ponens) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_kn1) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_kn2) ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_kn3) ).
fof(f40,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f41,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_and) ).
fof(f43,conjecture,
r2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r2) ).
fof(f44,negated_conjecture,
~ r2,
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f45,plain,
~ r2,
inference(flattening,[],[f44]) ).
fof(f46,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
=> r2 ),
inference(unused_predicate_definition_removal,[],[f23]) ).
fof(f47,plain,
( kn3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(unused_predicate_definition_removal,[],[f18]) ).
fof(f48,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f49,plain,
( kn1
=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f51,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f52,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f51]) ).
fof(f53,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f52]) ).
fof(f55,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(ennf_transformation,[],[f49]) ).
fof(f56,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f48]) ).
fof(f57,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(ennf_transformation,[],[f47]) ).
fof(f58,plain,
( r2
| ? [X0,X1] : ~ is_a_theorem(implies(X1,or(X0,X1))) ),
inference(ennf_transformation,[],[f46]) ).
fof(f59,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f60,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(ennf_transformation,[],[f28]) ).
fof(f61,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f62,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f63,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f64,plain,
! [X0,X1] :
( ~ modus_ponens
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f53]) ).
fof(f66,plain,
! [X0] :
( ~ kn1
| is_a_theorem(implies(X0,and(X0,X0))) ),
inference(cnf_transformation,[],[f55]) ).
fof(f67,plain,
! [X0,X1] :
( ~ kn2
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(cnf_transformation,[],[f56]) ).
fof(f68,plain,
! [X2,X0,X1] :
( ~ kn3
| is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(cnf_transformation,[],[f57]) ).
fof(f69,plain,
( ~ is_a_theorem(implies(sK1,or(sK0,sK1)))
| r2 ),
inference(cnf_transformation,[],[f58]) ).
fof(f70,plain,
! [X0,X1] :
( ~ op_or
| or(X0,X1) = not(and(not(X0),not(X1))) ),
inference(cnf_transformation,[],[f59]) ).
fof(f71,plain,
! [X0,X1] :
( ~ op_and
| and(X0,X1) = not(or(not(X0),not(X1))) ),
inference(cnf_transformation,[],[f60]) ).
fof(f72,plain,
! [X0,X1] :
( ~ op_implies_and
| implies(X0,X1) = not(and(X0,not(X1))) ),
inference(cnf_transformation,[],[f61]) ).
fof(f73,plain,
! [X0,X1] :
( ~ op_implies_or
| implies(X0,X1) = or(not(X0),X1) ),
inference(cnf_transformation,[],[f62]) ).
fof(f74,plain,
! [X0,X1] :
( ~ op_equiv
| equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
inference(cnf_transformation,[],[f63]) ).
fof(f75,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f76,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f77,plain,
op_equiv,
inference(cnf_transformation,[],[f34]) ).
fof(f78,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f79,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f80,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f81,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f83,plain,
op_implies_or,
inference(cnf_transformation,[],[f40]) ).
fof(f84,plain,
op_and,
inference(cnf_transformation,[],[f41]) ).
fof(f86,plain,
~ r2,
inference(cnf_transformation,[],[f45]) ).
fof(f88,definition,
( spl2_1
<=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f89,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f88]) ).
fof(f91,definition,
( spl2_2
<=> op_equiv ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f93,plain,
( ~ op_equiv
| spl2_2 ),
inference(avatar_component_clause,[],[f91]) ).
fof(f94,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f74,f91,f88]) ).
fof(f96,definition,
( spl2_3
<=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f97,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f96]) ).
fof(f99,definition,
( spl2_4
<=> op_implies_or ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
fof(f101,plain,
( ~ op_implies_or
| spl2_4 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f102,plain,
( spl2_3
| ~ spl2_4 ),
inference(avatar_split_clause,[],[f73,f99,f96]) ).
fof(f104,definition,
( spl2_5
<=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
fof(f105,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f104]) ).
fof(f107,definition,
( spl2_6
<=> op_implies_and ),
introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).
fof(f109,plain,
( ~ op_implies_and
| spl2_6 ),
inference(avatar_component_clause,[],[f107]) ).
fof(f110,plain,
( spl2_5
| ~ spl2_6 ),
inference(avatar_split_clause,[],[f72,f107,f104]) ).
fof(f112,definition,
( spl2_7
<=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
introduced(definition,[new_symbols(definition,[spl2_7])],[avatar_definition]) ).
fof(f113,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ spl2_7 ),
inference(avatar_component_clause,[],[f112]) ).
fof(f115,definition,
( spl2_8
<=> op_and ),
introduced(definition,[new_symbols(definition,[spl2_8])],[avatar_definition]) ).
fof(f117,plain,
( ~ op_and
| spl2_8 ),
inference(avatar_component_clause,[],[f115]) ).
fof(f118,plain,
( spl2_7
| ~ spl2_8 ),
inference(avatar_split_clause,[],[f71,f115,f112]) ).
fof(f120,definition,
( spl2_9
<=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
introduced(definition,[new_symbols(definition,[spl2_9])],[avatar_definition]) ).
fof(f121,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ spl2_9 ),
inference(avatar_component_clause,[],[f120]) ).
fof(f123,definition,
( spl2_10
<=> op_or ),
introduced(definition,[new_symbols(definition,[spl2_10])],[avatar_definition]) ).
fof(f125,plain,
( ~ op_or
| spl2_10 ),
inference(avatar_component_clause,[],[f123]) ).
fof(f126,plain,
( spl2_9
| ~ spl2_10 ),
inference(avatar_split_clause,[],[f70,f123,f120]) ).
fof(f128,definition,
( spl2_11
<=> r2 ),
introduced(definition,[new_symbols(definition,[spl2_11])],[avatar_definition]) ).
fof(f130,plain,
( r2
| ~ spl2_11 ),
inference(avatar_component_clause,[],[f128]) ).
fof(f132,definition,
( spl2_12
<=> is_a_theorem(implies(sK1,or(sK0,sK1))) ),
introduced(definition,[new_symbols(definition,[spl2_12])],[avatar_definition]) ).
fof(f134,plain,
( ~ is_a_theorem(implies(sK1,or(sK0,sK1)))
| spl2_12 ),
inference(avatar_component_clause,[],[f132]) ).
fof(f135,plain,
( spl2_11
| ~ spl2_12 ),
inference(avatar_split_clause,[],[f69,f132,f128]) ).
fof(f137,definition,
( spl2_13
<=> ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
introduced(definition,[new_symbols(definition,[spl2_13])],[avatar_definition]) ).
fof(f138,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ spl2_13 ),
inference(avatar_component_clause,[],[f137]) ).
fof(f140,definition,
( spl2_14
<=> kn3 ),
introduced(definition,[new_symbols(definition,[spl2_14])],[avatar_definition]) ).
fof(f142,plain,
( ~ kn3
| spl2_14 ),
inference(avatar_component_clause,[],[f140]) ).
fof(f143,plain,
( spl2_13
| ~ spl2_14 ),
inference(avatar_split_clause,[],[f68,f140,f137]) ).
fof(f145,definition,
( spl2_15
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
introduced(definition,[new_symbols(definition,[spl2_15])],[avatar_definition]) ).
fof(f146,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ spl2_15 ),
inference(avatar_component_clause,[],[f145]) ).
fof(f148,definition,
( spl2_16
<=> kn2 ),
introduced(definition,[new_symbols(definition,[spl2_16])],[avatar_definition]) ).
fof(f150,plain,
( ~ kn2
| spl2_16 ),
inference(avatar_component_clause,[],[f148]) ).
fof(f151,plain,
( spl2_15
| ~ spl2_16 ),
inference(avatar_split_clause,[],[f67,f148,f145]) ).
fof(f153,definition,
( spl2_17
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
introduced(definition,[new_symbols(definition,[spl2_17])],[avatar_definition]) ).
fof(f154,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ spl2_17 ),
inference(avatar_component_clause,[],[f153]) ).
fof(f156,definition,
( spl2_18
<=> kn1 ),
introduced(definition,[new_symbols(definition,[spl2_18])],[avatar_definition]) ).
fof(f158,plain,
( ~ kn1
| spl2_18 ),
inference(avatar_component_clause,[],[f156]) ).
fof(f159,plain,
( spl2_17
| ~ spl2_18 ),
inference(avatar_split_clause,[],[f66,f156,f153]) ).
fof(f169,definition,
( spl2_21
<=> ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl2_21])],[avatar_definition]) ).
fof(f170,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) )
| ~ spl2_21 ),
inference(avatar_component_clause,[],[f169]) ).
fof(f172,definition,
( spl2_22
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[spl2_22])],[avatar_definition]) ).
fof(f174,plain,
( ~ modus_ponens
| spl2_22 ),
inference(avatar_component_clause,[],[f172]) ).
fof(f175,plain,
( spl2_21
| ~ spl2_22 ),
inference(avatar_split_clause,[],[f64,f172,f169]) ).
fof(f176,plain,
( $false
| spl2_2 ),
inference(forward_subsumption_resolution,[],[f93,f77]) ).
fof(f177,plain,
spl2_2,
inference(avatar_contradiction_clause,[],[f176]) ).
fof(f178,plain,
( $false
| spl2_4 ),
inference(forward_subsumption_resolution,[],[f101,f83]) ).
fof(f179,plain,
spl2_4,
inference(avatar_contradiction_clause,[],[f178]) ).
fof(f180,plain,
( $false
| spl2_6 ),
inference(forward_subsumption_resolution,[],[f109,f76]) ).
fof(f181,plain,
spl2_6,
inference(avatar_contradiction_clause,[],[f180]) ).
fof(f182,plain,
( $false
| spl2_8 ),
inference(forward_subsumption_resolution,[],[f117,f84]) ).
fof(f183,plain,
spl2_8,
inference(avatar_contradiction_clause,[],[f182]) ).
fof(f184,plain,
( $false
| spl2_10 ),
inference(forward_subsumption_resolution,[],[f125,f75]) ).
fof(f185,plain,
spl2_10,
inference(avatar_contradiction_clause,[],[f184]) ).
fof(f186,plain,
( $false
| spl2_14 ),
inference(forward_subsumption_resolution,[],[f142,f81]) ).
fof(f187,plain,
spl2_14,
inference(avatar_contradiction_clause,[],[f186]) ).
fof(f188,plain,
( $false
| spl2_16 ),
inference(forward_subsumption_resolution,[],[f150,f80]) ).
fof(f189,plain,
spl2_16,
inference(avatar_contradiction_clause,[],[f188]) ).
fof(f190,plain,
( $false
| spl2_18 ),
inference(forward_subsumption_resolution,[],[f158,f79]) ).
fof(f191,plain,
spl2_18,
inference(avatar_contradiction_clause,[],[f190]) ).
fof(f194,plain,
( $false
| spl2_22 ),
inference(forward_subsumption_resolution,[],[f174,f78]) ).
fof(f195,plain,
spl2_22,
inference(avatar_contradiction_clause,[],[f194]) ).
fof(f197,plain,
( ! [X0] :
( is_a_theorem(and(X0,X0))
| ~ is_a_theorem(X0) )
| ~ spl2_17
| ~ spl2_21 ),
inference(resolution,[],[f170,f154]) ).
fof(f199,plain,
( ! [X2,X0,X1] : implies(X2,and(X0,not(X1))) = not(and(X2,implies(X0,X1)))
| ~ spl2_5 ),
inference(superposition,[],[f105,f105]) ).
fof(f200,plain,
( ! [X2,X0,X1] : implies(and(X0,not(X1)),X2) = or(implies(X0,X1),X2)
| ~ spl2_3
| ~ spl2_5 ),
inference(superposition,[],[f97,f105]) ).
fof(f201,plain,
( ! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1)))
| ~ spl2_3
| ~ spl2_7 ),
inference(forward_demodulation,[],[f113,f97]) ).
fof(f202,plain,
( ! [X0,X1] : or(X0,X1) = implies(not(X0),X1)
| ~ spl2_5
| ~ spl2_9 ),
inference(forward_demodulation,[],[f121,f105]) ).
fof(f203,plain,
( ! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2)
| ~ spl2_5
| ~ spl2_9 ),
inference(superposition,[],[f202,f105]) ).
fof(f204,plain,
( ! [X0] : is_a_theorem(or(X0,and(not(X0),not(X0))))
| ~ spl2_5
| ~ spl2_9
| ~ spl2_17 ),
inference(superposition,[],[f154,f202]) ).
fof(f205,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(not(X0)) )
| ~ spl2_5
| ~ spl2_9
| ~ spl2_21 ),
inference(superposition,[],[f170,f202]) ).
fof(f208,plain,
( ! [X0,X1] : and(not(X0),X1) = not(or(X0,not(X1)))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_7
| ~ spl2_9 ),
inference(superposition,[],[f201,f202]) ).
fof(f219,plain,
( ! [X0] :
( ~ is_a_theorem(implies(X0,X0))
| is_a_theorem(equiv(X0,X0)) )
| ~ spl2_1
| ~ spl2_17
| ~ spl2_21 ),
inference(superposition,[],[f197,f89]) ).
fof(f227,plain,
( ! [X0,X1] :
( ~ is_a_theorem(not(not(X0)))
| is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_21 ),
inference(superposition,[],[f205,f97]) ).
fof(f233,plain,
( ! [X0,X1] : implies(implies(X0,X1),and(X1,not(X0))) = not(equiv(X0,X1))
| ~ spl2_1
| ~ spl2_5 ),
inference(superposition,[],[f199,f89]) ).
fof(f244,plain,
( ! [X0,X1] : is_a_theorem(or(implies(X0,X1),X0))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_15 ),
inference(superposition,[],[f146,f200]) ).
fof(f255,plain,
( ! [X0,X1] : is_a_theorem(or(or(X0,X1),not(X0)))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_15 ),
inference(superposition,[],[f244,f202]) ).
fof(f258,plain,
( ! [X0,X1] : is_a_theorem(or(implies(X0,X1),not(not(X0))))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_15 ),
inference(superposition,[],[f255,f97]) ).
fof(f305,plain,
( ! [X2,X0,X1] : or(or(X0,not(X1)),X2) = implies(and(not(X0),X1),X2)
| ~ spl2_3
| ~ spl2_5
| ~ spl2_7
| ~ spl2_9 ),
inference(superposition,[],[f202,f208]) ).
fof(f438,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),or(and(X1,X2),not(and(X2,X0)))))
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13 ),
inference(forward_demodulation,[],[f138,f202]) ).
fof(f500,plain,
( ! [X0,X1] : is_a_theorem(or(not(equiv(X0,X1)),not(not(implies(X0,X1)))))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_15 ),
inference(superposition,[],[f258,f233]) ).
fof(f504,plain,
( ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),not(not(implies(X0,X1)))))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_15 ),
inference(forward_demodulation,[],[f500,f97]) ).
fof(f605,plain,
( ! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| is_a_theorem(not(not(implies(X0,X1)))) )
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_15
| ~ spl2_21 ),
inference(resolution,[],[f504,f170]) ).
fof(f622,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),X2),or(and(X2,X0),implies(X0,X1))))
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13 ),
inference(superposition,[],[f438,f105]) ).
fof(f626,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),or(and(X2,X0),implies(X0,X1))))
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13 ),
inference(forward_demodulation,[],[f622,f202]) ).
fof(f647,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(X2,X0),implies(implies(X0,X1),implies(not(X1),X2))))
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13 ),
inference(superposition,[],[f626,f203]) ).
fof(f648,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(X2,X0),implies(implies(X0,X1),or(X1,X2))))
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13 ),
inference(forward_demodulation,[],[f647,f202]) ).
fof(f655,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),or(X1,X2)))
| ~ is_a_theorem(or(X2,X0)) )
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_21 ),
inference(resolution,[],[f648,f170]) ).
fof(f656,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),or(X2,not(X0)))))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13 ),
inference(superposition,[],[f648,f97]) ).
fof(f1282,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(X2,X0))
| ~ is_a_theorem(implies(X1,X2)) )
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_21 ),
inference(resolution,[],[f655,f170]) ).
fof(f1433,plain,
( ! [X0,X1] :
( is_a_theorem(or(X0,X1))
| ~ is_a_theorem(implies(and(not(X1),not(X1)),X0)) )
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_17
| ~ spl2_21 ),
inference(resolution,[],[f1282,f204]) ).
fof(f1462,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(implies(not(X1),X1),X0))
| is_a_theorem(or(X0,X1)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_17
| ~ spl2_21 ),
inference(forward_demodulation,[],[f1433,f200]) ).
fof(f1469,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(or(X1,X1),X0))
| is_a_theorem(or(X0,X1)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_17
| ~ spl2_21 ),
inference(forward_demodulation,[],[f1462,f202]) ).
fof(f1517,plain,
( ! [X0] : is_a_theorem(or(not(X0),X0))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(resolution,[],[f1469,f255]) ).
fof(f1538,plain,
( ! [X0] : is_a_theorem(implies(X0,X0))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(forward_demodulation,[],[f1517,f97]) ).
fof(f1551,plain,
( ! [X0] : is_a_theorem(equiv(X0,X0))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(resolution,[],[f1538,f219]) ).
fof(f1554,plain,
( ! [X0] : is_a_theorem(or(X0,not(X0)))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(superposition,[],[f1538,f202]) ).
fof(f1561,plain,
( ! [X0,X1] :
( is_a_theorem(or(X0,X1))
| ~ is_a_theorem(implies(not(X1),X0)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(resolution,[],[f1554,f1282]) ).
fof(f1581,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(X1,X0))
| is_a_theorem(or(X0,X1)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(forward_demodulation,[],[f1561,f202]) ).
fof(f1649,plain,
( ! [X0,X1] : is_a_theorem(or(X0,implies(X0,X1)))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(resolution,[],[f1581,f244]) ).
fof(f1662,plain,
( ! [X0,X1] :
( is_a_theorem(or(X1,not(X0)))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(superposition,[],[f1581,f97]) ).
fof(f1697,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X2),X0))
| is_a_theorem(or(X0,X1)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(resolution,[],[f1649,f1282]) ).
fof(f1754,plain,
( $false
| ~ spl2_11 ),
inference(forward_subsumption_resolution,[],[f130,f86]) ).
fof(f1755,plain,
~ spl2_11,
inference(avatar_contradiction_clause,[],[f1754]) ).
fof(f3878,plain,
( ! [X0] : is_a_theorem(not(not(implies(X0,X0))))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(resolution,[],[f605,f1551]) ).
fof(f3884,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X1),X0))
| is_a_theorem(X0) )
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(resolution,[],[f3878,f227]) ).
fof(f4328,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X1,not(X0)))
| is_a_theorem(implies(X0,not(X1))) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(superposition,[],[f1662,f97]) ).
fof(f6251,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),or(X1,not(X0))))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(resolution,[],[f656,f3884]) ).
fof(f10672,plain,
( ! [X0,X1] : is_a_theorem(or(or(X0,not(X1)),X1))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(resolution,[],[f6251,f1697]) ).
fof(f10711,plain,
( ! [X0,X1] : is_a_theorem(implies(and(not(X0),X1),X1))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_7
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(forward_demodulation,[],[f10672,f305]) ).
fof(f10716,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,not(and(not(X1),not(X0)))))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_7
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(resolution,[],[f10711,f4328]) ).
fof(f10740,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X1),X0)))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_7
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(forward_demodulation,[],[f10716,f105]) ).
fof(f10746,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X1,X0)))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_7
| ~ spl2_9
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(forward_demodulation,[],[f10740,f202]) ).
fof(f10775,plain,
( $false
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_7
| ~ spl2_9
| spl2_12
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(resolution,[],[f10746,f134]) ).
fof(f10787,plain,
( ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_7
| ~ spl2_9
| spl2_12
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(avatar_contradiction_clause,[],[f10775]) ).
cnf(s1,plain,
( spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f94]) ).
cnf(s2,plain,
( spl2_3
| ~ spl2_4 ),
inference(sat_conversion,[],[f102]) ).
cnf(s3,plain,
( spl2_5
| ~ spl2_6 ),
inference(sat_conversion,[],[f110]) ).
cnf(s4,plain,
( spl2_7
| ~ spl2_8 ),
inference(sat_conversion,[],[f118]) ).
cnf(s5,plain,
( spl2_9
| ~ spl2_10 ),
inference(sat_conversion,[],[f126]) ).
cnf(s6,plain,
( spl2_11
| ~ spl2_12 ),
inference(sat_conversion,[],[f135]) ).
cnf(s7,plain,
( spl2_13
| ~ spl2_14 ),
inference(sat_conversion,[],[f143]) ).
cnf(s8,plain,
( spl2_15
| ~ spl2_16 ),
inference(sat_conversion,[],[f151]) ).
cnf(s9,plain,
( spl2_17
| ~ spl2_18 ),
inference(sat_conversion,[],[f159]) ).
cnf(s11,plain,
( spl2_21
| ~ spl2_22 ),
inference(sat_conversion,[],[f175]) ).
cnf(s12,plain,
spl2_2,
inference(sat_conversion,[],[f177]) ).
cnf(s13,plain,
spl2_4,
inference(sat_conversion,[],[f179]) ).
cnf(s14,plain,
spl2_6,
inference(sat_conversion,[],[f181]) ).
cnf(s15,plain,
spl2_8,
inference(sat_conversion,[],[f183]) ).
cnf(s16,plain,
spl2_10,
inference(sat_conversion,[],[f185]) ).
cnf(s17,plain,
spl2_14,
inference(sat_conversion,[],[f187]) ).
cnf(s18,plain,
spl2_16,
inference(sat_conversion,[],[f189]) ).
cnf(s19,plain,
spl2_18,
inference(sat_conversion,[],[f191]) ).
cnf(s21,plain,
spl2_22,
inference(sat_conversion,[],[f195]) ).
cnf(s25,plain,
~ spl2_11,
inference(sat_conversion,[],[f1755]) ).
cnf(s31,plain,
( ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_7
| ~ spl2_9
| spl2_12
| ~ spl2_13
| ~ spl2_15
| ~ spl2_17
| ~ spl2_21 ),
inference(sat_conversion,[],[f10787]) ).
cnf(s32,plain,
spl2_21,
inference(rat,[],[s11,s21]) ).
cnf(s34,plain,
spl2_17,
inference(rat,[],[s9,s19]) ).
cnf(s35,plain,
spl2_15,
inference(rat,[],[s8,s18]) ).
cnf(s36,plain,
spl2_13,
inference(rat,[],[s7,s17]) ).
cnf(s37,plain,
~ spl2_12,
inference(rat,[],[s6,s25]) ).
cnf(s39,plain,
spl2_9,
inference(rat,[],[s5,s16]) ).
cnf(s40,plain,
spl2_7,
inference(rat,[],[s4,s15]) ).
cnf(s41,plain,
spl2_5,
inference(rat,[],[s3,s14]) ).
cnf(s42,plain,
spl2_3,
inference(rat,[],[s2,s13]) ).
cnf(s43,plain,
~ spl2_1,
inference(rat,[],[s31,s32,s34,s35,s36,s37,s39,s40,s41,s42]) ).
cnf(s49,plain,
$false,
inference(rat,[],[s1,s12,s43]) ).
fof(f10790,plain,
$false,
inference(avatar_sat_refutation,[],[s49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL519+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.12/0.38 % Computer : n013.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 15:55:07 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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
% 2.65/0.80 % (377000)Will run a generic schedule for satisfiability detection.
% 2.65/0.80 % (377008)dis+10_1_sil=32000:sp=arity:random_seed=3755970243:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.65/0.80 % (377006)% WARNING: option uhcvi not known.
% 2.65/0.80 % (377005)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2220809526_2999 on theBenchmark for (2999ds/0Mi)
% 2.65/0.80 % (377006)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4256149441:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.65/0.80 % (377007)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2247187516:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.65/0.80 % (377009)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1148053949:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.65/0.80 % (377011)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=698090249:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.65/0.80 % (377010)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1544683502:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.65/0.80 % TRYING [1]
% 2.65/0.80 % TRYING [2]
% 2.65/0.80 % TRYING [3]
% 2.65/0.80 % TRYING [4]
% 2.65/0.80 % (377008)Instruction limit reached!
% 2.65/0.80 % (377008)------------------------------
% 2.65/0.80 % (377008)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.65/0.80 % (377008)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/0.80 % (377008)CaDiCaL version: 2.1.3
% 2.65/0.80 % (377008)Termination reason: Instruction limit
% 2.65/0.80 % (377008)Termination phase: Saturation
% 2.65/0.80 % (377008)Time elapsed: 0.035 s
% 2.65/0.80 % (377008)Peak memory usage: 13 MB
% 2.65/0.80 % (377008)Instructions burned: 105 (million)
% 2.65/0.80 % (377019)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3360475566:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.65/0.80 % TRYING [1]
% 2.65/0.80 % TRYING [2]
% 2.65/0.80 % TRYING [3]
% 2.65/0.80 % TRYING [4]
% 2.65/0.80 % (377009)Instruction limit reached!
% 2.65/0.80 % (377009)------------------------------
% 2.65/0.80 % (377009)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.65/0.80 % (377009)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/0.80 % (377009)CaDiCaL version: 2.1.3
% 2.65/0.80 % (377009)Termination reason: Instruction limit
% 2.65/0.80 % (377009)Termination phase: Saturation
% 2.65/0.80 % (377009)Time elapsed: 0.073 s
% 2.65/0.80 % (377009)Peak memory usage: 13 MB
% 2.65/0.80 % (377009)Instructions burned: 117 (million)
% 2.65/0.80 % (377010)Instruction limit reached!
% 2.65/0.80 % (377010)------------------------------
% 2.65/0.80 % (377010)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.65/0.80 % (377010)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/0.80 % (377010)CaDiCaL version: 2.1.3
% 2.65/0.80 % (377010)Termination reason: Instruction limit
% 2.65/0.80 % (377010)Termination phase: Saturation
% 2.65/0.80 % (377010)Time elapsed: 0.081 s
% 2.65/0.80 % (377010)Peak memory usage: 14 MB
% 2.65/0.80 % (377010)Instructions burned: 131 (million)
% 2.65/0.80 % (377021)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4078312916:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.65/0.80 % (377022)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=3966822093:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.65/0.80 % (377011)Instruction limit reached!
% 2.65/0.80 % (377011)------------------------------
% 2.65/0.80 % (377011)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.65/0.80 % (377011)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/0.80 % (377011)CaDiCaL version: 2.1.3
% 2.65/0.80 % (377011)Termination reason: Instruction limit
% 2.65/0.80 % (377011)Termination phase: Saturation
% 2.65/0.80 % (377011)Time elapsed: 0.105 s
% 2.65/0.80 % (377011)Peak memory usage: 14 MB
% 2.65/0.80 % (377011)Instructions burned: 160 (million)
% 2.65/0.80 % (377025)ott-21_1_sil=16000:fs=off:random_seed=1789683082:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.65/0.80 % TRYING [5]
% 2.65/0.80 % (377021)Instruction limit reached!
% 2.65/0.80 % (377021)------------------------------
% 2.65/0.80 % (377021)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.65/0.80 % (377021)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/0.80 % (377021)CaDiCaL version: 2.1.3
% 2.65/0.80 % (377021)Termination reason: Instruction limit
% 2.65/0.80 % (377021)Termination phase: Saturation
% 2.65/0.80 % (377021)Time elapsed: 0.087 s
% 2.65/0.80 % (377021)Peak memory usage: 13 MB
% 2.65/0.80 % (377021)Instructions burned: 131 (million)
% 2.65/0.80 % TRYING [5]
% 2.65/0.80 % (377027)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3537390234:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.65/0.80 % (377025)Instruction limit reached!
% 2.65/0.80 % (377025)------------------------------
% 2.65/0.80 % (377025)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.65/0.80 % (377025)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/0.80 % (377025)CaDiCaL version: 2.1.3
% 2.65/0.80 % (377025)Termination reason: Instruction limit
% 2.65/0.80 % (377025)Termination phase: Saturation
% 2.65/0.80 % (377025)Time elapsed: 0.099 s
% 2.65/0.80 % (377025)Peak memory usage: 13 MB
% 2.65/0.80 % (377025)Instructions burned: 181 (million)
% 2.65/0.80 % (377029)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=50034286:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.65/0.80 % TRYING [1]
% 2.65/0.80 % TRYING [2]
% 2.65/0.80 % (377019)Instruction limit reached!
% 2.65/0.80 % (377019)------------------------------
% 2.65/0.80 % (377019)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.65/0.80 % (377019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/0.80 % (377019)CaDiCaL version: 2.1.3
% 2.65/0.80 % (377019)Termination reason: Instruction limit
% 2.65/0.80 % (377019)Termination phase: Finite model building SAT solving
% 2.65/0.80 % (377019)Time elapsed: 0.226 s
% 2.65/0.80 % (377019)Peak memory usage: 18 MB
% 2.65/0.80 % (377019)Instructions burned: 716 (million)
% 2.65/0.80 % TRYING [3]
% 2.65/0.80 % (377031)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3756384525:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 2.65/0.80 % TRYING [4]
% 2.65/0.80 % (377022) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-377000-377022"...
% 2.65/0.80 % (377022)...printing done.
% 2.65/0.80 % (377022)Refutation found. Thanks to Tanya!
% 2.65/0.80 % SZS status Theorem for theBenchmark
% 2.65/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 2.65/0.80 % (377022)------------------------------
% 2.65/0.80 % (377022)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.65/0.80 % (377022)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/0.80 % (377022)CaDiCaL version: 2.1.3
% 2.65/0.80 % (377022)Termination reason: Refutation
% 2.65/0.80 % (377022)Time elapsed: 0.228 s
% 2.65/0.80 % (377022)Peak memory usage: 17 MB
% 2.65/0.80 % (377022)Instructions burned: 360 (million)
% 2.65/0.80 % (377000)Success in time 0.37 s
% 2.65/0.80 % Vampire exiting
%------------------------------------------------------------------------------