%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL522+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 : n003.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:51 AM UTC 2026
% Result : Theorem 14.05s 2.96s
% Output : Refutation 15.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 70
% Number of leaves : 22
% Syntax : Number of formulae : 167 ( 91 unt; 0 def)
% Number of atoms : 266 ( 46 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 179 ( 80 ~; 76 |; 2 &)
% ( 6 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 14 ( 12 usr; 12 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 276 ( 273 !; 3 ?)
% 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(f16,axiom,
( kn1
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn1) ).
fof(f17,axiom,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',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/theBenchmark.p',kn3) ).
fof(f26,axiom,
( r5
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r5) ).
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(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(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',rosser_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_modus_ponens) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn1) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn3) ).
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,
r5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r5) ).
fof(f44,negated_conjecture,
~ r5,
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f45,plain,
~ r5,
inference(flattening,[],[f44]) ).
fof(f46,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
=> r5 ),
inference(unused_predicate_definition_removal,[],[f26]) ).
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(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(f52,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f51]) ).
fof(f53,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f52]) ).
fof(f54,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f50]) ).
fof(f55,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(ennf_transformation,[],[f49]) ).
fof(f56,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f48]) ).
fof(f57,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(ennf_transformation,[],[f47]) ).
fof(f58,plain,
( r5
| ? [X0,X1,X2] : ~ is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
inference(ennf_transformation,[],[f46]) ).
fof(f59,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f60,plain,
( ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(ennf_transformation,[],[f28]) ).
fof(f61,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f62,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f63,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f64,plain,
( r5
| ~ is_a_theorem(implies(implies(sK1,sK2),implies(or(sK0,sK1),or(sK0,sK2)))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f58]) ).
fof(f65,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f53]) ).
fof(f66,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f54]) ).
fof(f67,plain,
! [X0] :
( is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(cnf_transformation,[],[f55]) ).
fof(f68,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f56]) ).
fof(f69,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(cnf_transformation,[],[f57]) ).
fof(f70,plain,
( r5
| ~ is_a_theorem(implies(implies(sK1,sK2),implies(or(sK0,sK1),or(sK0,sK2)))) ),
inference(cnf_transformation,[],[f64]) ).
fof(f71,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f59]) ).
fof(f72,plain,
! [X0,X1] :
( and(X0,X1) = not(or(not(X0),not(X1)))
| ~ op_and ),
inference(cnf_transformation,[],[f60]) ).
fof(f73,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f61]) ).
fof(f74,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f62]) ).
fof(f75,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f63]) ).
fof(f76,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f77,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f79,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f80,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f81,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f82,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f83,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f39]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f40]) ).
fof(f85,plain,
op_and,
inference(cnf_transformation,[],[f41]) ).
fof(f86,plain,
op_equiv,
inference(cnf_transformation,[],[f42]) ).
fof(f87,plain,
~ r5,
inference(cnf_transformation,[],[f45]) ).
fof(f88,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(forward_subsumption_resolution,[],[f75,f86]) ).
fof(f89,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(forward_subsumption_resolution,[],[f74,f84]) ).
fof(f90,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f73,f77]) ).
fof(f91,plain,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f72,f85]) ).
fof(f92,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f71,f76]) ).
fof(f93,plain,
~ is_a_theorem(implies(implies(sK1,sK2),implies(or(sK0,sK1),or(sK0,sK2)))),
inference(forward_subsumption_resolution,[],[f70,f87]) ).
fof(f94,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))),
inference(forward_subsumption_resolution,[],[f69,f82]) ).
fof(f95,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(forward_subsumption_resolution,[],[f68,f81]) ).
fof(f96,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,X0))),
inference(forward_subsumption_resolution,[],[f67,f80]) ).
fof(f97,plain,
! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f66,f83]) ).
fof(f98,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f65,f79]) ).
fof(f99,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(forward_demodulation,[],[f91,f89]) ).
fof(f100,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f92,f90]) ).
fof(f102,plain,
! [X2,X0,X1] : implies(and(X0,not(X1)),X2) = or(implies(X0,X1),X2),
inference(superposition,[],[f89,f90]) ).
fof(f103,plain,
! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2),
inference(superposition,[],[f100,f90]) ).
fof(f106,plain,
! [X0] :
( is_a_theorem(and(X0,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f98,f96]) ).
fof(f109,plain,
! [X0,X1] : is_a_theorem(or(implies(X0,X1),X0)),
inference(superposition,[],[f95,f102]) ).
fof(f116,plain,
! [X0,X1] : and(not(X0),X1) = not(or(X0,not(X1))),
inference(superposition,[],[f99,f100]) ).
fof(f139,plain,
! [X0,X1] : not(implies(X0,not(X1))) = and(not(not(X0)),X1),
inference(superposition,[],[f116,f89]) ).
fof(f147,plain,
! [X0,X1] : and(X0,X1) = and(not(not(X0)),X1),
inference(forward_demodulation,[],[f139,f99]) ).
fof(f156,plain,
! [X0] : is_a_theorem(implies(not(not(X0)),and(X0,not(not(X0))))),
inference(superposition,[],[f96,f147]) ).
fof(f157,plain,
! [X0] : is_a_theorem(or(not(X0),and(X0,not(not(X0))))),
inference(forward_demodulation,[],[f156,f100]) ).
fof(f161,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,not(not(X0))))),
inference(forward_demodulation,[],[f157,f89]) ).
fof(f181,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(not(and(X1,X2)),not(and(X2,X0)))) ),
inference(resolution,[],[f94,f98]) ).
fof(f188,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),X2),implies(not(and(X2,X0)),implies(X0,X1)))),
inference(superposition,[],[f94,f90]) ).
fof(f192,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),X2),or(and(X2,X0),implies(X0,X1)))),
inference(forward_demodulation,[],[f188,f100]) ).
fof(f198,plain,
! [X2,X0,X1] :
( is_a_theorem(or(and(X1,X2),not(and(X2,X0))))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f181,f100]) ).
fof(f200,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),or(and(X2,X0),implies(X0,X1)))),
inference(forward_demodulation,[],[f192,f100]) ).
fof(f211,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),or(and(X2,not(X0)),or(X0,X1)))),
inference(superposition,[],[f200,f100]) ).
fof(f216,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),implies(implies(X2,X0),or(X0,X1)))),
inference(forward_demodulation,[],[f211,f103]) ).
fof(f219,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),or(X2,X0)))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[],[f216,f98]) ).
fof(f222,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X2,not(X0)),implies(or(X0,X1),or(X1,X2)))),
inference(superposition,[],[f216,f100]) ).
fof(f230,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(or(X2,X0)) ),
inference(resolution,[],[f219,f98]) ).
fof(f262,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(or(X2,not(X0))) ),
inference(superposition,[],[f230,f89]) ).
fof(f268,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,and(X1,X2)))
| is_a_theorem(or(X1,not(X0))) ),
inference(resolution,[],[f262,f95]) ).
fof(f669,plain,
! [X0] : is_a_theorem(or(X0,not(X0))),
inference(resolution,[],[f268,f161]) ).
fof(f681,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| is_a_theorem(or(X1,X0)) ),
inference(resolution,[],[f669,f230]) ).
fof(f688,plain,
! [X0] : is_a_theorem(implies(X0,not(not(X0)))),
inference(superposition,[],[f669,f89]) ).
fof(f699,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| is_a_theorem(or(X1,X0)) ),
inference(forward_demodulation,[],[f681,f100]) ).
fof(f716,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(or(not(not(X1)),not(X0))) ),
inference(resolution,[],[f688,f262]) ).
fof(f730,plain,
! [X0,X1] :
( is_a_theorem(implies(not(X1),not(X0)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f716,f89]) ).
fof(f732,plain,
! [X0,X1] :
( is_a_theorem(or(X1,not(X0)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f730,f100]) ).
fof(f734,plain,
! [X2,X0,X1] :
( is_a_theorem(or(not(and(X0,X1)),and(X2,X0)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f699,f198]) ).
fof(f736,plain,
! [X0] : is_a_theorem(or(not(X0),X0)),
inference(resolution,[],[f699,f669]) ).
fof(f742,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(forward_demodulation,[],[f736,f89]) ).
fof(f743,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(and(X0,X1),and(X2,X0)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(forward_demodulation,[],[f734,f89]) ).
fof(f752,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(not(X0),X2))
| is_a_theorem(or(X2,X1)) ),
inference(resolution,[],[f732,f230]) ).
fof(f766,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(X0,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(or(X2,X1)) ),
inference(forward_demodulation,[],[f752,f100]) ).
fof(f771,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(and(X2,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(and(X1,X2)) ),
inference(resolution,[],[f743,f98]) ).
fof(f791,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(or(X0,X2)) ),
inference(resolution,[],[f766,f109]) ).
fof(f968,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(and(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f771,f106]) ).
fof(f1058,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(or(X0,X1),X2))
| is_a_theorem(or(not(X0),X2)) ),
inference(superposition,[],[f791,f100]) ).
fof(f1064,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(or(X0,X1),X2))
| is_a_theorem(implies(X0,X2)) ),
inference(forward_demodulation,[],[f1058,f89]) ).
fof(f1074,plain,
! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))),
inference(resolution,[],[f1064,f742]) ).
fof(f1087,plain,
! [X0,X1] :
( is_a_theorem(or(X0,X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1074,f98]) ).
fof(f1198,plain,
! [X0,X1] :
( is_a_theorem(or(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1087,f699]) ).
fof(f1219,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X1) ),
inference(superposition,[],[f1198,f89]) ).
fof(f1223,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f1219,f968]) ).
fof(f1346,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(equiv(X0,X1)) ),
inference(superposition,[],[f1223,f88]) ).
fof(f1435,plain,
! [X0] :
( ~ is_a_theorem(implies(not(not(X0)),X0))
| is_a_theorem(equiv(not(not(X0)),X0)) ),
inference(resolution,[],[f1346,f688]) ).
fof(f1472,plain,
! [X0] :
( ~ is_a_theorem(or(not(X0),X0))
| is_a_theorem(equiv(not(not(X0)),X0)) ),
inference(forward_demodulation,[],[f1435,f100]) ).
fof(f1477,plain,
! [X0] :
( ~ is_a_theorem(implies(X0,X0))
| is_a_theorem(equiv(not(not(X0)),X0)) ),
inference(forward_demodulation,[],[f1472,f89]) ).
fof(f1479,plain,
! [X0] : is_a_theorem(equiv(not(not(X0)),X0)),
inference(forward_subsumption_resolution,[],[f1477,f742]) ).
fof(f1480,plain,
! [X0] : not(not(X0)) = X0,
inference(resolution,[],[f1479,f97]) ).
fof(f1496,plain,
! [X0,X1] : and(X1,not(X0)) = not(implies(X1,X0)),
inference(superposition,[],[f99,f1480]) ).
fof(f1609,plain,
! [X0] : is_a_theorem(implies(not(X0),not(implies(not(X0),X0)))),
inference(superposition,[],[f96,f1496]) ).
fof(f1656,plain,
! [X0] : is_a_theorem(or(X0,not(implies(not(X0),X0)))),
inference(forward_demodulation,[],[f1609,f100]) ).
fof(f1676,plain,
! [X0] : is_a_theorem(or(X0,not(or(X0,X0)))),
inference(forward_demodulation,[],[f1656,f100]) ).
fof(f1688,plain,
! [X0] : is_a_theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f1676,f699]) ).
fof(f1714,plain,
! [X0] : is_a_theorem(implies(or(X0,X0),X0)),
inference(forward_demodulation,[],[f1688,f89]) ).
fof(f1735,plain,
! [X0] :
( ~ is_a_theorem(implies(X0,or(X0,X0)))
| is_a_theorem(equiv(X0,or(X0,X0))) ),
inference(resolution,[],[f1714,f1346]) ).
fof(f1747,plain,
! [X0] : is_a_theorem(equiv(X0,or(X0,X0))),
inference(forward_subsumption_resolution,[],[f1735,f1074]) ).
fof(f1752,plain,
! [X0] : or(X0,X0) = X0,
inference(resolution,[],[f1747,f97]) ).
fof(f1764,plain,
! [X0] : not(not(X0)) = and(not(not(X0)),X0),
inference(superposition,[],[f116,f1752]) ).
fof(f1802,plain,
! [X0] : not(X0) = implies(X0,not(X0)),
inference(superposition,[],[f89,f1752]) ).
fof(f1811,plain,
! [X0] : and(X0,X0) = not(not(X0)),
inference(forward_demodulation,[],[f1764,f147]) ).
fof(f1814,plain,
! [X0] : and(X0,X0) = X0,
inference(forward_demodulation,[],[f1811,f1480]) ).
fof(f1828,plain,
! [X0,X1] : is_a_theorem(implies(or(X1,X0),or(X0,implies(X0,X1)))),
inference(superposition,[],[f200,f1814]) ).
fof(f2001,plain,
! [X0] : is_a_theorem(implies(or(not(X0),X0),or(X0,not(X0)))),
inference(superposition,[],[f1828,f1802]) ).
fof(f2016,plain,
! [X0] : is_a_theorem(implies(implies(X0,X0),or(X0,not(X0)))),
inference(forward_demodulation,[],[f2001,f89]) ).
fof(f2033,plain,
! [X0] : is_a_theorem(implies(or(X0,not(X0)),or(not(X0),not(not(X0))))),
inference(superposition,[],[f2016,f100]) ).
fof(f2059,plain,
! [X0] : is_a_theorem(implies(or(X0,not(X0)),implies(X0,not(not(X0))))),
inference(forward_demodulation,[],[f2033,f89]) ).
fof(f2076,plain,
! [X0] : is_a_theorem(implies(or(X0,not(X0)),implies(X0,X0))),
inference(forward_demodulation,[],[f2059,f1480]) ).
fof(f2419,plain,
! [X0] :
( ~ is_a_theorem(implies(implies(X0,X0),or(X0,not(X0))))
| is_a_theorem(equiv(implies(X0,X0),or(X0,not(X0)))) ),
inference(resolution,[],[f2076,f1346]) ).
fof(f2731,plain,
! [X0] : is_a_theorem(equiv(implies(X0,X0),or(X0,not(X0)))),
inference(forward_subsumption_resolution,[],[f2419,f2016]) ).
fof(f2935,plain,
! [X0] : implies(X0,X0) = or(X0,not(X0)),
inference(resolution,[],[f2731,f97]) ).
fof(f3003,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X0),implies(or(X0,X1),or(X1,X0)))),
inference(superposition,[],[f222,f2935]) ).
fof(f3224,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X0))
| is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(resolution,[],[f3003,f98]) ).
fof(f3268,plain,
! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))),
inference(forward_subsumption_resolution,[],[f3224,f742]) ).
fof(f3298,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),or(X1,not(X0)))),
inference(superposition,[],[f3268,f89]) ).
fof(f3305,plain,
! [X0,X1] : is_a_theorem(implies(or(X1,not(X0)),implies(X0,X1))),
inference(superposition,[],[f3268,f89]) ).
fof(f3737,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),or(X1,not(X0))))
| is_a_theorem(equiv(implies(X0,X1),or(X1,not(X0)))) ),
inference(resolution,[],[f3305,f1346]) ).
fof(f3771,plain,
! [X0,X1] : is_a_theorem(equiv(implies(X0,X1),or(X1,not(X0)))),
inference(forward_subsumption_resolution,[],[f3737,f3298]) ).
fof(f3778,plain,
! [X0,X1] : implies(X0,X1) = or(X1,not(X0)),
inference(resolution,[],[f3771,f97]) ).
fof(f3824,plain,
! [X0,X1] : not(implies(X0,X1)) = and(not(X1),X0),
inference(superposition,[],[f116,f3778]) ).
fof(f4649,plain,
! [X2,X0,X1] : or(not(implies(not(X0),X1)),X2) = implies(implies(not(X1),X0),X2),
inference(superposition,[],[f103,f3824]) ).
fof(f4658,plain,
! [X2,X0,X1] : implies(or(X1,X0),X2) = or(not(implies(not(X0),X1)),X2),
inference(forward_demodulation,[],[f4649,f100]) ).
fof(f4700,plain,
! [X2,X0,X1] : implies(implies(not(X0),X1),X2) = implies(or(X1,X0),X2),
inference(forward_demodulation,[],[f4658,f89]) ).
fof(f4725,plain,
! [X2,X0,X1] : implies(or(X0,X1),X2) = implies(or(X1,X0),X2),
inference(forward_demodulation,[],[f4700,f100]) ).
fof(f4867,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X2,not(X1)),implies(or(X0,X1),or(X0,X2)))),
inference(superposition,[],[f222,f4725]) ).
fof(f4977,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))),
inference(forward_demodulation,[],[f4867,f3778]) ).
fof(f5039,plain,
$false,
inference(resolution,[],[f4977,f93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL522+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n003.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 15:57:41 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
% 11.42/2.52 % (741167)Detected formulas, will run a generic FOF schedule.
% 11.42/2.52 % (741172)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=3836924108:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 11.42/2.52 % (741175)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=127181658:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 11.42/2.52 % (741177)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2988509095:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 11.42/2.52 % (741175)Refutation not found, incomplete strategy
% 11.42/2.52 % (741175)------------------------------
% 11.42/2.52 % (741175)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.42/2.52 % (741175)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.42/2.52 % (741175)CaDiCaL version: 2.1.3
% 11.42/2.52 % (741175)Termination reason: Refutation not found, incomplete strategy
% 11.42/2.52 % (741175)Time elapsed: 0.001 s
% 11.42/2.52 % (741175)Peak memory usage: 87 MB
% 11.42/2.52 % (741173)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=1884803924:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 11.42/2.52 % (741174)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=2065937107:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 11.42/2.52 % (741176)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=650492901:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 11.42/2.52 % (741178)dis-21_1_sil=8000:lcm=predicate:random_seed=2101787164: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.42/2.52 % (741176)Refutation not found, incomplete strategy
% 11.42/2.52 % (741176)------------------------------
% 11.42/2.52 % (741176)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.42/2.52 % (741176)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.42/2.52 % (741176)CaDiCaL version: 2.1.3
% 11.42/2.52 % (741176)Termination reason: Refutation not found, incomplete strategy
% 11.42/2.52 % (741176)Time elapsed: 0.001 s
% 11.42/2.52 % (741176)Peak memory usage: 86 MB
% 11.42/2.52 % (741178)Refutation not found, incomplete strategy
% 11.42/2.52 % (741178)------------------------------
% 11.42/2.52 % (741178)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.42/2.52 % (741178)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.42/2.52 % (741178)CaDiCaL version: 2.1.3
% 11.42/2.52 % (741178)Termination reason: Refutation not found, incomplete strategy
% 11.42/2.52 % (741178)Time elapsed: 0.002 s
% 11.42/2.52 % (741178)Peak memory usage: 88 MB
% 11.42/2.52 % (741178)Instructions burned: 1 (million)
% 11.42/2.52 % (741177)Instruction limit reached!
% 11.42/2.52 % (741177)------------------------------
% 11.42/2.52 % (741177)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.42/2.52 % (741177)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.42/2.52 % (741177)CaDiCaL version: 2.1.3
% 11.42/2.52 % (741177)Termination reason: Instruction limit
% 11.42/2.52 % (741177)Termination phase: Saturation
% 11.42/2.52 % (741177)Time elapsed: 0.091 s
% 11.42/2.52 % (741177)Peak memory usage: 90 MB
% 11.42/2.52 % (741177)Instructions burned: 139 (million)
% 11.42/2.52 % (741186)lrs+10_1_sil=8000:sp=occurrence:random_seed=425640418:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 11.42/2.52 % (741186)Refutation not found, incomplete strategy
% 11.42/2.52 % (741186)------------------------------
% 11.42/2.52 % (741186)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.42/2.52 % (741186)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.42/2.52 % (741186)CaDiCaL version: 2.1.3
% 11.42/2.52 % (741186)Termination reason: Refutation not found, incomplete strategy
% 11.42/2.52 % (741186)Time elapsed: 0.001 s
% 11.42/2.52 % (741186)Peak memory usage: 87 MB
% 11.42/2.52 % (741175)------------------------------
% 11.42/2.52 % (741175)------------------------------
% 11.42/2.52 % (741178)------------------------------
% 11.42/2.52 % (741178)------------------------------
% 11.42/2.52 % (741176)------------------------------
% 14.05/2.96 % (741176)------------------------------
% 14.05/2.96 % (741188)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3620090784:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 14.05/2.96 % (741188)Refutation not found, incomplete strategy
% 14.05/2.96 % (741188)------------------------------
% 14.05/2.96 % (741188)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741188)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741188)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741188)Termination reason: Refutation not found, incomplete strategy
% 14.05/2.96 % (741188)Time elapsed: 0.001 s
% 14.05/2.96 % (741188)Peak memory usage: 87 MB
% 14.05/2.96 % (741189)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2484606863:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 14.05/2.96 % (741190)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=1085412624:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 14.05/2.96 % (741189)Refutation not found, incomplete strategy
% 14.05/2.96 % (741189)------------------------------
% 14.05/2.96 % (741189)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741189)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741189)Termination reason: Refutation not found, incomplete strategy
% 14.05/2.96 % (741189)Time elapsed: 0.001 s
% 14.05/2.96 % (741189)Peak memory usage: 87 MB
% 14.05/2.96 % (741186)------------------------------
% 14.05/2.96 % (741186)------------------------------
% 14.05/2.96 % (741190)Instruction limit reached!
% 14.05/2.96 % (741190)------------------------------
% 14.05/2.96 % (741190)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741190)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741190)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741190)Termination reason: Instruction limit
% 14.05/2.96 % (741190)Termination phase: Saturation
% 14.05/2.96 % (741190)Time elapsed: 0.161 s
% 14.05/2.96 % (741190)Peak memory usage: 93 MB
% 14.05/2.96 % (741190)Instructions burned: 248 (million)
% 14.05/2.96 % (741174)Refutation not found, incomplete strategy
% 14.05/2.96 % (741174)------------------------------
% 14.05/2.96 % (741174)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741174)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741174)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741174)Termination reason: Refutation not found, incomplete strategy
% 14.05/2.96 % (741174)Time elapsed: 0.582 s
% 14.05/2.96 % (741174)Peak memory usage: 126 MB
% 14.05/2.96 % (741174)Instructions burned: 824 (million)
% 14.05/2.96 % (741188)------------------------------
% 14.05/2.96 % (741188)------------------------------
% 14.05/2.96 % (741194)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=825240521:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2993 on theBenchmark for (2993ds/294Mi)
% 14.05/2.96 % (741194)Refutation not found, incomplete strategy
% 14.05/2.96 % (741194)------------------------------
% 14.05/2.96 % (741194)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741194)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741194)Termination reason: Refutation not found, incomplete strategy
% 14.05/2.96 % (741194)Time elapsed: 0.001 s
% 14.05/2.96 % (741194)Peak memory usage: 87 MB
% 14.05/2.96 % (741189)------------------------------
% 14.05/2.96 % (741189)------------------------------
% 14.05/2.96 % (741195)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3740570133:i=2350_2992 on theBenchmark for (2992ds/2350Mi)
% 14.05/2.96 % (741197)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3024021450:cts=off:i=113:fsr=off:ss=included:sgt=4_2992 on theBenchmark for (2992ds/113Mi)
% 14.05/2.96 % (741197)Refutation not found, incomplete strategy
% 14.05/2.96 % (741197)------------------------------
% 14.05/2.96 % (741197)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741197)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741197)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741197)Termination reason: Refutation not found, incomplete strategy
% 14.05/2.96 % (741197)Time elapsed: 0.001 s
% 14.05/2.96 % (741197)Peak memory usage: 88 MB
% 14.05/2.96 % (741198)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1356021237:i=127:av=off:fsr=off:sup=off_2992 on theBenchmark for (2992ds/127Mi)
% 14.05/2.96 % (741174)------------------------------
% 14.05/2.96 % (741174)------------------------------
% 14.05/2.96 % (741198)Instruction limit reached!
% 14.05/2.96 % (741198)------------------------------
% 14.05/2.96 % (741198)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741198)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741198)Termination reason: Instruction limit
% 14.05/2.96 % (741198)Termination phase: Saturation
% 14.05/2.96 % (741198)Time elapsed: 0.066 s
% 14.05/2.96 % (741198)Peak memory usage: 88 MB
% 14.05/2.96 % (741198)Instructions burned: 128 (million)
% 14.05/2.96 % (741194)------------------------------
% 14.05/2.96 % (741194)------------------------------
% 14.05/2.96 % (741202)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=4219069918:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2990 on theBenchmark for (2990ds/114Mi)
% 14.05/2.96 % (741202)Refutation not found, incomplete strategy
% 14.05/2.96 % (741202)------------------------------
% 14.05/2.96 % (741202)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741202)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741202)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741202)Termination reason: Refutation not found, incomplete strategy
% 14.05/2.96 % (741202)Time elapsed: 0.001 s
% 14.05/2.96 % (741202)Peak memory usage: 87 MB
% 14.05/2.96 % (741204)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=374886777:i=437:sd=1:aac=none:ss=included_2990 on theBenchmark for (2990ds/437Mi)
% 14.05/2.96 % (741204)Refutation not found, incomplete strategy
% 14.05/2.96 % (741204)------------------------------
% 14.05/2.96 % (741204)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741204)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741204)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741204)Termination reason: Refutation not found, incomplete strategy
% 14.05/2.96 % (741204)Time elapsed: 0.001 s
% 14.05/2.96 % (741204)Peak memory usage: 88 MB
% 14.05/2.96 % (741197)------------------------------
% 14.05/2.96 % (741197)------------------------------
% 14.05/2.96 % (741203)lrs+10_1_sil=8000:sp=occurrence:random_seed=3707812421:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2990 on theBenchmark for (2990ds/907Mi)
% 14.05/2.96 % (741208)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=4067277430:i=5202:ss=axioms:sgt=16_2988 on theBenchmark for (2988ds/5202Mi)
% 14.05/2.96 % (741202)------------------------------
% 14.05/2.96 % (741202)------------------------------
% 14.05/2.96 % (741204)------------------------------
% 14.05/2.96 % (741204)------------------------------
% 14.05/2.96 % (741210)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=2438718293:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2986 on theBenchmark for (2986ds/134Mi)
% 14.05/2.96 % (741210)Refutation not found, incomplete strategy
% 14.05/2.96 % (741210)------------------------------
% 14.05/2.96 % (741210)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741210)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741210)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741210)Termination reason: Refutation not found, incomplete strategy
% 14.05/2.96 % (741210)Time elapsed: 0.001 s
% 14.05/2.96 % (741210)Peak memory usage: 89 MB
% 14.05/2.96 % (741211)lrs+1002_8_sil=8000:sp=occurrence:sos=on:sac=on:random_seed=1830793577:st=8:i=592:sd=3:ep=RST:ss=axioms_2986 on theBenchmark for (2986ds/592Mi)
% 14.05/2.96 % (741211)Refutation not found, incomplete strategy
% 14.05/2.96 % (741211)------------------------------
% 14.05/2.96 % (741211)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741211)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741211)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741211)Termination reason: Refutation not found, incomplete strategy
% 14.05/2.96 % (741211)Time elapsed: 0.001 s
% 14.05/2.96 % (741211)Peak memory usage: 88 MB
% 14.05/2.96 % (741203)Instruction limit reached!
% 14.05/2.96 % (741203)------------------------------
% 14.05/2.96 % (741203)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741203)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741203)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741203)Termination reason: Instruction limit
% 14.05/2.96 % (741203)Termination phase: Saturation
% 14.05/2.96 % (741203)Time elapsed: 0.542 s
% 14.05/2.96 % (741203)Peak memory usage: 101 MB
% 14.05/2.96 % (741203)Instructions burned: 908 (million)
% 14.05/2.96 % (741210)------------------------------
% 14.05/2.96 % (741210)------------------------------
% 14.05/2.96 % (741211)------------------------------
% 14.05/2.96 % (741211)------------------------------
% 14.05/2.96 % (741214)lrs+10_1_ncem=casc2026/models/loop6.pt:sil=32000:npcc=on:random_seed=1792114101:st=3:i=13193:sd=3:ss=axioms_2983 on theBenchmark for (2983ds/13193Mi)
% 14.05/2.96 % (741195)First to succeed.
% 14.05/2.96 % (741195)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-741167"
% 14.05/2.96 % (741216)lrs+10_1024_to=lpo:sil=8000:tgt=full:sp=arity:slsq=on:random_seed=2069830354:i=134:gtgl=5:slsql=off:gtg=exists_sym_2982 on theBenchmark for (2982ds/134Mi)
% 14.05/2.96 % (741215)lrs+1666_7_slsqr=4,1:sil=8000:plsq=on:plsqc=1:sos=on:urr=on:plsql=on:rp=on:alpa=false:sac=on:slsq=on:random_seed=2224781628:i=125:slsql=off:bs=unit_only:gtg=position:fdi=2:gsp=on:ss=axioms:sgt=8_2982 on theBenchmark for (2982ds/125Mi)
% 14.05/2.96 % (741215)Refutation not found, incomplete strategy
% 14.05/2.96 % (741215)------------------------------
% 14.05/2.96 % (741215)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741215)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741215)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741215)Termination reason: Refutation not found, incomplete strategy
% 14.05/2.96 % (741215)Time elapsed: 0.001 s
% 14.05/2.96 % (741215)Peak memory usage: 87 MB
% 14.05/2.96 % (741216)Instruction limit reached!
% 14.05/2.96 % (741216)------------------------------
% 14.05/2.96 % (741216)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741216)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741216)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741216)Termination reason: Instruction limit
% 14.05/2.96 % (741216)Termination phase: Saturation
% 14.05/2.96 % (741216)Time elapsed: 0.081 s
% 14.05/2.96 % (741216)Peak memory usage: 89 MB
% 14.05/2.96 % (741216)Instructions burned: 134 (million)
% 14.05/2.96 % (741220)lrs+10_1_sil=16000:plsq=on:plsqc=1:plsqr=32,1:sos=on:lcm=reverse:fd=off:newcnf=on:random_seed=885030515:i=141:sd=1:gsp=on:sup=off:ss=axioms:sgt=8_2980 on theBenchmark for (2980ds/141Mi)
% 14.05/2.96 % (741220)Refutation not found, incomplete strategy
% 14.05/2.96 % (741220)------------------------------
% 14.05/2.96 % (741220)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.05/2.96 % (741220)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.05/2.96 % (741220)CaDiCaL version: 2.1.3
% 14.05/2.96 % (741220)Termination reason: Refutation not found, incomplete strategy
% 14.05/2.96 % (741220)Time elapsed: 0.001 s
% 14.05/2.96 % (741220)Peak memory usage: 87 MB
% 14.05/2.96 % (741195)Refutation found. Thanks to Tanya!
% 14.05/2.96 % SZS status Theorem for theBenchmark
% 14.05/2.96 % SZS output start Proof for theBenchmark
% See solution above
% 15.44/3.15 % (741195)------------------------------
% 15.44/3.15 % (741195)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 15.44/3.15 % (741195)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.44/3.15 % (741195)CaDiCaL version: 2.1.3
% 15.44/3.15 % (741195)Termination reason: Refutation
% 15.44/3.15 % (741195)Time elapsed: 0.991 s
% 15.44/3.15 % (741195)Peak memory usage: 134 MB
% 15.44/3.15 % (741195)Instructions burned: 1500 (million)
% 15.44/3.15 % (741195)------------------------------
% 15.44/3.15 % (741195)------------------------------
% 15.44/3.15 % (741167)Success in time 2.101 s
% 15.44/3.15 % Vampire exiting
%------------------------------------------------------------------------------