%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL551+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:52:55 AM UTC 2026
% Result : Theorem 8.74s 2.13s
% Output : Refutation 9.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 40
% Number of leaves : 26
% Syntax : Number of formulae : 167 ( 80 unt; 2 def)
% Number of atoms : 291 ( 48 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 227 ( 103 ~; 92 |; 4 &)
% ( 10 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 17 ( 15 usr; 15 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 239 ( 0 sgn 237 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
( modus_tollens
<=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_tollens) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_or) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_and) ).
fof(f33,axiom,
( modus_ponens_strict_implies
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(strict_implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens_strict_implies) ).
fof(f34,axiom,
( adjunction
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(X1) )
=> is_a_theorem(and(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',adjunction) ).
fof(f35,axiom,
( substitution_strict_equiv
<=> ! [X0,X1] :
( is_a_theorem(strict_equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_strict_equiv) ).
fof(f45,axiom,
( axiom_m1
<=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m1) ).
fof(f46,axiom,
( axiom_m2
<=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m2) ).
fof(f48,axiom,
( axiom_m4
<=> ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m4) ).
fof(f49,axiom,
( axiom_m5
<=> ! [X0,X1,X2] : is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m5) ).
fof(f57,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f58,axiom,
( op_strict_equiv
=> ! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_strict_equiv) ).
fof(f62,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f64,axiom,
op_strict_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_equiv) ).
fof(f65,axiom,
modus_ponens_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_modus_ponens_strict_implies) ).
fof(f66,axiom,
substitution_strict_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_substitution_strict_equiv) ).
fof(f67,axiom,
adjunction,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_adjunction) ).
fof(f68,axiom,
axiom_m1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m1) ).
fof(f69,axiom,
axiom_m2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m2) ).
fof(f71,axiom,
axiom_m4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m4) ).
fof(f72,axiom,
axiom_m5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_axiom_m5) ).
fof(f73,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f74,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f77,conjecture,
modus_tollens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_modus_tollens) ).
fof(f78,negated_conjecture,
~ modus_tollens,
inference(negated_conjecture,[status(cth)],[f77]) ).
fof(f79,plain,
~ modus_tollens,
inference(flattening,[],[f78]) ).
fof(f80,plain,
( axiom_m5
=> ! [X0,X1,X2] : is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2))) ),
inference(unused_predicate_definition_removal,[],[f49]) ).
fof(f81,plain,
( axiom_m4
=> ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f48]) ).
fof(f83,plain,
( axiom_m2
=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f46]) ).
fof(f84,plain,
( axiom_m1
=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f45]) ).
fof(f85,plain,
( substitution_strict_equiv
=> ! [X0,X1] :
( is_a_theorem(strict_equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f35]) ).
fof(f86,plain,
( adjunction
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(X1) )
=> is_a_theorem(and(X0,X1)) ) ),
inference(unused_predicate_definition_removal,[],[f34]) ).
fof(f87,plain,
( modus_ponens_strict_implies
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(strict_implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f33]) ).
fof(f88,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
=> modus_tollens ),
inference(unused_predicate_definition_removal,[],[f3]) ).
fof(f95,plain,
( modus_tollens
| ? [X0,X1] : ~ is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
inference(ennf_transformation,[],[f88]) ).
fof(f96,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f97,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f99,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(strict_implies(X0,X1)) )
| ~ modus_ponens_strict_implies ),
inference(ennf_transformation,[],[f87]) ).
fof(f100,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(strict_implies(X0,X1)) )
| ~ modus_ponens_strict_implies ),
inference(flattening,[],[f99]) ).
fof(f101,plain,
( ! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) )
| ~ adjunction ),
inference(ennf_transformation,[],[f86]) ).
fof(f102,plain,
( ! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) )
| ~ adjunction ),
inference(flattening,[],[f101]) ).
fof(f103,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(strict_equiv(X0,X1)) )
| ~ substitution_strict_equiv ),
inference(ennf_transformation,[],[f85]) ).
fof(f104,plain,
( ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0)))
| ~ axiom_m1 ),
inference(ennf_transformation,[],[f84]) ).
fof(f105,plain,
( ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0))
| ~ axiom_m2 ),
inference(ennf_transformation,[],[f83]) ).
fof(f107,plain,
( ! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0)))
| ~ axiom_m4 ),
inference(ennf_transformation,[],[f81]) ).
fof(f108,plain,
( ! [X0,X1,X2] : is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2)))
| ~ axiom_m5 ),
inference(ennf_transformation,[],[f80]) ).
fof(f110,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f57]) ).
fof(f111,plain,
( ! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0))
| ~ op_strict_equiv ),
inference(ennf_transformation,[],[f58]) ).
fof(f112,plain,
( modus_tollens
| ~ is_a_theorem(implies(implies(not(sK1),not(sK0)),implies(sK0,sK1))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f95]) ).
fof(f114,plain,
( modus_tollens
| ~ is_a_theorem(implies(implies(not(sK1),not(sK0)),implies(sK0,sK1))) ),
inference(cnf_transformation,[],[f112]) ).
fof(f115,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f96]) ).
fof(f116,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f97]) ).
fof(f118,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(strict_implies(X0,X1))
| ~ modus_ponens_strict_implies ),
inference(cnf_transformation,[],[f100]) ).
fof(f119,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ adjunction ),
inference(cnf_transformation,[],[f102]) ).
fof(f120,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(strict_equiv(X0,X1))
| ~ substitution_strict_equiv ),
inference(cnf_transformation,[],[f103]) ).
fof(f121,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(and(X0,X1),and(X1,X0)))
| ~ axiom_m1 ),
inference(cnf_transformation,[],[f104]) ).
fof(f122,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(and(X0,X1),X0))
| ~ axiom_m2 ),
inference(cnf_transformation,[],[f105]) ).
fof(f124,plain,
! [X0] :
( is_a_theorem(strict_implies(X0,and(X0,X0)))
| ~ axiom_m4 ),
inference(cnf_transformation,[],[f107]) ).
fof(f125,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2)))
| ~ axiom_m5 ),
inference(cnf_transformation,[],[f108]) ).
fof(f127,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f110]) ).
fof(f128,plain,
! [X0,X1] :
( strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0))
| ~ op_strict_equiv ),
inference(cnf_transformation,[],[f111]) ).
fof(f131,plain,
op_strict_implies,
inference(cnf_transformation,[],[f62]) ).
fof(f133,plain,
op_strict_equiv,
inference(cnf_transformation,[],[f64]) ).
fof(f134,plain,
modus_ponens_strict_implies,
inference(cnf_transformation,[],[f65]) ).
fof(f135,plain,
substitution_strict_equiv,
inference(cnf_transformation,[],[f66]) ).
fof(f136,plain,
adjunction,
inference(cnf_transformation,[],[f67]) ).
fof(f137,plain,
axiom_m1,
inference(cnf_transformation,[],[f68]) ).
fof(f138,plain,
axiom_m2,
inference(cnf_transformation,[],[f69]) ).
fof(f140,plain,
axiom_m4,
inference(cnf_transformation,[],[f71]) ).
fof(f141,plain,
axiom_m5,
inference(cnf_transformation,[],[f72]) ).
fof(f142,plain,
op_or,
inference(cnf_transformation,[],[f73]) ).
fof(f143,plain,
op_implies_and,
inference(cnf_transformation,[],[f74]) ).
fof(f146,plain,
~ modus_tollens,
inference(cnf_transformation,[],[f79]) ).
fof(f147,plain,
! [X0,X1] : strict_equiv(X0,X1) = and(strict_implies(X0,X1),strict_implies(X1,X0)),
inference(forward_subsumption_resolution,[],[f128,f133]) ).
fof(f148,plain,
! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(forward_subsumption_resolution,[],[f127,f131]) ).
fof(f150,plain,
! [X2,X0,X1] : is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2))),
inference(forward_subsumption_resolution,[],[f125,f141]) ).
fof(f151,plain,
! [X0] : is_a_theorem(strict_implies(X0,and(X0,X0))),
inference(forward_subsumption_resolution,[],[f124,f140]) ).
fof(f153,plain,
! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)),
inference(forward_subsumption_resolution,[],[f122,f138]) ).
fof(f154,plain,
! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),and(X1,X0))),
inference(forward_subsumption_resolution,[],[f121,f137]) ).
fof(f155,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f120,f135]) ).
fof(f156,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f119,f136]) ).
fof(f157,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f118,f134]) ).
fof(f159,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f116,f143]) ).
fof(f160,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f115,f142]) ).
fof(f161,plain,
~ is_a_theorem(implies(implies(not(sK1),not(sK0)),implies(sK0,sK1))),
inference(forward_subsumption_resolution,[],[f114,f146]) ).
fof(f163,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f160,f159]) ).
fof(f165,plain,
! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2),
inference(superposition,[],[f163,f159]) ).
fof(f167,plain,
! [X0,X1] : strict_implies(not(X0),X1) = necessarily(or(X0,X1)),
inference(superposition,[],[f148,f163]) ).
fof(f181,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(and(strict_implies(X0,X1),strict_implies(X1,X2)))
| is_a_theorem(strict_implies(X0,X2)) ),
inference(resolution,[],[f150,f157]) ).
fof(f182,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(X2,X1))
| ~ is_a_theorem(strict_implies(X0,X2))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(resolution,[],[f181,f156]) ).
fof(f183,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(X0,and(X1,X1)))
| ~ is_a_theorem(strict_implies(X0,X1)) ),
inference(resolution,[],[f182,f151]) ).
fof(f184,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(X0,and(X1,X2)))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(resolution,[],[f182,f153]) ).
fof(f191,plain,
! [X0] : is_a_theorem(strict_implies(X0,X0)),
inference(resolution,[],[f184,f151]) ).
fof(f219,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X1,X0))
| ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(strict_equiv(X0,X1)) ),
inference(superposition,[],[f156,f147]) ).
fof(f228,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,and(X0,X1)))
| is_a_theorem(strict_equiv(X0,and(X0,X1))) ),
inference(resolution,[],[f219,f153]) ).
fof(f229,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(and(X0,X1),and(X1,X0)))
| is_a_theorem(strict_equiv(and(X0,X1),and(X1,X0))) ),
inference(resolution,[],[f219,f154]) ).
fof(f233,plain,
! [X0,X1] : is_a_theorem(strict_equiv(and(X0,X1),and(X1,X0))),
inference(forward_subsumption_resolution,[],[f229,f154]) ).
fof(f252,plain,
! [X0] : is_a_theorem(strict_equiv(X0,and(X0,X0))),
inference(resolution,[],[f228,f151]) ).
fof(f271,plain,
! [X0,X1] : and(X0,X1) = and(X1,X0),
inference(resolution,[],[f155,f233]) ).
fof(f272,plain,
! [X0] : and(X0,X0) = X0,
inference(resolution,[],[f155,f252]) ).
fof(f293,plain,
! [X0] : implies(not(X0),X0) = not(not(X0)),
inference(superposition,[],[f159,f272]) ).
fof(f301,plain,
! [X0] : or(X0,X0) = not(not(X0)),
inference(forward_demodulation,[],[f293,f163]) ).
fof(f305,plain,
! [X0] : strict_implies(not(X0),X0) = necessarily(not(not(X0))),
inference(superposition,[],[f167,f301]) ).
fof(f348,plain,
! [X0,X1] : implies(X1,X0) = not(and(not(X0),X1)),
inference(superposition,[],[f159,f271]) ).
fof(f387,plain,
! [X0,X1] : implies(not(X0),X1) = implies(not(X1),X0),
inference(superposition,[],[f159,f348]) ).
fof(f395,plain,
! [X0,X1] : implies(not(X0),X1) = or(X1,X0),
inference(forward_demodulation,[],[f387,f163]) ).
fof(f401,plain,
! [X0,X1] : or(X0,X1) = or(X1,X0),
inference(forward_demodulation,[],[f395,f163]) ).
fof(f407,plain,
! [X0,X1] : necessarily(or(X0,X1)) = strict_implies(not(X1),X0),
inference(superposition,[],[f167,f401]) ).
fof(f409,plain,
! [X0,X1] : strict_implies(not(X0),X1) = strict_implies(not(X1),X0),
inference(forward_demodulation,[],[f407,f167]) ).
fof(f415,plain,
! [X2,X0,X1] : strict_implies(implies(X0,X1),X2) = strict_implies(not(X2),and(not(X1),X0)),
inference(superposition,[],[f409,f348]) ).
fof(f430,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(not(and(X0,X0)),X1))
| ~ is_a_theorem(strict_implies(not(X1),X0)) ),
inference(superposition,[],[f183,f409]) ).
fof(f439,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(not(X0),X1))
| ~ is_a_theorem(strict_implies(X2,not(X1)))
| is_a_theorem(strict_implies(X2,X0)) ),
inference(superposition,[],[f182,f409]) ).
fof(f440,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(not(X0),X1))
| ~ is_a_theorem(strict_implies(X0,not(X1)))
| is_a_theorem(strict_equiv(X0,not(X1))) ),
inference(superposition,[],[f219,f409]) ).
fof(f441,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(not(X1),X0))
| is_a_theorem(strict_implies(not(X0),X1)) ),
inference(forward_demodulation,[],[f430,f272]) ).
fof(f445,plain,
! [X0] : is_a_theorem(strict_implies(not(not(X0)),X0)),
inference(resolution,[],[f441,f191]) ).
fof(f461,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,not(not(X1))))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(resolution,[],[f445,f182]) ).
fof(f475,plain,
! [X0] : is_a_theorem(strict_implies(not(not(not(not(X0)))),X0)),
inference(resolution,[],[f461,f445]) ).
fof(f516,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(implies(X0,X1),X2))
| is_a_theorem(strict_implies(not(X2),not(X1))) ),
inference(superposition,[],[f184,f415]) ).
fof(f651,plain,
! [X0,X1] : is_a_theorem(strict_implies(not(implies(X0,X1)),not(X1))),
inference(resolution,[],[f516,f191]) ).
fof(f695,plain,
! [X0] :
( ~ is_a_theorem(strict_implies(not(not(not(X0))),not(X0)))
| is_a_theorem(strict_equiv(not(not(not(X0))),not(X0))) ),
inference(resolution,[],[f475,f440]) ).
fof(f717,plain,
! [X0] : is_a_theorem(strict_equiv(not(not(not(X0))),not(X0))),
inference(forward_subsumption_resolution,[],[f695,f445]) ).
fof(f718,plain,
! [X0] : not(X0) = not(not(not(X0))),
inference(resolution,[],[f717,f155]) ).
fof(f723,plain,
! [X0,X1] : implies(X0,X1) = not(not(implies(X0,X1))),
inference(superposition,[],[f718,f348]) ).
fof(f738,plain,
! [X0,X1] : not(and(not(X0),X1)) = implies(X1,not(not(X0))),
inference(superposition,[],[f348,f718]) ).
fof(f762,plain,
! [X0,X1] : implies(X1,X0) = implies(X1,not(not(X0))),
inference(forward_demodulation,[],[f738,f348]) ).
fof(f806,plain,
! [X0,X1] : necessarily(implies(X0,X1)) = strict_implies(X0,not(not(X1))),
inference(superposition,[],[f148,f762]) ).
fof(f821,plain,
! [X0,X1] : strict_implies(X0,X1) = strict_implies(X0,not(not(X1))),
inference(forward_demodulation,[],[f806,f148]) ).
fof(f841,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(not(not(X1))) ),
inference(superposition,[],[f157,f821]) ).
fof(f845,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(not(not(X1)),X0))
| ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(strict_equiv(not(not(X1)),X0)) ),
inference(superposition,[],[f219,f821]) ).
fof(f1048,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(strict_implies(X0,not(not(X1))))
| is_a_theorem(strict_implies(X0,implies(X2,X1))) ),
inference(resolution,[],[f651,f439]) ).
fof(f1074,plain,
! [X2,X0,X1] :
( is_a_theorem(strict_implies(X0,implies(X2,X1)))
| ~ is_a_theorem(strict_implies(X0,X1)) ),
inference(forward_demodulation,[],[f1048,f821]) ).
fof(f1112,plain,
! [X0,X1] :
( is_a_theorem(necessarily(not(not(implies(X0,X1)))))
| ~ is_a_theorem(strict_implies(not(implies(X0,X1)),X1)) ),
inference(superposition,[],[f1074,f305]) ).
fof(f1115,plain,
! [X0,X1] :
( is_a_theorem(necessarily(implies(X0,X1)))
| ~ is_a_theorem(strict_implies(not(implies(X0,X1)),X1)) ),
inference(forward_demodulation,[],[f1112,f723]) ).
fof(f1120,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(not(implies(X0,X1)),X1))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(forward_demodulation,[],[f1115,f148]) ).
fof(f1127,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(not(X0),implies(X1,X0)))
| is_a_theorem(strict_implies(X1,X0)) ),
inference(superposition,[],[f1120,f409]) ).
fof(f1149,plain,
! [X0,X1] :
( ~ is_a_theorem(strict_implies(not(X1),X1))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(resolution,[],[f1127,f1074]) ).
fof(f1610,plain,
! [X0] :
( ~ is_a_theorem(strict_implies(X0,X0))
| is_a_theorem(strict_equiv(not(not(X0)),X0)) ),
inference(resolution,[],[f845,f445]) ).
fof(f1647,plain,
! [X0] : is_a_theorem(strict_equiv(not(not(X0)),X0)),
inference(forward_subsumption_resolution,[],[f1610,f191]) ).
fof(f1654,plain,
! [X0] : not(not(X0)) = X0,
inference(resolution,[],[f1647,f155]) ).
fof(f1665,plain,
! [X0] : necessarily(X0) = strict_implies(not(X0),X0),
inference(superposition,[],[f305,f1654]) ).
fof(f1684,plain,
! [X0] : necessarily(not(X0)) = strict_implies(X0,not(X0)),
inference(superposition,[],[f305,f1654]) ).
fof(f1686,plain,
! [X0,X1] : implies(X1,not(X0)) = not(and(X0,X1)),
inference(superposition,[],[f348,f1654]) ).
fof(f1744,plain,
! [X0,X1] :
( is_a_theorem(strict_implies(X1,X0))
| ~ is_a_theorem(necessarily(X0)) ),
inference(superposition,[],[f1149,f1665]) ).
fof(f2169,plain,
~ is_a_theorem(implies(not(and(sK0,not(sK1))),implies(sK0,sK1))),
inference(superposition,[],[f161,f1686]) ).
fof(f2172,plain,
~ is_a_theorem(or(and(sK0,not(sK1)),implies(sK0,sK1))),
inference(forward_demodulation,[],[f2169,f163]) ).
fof(f2194,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(sK0,sK1))),
inference(forward_demodulation,[],[f2172,f165]) ).
fof(f2286,plain,
! [X0,X1] : necessarily(implies(X0,X1)) = strict_implies(and(X0,not(X1)),implies(X0,X1)),
inference(superposition,[],[f1684,f159]) ).
fof(f2339,plain,
! [X0,X1] : strict_implies(X0,X1) = strict_implies(and(X0,not(X1)),implies(X0,X1)),
inference(forward_demodulation,[],[f2286,f148]) ).
fof(f2457,plain,
! [X0,X1] :
( ~ is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X1)
| is_a_theorem(not(not(X0))) ),
inference(resolution,[],[f1744,f841]) ).
fof(f2499,definition,
( spl2_1
<=> ! [X1] : ~ is_a_theorem(X1) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f2500,plain,
( ! [X1] : ~ is_a_theorem(X1)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f2499]) ).
fof(f2502,definition,
( spl2_2
<=> ! [X0] :
( ~ is_a_theorem(necessarily(X0))
| is_a_theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f2503,plain,
( ! [X0] :
( ~ is_a_theorem(necessarily(X0))
| is_a_theorem(X0) )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f2502]) ).
fof(f2505,plain,
! [X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X1) ),
inference(forward_demodulation,[],[f2457,f1654]) ).
fof(f2512,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f2505,f2502,f2499]) ).
fof(f2804,plain,
( ! [X0,X1] :
( ~ is_a_theorem(strict_implies(X0,X1))
| is_a_theorem(implies(X0,X1)) )
| ~ spl2_2 ),
inference(superposition,[],[f2503,f148]) ).
fof(f2809,plain,
( ! [X0] : is_a_theorem(implies(X0,X0))
| ~ spl2_2 ),
inference(resolution,[],[f2804,f191]) ).
fof(f2905,plain,
( $false
| ~ spl2_2 ),
inference(resolution,[],[f2809,f2194]) ).
fof(f2910,plain,
~ spl2_2,
inference(avatar_contradiction_clause,[],[f2905]) ).
fof(f3025,plain,
! [X2,X0,X1] : is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(implies(X0,X1),X2)),strict_implies(and(X0,not(X1)),X2))),
inference(superposition,[],[f150,f2339]) ).
fof(f3041,plain,
( $false
| ~ spl2_1 ),
inference(forward_subsumption_resolution,[],[f3025,f2500]) ).
fof(f3042,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f3041]) ).
cnf(s3,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f2512]) ).
cnf(s7,plain,
~ spl2_2,
inference(sat_conversion,[],[f2910]) ).
cnf(s10,plain,
~ spl2_1,
inference(sat_conversion,[],[f3042]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s3,s7,s10]) ).
fof(f3073,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL551+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n011.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 16:00:45 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.74/2.13 % (2587835)Detected formulas, will run a generic FOF schedule.
% 8.74/2.13 % (2587846)dis-21_1_sil=8000:lcm=predicate:random_seed=3204252979:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 8.74/2.13 % (2587846)Refutation not found, incomplete strategy
% 8.74/2.13 % (2587846)------------------------------
% 8.74/2.13 % (2587846)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587846)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587846)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587846)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.13 % (2587846)Time elapsed: 0.001 s
% 8.74/2.13 % (2587846)Peak memory usage: 88 MB
% 8.74/2.13 % (2587846)Instructions burned: 1 (million)
% 8.74/2.13 % (2587842)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=444286815:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 8.74/2.13 % (2587840)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2534289113:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 8.74/2.13 % (2587841)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2752282464:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 8.74/2.13 % (2587844)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2228432282:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 8.74/2.13 % (2587843)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1231504068:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 8.74/2.13 % (2587845)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=345547222:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 8.74/2.13 % (2587844)Refutation not found, incomplete strategy
% 8.74/2.13 % (2587844)------------------------------
% 8.74/2.13 % (2587844)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587844)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587844)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587844)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.13 % (2587844)Time elapsed: 0.001 s
% 8.74/2.13 % (2587843)Refutation not found, incomplete strategy
% 8.74/2.13 % (2587843)------------------------------
% 8.74/2.13 % (2587843)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587844)Peak memory usage: 86 MB
% 8.74/2.13 % (2587843)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587843)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587843)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.13 % (2587843)Time elapsed: 0.001 s
% 8.74/2.13 % (2587843)Peak memory usage: 87 MB
% 8.74/2.13 % (2587845)Instruction limit reached!
% 8.74/2.13 % (2587845)------------------------------
% 8.74/2.13 % (2587845)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587845)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587845)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587845)Termination reason: Instruction limit
% 8.74/2.13 % (2587845)Termination phase: Saturation
% 8.74/2.13 % (2587845)Time elapsed: 0.092 s
% 8.74/2.13 % (2587845)Peak memory usage: 90 MB
% 8.74/2.13 % (2587845)Instructions burned: 140 (million)
% 8.74/2.13 % (2587846)------------------------------
% 8.74/2.13 % (2587846)------------------------------
% 8.74/2.13 % (2587854)lrs+10_1_sil=8000:sp=occurrence:random_seed=1336818819:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 8.74/2.13 % (2587854)Refutation not found, incomplete strategy
% 8.74/2.13 % (2587854)------------------------------
% 8.74/2.13 % (2587854)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587854)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587854)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587854)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.13 % (2587854)Time elapsed: 0.001 s
% 8.74/2.13 % (2587854)Peak memory usage: 87 MB
% 8.74/2.13 % (2587844)------------------------------
% 8.74/2.13 % (2587844)------------------------------
% 8.74/2.13 % (2587843)------------------------------
% 8.74/2.13 % (2587843)------------------------------
% 8.74/2.13 % (2587855)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2301460328:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 8.74/2.13 % (2587855)Refutation not found, incomplete strategy
% 8.74/2.13 % (2587855)------------------------------
% 8.74/2.13 % (2587855)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587855)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587855)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587855)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.13 % (2587855)Time elapsed: 0.0000 s
% 8.74/2.13 % (2587855)Peak memory usage: 87 MB
% 8.74/2.13 % (2587857)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1343378561:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 8.74/2.13 % (2587858)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=2059344991:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 8.74/2.13 % (2587857)Refutation not found, incomplete strategy
% 8.74/2.13 % (2587857)------------------------------
% 8.74/2.13 % (2587857)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587857)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587857)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587857)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.13 % (2587857)Time elapsed: 0.001 s
% 8.74/2.13 % (2587857)Peak memory usage: 87 MB
% 8.74/2.13 % (2587855)------------------------------
% 8.74/2.13 % (2587855)------------------------------
% 8.74/2.13 % (2587854)------------------------------
% 8.74/2.13 % (2587854)------------------------------
% 8.74/2.13 % (2587862)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=652618240:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2994 on theBenchmark for (2994ds/294Mi)
% 8.74/2.13 % (2587862)Refutation not found, incomplete strategy
% 8.74/2.13 % (2587862)------------------------------
% 8.74/2.13 % (2587862)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587862)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587862)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.13 % (2587862)Time elapsed: 0.0000 s
% 8.74/2.13 % (2587862)Peak memory usage: 87 MB
% 8.74/2.13 % (2587858)Instruction limit reached!
% 8.74/2.13 % (2587858)------------------------------
% 8.74/2.13 % (2587858)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587858)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587858)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587858)Termination reason: Instruction limit
% 8.74/2.13 % (2587858)Termination phase: Saturation
% 8.74/2.13 % (2587858)Time elapsed: 0.148 s
% 8.74/2.13 % (2587858)Peak memory usage: 92 MB
% 8.74/2.13 % (2587858)Instructions burned: 249 (million)
% 8.74/2.13 % (2587842)Refutation not found, incomplete strategy
% 8.74/2.13 % (2587842)------------------------------
% 8.74/2.13 % (2587842)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587842)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587842)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587842)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.13 % (2587842)Time elapsed: 0.565 s
% 8.74/2.13 % (2587842)Peak memory usage: 126 MB
% 8.74/2.13 % (2587842)Instructions burned: 830 (million)
% 8.74/2.13 % (2587863)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1122109504:i=2350_2993 on theBenchmark for (2993ds/2350Mi)
% 8.74/2.13 % (2587857)------------------------------
% 8.74/2.13 % (2587857)------------------------------
% 8.74/2.13 % (2587862)------------------------------
% 8.74/2.13 % (2587862)------------------------------
% 8.74/2.13 % (2587865)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2417470917:cts=off:i=113:fsr=off:ss=included:sgt=4_2993 on theBenchmark for (2993ds/113Mi)
% 8.74/2.13 % (2587865)Refutation not found, incomplete strategy
% 8.74/2.13 % (2587865)------------------------------
% 8.74/2.13 % (2587865)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587865)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587865)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587865)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.13 % (2587865)Time elapsed: 0.001 s
% 8.74/2.13 % (2587865)Peak memory usage: 88 MB
% 8.74/2.13 % (2587868)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=4098476126:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2991 on theBenchmark for (2991ds/114Mi)
% 8.74/2.13 % (2587868)Refutation not found, incomplete strategy
% 8.74/2.13 % (2587868)------------------------------
% 8.74/2.13 % (2587868)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587868)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587868)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587868)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.13 % (2587868)Time elapsed: 0.0000 s
% 8.74/2.13 % (2587868)Peak memory usage: 87 MB
% 8.74/2.13 % (2587867)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1805139933:i=127:av=off:fsr=off:sup=off_2991 on theBenchmark for (2991ds/127Mi)
% 8.74/2.13 % (2587842)------------------------------
% 8.74/2.13 % (2587842)------------------------------
% 8.74/2.13 % (2587840)First to succeed.
% 8.74/2.13 % (2587840)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2587835"
% 8.74/2.13 % (2587867)Instruction limit reached!
% 8.74/2.13 % (2587867)------------------------------
% 8.74/2.13 % (2587867)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587867)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587867)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587867)Termination reason: Instruction limit
% 8.74/2.13 % (2587867)Termination phase: Saturation
% 8.74/2.13 % (2587867)Time elapsed: 0.067 s
% 8.74/2.13 % (2587867)Peak memory usage: 88 MB
% 8.74/2.13 % (2587867)Instructions burned: 128 (million)
% 8.74/2.13 % (2587868)------------------------------
% 8.74/2.13 % (2587868)------------------------------
% 8.74/2.13 % (2587865)------------------------------
% 8.74/2.13 % (2587865)------------------------------
% 8.74/2.13 % (2587872)lrs+10_1_sil=8000:sp=occurrence:random_seed=1526631330:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2990 on theBenchmark for (2990ds/907Mi)
% 8.74/2.13 % (2587873)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=3247724027:i=437:sd=1:aac=none:ss=included_2989 on theBenchmark for (2989ds/437Mi)
% 8.74/2.13 % (2587873)Refutation not found, incomplete strategy
% 8.74/2.13 % (2587873)------------------------------
% 8.74/2.13 % (2587873)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587873)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587873)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587873)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.13 % (2587873)Time elapsed: 0.001 s
% 8.74/2.13 % (2587873)Peak memory usage: 88 MB
% 8.74/2.13 % (2587874)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3789789403:i=5202:ss=axioms:sgt=16_2989 on theBenchmark for (2989ds/5202Mi)
% 8.74/2.13 % (2587875)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=2618428077:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2989 on theBenchmark for (2989ds/134Mi)
% 8.74/2.13 % (2587875)Refutation not found, incomplete strategy
% 8.74/2.13 % (2587875)------------------------------
% 8.74/2.13 % (2587875)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.74/2.13 % (2587875)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.74/2.13 % (2587875)CaDiCaL version: 2.1.3
% 8.74/2.13 % (2587875)Termination reason: Refutation not found, incomplete strategy
% 8.74/2.13 % (2587875)Time elapsed: 0.001 s
% 8.74/2.13 % (2587875)Peak memory usage: 89 MB
% 8.74/2.13 % (2587840)Refutation found. Thanks to Tanya!
% 8.74/2.13 % SZS status Theorem for theBenchmark
% 8.74/2.13 % SZS output start Proof for theBenchmark
% See solution above
% 9.55/2.27 % (2587840)------------------------------
% 9.55/2.27 % (2587840)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.55/2.27 % (2587840)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.55/2.27 % (2587840)CaDiCaL version: 2.1.3
% 9.55/2.27 % (2587840)Termination reason: Refutation
% 9.55/2.27 % (2587840)Time elapsed: 0.855 s
% 9.55/2.27 % (2587840)Peak memory usage: 131 MB
% 9.55/2.27 % (2587840)Instructions burned: 1270 (million)
% 9.55/2.27 % (2587840)------------------------------
% 9.55/2.27 % (2587840)------------------------------
% 9.55/2.27 % (2587835)Success in time 1.28 s
% 9.55/2.27 % Vampire exiting
%------------------------------------------------------------------------------