%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL475+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 : n017.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:33 AM UTC 2026
% Result : Theorem 11.68s 2.65s
% Output : Refutation 13.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 45
% Number of leaves : 22
% Syntax : Number of formulae : 153 ( 44 unt; 2 def)
% Number of atoms : 318 ( 25 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 314 ( 149 ~; 141 |; 2 &)
% ( 8 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 15 ( 13 usr; 13 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 273 ( 0 sgn 272 !; 1 ?)
% 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/theBenchmark.p',modus_ponens) ).
fof(f2,axiom,
( substitution_of_equivalents
<=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_of_equivalents) ).
fof(f19,axiom,
( cn1
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn1) ).
fof(f20,axiom,
( cn2
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn2) ).
fof(f21,axiom,
( cn3
<=> ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn3) ).
fof(f22,axiom,
( r1
<=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r1) ).
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(f28,axiom,
( op_and
=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_and) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_or) ).
fof(f31,axiom,
( op_equiv
=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_equiv) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_op_or) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_modus_ponens) ).
fof(f36,axiom,
cn1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn1) ).
fof(f37,axiom,
cn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).
fof(f38,axiom,
cn3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn3) ).
fof(f39,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',use_substitution_of_equivalents) ).
fof(f40,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f41,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_and) ).
fof(f42,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_equiv) ).
fof(f43,conjecture,
r1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r1) ).
fof(f44,negated_conjecture,
~ r1,
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f45,plain,
~ r1,
inference(flattening,[],[f44]) ).
fof(f46,plain,
( ! [X0] : is_a_theorem(implies(or(X0,X0),X0))
=> r1 ),
inference(unused_predicate_definition_removal,[],[f22]) ).
fof(f47,plain,
( cn3
=> ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f21]) ).
fof(f48,plain,
( cn2
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(unused_predicate_definition_removal,[],[f20]) ).
fof(f49,plain,
( cn1
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f19]) ).
fof(f50,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
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(f54,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f51]) ).
fof(f55,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f54]) ).
fof(f56,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f50]) ).
fof(f57,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ cn1 ),
inference(ennf_transformation,[],[f49]) ).
fof(f58,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ cn2 ),
inference(ennf_transformation,[],[f48]) ).
fof(f59,plain,
( ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0))
| ~ cn3 ),
inference(ennf_transformation,[],[f47]) ).
fof(f60,plain,
( r1
| ? [X0] : ~ is_a_theorem(implies(or(X0,X0),X0)) ),
inference(ennf_transformation,[],[f46]) ).
fof(f61,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f62,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(ennf_transformation,[],[f28]) ).
fof(f63,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f64,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f65,plain,
( r1
| ~ is_a_theorem(implies(or(sK0,sK0),sK0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f60]) ).
fof(f66,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f55]) ).
fof(f67,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f56]) ).
fof(f68,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ cn1 ),
inference(cnf_transformation,[],[f57]) ).
fof(f69,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ cn2 ),
inference(cnf_transformation,[],[f58]) ).
fof(f70,plain,
! [X0] :
( is_a_theorem(implies(implies(not(X0),X0),X0))
| ~ cn3 ),
inference(cnf_transformation,[],[f59]) ).
fof(f71,plain,
( r1
| ~ is_a_theorem(implies(or(sK0,sK0),sK0)) ),
inference(cnf_transformation,[],[f65]) ).
fof(f72,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f61]) ).
fof(f73,plain,
! [X0,X1] :
( and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(cnf_transformation,[],[f62]) ).
fof(f74,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f63]) ).
fof(f75,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f64]) ).
fof(f76,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f78,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f79,plain,
cn1,
inference(cnf_transformation,[],[f36]) ).
fof(f80,plain,
cn2,
inference(cnf_transformation,[],[f37]) ).
fof(f81,plain,
cn3,
inference(cnf_transformation,[],[f38]) ).
fof(f82,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f39]) ).
fof(f83,plain,
op_implies_or,
inference(cnf_transformation,[],[f40]) ).
fof(f84,plain,
op_and,
inference(cnf_transformation,[],[f41]) ).
fof(f85,plain,
op_equiv,
inference(cnf_transformation,[],[f42]) ).
fof(f86,plain,
~ r1,
inference(cnf_transformation,[],[f45]) ).
fof(f87,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(forward_subsumption_resolution,[],[f75,f85]) ).
fof(f88,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(forward_subsumption_resolution,[],[f74,f83]) ).
fof(f89,plain,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f73,f84]) ).
fof(f90,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f72,f76]) ).
fof(f91,plain,
~ is_a_theorem(implies(or(sK0,sK0),sK0)),
inference(forward_subsumption_resolution,[],[f71,f86]) ).
fof(f92,plain,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
inference(forward_subsumption_resolution,[],[f70,f81]) ).
fof(f93,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(forward_subsumption_resolution,[],[f69,f80]) ).
fof(f94,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(forward_subsumption_resolution,[],[f68,f79]) ).
fof(f95,plain,
! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f67,f82]) ).
fof(f96,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f66,f78]) ).
fof(f97,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[],[f89,f88]) ).
fof(f100,plain,
! [X2,X0,X1] : is_a_theorem(implies(and(not(X0),not(X1)),implies(or(X0,X1),X2))),
inference(superposition,[],[f93,f90]) ).
fof(f101,plain,
! [X2,X0,X1] : implies(and(not(X0),not(X1)),X2) = or(or(X0,X1),X2),
inference(superposition,[],[f88,f90]) ).
fof(f102,plain,
! [X2,X0,X1] : is_a_theorem(or(or(X0,X1),implies(or(X0,X1),X2))),
inference(forward_demodulation,[],[f100,f101]) ).
fof(f104,plain,
! [X0,X1] :
( is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f96,f93]) ).
fof(f106,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f96,f94]) ).
fof(f108,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f106,f96]) ).
fof(f109,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f108,f93]) ).
fof(f110,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f108,f92]) ).
fof(f111,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X0,implies(implies(X2,X3),implies(X1,X3))))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f108,f94]) ).
fof(f112,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X0,implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(resolution,[],[f108,f106]) ).
fof(f113,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f110,f93]) ).
fof(f120,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X1,not(X0))) ),
inference(resolution,[],[f112,f93]) ).
fof(f125,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f120,f110]) ).
fof(f126,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,not(X1)))
| is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,X0)) ),
inference(resolution,[],[f120,f112]) ).
fof(f135,plain,
! [X2,X0,X1] : implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(superposition,[],[f88,f97]) ).
fof(f141,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(X3,implies(X2,X4)))
| is_a_theorem(implies(X0,implies(X3,implies(X1,X4))))
| ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f111,f112]) ).
fof(f143,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(X2,X3),implies(X1,X3))) ),
inference(resolution,[],[f111,f96]) ).
fof(f185,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(not(not(X0)),not(X0))))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f126,f92]) ).
fof(f194,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X2,implies(not(X1),X3))) ),
inference(resolution,[],[f109,f108]) ).
fof(f252,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(not(X0),X2)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f143,f93]) ).
fof(f321,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f125,f104]) ).
fof(f335,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X3,X0))
| is_a_theorem(implies(X2,implies(X3,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f321,f112]) ).
fof(f413,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(implies(X1,not(X0)),X2)))
| ~ is_a_theorem(implies(not(not(X0)),X1)) ),
inference(resolution,[],[f185,f106]) ).
fof(f427,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,or(and(X1,X0),X2)))
| ~ is_a_theorem(implies(not(not(X0)),X1)) ),
inference(forward_demodulation,[],[f413,f135]) ).
fof(f479,definition,
( spl1_7
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl1_7])],[avatar_definition]) ).
fof(f480,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl1_7 ),
inference(avatar_component_clause,[],[f479]) ).
fof(f529,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X1),X3),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f335,f93]) ).
fof(f710,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(not(X0),X0),implies(not(X1),X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f194,f92]) ).
fof(f748,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X0),X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f710,f110]) ).
fof(f773,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X2,implies(not(X0),X0)))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X2,X1)) ),
inference(resolution,[],[f748,f108]) ).
fof(f831,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X2,X0),X1))
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f773,f252]) ).
fof(f980,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X0,implies(X1,implies(X2,X3))))
| ~ is_a_theorem(implies(X0,implies(X2,not(X1)))) ),
inference(resolution,[],[f141,f93]) ).
fof(f1105,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X1))),
inference(resolution,[],[f529,f92]) ).
fof(f1145,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X2)))),
inference(resolution,[],[f1105,f529]) ).
fof(f1287,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))) ),
inference(resolution,[],[f1145,f143]) ).
fof(f1328,definition,
( spl1_11
<=> ! [X2,X1,X3] : is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))) ),
introduced(definition,[new_symbols(definition,[spl1_11])],[avatar_definition]) ).
fof(f1329,plain,
( ! [X2,X3,X1] : is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2)))
| ~ spl1_11 ),
inference(avatar_component_clause,[],[f1328]) ).
fof(f1330,plain,
( spl1_11
| spl1_7 ),
inference(avatar_split_clause,[],[f1287,f479,f1328]) ).
fof(f1331,plain,
( $false
| ~ spl1_7 ),
inference(resolution,[],[f480,f113]) ).
fof(f1382,plain,
~ spl1_7,
inference(avatar_contradiction_clause,[],[f1331]) ).
fof(f1387,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X0),X1),X1))
| ~ spl1_11 ),
inference(resolution,[],[f1329,f110]) ).
fof(f1395,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(implies(X1,X1),X2)))
| is_a_theorem(implies(X0,implies(X3,X2))) )
| ~ spl1_11 ),
inference(resolution,[],[f1329,f108]) ).
fof(f1413,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(implies(X1,X1),X2)))
| is_a_theorem(implies(X0,X2)) )
| ~ spl1_11 ),
inference(resolution,[],[f1387,f108]) ).
fof(f1445,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,X2),X0))
| is_a_theorem(implies(implies(X0,X1),X1)) )
| ~ spl1_11 ),
inference(resolution,[],[f1413,f106]) ).
fof(f1477,plain,
( ! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) )
| ~ spl1_11 ),
inference(resolution,[],[f1445,f321]) ).
fof(f1517,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X0,X2)))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X2)) )
| ~ spl1_11 ),
inference(resolution,[],[f1477,f108]) ).
fof(f1546,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X2,implies(X3,X0)))
| is_a_theorem(implies(X2,implies(X3,X1)))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl1_11 ),
inference(resolution,[],[f1517,f111]) ).
fof(f1550,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(X2,X0),implies(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl1_11 ),
inference(resolution,[],[f1517,f94]) ).
fof(f1749,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X3,X2))
| is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X1,X3)) )
| ~ spl1_11 ),
inference(resolution,[],[f1546,f1550]) ).
fof(f1985,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(not(X2),X2)))
| is_a_theorem(implies(implies(X0,X1),implies(X0,X2))) )
| ~ spl1_11 ),
inference(resolution,[],[f1749,f92]) ).
fof(f2016,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),X1)),implies(X0,X1)))
| ~ spl1_11 ),
inference(resolution,[],[f1985,f113]) ).
fof(f2055,plain,
( ! [X0] : is_a_theorem(implies(implies(not(X0),implies(not(X0),X0)),X0))
| ~ spl1_11 ),
inference(resolution,[],[f2016,f110]) ).
fof(f2530,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),implies(not(X1),X1))))
| is_a_theorem(implies(X0,X1)) )
| ~ spl1_11 ),
inference(resolution,[],[f2055,f108]) ).
fof(f4921,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),not(not(X1)))))
| is_a_theorem(implies(X0,X1)) )
| ~ spl1_11 ),
inference(resolution,[],[f2530,f980]) ).
fof(f4974,plain,
( ! [X0,X1] :
( is_a_theorem(implies(implies(not(X0),X1),X0))
| ~ is_a_theorem(implies(X1,not(not(X0)))) )
| ~ spl1_11 ),
inference(resolution,[],[f4921,f1550]) ).
fof(f5041,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(X2,implies(X0,X1))))
| ~ spl1_11 ),
inference(resolution,[],[f1395,f94]) ).
fof(f8593,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,not(not(implies(not(X1),not(not(X1)))))))
| is_a_theorem(implies(implies(not(implies(not(X1),not(not(X1)))),X0),X1)) )
| ~ spl1_11 ),
inference(resolution,[],[f4974,f4921]) ).
fof(f8626,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,not(and(not(X1),not(X1)))))
| is_a_theorem(implies(implies(not(implies(not(X1),not(not(X1)))),X0),X1)) )
| ~ spl1_11 ),
inference(forward_demodulation,[],[f8593,f97]) ).
fof(f8629,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,or(X1,X1)))
| is_a_theorem(implies(implies(not(implies(not(X1),not(not(X1)))),X0),X1)) )
| ~ spl1_11 ),
inference(forward_demodulation,[],[f8626,f90]) ).
fof(f8631,plain,
( ! [X0,X1] :
( is_a_theorem(implies(implies(and(not(X1),not(X1)),X0),X1))
| ~ is_a_theorem(implies(X0,or(X1,X1))) )
| ~ spl1_11 ),
inference(forward_demodulation,[],[f8629,f97]) ).
fof(f8632,plain,
( ! [X0,X1] :
( is_a_theorem(implies(or(or(X1,X1),X0),X1))
| ~ is_a_theorem(implies(X0,or(X1,X1))) )
| ~ spl1_11 ),
inference(forward_demodulation,[],[f8631,f101]) ).
fof(f8633,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(or(X1,X1),X0))
| ~ is_a_theorem(implies(X0,or(X1,X1)))
| is_a_theorem(X1) )
| ~ spl1_11 ),
inference(resolution,[],[f8632,f96]) ).
fof(f8783,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(implies(or(X0,X0),X1),or(X0,X0)))
| is_a_theorem(X0) )
| ~ spl1_11 ),
inference(resolution,[],[f8633,f102]) ).
fof(f8791,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X1,or(X0,X0)))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) )
| ~ spl1_11 ),
inference(resolution,[],[f8783,f831]) ).
fof(f8826,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(not(not(X1)),X0))
| ~ is_a_theorem(X1)
| is_a_theorem(and(X0,X1)) )
| ~ spl1_11 ),
inference(resolution,[],[f8791,f427]) ).
fof(f8926,plain,
( ! [X0,X1] :
( is_a_theorem(and(X1,X0))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) )
| ~ spl1_11 ),
inference(resolution,[],[f8826,f321]) ).
fof(f8945,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(equiv(X0,X1))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl1_11 ),
inference(superposition,[],[f8926,f87]) ).
fof(f8963,plain,
( ! [X0] :
( is_a_theorem(equiv(X0,implies(not(X0),X0)))
| ~ is_a_theorem(implies(X0,implies(not(X0),X0))) )
| ~ spl1_11 ),
inference(resolution,[],[f8945,f92]) ).
fof(f9030,plain,
( ! [X0] : is_a_theorem(equiv(X0,implies(not(X0),X0)))
| ~ spl1_11 ),
inference(forward_subsumption_resolution,[],[f8963,f93]) ).
fof(f9033,plain,
( ! [X0] : implies(not(X0),X0) = X0
| ~ spl1_11 ),
inference(resolution,[],[f9030,f95]) ).
fof(f9253,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0)))
| ~ spl1_11 ),
inference(superposition,[],[f5041,f9033]) ).
fof(f9373,plain,
( ! [X0] : is_a_theorem(implies(not(not(X0)),X0))
| ~ spl1_11 ),
inference(resolution,[],[f9253,f4921]) ).
fof(f9620,plain,
( ! [X0] : is_a_theorem(implies(not(not(implies(not(X0),not(not(X0))))),X0))
| ~ spl1_11 ),
inference(resolution,[],[f9373,f4921]) ).
fof(f9659,plain,
( ! [X0] : is_a_theorem(implies(not(and(not(X0),not(X0))),X0))
| ~ spl1_11 ),
inference(forward_demodulation,[],[f9620,f97]) ).
fof(f9671,plain,
( ! [X0] : is_a_theorem(implies(or(X0,X0),X0))
| ~ spl1_11 ),
inference(forward_demodulation,[],[f9659,f90]) ).
fof(f9676,plain,
( $false
| ~ spl1_11 ),
inference(resolution,[],[f9671,f91]) ).
fof(f9743,plain,
~ spl1_11,
inference(avatar_contradiction_clause,[],[f9676]) ).
cnf(s14,plain,
( spl1_7
| spl1_11 ),
inference(sat_conversion,[],[f1330]) ).
cnf(s28,plain,
~ spl1_7,
inference(sat_conversion,[],[f1382]) ).
cnf(s152,plain,
~ spl1_11,
inference(sat_conversion,[],[f9743]) ).
cnf(s153,plain,
$false,
inference(rat,[],[s14,s152,s28]) ).
fof(f9772,plain,
$false,
inference(avatar_sat_refutation,[],[s153]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL475+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.10/0.37 % Computer : n017.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 15:44:35 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 11.25/2.53 % (2759761)Detected formulas, will run a generic FOF schedule.
% 11.25/2.53 % (2759766)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=2627158191:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 11.25/2.53 % (2759770)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1688657444:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 11.25/2.53 % (2759768)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=4108349346:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 11.25/2.53 % (2759769)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1048730944:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 11.25/2.53 % (2759767)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=4163778419:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 11.25/2.53 % (2759772)dis-21_1_sil=8000:lcm=predicate:random_seed=2755430693: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)
% 11.25/2.53 % (2759771)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=148778318:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 11.25/2.53 % (2759770)Refutation not found, incomplete strategy
% 11.25/2.53 % (2759770)------------------------------
% 11.25/2.53 % (2759770)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.25/2.53 % (2759770)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.25/2.53 % (2759770)CaDiCaL version: 2.1.3
% 11.25/2.53 % (2759770)Termination reason: Refutation not found, incomplete strategy
% 11.25/2.53 % (2759770)Time elapsed: 0.001 s
% 11.25/2.53 % (2759769)Refutation not found, incomplete strategy
% 11.25/2.53 % (2759769)------------------------------
% 11.25/2.53 % (2759769)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.25/2.53 % (2759770)Peak memory usage: 86 MB
% 11.25/2.53 % (2759769)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.25/2.53 % (2759769)CaDiCaL version: 2.1.3
% 11.25/2.53 % (2759769)Termination reason: Refutation not found, incomplete strategy
% 11.25/2.53 % (2759769)Time elapsed: 0.001 s
% 11.25/2.53 % (2759769)Peak memory usage: 87 MB
% 11.25/2.53 % (2759772)Refutation not found, incomplete strategy
% 11.25/2.53 % (2759772)------------------------------
% 11.25/2.53 % (2759772)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.25/2.53 % (2759772)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.25/2.53 % (2759772)CaDiCaL version: 2.1.3
% 11.25/2.53 % (2759772)Termination reason: Refutation not found, incomplete strategy
% 11.25/2.53 % (2759772)Time elapsed: 0.002 s
% 11.25/2.53 % (2759772)Peak memory usage: 88 MB
% 11.25/2.53 % (2759772)Instructions burned: 1 (million)
% 11.25/2.53 % (2759771)Instruction limit reached!
% 11.25/2.53 % (2759771)------------------------------
% 11.25/2.53 % (2759771)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.25/2.53 % (2759771)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.25/2.53 % (2759771)CaDiCaL version: 2.1.3
% 11.25/2.53 % (2759771)Termination reason: Instruction limit
% 11.25/2.53 % (2759771)Termination phase: Saturation
% 11.25/2.53 % (2759771)Time elapsed: 0.090 s
% 11.25/2.53 % (2759771)Peak memory usage: 90 MB
% 11.25/2.53 % (2759771)Instructions burned: 139 (million)
% 11.25/2.53 % (2759772)------------------------------
% 11.25/2.53 % (2759772)------------------------------
% 11.25/2.53 % (2759770)------------------------------
% 11.25/2.53 % (2759770)------------------------------
% 11.25/2.53 % (2759769)------------------------------
% 11.25/2.53 % (2759769)------------------------------
% 11.25/2.53 % (2759780)lrs+10_1_sil=8000:sp=occurrence:random_seed=1471767133:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 11.25/2.53 % (2759780)Refutation not found, incomplete strategy
% 11.25/2.53 % (2759780)------------------------------
% 11.25/2.53 % (2759780)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.25/2.53 % (2759780)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.25/2.53 % (2759780)CaDiCaL version: 2.1.3
% 11.25/2.53 % (2759780)Termination reason: Refutation not found, incomplete strategy
% 11.68/2.65 % (2759780)Time elapsed: 0.001 s
% 11.68/2.65 % (2759780)Peak memory usage: 87 MB
% 11.68/2.65 % (2759782)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4120279626:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 11.68/2.65 % (2759781)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3404834220:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2995 on theBenchmark for (2995ds/157Mi)
% 11.68/2.65 % (2759783)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=2466260594:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 11.68/2.65 % (2759782)Refutation not found, incomplete strategy
% 11.68/2.65 % (2759782)------------------------------
% 11.68/2.65 % (2759782)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.68/2.65 % (2759782)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.68/2.65 % (2759782)CaDiCaL version: 2.1.3
% 11.68/2.65 % (2759782)Termination reason: Refutation not found, incomplete strategy
% 11.68/2.65 % (2759782)Time elapsed: 0.001 s
% 11.68/2.65 % (2759782)Peak memory usage: 86 MB
% 11.68/2.65 % (2759781)Refutation not found, incomplete strategy
% 11.68/2.65 % (2759781)------------------------------
% 11.68/2.65 % (2759781)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.68/2.65 % (2759781)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.68/2.65 % (2759781)CaDiCaL version: 2.1.3
% 11.68/2.65 % (2759781)Termination reason: Refutation not found, incomplete strategy
% 11.68/2.65 % (2759781)Time elapsed: 0.001 s
% 11.68/2.65 % (2759781)Peak memory usage: 87 MB
% 11.68/2.65 % (2759780)------------------------------
% 11.68/2.65 % (2759780)------------------------------
% 11.68/2.65 % (2759768)Refutation not found, incomplete strategy
% 11.68/2.65 % (2759768)------------------------------
% 11.68/2.65 % (2759768)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.68/2.65 % (2759768)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.68/2.65 % (2759768)CaDiCaL version: 2.1.3
% 11.68/2.65 % (2759768)Termination reason: Refutation not found, incomplete strategy
% 11.68/2.65 % (2759768)Time elapsed: 0.556 s
% 11.68/2.65 % (2759768)Peak memory usage: 126 MB
% 11.68/2.65 % (2759768)Instructions burned: 828 (million)
% 11.68/2.65 % (2759783)Instruction limit reached!
% 11.68/2.65 % (2759783)------------------------------
% 11.68/2.65 % (2759783)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.68/2.65 % (2759783)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.68/2.65 % (2759783)CaDiCaL version: 2.1.3
% 11.68/2.65 % (2759783)Termination reason: Instruction limit
% 11.68/2.65 % (2759783)Termination phase: Saturation
% 11.68/2.65 % (2759783)Time elapsed: 0.156 s
% 11.68/2.65 % (2759783)Peak memory usage: 92 MB
% 11.68/2.65 % (2759783)Instructions burned: 249 (million)
% 11.68/2.65 % (2759782)------------------------------
% 11.68/2.65 % (2759782)------------------------------
% 11.68/2.65 % (2759781)------------------------------
% 11.68/2.65 % (2759781)------------------------------
% 11.68/2.65 % (2759788)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=4223105754:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2993 on theBenchmark for (2993ds/294Mi)
% 11.68/2.65 % (2759788)Refutation not found, incomplete strategy
% 11.68/2.65 % (2759788)------------------------------
% 11.68/2.65 % (2759788)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.68/2.65 % (2759788)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.68/2.65 % (2759788)CaDiCaL version: 2.1.3
% 11.68/2.65 % (2759788)Termination reason: Refutation not found, incomplete strategy
% 11.68/2.65 % (2759788)Time elapsed: 0.001 s
% 11.68/2.65 % (2759788)Peak memory usage: 87 MB
% 11.68/2.65 % (2759789)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1955130793:i=2350_2992 on theBenchmark for (2992ds/2350Mi)
% 11.68/2.65 % (2759768)------------------------------
% 11.68/2.65 % (2759768)------------------------------
% 11.68/2.65 % (2759790)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3689335692:cts=off:i=113:fsr=off:ss=included:sgt=4_2991 on theBenchmark for (2991ds/113Mi)
% 11.68/2.65 % (2759791)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1415620994:i=127:av=off:fsr=off:sup=off_2991 on theBenchmark for (2991ds/127Mi)
% 11.68/2.65 % (2759790)Refutation not found, incomplete strategy
% 11.68/2.65 % (2759790)------------------------------
% 11.68/2.65 % (2759790)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.68/2.65 % (2759790)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.68/2.65 % (2759790)CaDiCaL version: 2.1.3
% 11.68/2.65 % (2759790)Termination reason: Refutation not found, incomplete strategy
% 11.68/2.65 % (2759790)Time elapsed: 0.001 s
% 11.68/2.65 % (2759790)Peak memory usage: 88 MB
% 11.68/2.65 % (2759791)Instruction limit reached!
% 11.68/2.65 % (2759791)------------------------------
% 11.68/2.65 % (2759791)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.68/2.65 % (2759791)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.68/2.65 % (2759791)CaDiCaL version: 2.1.3
% 11.68/2.65 % (2759791)Termination reason: Instruction limit
% 11.68/2.65 % (2759791)Termination phase: Saturation
% 11.68/2.65 % (2759791)Time elapsed: 0.073 s
% 11.68/2.65 % (2759791)Peak memory usage: 89 MB
% 11.68/2.65 % (2759791)Instructions burned: 127 (million)
% 11.68/2.65 % (2759788)------------------------------
% 11.68/2.65 % (2759788)------------------------------
% 11.68/2.65 % (2759796)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=3546472319:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2990 on theBenchmark for (2990ds/114Mi)
% 11.68/2.65 % (2759796)Refutation not found, incomplete strategy
% 11.68/2.65 % (2759796)------------------------------
% 11.68/2.65 % (2759796)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.68/2.65 % (2759796)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.68/2.65 % (2759796)CaDiCaL version: 2.1.3
% 11.68/2.65 % (2759796)Termination reason: Refutation not found, incomplete strategy
% 11.68/2.65 % (2759796)Time elapsed: 0.001 s
% 11.68/2.65 % (2759796)Peak memory usage: 87 MB
% 11.68/2.65 % (2759797)lrs+10_1_sil=8000:sp=occurrence:random_seed=4055011872:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2989 on theBenchmark for (2989ds/907Mi)
% 11.68/2.65 % (2759790)------------------------------
% 11.68/2.65 % (2759790)------------------------------
% 11.68/2.65 % (2759798)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=364928964:i=437:sd=1:aac=none:ss=included_2989 on theBenchmark for (2989ds/437Mi)
% 11.68/2.65 % (2759798)Refutation not found, incomplete strategy
% 11.68/2.65 % (2759798)------------------------------
% 11.68/2.65 % (2759798)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.68/2.65 % (2759798)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.68/2.65 % (2759798)CaDiCaL version: 2.1.3
% 11.68/2.65 % (2759798)Termination reason: Refutation not found, incomplete strategy
% 11.68/2.65 % (2759798)Time elapsed: 0.001 s
% 11.68/2.65 % (2759798)Peak memory usage: 88 MB
% 11.68/2.65 % (2759801)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=992223706:i=5202:ss=axioms:sgt=16_2987 on theBenchmark for (2987ds/5202Mi)
% 11.68/2.65 % (2759796)------------------------------
% 11.68/2.65 % (2759796)------------------------------
% 11.68/2.65 % (2759798)------------------------------
% 11.68/2.65 % (2759798)------------------------------
% 11.68/2.65 % (2759766)First to succeed.
% 11.68/2.65 % (2759766)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2759761"
% 11.68/2.65 % (2759804)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=2091076508:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2986 on theBenchmark for (2986ds/134Mi)
% 11.68/2.65 % (2759804)Refutation not found, incomplete strategy
% 11.68/2.65 % (2759804)------------------------------
% 11.68/2.65 % (2759804)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.68/2.65 % (2759804)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.68/2.65 % (2759804)CaDiCaL version: 2.1.3
% 11.68/2.65 % (2759804)Termination reason: Refutation not found, incomplete strategy
% 11.68/2.65 % (2759804)Time elapsed: 0.001 s
% 11.68/2.65 % (2759804)Peak memory usage: 89 MB
% 11.68/2.65 % (2759805)lrs+1002_8_sil=8000:sp=occurrence:sos=on:sac=on:random_seed=1091473834:st=8:i=592:sd=3:ep=RST:ss=axioms_2984 on theBenchmark for (2984ds/592Mi)
% 11.68/2.65 % (2759805)Refutation not found, incomplete strategy
% 11.68/2.65 % (2759805)------------------------------
% 11.68/2.65 % (2759805)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.68/2.65 % (2759805)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.68/2.65 % (2759805)CaDiCaL version: 2.1.3
% 11.68/2.65 % (2759805)Termination reason: Refutation not found, incomplete strategy
% 11.68/2.65 % (2759805)Time elapsed: 0.001 s
% 11.68/2.65 % (2759805)Peak memory usage: 88 MB
% 11.68/2.65 % (2759797)Instruction limit reached!
% 11.68/2.65 % (2759797)------------------------------
% 11.68/2.65 % (2759797)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.68/2.65 % (2759797)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.68/2.65 % (2759797)CaDiCaL version: 2.1.3
% 11.68/2.65 % (2759797)Termination reason: Instruction limit
% 11.68/2.65 % (2759797)Termination phase: Saturation
% 11.68/2.65 % (2759797)Time elapsed: 0.523 s
% 11.68/2.65 % (2759797)Peak memory usage: 102 MB
% 11.68/2.65 % (2759797)Instructions burned: 909 (million)
% 11.68/2.65 % (2759766)Refutation found. Thanks to Tanya!
% 11.68/2.65 % SZS status Theorem for theBenchmark
% 11.68/2.65 % SZS output start Proof for theBenchmark
% See solution above
% 13.27/2.84 % (2759766)------------------------------
% 13.27/2.84 % (2759766)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.27/2.84 % (2759766)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.27/2.84 % (2759766)CaDiCaL version: 2.1.3
% 13.27/2.84 % (2759766)Termination reason: Refutation
% 13.27/2.84 % (2759766)Time elapsed: 1.398 s
% 13.27/2.84 % (2759766)Peak memory usage: 146 MB
% 13.27/2.84 % (2759766)Instructions burned: 3001 (million)
% 13.27/2.84 % (2759766)------------------------------
% 13.27/2.84 % (2759766)------------------------------
% 13.27/2.84 % (2759761)Success in time 1.795 s
% 13.27/2.84 % Vampire exiting
%------------------------------------------------------------------------------