%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL516+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 : n007.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:50 AM UTC 2026
% Result : Theorem 2.79s 1.01s
% Output : Refutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 32
% Syntax : Number of formulae : 181 ( 48 unt; 16 def)
% Number of atoms : 598 ( 19 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 807 ( 390 ~; 384 |; 2 &)
% ( 21 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 27 ( 25 usr; 25 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 212 ( 0 sgn 210 !; 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(f16,axiom,
( kn1
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn1) ).
fof(f17,axiom,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL006+0.ax',kn3) ).
fof(f20,axiom,
( cn2
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',cn2) ).
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(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(f31,axiom,
( op_equiv
=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_implies_and) ).
fof(f34,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_equiv) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_modus_ponens) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn1) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn2) ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn3) ).
fof(f43,conjecture,
cn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).
fof(f44,negated_conjecture,
~ cn2,
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f45,plain,
~ cn2,
inference(flattening,[],[f44]) ).
fof(f46,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
=> cn2 ),
inference(unused_predicate_definition_removal,[],[f20]) ).
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(f55,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f51]) ).
fof(f56,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f55]) ).
fof(f58,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(ennf_transformation,[],[f49]) ).
fof(f59,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f48]) ).
fof(f60,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(f61,plain,
( cn2
| ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(ennf_transformation,[],[f46]) ).
fof(f62,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f63,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f64,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f65,plain,
! [X0,X1] :
( ~ modus_ponens
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f67,plain,
! [X0] :
( ~ kn1
| is_a_theorem(implies(X0,and(X0,X0))) ),
inference(cnf_transformation,[],[f58]) ).
fof(f68,plain,
! [X0,X1] :
( ~ kn2
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(cnf_transformation,[],[f59]) ).
fof(f69,plain,
! [X2,X0,X1] :
( ~ kn3
| is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(cnf_transformation,[],[f60]) ).
fof(f70,plain,
( ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1)))
| cn2 ),
inference(cnf_transformation,[],[f61]) ).
fof(f71,plain,
! [X0,X1] :
( ~ op_or
| or(X0,X1) = not(and(not(X0),not(X1))) ),
inference(cnf_transformation,[],[f62]) ).
fof(f72,plain,
! [X0,X1] :
( ~ op_implies_and
| implies(X0,X1) = not(and(X0,not(X1))) ),
inference(cnf_transformation,[],[f63]) ).
fof(f73,plain,
! [X0,X1] :
( ~ op_equiv
| equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
inference(cnf_transformation,[],[f64]) ).
fof(f74,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f75,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f76,plain,
op_equiv,
inference(cnf_transformation,[],[f34]) ).
fof(f77,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f78,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f79,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f80,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f84,plain,
~ cn2,
inference(cnf_transformation,[],[f45]) ).
fof(f85,plain,
! [X0,X1] :
( modus_ponens
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(consistent_polarity_flipping,[],[f65]) ).
fof(f86,plain,
! [X0,X1] :
( kn2
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(consistent_polarity_flipping,[],[f68]) ).
fof(f87,plain,
! [X2,X0,X1] :
( kn3
| is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(consistent_polarity_flipping,[],[f69]) ).
fof(f88,plain,
! [X0,X1] :
( op_implies_and
| implies(X0,X1) = not(and(X0,not(X1))) ),
inference(consistent_polarity_flipping,[],[f72]) ).
fof(f89,plain,
~ op_implies_and,
inference(consistent_polarity_flipping,[],[f75]) ).
fof(f90,plain,
~ modus_ponens,
inference(consistent_polarity_flipping,[],[f77]) ).
fof(f91,plain,
~ kn2,
inference(consistent_polarity_flipping,[],[f79]) ).
fof(f92,plain,
~ kn3,
inference(consistent_polarity_flipping,[],[f80]) ).
fof(f94,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(f95,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f94]) ).
fof(f97,definition,
( spl2_2
<=> op_equiv ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f100,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f73,f97,f94]) ).
fof(f102,definition,
( spl2_3
<=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f103,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f102]) ).
fof(f105,definition,
( spl2_4
<=> op_implies_and ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
fof(f108,plain,
( spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f88,f105,f102]) ).
fof(f110,definition,
( spl2_5
<=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
introduced(definition,[new_symbols(definition,[spl2_5])],[avatar_definition]) ).
fof(f111,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ spl2_5 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f113,definition,
( spl2_6
<=> op_or ),
introduced(definition,[new_symbols(definition,[spl2_6])],[avatar_definition]) ).
fof(f116,plain,
( spl2_5
| ~ spl2_6 ),
inference(avatar_split_clause,[],[f71,f113,f110]) ).
fof(f118,definition,
( spl2_7
<=> cn2 ),
introduced(definition,[new_symbols(definition,[spl2_7])],[avatar_definition]) ).
fof(f122,definition,
( spl2_8
<=> is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
introduced(definition,[new_symbols(definition,[spl2_8])],[avatar_definition]) ).
fof(f124,plain,
( ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1)))
| spl2_8 ),
inference(avatar_component_clause,[],[f122]) ).
fof(f125,plain,
( spl2_7
| ~ spl2_8 ),
inference(avatar_split_clause,[],[f70,f122,f118]) ).
fof(f127,definition,
( spl2_9
<=> ! [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_9])],[avatar_definition]) ).
fof(f128,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ spl2_9 ),
inference(avatar_component_clause,[],[f127]) ).
fof(f130,definition,
( spl2_10
<=> kn3 ),
introduced(definition,[new_symbols(definition,[spl2_10])],[avatar_definition]) ).
fof(f133,plain,
( spl2_9
| spl2_10 ),
inference(avatar_split_clause,[],[f87,f130,f127]) ).
fof(f135,definition,
( spl2_11
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
introduced(definition,[new_symbols(definition,[spl2_11])],[avatar_definition]) ).
fof(f136,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ spl2_11 ),
inference(avatar_component_clause,[],[f135]) ).
fof(f138,definition,
( spl2_12
<=> kn2 ),
introduced(definition,[new_symbols(definition,[spl2_12])],[avatar_definition]) ).
fof(f141,plain,
( spl2_11
| spl2_12 ),
inference(avatar_split_clause,[],[f86,f138,f135]) ).
fof(f143,definition,
( spl2_13
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
introduced(definition,[new_symbols(definition,[spl2_13])],[avatar_definition]) ).
fof(f144,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ spl2_13 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f146,definition,
( spl2_14
<=> kn1 ),
introduced(definition,[new_symbols(definition,[spl2_14])],[avatar_definition]) ).
fof(f149,plain,
( spl2_13
| ~ spl2_14 ),
inference(avatar_split_clause,[],[f67,f146,f143]) ).
fof(f159,definition,
( spl2_17
<=> ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl2_17])],[avatar_definition]) ).
fof(f160,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) )
| ~ spl2_17 ),
inference(avatar_component_clause,[],[f159]) ).
fof(f162,definition,
( spl2_18
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[spl2_18])],[avatar_definition]) ).
fof(f165,plain,
( spl2_17
| spl2_18 ),
inference(avatar_split_clause,[],[f85,f162,f159]) ).
fof(f166,plain,
~ spl2_7,
inference(avatar_split_clause,[],[f84,f118]) ).
fof(f167,plain,
spl2_6,
inference(avatar_split_clause,[],[f74,f113]) ).
fof(f168,plain,
spl2_2,
inference(avatar_split_clause,[],[f76,f97]) ).
fof(f169,plain,
spl2_14,
inference(avatar_split_clause,[],[f78,f146]) ).
fof(f171,plain,
~ spl2_4,
inference(avatar_split_clause,[],[f89,f105]) ).
fof(f172,plain,
~ spl2_18,
inference(avatar_split_clause,[],[f90,f162]) ).
fof(f173,plain,
~ spl2_12,
inference(avatar_split_clause,[],[f91,f138]) ).
fof(f174,plain,
~ spl2_10,
inference(avatar_split_clause,[],[f92,f130]) ).
fof(f176,plain,
( ! [X0] :
( is_a_theorem(and(X0,X0))
| ~ is_a_theorem(X0) )
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f160,f144]) ).
fof(f178,plain,
( ! [X2,X0,X1] : or(and(X0,not(X1)),X2) = not(and(implies(X0,X1),not(X2)))
| ~ spl2_3
| ~ spl2_5 ),
inference(superposition,[],[f111,f103]) ).
fof(f182,plain,
( ! [X0,X1] : or(X0,X1) = implies(not(X0),X1)
| ~ spl2_3
| ~ spl2_5 ),
inference(superposition,[],[f111,f103]) ).
fof(f186,plain,
( ! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2)
| ~ spl2_3
| ~ spl2_5 ),
inference(forward_demodulation,[],[f178,f103]) ).
fof(f191,plain,
( ! [X0] : is_a_theorem(or(X0,and(not(X0),not(X0))))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_13 ),
inference(superposition,[],[f144,f182]) ).
fof(f192,plain,
( ! [X0,X1] :
( ~ is_a_theorem(not(X0))
| is_a_theorem(X1)
| ~ is_a_theorem(or(X0,X1)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_17 ),
inference(superposition,[],[f160,f182]) ).
fof(f196,plain,
( ! [X0,X1] : is_a_theorem(implies(equiv(X0,X1),implies(X0,X1)))
| ~ spl2_1
| ~ spl2_11 ),
inference(superposition,[],[f136,f95]) ).
fof(f197,plain,
( ! [X0] :
( ~ is_a_theorem(implies(X0,X0))
| is_a_theorem(equiv(X0,X0)) )
| ~ spl2_1
| ~ spl2_13
| ~ spl2_17 ),
inference(superposition,[],[f176,f95]) ).
fof(f199,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),or(and(X1,X2),not(and(X2,X0)))))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9 ),
inference(forward_demodulation,[],[f128,f182]) ).
fof(f200,plain,
( ! [X2,X0,X1] :
( is_a_theorem(or(and(X0,X1),not(and(X1,X2))))
| ~ is_a_theorem(implies(X2,X0)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_17 ),
inference(resolution,[],[f199,f160]) ).
fof(f204,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),X2),or(and(X2,X0),implies(X0,X1))))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9 ),
inference(superposition,[],[f199,f103]) ).
fof(f207,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),or(and(X2,X0),implies(X0,X1))))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9 ),
inference(forward_demodulation,[],[f204,f182]) ).
fof(f210,plain,
( ! [X0,X1] : is_a_theorem(implies(equiv(not(X0),X1),or(X0,X1)))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_11 ),
inference(superposition,[],[f196,f182]) ).
fof(f216,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(or(X2,X0))
| is_a_theorem(or(and(X0,X1),implies(X1,X2))) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_17 ),
inference(resolution,[],[f207,f160]) ).
fof(f260,plain,
( ! [X2,X0,X1] :
( is_a_theorem(or(and(X2,not(X0)),or(X0,X1)))
| ~ is_a_theorem(implies(not(X1),X2)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_17 ),
inference(superposition,[],[f200,f111]) ).
fof(f262,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),not(and(not(X1),X2))))
| ~ is_a_theorem(implies(X2,X0)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_17 ),
inference(superposition,[],[f200,f186]) ).
fof(f264,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(X2,X0),or(X0,X1)))
| ~ is_a_theorem(implies(not(X1),X2)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_17 ),
inference(forward_demodulation,[],[f260,f186]) ).
fof(f266,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(or(X1,X2))
| is_a_theorem(implies(implies(X2,X0),or(X0,X1))) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_17 ),
inference(forward_demodulation,[],[f264,f182]) ).
fof(f424,plain,
( ! [X0,X1] :
( ~ is_a_theorem(equiv(not(X0),X1))
| is_a_theorem(or(X0,X1)) )
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_11
| ~ spl2_17 ),
inference(resolution,[],[f210,f160]) ).
fof(f464,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(and(not(X0),not(X0)),X1),or(X1,X0)))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f266,f191]) ).
fof(f634,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(and(not(X1),not(X1)),X0))
| is_a_theorem(or(X0,X1)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f464,f160]) ).
fof(f759,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(not(and(not(X2),X0)))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_17 ),
inference(resolution,[],[f262,f160]) ).
fof(f843,plain,
( ! [X0] : is_a_theorem(or(not(X0),X0))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f634,f136]) ).
fof(f854,plain,
( ! [X0,X1] : is_a_theorem(or(and(X0,X1),implies(X1,not(X0))))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f843,f216]) ).
fof(f855,plain,
( ! [X0,X1] : is_a_theorem(or(implies(X0,X1),and(X0,not(X1))))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(superposition,[],[f843,f103]) ).
fof(f2688,plain,
( ~ is_a_theorem(implies(sK0,or(sK0,sK1)))
| ~ spl2_3
| ~ spl2_5
| spl2_8 ),
inference(forward_demodulation,[],[f124,f182]) ).
fof(f7449,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,and(X0,X2)))
| is_a_theorem(not(and(not(X0),X1))) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_17 ),
inference(resolution,[],[f759,f136]) ).
fof(f8068,plain,
( ! [X0] : is_a_theorem(not(and(not(X0),X0)))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f7449,f144]) ).
fof(f8083,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(or(X0,and(X1,X2)))
| is_a_theorem(not(and(not(X1),not(X0)))) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_17 ),
inference(superposition,[],[f7449,f182]) ).
fof(f8085,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(not(X1),X0))
| ~ is_a_theorem(or(X0,and(X1,X2))) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_17 ),
inference(forward_demodulation,[],[f8083,f103]) ).
fof(f8088,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(or(X0,and(X1,X2)))
| is_a_theorem(or(X1,X0)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_17 ),
inference(forward_demodulation,[],[f8085,f182]) ).
fof(f8093,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(and(not(X1),X1),X0))
| is_a_theorem(X0) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f8068,f192]) ).
fof(f8237,plain,
( ! [X0] : is_a_theorem(implies(X0,not(not(X0))))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f8093,f854]) ).
fof(f8238,plain,
( ! [X0,X1] :
( is_a_theorem(not(and(X0,X1)))
| ~ is_a_theorem(implies(X1,not(X0))) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f8093,f200]) ).
fof(f8275,plain,
( ! [X0] :
( is_a_theorem(not(not(X0)))
| ~ is_a_theorem(X0) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f8237,f160]) ).
fof(f8277,plain,
( ! [X0] : is_a_theorem(or(not(not(and(not(X0),not(X0)))),X0))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f8237,f634]) ).
fof(f8292,plain,
( ! [X0] : is_a_theorem(or(not(implies(not(X0),X0)),X0))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(forward_demodulation,[],[f8277,f103]) ).
fof(f8293,plain,
( ! [X0] : is_a_theorem(or(not(or(X0,X0)),X0))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(forward_demodulation,[],[f8292,f182]) ).
fof(f8355,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(not(X0),X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f8275,f192]) ).
fof(f8586,plain,
( ! [X0] :
( ~ is_a_theorem(or(X0,X0))
| is_a_theorem(X0) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f8355,f8293]) ).
fof(f8774,plain,
( ! [X0,X1] : is_a_theorem(or(X0,implies(X0,X1)))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f8088,f855]) ).
fof(f8775,plain,
( ! [X0,X1] : is_a_theorem(or(X0,not(and(X0,X1))))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f8088,f843]) ).
fof(f8799,plain,
( ! [X2,X0,X1] : is_a_theorem(or(and(implies(X0,X1),X2),implies(X2,X0)))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f8774,f216]) ).
fof(f8951,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(not(and(X0,X1)),X2),or(X2,X0)))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f8775,f266]) ).
fof(f8983,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(or(and(X0,X1),X2),or(X2,X0)))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(forward_demodulation,[],[f8951,f182]) ).
fof(f11808,plain,
( ! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(not(X1),not(X0))) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(superposition,[],[f8238,f103]) ).
fof(f11824,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(X1,not(X0)))
| is_a_theorem(implies(X0,X1)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(forward_demodulation,[],[f11808,f182]) ).
fof(f16459,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(or(and(X1,X2),X0))
| is_a_theorem(or(X0,X1)) )
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f8983,f160]) ).
fof(f19560,plain,
( ! [X2,X0,X1] : is_a_theorem(or(implies(X0,X1),implies(X1,X2)))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f16459,f8799]) ).
fof(f19711,plain,
( ! [X0] : is_a_theorem(implies(X0,X0))
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f19560,f8586]) ).
fof(f19735,plain,
( ! [X0] : is_a_theorem(equiv(X0,X0))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(backward_subsumption_resolution,[],[f197,f19711]) ).
fof(f19773,plain,
( ! [X0] : is_a_theorem(or(X0,not(X0)))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f19735,f424]) ).
fof(f19790,plain,
( ! [X0,X1] : is_a_theorem(or(not(and(X0,X1)),X0))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f19773,f16459]) ).
fof(f20050,plain,
( ! [X0,X1] : is_a_theorem(or(implies(X0,X1),X0))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(superposition,[],[f19790,f103]) ).
fof(f20758,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(resolution,[],[f20050,f11824]) ).
fof(f20774,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(forward_demodulation,[],[f20758,f182]) ).
fof(f21189,plain,
( $false
| ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| spl2_8
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(backward_subsumption_resolution,[],[f2688,f20774]) ).
fof(f21210,plain,
( ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| spl2_8
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(avatar_contradiction_clause,[],[f21189]) ).
cnf(s1,plain,
( spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f100]) ).
cnf(s2,plain,
( spl2_3
| spl2_4 ),
inference(sat_conversion,[],[f108]) ).
cnf(s3,plain,
( spl2_5
| ~ spl2_6 ),
inference(sat_conversion,[],[f116]) ).
cnf(s4,plain,
( spl2_7
| ~ spl2_8 ),
inference(sat_conversion,[],[f125]) ).
cnf(s5,plain,
( spl2_9
| spl2_10 ),
inference(sat_conversion,[],[f133]) ).
cnf(s6,plain,
( spl2_11
| spl2_12 ),
inference(sat_conversion,[],[f141]) ).
cnf(s7,plain,
( spl2_13
| ~ spl2_14 ),
inference(sat_conversion,[],[f149]) ).
cnf(s9,plain,
( spl2_17
| spl2_18 ),
inference(sat_conversion,[],[f165]) ).
cnf(s10,plain,
~ spl2_7,
inference(sat_conversion,[],[f166]) ).
cnf(s11,plain,
spl2_6,
inference(sat_conversion,[],[f167]) ).
cnf(s12,plain,
spl2_2,
inference(sat_conversion,[],[f168]) ).
cnf(s13,plain,
spl2_14,
inference(sat_conversion,[],[f169]) ).
cnf(s17,plain,
~ spl2_4,
inference(sat_conversion,[],[f171]) ).
cnf(s18,plain,
~ spl2_18,
inference(sat_conversion,[],[f172]) ).
cnf(s19,plain,
~ spl2_12,
inference(sat_conversion,[],[f173]) ).
cnf(s20,plain,
~ spl2_10,
inference(sat_conversion,[],[f174]) ).
cnf(s29,plain,
( ~ spl2_1
| ~ spl2_3
| ~ spl2_5
| spl2_8
| ~ spl2_9
| ~ spl2_11
| ~ spl2_13
| ~ spl2_17 ),
inference(sat_conversion,[],[f21210]) ).
cnf(s30,plain,
spl2_17,
inference(rat,[],[s9,s18]) ).
cnf(s32,plain,
spl2_13,
inference(rat,[],[s7,s13]) ).
cnf(s33,plain,
spl2_11,
inference(rat,[],[s6,s19]) ).
cnf(s34,plain,
spl2_9,
inference(rat,[],[s5,s20]) ).
cnf(s35,plain,
~ spl2_8,
inference(rat,[],[s4,s10]) ).
cnf(s36,plain,
spl2_5,
inference(rat,[],[s3,s11]) ).
cnf(s37,plain,
spl2_3,
inference(rat,[],[s2,s17]) ).
cnf(s38,plain,
~ spl2_1,
inference(rat,[],[s29,s30,s32,s33,s34,s35,s36,s37]) ).
cnf(s41,plain,
$false,
inference(rat,[],[s1,s12,s38]) ).
fof(f21213,plain,
$false,
inference(avatar_sat_refutation,[],[s41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL516+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.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 15:53:25 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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
% 2.79/1.01 % (1616008)Will run a generic schedule for satisfiability detection.
% 2.79/1.01 % (1616019)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1825466491:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.79/1.01 % (1616013)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2445381346_2999 on theBenchmark for (2999ds/0Mi)
% 2.79/1.01 % (1616015)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3100990321:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.79/1.01 % (1616016)dis+10_1_sil=32000:sp=arity:random_seed=3699196194:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.79/1.01 % (1616017)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1114974158:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.79/1.01 % (1616018)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=481347760:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.79/1.01 % (1616014)% WARNING: option uhcvi not known.
% 2.79/1.01 % TRYING [1]
% 2.79/1.01 % TRYING [2]
% 2.79/1.01 % TRYING [3]
% 2.79/1.01 % (1616014)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2100069385:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.79/1.01 % TRYING [4]
% 2.79/1.01 % (1616019)Instruction limit reached!
% 2.79/1.01 % (1616019)------------------------------
% 2.79/1.01 % (1616019)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/1.01 % (1616019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.01 % (1616019)CaDiCaL version: 2.1.3
% 2.79/1.01 % (1616019)Termination reason: Instruction limit
% 2.79/1.01 % (1616019)Termination phase: Saturation
% 2.79/1.01 % (1616019)Time elapsed: 0.058 s
% 2.79/1.01 % (1616019)Peak memory usage: 14 MB
% 2.79/1.01 % (1616019)Instructions burned: 159 (million)
% 2.79/1.01 % (1616027)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3659183216:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.79/1.01 % TRYING [1]
% 2.79/1.01 % TRYING [2]
% 2.79/1.01 % TRYING [3]
% 2.79/1.01 % (1616016)Instruction limit reached!
% 2.79/1.01 % (1616016)------------------------------
% 2.79/1.01 % (1616016)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/1.01 % (1616016)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.01 % (1616016)CaDiCaL version: 2.1.3
% 2.79/1.01 % (1616016)Termination reason: Instruction limit
% 2.79/1.01 % (1616016)Termination phase: Saturation
% 2.79/1.01 % (1616016)Time elapsed: 0.068 s
% 2.79/1.01 % (1616016)Peak memory usage: 12 MB
% 2.79/1.01 % (1616016)Instructions burned: 103 (million)
% 2.79/1.01 % TRYING [4]
% 2.79/1.01 % (1616017)Instruction limit reached!
% 2.79/1.01 % (1616017)------------------------------
% 2.79/1.01 % (1616017)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/1.01 % (1616017)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.01 % (1616017)CaDiCaL version: 2.1.3
% 2.79/1.01 % (1616017)Termination reason: Instruction limit
% 2.79/1.01 % (1616017)Termination phase: Saturation
% 2.79/1.01 % (1616017)Time elapsed: 0.077 s
% 2.79/1.01 % (1616017)Peak memory usage: 12 MB
% 2.79/1.01 % (1616017)Instructions burned: 117 (million)
% 2.79/1.01 % (1616018)Instruction limit reached!
% 2.79/1.01 % (1616018)------------------------------
% 2.79/1.01 % (1616018)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/1.01 % (1616018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.01 % (1616018)CaDiCaL version: 2.1.3
% 2.79/1.01 % (1616018)Termination reason: Instruction limit
% 2.79/1.01 % (1616018)Termination phase: Saturation
% 2.79/1.01 % (1616018)Time elapsed: 0.085 s
% 2.79/1.01 % (1616018)Peak memory usage: 13 MB
% 2.79/1.01 % (1616018)Instructions burned: 132 (million)
% 2.79/1.01 % (1616029)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=464754954:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.79/1.01 % (1616030)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=2198959166:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 2.79/1.01 % (1616031)ott-21_1_sil=16000:fs=off:random_seed=2351077116:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 2.79/1.01 % (1616029)Instruction limit reached!
% 2.79/1.01 % (1616029)------------------------------
% 2.79/1.01 % (1616029)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/1.01 % (1616029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.01 % (1616029)CaDiCaL version: 2.1.3
% 2.79/1.01 % (1616029)Termination reason: Instruction limit
% 2.79/1.01 % (1616029)Termination phase: Saturation
% 2.79/1.01 % (1616029)Time elapsed: 0.089 s
% 2.79/1.01 % (1616029)Peak memory usage: 14 MB
% 2.79/1.01 % (1616029)Instructions burned: 131 (million)
% 2.79/1.01 % (1616031)Instruction limit reached!
% 2.79/1.01 % (1616031)------------------------------
% 2.79/1.01 % (1616031)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/1.01 % (1616031)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.01 % (1616031)CaDiCaL version: 2.1.3
% 2.79/1.01 % (1616031)Termination reason: Instruction limit
% 2.79/1.01 % (1616031)Termination phase: Saturation
% 2.79/1.01 % (1616031)Time elapsed: 0.089 s
% 2.79/1.01 % (1616031)Peak memory usage: 12 MB
% 2.79/1.01 % (1616031)Instructions burned: 182 (million)
% 2.79/1.01 % (1616035)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=775311871:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 2.79/1.01 % TRYING [5]
% 2.79/1.01 % TRYING [5]
% 2.79/1.01 % (1616036)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=42788038:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.79/1.01 % TRYING [1]
% 2.79/1.01 % TRYING [2]
% 2.79/1.01 % TRYING [3]
% 2.79/1.01 % (1616027)Instruction limit reached!
% 2.79/1.01 % (1616027)------------------------------
% 2.79/1.01 % (1616027)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/1.01 % (1616027)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.01 % (1616027)CaDiCaL version: 2.1.3
% 2.79/1.01 % (1616027)Termination reason: Instruction limit
% 2.79/1.01 % (1616027)Termination phase: Finite model building SAT solving
% 2.79/1.01 % (1616027)Time elapsed: 0.230 s
% 2.79/1.01 % (1616027)Peak memory usage: 16 MB
% 2.79/1.01 % (1616027)Instructions burned: 715 (million)
% 2.79/1.01 % TRYING [4]
% 2.79/1.01 % (1616039)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=933984267:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 2.79/1.01 % (1616035)Instruction limit reached!
% 2.79/1.01 % (1616035)------------------------------
% 2.79/1.01 % (1616035)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/1.01 % (1616035)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.01 % (1616035)CaDiCaL version: 2.1.3
% 2.79/1.01 % (1616035)Termination reason: Instruction limit
% 2.79/1.01 % (1616035)Termination phase: Saturation
% 2.79/1.01 % (1616035)Time elapsed: 0.311 s
% 2.79/1.01 % (1616035)Peak memory usage: 13 MB
% 2.79/1.01 % (1616035)Instructions burned: 477 (million)
% 2.79/1.01 % (1616041)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2225191064:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 2.79/1.01 % (1616030)Instruction limit reached!
% 2.79/1.01 % (1616030)------------------------------
% 2.79/1.01 % (1616030)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/1.01 % (1616030)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.01 % (1616030)CaDiCaL version: 2.1.3
% 2.79/1.01 % (1616030)Termination reason: Instruction limit
% 2.79/1.01 % (1616030)Termination phase: Saturation
% 2.79/1.01 % (1616030)Time elapsed: 0.447 s
% 2.79/1.01 % (1616030)Peak memory usage: 19 MB
% 2.79/1.01 % (1616030)Instructions burned: 684 (million)
% 2.79/1.01 % (1616043)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=3212775466: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)
% 2.79/1.01 % TRYING [14]
% 2.79/1.01 % (1616014) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1616008-1616014"...
% 2.79/1.01 % (1616014)...printing done.
% 2.79/1.01 % TRYING [5]
% 2.79/1.01 % (1616014)Refutation found. Thanks to Tanya!
% 2.79/1.01 % SZS status Theorem for theBenchmark
% 2.79/1.01 % SZS output start Proof for theBenchmark
% See solution above
% 2.79/1.02 % (1616014)------------------------------
% 2.79/1.02 % (1616014)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.79/1.02 % (1616014)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.79/1.02 % (1616014)CaDiCaL version: 2.1.3
% 2.79/1.02 % (1616014)Termination reason: Refutation
% 2.79/1.02 % (1616014)Time elapsed: 0.563 s
% 2.79/1.02 % (1616014)Peak memory usage: 26 MB
% 2.79/1.02 % (1616014)Instructions burned: 997 (million)
% 2.79/1.02 % (1616008)Success in time 0.606 s
% 2.79/1.02 % Vampire exiting
%------------------------------------------------------------------------------