%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL508+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 : n001.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:38 AM UTC 2026
% Result : Theorem 9.67s 2.24s
% Output : Refutation 10.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 58
% Number of leaves : 18
% Syntax : Number of formulae : 171 ( 83 unt; 0 def)
% Number of atoms : 288 ( 25 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 217 ( 100 ~; 96 |; 2 &)
% ( 6 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 329 ( 327 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox/benchmark/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(f9,axiom,
( and_3
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_3) ).
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(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(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(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_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(f41,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f42,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_equiv) ).
fof(f43,conjecture,
and_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_3) ).
fof(f44,negated_conjecture,
~ and_3,
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f45,plain,
~ and_3,
inference(flattening,[],[f44]) ).
fof(f46,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(f47,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f48,plain,
( kn1
=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f49,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
=> and_3 ),
inference(unused_predicate_definition_removal,[],[f9]) ).
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,
( and_3
| ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(ennf_transformation,[],[f49]) ).
fof(f58,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(ennf_transformation,[],[f48]) ).
fof(f59,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f47]) ).
fof(f60,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(ennf_transformation,[],[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] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f63,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f64,plain,
( and_3
| ~ is_a_theorem(implies(sK0,implies(sK1,and(sK0,sK1)))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f57]) ).
fof(f65,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f55]) ).
fof(f66,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f56]) ).
fof(f67,plain,
( and_3
| ~ is_a_theorem(implies(sK0,implies(sK1,and(sK0,sK1)))) ),
inference(cnf_transformation,[],[f64]) ).
fof(f68,plain,
! [X0] :
( is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(cnf_transformation,[],[f58]) ).
fof(f69,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f59]) ).
fof(f70,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(cnf_transformation,[],[f60]) ).
fof(f71,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f61]) ).
fof(f72,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f62]) ).
fof(f73,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f63]) ).
fof(f77,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f78,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f79,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f80,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f81,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f39]) ).
fof(f82,plain,
op_or,
inference(cnf_transformation,[],[f40]) ).
fof(f83,plain,
op_implies_and,
inference(cnf_transformation,[],[f41]) ).
fof(f84,plain,
op_equiv,
inference(cnf_transformation,[],[f42]) ).
fof(f85,plain,
~ and_3,
inference(cnf_transformation,[],[f45]) ).
fof(f86,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(forward_subsumption_resolution,[],[f73,f84]) ).
fof(f87,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f72,f83]) ).
fof(f88,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f71,f82]) ).
fof(f89,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))),
inference(forward_subsumption_resolution,[],[f70,f80]) ).
fof(f90,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(forward_subsumption_resolution,[],[f69,f79]) ).
fof(f91,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,X0))),
inference(forward_subsumption_resolution,[],[f68,f78]) ).
fof(f92,plain,
~ is_a_theorem(implies(sK0,implies(sK1,and(sK0,sK1)))),
inference(forward_subsumption_resolution,[],[f67,f85]) ).
fof(f93,plain,
! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f66,f81]) ).
fof(f94,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f65,f77]) ).
fof(f95,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f88,f87]) ).
fof(f97,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X2,X0),implies(implies(X0,X1),not(and(not(X1),X2))))),
inference(superposition,[],[f89,f87]) ).
fof(f98,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),X2),implies(not(and(X2,X0)),implies(X0,X1)))),
inference(superposition,[],[f89,f87]) ).
fof(f99,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),X2),or(and(X2,X0),implies(X0,X1)))),
inference(forward_demodulation,[],[f98,f95]) ).
fof(f100,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),or(and(X2,X0),implies(X0,X1)))),
inference(forward_demodulation,[],[f99,f95]) ).
fof(f101,plain,
! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2),
inference(superposition,[],[f95,f87]) ).
fof(f102,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X2,X0),or(and(X0,X1),not(and(X1,X2))))),
inference(superposition,[],[f89,f95]) ).
fof(f103,plain,
! [X0] : is_a_theorem(or(X0,and(not(X0),not(X0)))),
inference(superposition,[],[f91,f95]) ).
fof(f107,plain,
! [X0] :
( is_a_theorem(and(X0,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f94,f91]) ).
fof(f109,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,f89]) ).
fof(f110,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| ~ is_a_theorem(not(X0))
| is_a_theorem(X1) ),
inference(superposition,[],[f94,f95]) ).
fof(f111,plain,
! [X2,X0,X1] :
( is_a_theorem(or(and(X1,X2),not(and(X2,X0))))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f109,f95]) ).
fof(f113,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),or(and(X2,not(X0)),or(X0,X1)))),
inference(superposition,[],[f100,f95]) ).
fof(f114,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),implies(implies(X2,X0),or(X0,X1)))),
inference(forward_demodulation,[],[f113,f101]) ).
fof(f115,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),or(X2,X0)))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[],[f114,f94]) ).
fof(f137,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),not(and(not(X1),X2))))
| ~ is_a_theorem(implies(X2,X0)) ),
inference(superposition,[],[f111,f101]) ).
fof(f143,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(not(and(not(X2),X0))) ),
inference(resolution,[],[f137,f94]) ).
fof(f153,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,and(X1,X2)))
| is_a_theorem(not(and(not(X1),X0))) ),
inference(resolution,[],[f143,f90]) ).
fof(f158,plain,
! [X0] : is_a_theorem(not(and(not(X0),X0))),
inference(resolution,[],[f153,f91]) ).
fof(f161,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(X0,and(X1,X2)))
| is_a_theorem(not(and(not(X1),not(X0)))) ),
inference(superposition,[],[f153,f95]) ).
fof(f162,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(not(X1),X0))
| ~ is_a_theorem(or(X0,and(X1,X2))) ),
inference(forward_demodulation,[],[f161,f87]) ).
fof(f163,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(X0,and(X1,X2)))
| is_a_theorem(or(X1,X0)) ),
inference(forward_demodulation,[],[f162,f95]) ).
fof(f165,plain,
! [X0] : is_a_theorem(implies(not(not(X0)),X0)),
inference(superposition,[],[f158,f87]) ).
fof(f166,plain,
! [X0] : is_a_theorem(or(not(X0),X0)),
inference(forward_demodulation,[],[f165,f95]) ).
fof(f168,plain,
! [X0,X1] : is_a_theorem(or(X0,not(and(X0,X1)))),
inference(resolution,[],[f163,f166]) ).
fof(f172,plain,
! [X0,X1] : is_a_theorem(or(X0,implies(X0,X1))),
inference(superposition,[],[f168,f87]) ).
fof(f177,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(or(X2,X0)) ),
inference(resolution,[],[f115,f94]) ).
fof(f194,plain,
! [X0,X1] :
( is_a_theorem(or(X1,not(X0)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f177,f166]) ).
fof(f196,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(or(X2,X0)) ),
inference(resolution,[],[f177,f172]) ).
fof(f200,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,[],[f194,f177]) ).
fof(f203,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,[],[f200,f95]) ).
fof(f216,plain,
! [X2,X0,X1] :
( is_a_theorem(or(implies(X0,X2),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f203,f172]) ).
fof(f231,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(not(and(X0,X1)))
| is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X2,X0)) ),
inference(resolution,[],[f110,f111]) ).
fof(f236,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(not(X0)) ),
inference(resolution,[],[f110,f172]) ).
fof(f266,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,not(X0)))
| is_a_theorem(not(and(X0,X1))) ),
inference(resolution,[],[f231,f158]) ).
fof(f269,plain,
! [X0,X1] :
( is_a_theorem(not(and(X0,X1)))
| ~ is_a_theorem(not(X1)) ),
inference(resolution,[],[f266,f236]) ).
fof(f273,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,not(X1)))
| is_a_theorem(not(and(X1,not(X0)))) ),
inference(superposition,[],[f266,f95]) ).
fof(f274,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(forward_demodulation,[],[f273,f87]) ).
fof(f276,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(and(X0,X1),and(X2,X0)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f274,f111]) ).
fof(f277,plain,
! [X0] : is_a_theorem(implies(X0,not(not(X0)))),
inference(resolution,[],[f274,f166]) ).
fof(f285,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(and(X2,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(and(X1,X2)) ),
inference(resolution,[],[f276,f94]) ).
fof(f291,plain,
! [X0] :
( is_a_theorem(not(not(X0)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f277,f94]) ).
fof(f295,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(and(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f285,f107]) ).
fof(f319,plain,
! [X0,X1] :
( ~ is_a_theorem(not(not(X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(superposition,[],[f269,f87]) ).
fof(f320,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f319,f291]) ).
fof(f323,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f320,f295]) ).
fof(f329,plain,
! [X0,X1] :
( is_a_theorem(or(X0,X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f320,f196]) ).
fof(f333,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(or(X2,X1)) ),
inference(resolution,[],[f329,f203]) ).
fof(f347,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(equiv(X0,X1)) ),
inference(superposition,[],[f323,f86]) ).
fof(f351,plain,
! [X0] :
( ~ is_a_theorem(implies(not(not(X0)),X0))
| is_a_theorem(equiv(not(not(X0)),X0)) ),
inference(resolution,[],[f347,f277]) ).
fof(f357,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,and(X0,X1)))
| is_a_theorem(equiv(X0,and(X0,X1))) ),
inference(resolution,[],[f347,f90]) ).
fof(f364,plain,
! [X0] :
( ~ is_a_theorem(or(not(X0),X0))
| is_a_theorem(equiv(not(not(X0)),X0)) ),
inference(forward_demodulation,[],[f351,f95]) ).
fof(f367,plain,
! [X0] : is_a_theorem(equiv(not(not(X0)),X0)),
inference(forward_subsumption_resolution,[],[f364,f166]) ).
fof(f378,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X3,X0))
| is_a_theorem(or(X2,not(and(not(X1),X3))))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f333,f137]) ).
fof(f391,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(and(X2,X2),X1))
| is_a_theorem(or(X0,not(and(not(X1),X2)))) ),
inference(resolution,[],[f378,f91]) ).
fof(f420,plain,
! [X0,X1] : is_a_theorem(or(X0,not(and(not(X1),X1)))),
inference(resolution,[],[f391,f90]) ).
fof(f434,plain,
! [X0,X1] : is_a_theorem(or(X1,implies(not(not(X0)),X0))),
inference(superposition,[],[f420,f87]) ).
fof(f436,plain,
! [X0,X1] : is_a_theorem(or(X1,or(not(X0),X0))),
inference(forward_demodulation,[],[f434,f95]) ).
fof(f454,plain,
! [X0] : is_a_theorem(equiv(X0,and(X0,X0))),
inference(resolution,[],[f357,f91]) ).
fof(f719,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(or(and(not(X0),not(X0)),X1)) ),
inference(resolution,[],[f103,f203]) ).
fof(f725,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X0),X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f719,f101]) ).
fof(f726,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f725,f95]) ).
fof(f728,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(resolution,[],[f726,f94]) ).
fof(f744,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(and(not(X0),X0)),X1))
| is_a_theorem(X1) ),
inference(resolution,[],[f728,f420]) ).
fof(f750,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(or(not(X0),X0),X1))
| is_a_theorem(X1) ),
inference(resolution,[],[f728,f436]) ).
fof(f754,plain,
! [X0,X1] :
( ~ is_a_theorem(or(and(not(X0),X0),X1))
| is_a_theorem(X1) ),
inference(forward_demodulation,[],[f744,f95]) ).
fof(f819,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),or(X1,not(X0)))),
inference(resolution,[],[f750,f114]) ).
fof(f950,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(X2) ),
inference(resolution,[],[f216,f728]) ).
fof(f1073,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(implies(X1,X2),not(and(not(X2),X0)))) ),
inference(resolution,[],[f950,f97]) ).
fof(f1129,plain,
! [X0] : not(not(X0)) = X0,
inference(resolution,[],[f93,f367]) ).
fof(f1133,plain,
! [X0] : and(X0,X0) = X0,
inference(resolution,[],[f93,f454]) ).
fof(f1142,plain,
! [X0,X1] : implies(X1,not(X0)) = not(and(X1,X0)),
inference(superposition,[],[f87,f1129]) ).
fof(f1143,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(superposition,[],[f95,f1129]) ).
fof(f1167,plain,
! [X0,X1] :
( ~ is_a_theorem(or(and(X0,not(X0)),X1))
| is_a_theorem(X1) ),
inference(superposition,[],[f754,f1129]) ).
fof(f1169,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),X1),or(X1,X0))),
inference(superposition,[],[f819,f1129]) ).
fof(f1176,plain,
! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))),
inference(forward_demodulation,[],[f1169,f95]) ).
fof(f1177,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X0),X1))
| is_a_theorem(X1) ),
inference(forward_demodulation,[],[f1167,f101]) ).
fof(f1209,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),or(and(X1,X0),not(X0)))),
inference(superposition,[],[f102,f1133]) ).
fof(f2337,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| is_a_theorem(equiv(or(X0,X1),or(X1,X0))) ),
inference(resolution,[],[f1176,f347]) ).
fof(f2347,plain,
! [X0,X1] : is_a_theorem(equiv(or(X0,X1),or(X1,X0))),
inference(forward_subsumption_resolution,[],[f2337,f1176]) ).
fof(f2351,plain,
! [X0,X1] : or(X0,X1) = or(X1,X0),
inference(resolution,[],[f2347,f93]) ).
fof(f2468,plain,
! [X0,X1] : implies(X1,X0) = or(X0,not(X1)),
inference(superposition,[],[f1143,f2351]) ).
fof(f2475,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),or(not(and(X0,X1)),and(X2,X0)))),
inference(superposition,[],[f102,f2351]) ).
fof(f2486,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(and(X0,X1),and(X2,X0)))),
inference(forward_demodulation,[],[f2475,f1143]) ).
fof(f2523,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),and(X1,X0))),
inference(resolution,[],[f2486,f1177]) ).
fof(f2557,plain,
! [X0,X1] : is_a_theorem(not(and(not(X0),and(X1,X0)))),
inference(resolution,[],[f2523,f153]) ).
fof(f2580,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),not(and(X1,X0)))),
inference(forward_demodulation,[],[f2557,f1142]) ).
fof(f2583,plain,
! [X0,X1] : is_a_theorem(or(X0,not(and(X1,X0)))),
inference(forward_demodulation,[],[f2580,f95]) ).
fof(f2586,plain,
! [X0,X1] : is_a_theorem(implies(and(X1,X0),X0)),
inference(forward_demodulation,[],[f2583,f2468]) ).
fof(f2605,plain,
! [X2,X0,X1] : is_a_theorem(not(and(not(X0),and(X1,and(X0,X2))))),
inference(resolution,[],[f2586,f153]) ).
fof(f2609,plain,
! [X2,X0,X1] : is_a_theorem(implies(not(X0),not(and(X1,and(X0,X2))))),
inference(forward_demodulation,[],[f2605,f1142]) ).
fof(f2615,plain,
! [X2,X0,X1] : is_a_theorem(or(X0,not(and(X1,and(X0,X2))))),
inference(forward_demodulation,[],[f2609,f95]) ).
fof(f2618,plain,
! [X2,X0,X1] : is_a_theorem(implies(and(X1,and(X0,X2)),X0)),
inference(forward_demodulation,[],[f2615,f2468]) ).
fof(f2680,plain,
! [X2,X0,X1] : is_a_theorem(not(and(X0,and(X1,and(not(X0),X2))))),
inference(resolution,[],[f2618,f266]) ).
fof(f2691,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,not(and(X1,and(not(X0),X2))))),
inference(forward_demodulation,[],[f2680,f1142]) ).
fof(f2699,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,not(and(not(X0),X2))))),
inference(forward_demodulation,[],[f2691,f1142]) ).
fof(f2703,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(not(X0),not(X2))))),
inference(forward_demodulation,[],[f2699,f1142]) ).
fof(f2705,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,or(X0,not(X2))))),
inference(forward_demodulation,[],[f2703,f95]) ).
fof(f2706,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X0)))),
inference(forward_demodulation,[],[f2705,f2468]) ).
fof(f2708,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),not(and(not(X2),X1)))),
inference(resolution,[],[f2706,f1073]) ).
fof(f2748,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X2),not(X1)))),
inference(forward_demodulation,[],[f2708,f1142]) ).
fof(f2753,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),or(X2,not(X1)))),
inference(forward_demodulation,[],[f2748,f95]) ).
fof(f2756,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
inference(forward_demodulation,[],[f2753,f2468]) ).
fof(f2765,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f2756,f94]) ).
fof(f2803,plain,
! [X0,X1] : is_a_theorem(implies(X0,or(and(X0,X1),not(X1)))),
inference(resolution,[],[f2765,f1209]) ).
fof(f2831,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(forward_demodulation,[],[f2803,f2468]) ).
fof(f2869,plain,
$false,
inference(resolution,[],[f2831,f92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL508+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.13/0.38 % Computer : n001.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 16:00:16 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/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
% 9.67/2.24 % (3749289)Detected formulas, will run a generic FOF schedule.
% 9.67/2.24 % (3749296)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=2796760207:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 9.67/2.24 % (3749297)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2015630255:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 9.67/2.24 % (3749297)Refutation not found, incomplete strategy
% 9.67/2.24 % (3749297)------------------------------
% 9.67/2.24 % (3749297)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749297)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749297)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749297)Termination reason: Refutation not found, incomplete strategy
% 9.67/2.24 % (3749297)Time elapsed: 0.001 s
% 9.67/2.24 % (3749297)Peak memory usage: 86 MB
% 9.67/2.24 % (3749298)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=274285815:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 9.67/2.24 % (3749295)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=2324775078:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 9.67/2.24 % (3749294)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=1620375244:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 9.67/2.24 % (3749300)dis-21_1_sil=8000:lcm=predicate:random_seed=1278551277: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)
% 9.67/2.24 % (3749298)Refutation not found, incomplete strategy
% 9.67/2.24 % (3749298)------------------------------
% 9.67/2.24 % (3749298)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749298)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749298)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749298)Termination reason: Refutation not found, incomplete strategy
% 9.67/2.24 % (3749298)Time elapsed: 0.0000 s
% 9.67/2.24 % (3749298)Peak memory usage: 86 MB
% 9.67/2.24 % (3749300)Refutation not found, incomplete strategy
% 9.67/2.24 % (3749300)------------------------------
% 9.67/2.24 % (3749300)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749300)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749300)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749300)Termination reason: Refutation not found, incomplete strategy
% 9.67/2.24 % (3749300)Time elapsed: 0.002 s
% 9.67/2.24 % (3749300)Peak memory usage: 88 MB
% 9.67/2.24 % (3749300)Instructions burned: 1 (million)
% 9.67/2.24 % (3749299)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1538324470:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 9.67/2.24 % (3749299)Instruction limit reached!
% 9.67/2.24 % (3749299)------------------------------
% 9.67/2.24 % (3749299)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749299)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749299)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749299)Termination reason: Instruction limit
% 9.67/2.24 % (3749299)Termination phase: Saturation
% 9.67/2.24 % (3749299)Time elapsed: 0.093 s
% 9.67/2.24 % (3749299)Peak memory usage: 90 MB
% 9.67/2.24 % (3749299)Instructions burned: 140 (million)
% 9.67/2.24 % (3749308)lrs+10_1_sil=8000:sp=occurrence:random_seed=1315753409:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 9.67/2.24 % (3749308)Refutation not found, incomplete strategy
% 9.67/2.24 % (3749308)------------------------------
% 9.67/2.24 % (3749308)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749308)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749308)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749308)Termination reason: Refutation not found, incomplete strategy
% 9.67/2.24 % (3749308)Time elapsed: 0.001 s
% 9.67/2.24 % (3749308)Peak memory usage: 87 MB
% 9.67/2.24 % (3749297)------------------------------
% 9.67/2.24 % (3749297)------------------------------
% 9.67/2.24 % (3749298)------------------------------
% 9.67/2.24 % (3749298)------------------------------
% 9.67/2.24 % (3749300)------------------------------
% 9.67/2.24 % (3749300)------------------------------
% 9.67/2.24 % (3749296)Refutation not found, incomplete strategy
% 9.67/2.24 % (3749296)------------------------------
% 9.67/2.24 % (3749296)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749296)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749296)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749296)Termination reason: Refutation not found, incomplete strategy
% 9.67/2.24 % (3749296)Time elapsed: 0.332 s
% 9.67/2.24 % (3749296)Peak memory usage: 127 MB
% 9.67/2.24 % (3749296)Instructions burned: 828 (million)
% 9.67/2.24 % (3749311)lrs+1011_1_sil=32000:sp=occurrence:random_seed=692825845:i=325:sd=1:ss=axioms:sgt=32_2996 on theBenchmark for (2996ds/325Mi)
% 9.67/2.24 % (3749310)lrs+10_1_sil=32000:urr=on:br=off:random_seed=964104177:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 9.67/2.24 % (3749312)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=1216262002:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 9.67/2.24 % (3749311)Refutation not found, incomplete strategy
% 9.67/2.24 % (3749311)------------------------------
% 9.67/2.24 % (3749311)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749311)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749311)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749311)Termination reason: Refutation not found, incomplete strategy
% 9.67/2.24 % (3749311)Time elapsed: 0.001 s
% 9.67/2.24 % (3749311)Peak memory usage: 87 MB
% 9.67/2.24 % (3749310)Refutation not found, incomplete strategy
% 9.67/2.24 % (3749310)------------------------------
% 9.67/2.24 % (3749310)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749310)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749310)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749310)Termination reason: Refutation not found, incomplete strategy
% 9.67/2.24 % (3749310)Time elapsed: 0.001 s
% 9.67/2.24 % (3749310)Peak memory usage: 87 MB
% 9.67/2.24 % (3749308)------------------------------
% 9.67/2.24 % (3749308)------------------------------
% 9.67/2.24 % (3749296)------------------------------
% 9.67/2.24 % (3749296)------------------------------
% 9.67/2.24 % (3749312)Instruction limit reached!
% 9.67/2.24 % (3749312)------------------------------
% 9.67/2.24 % (3749312)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749312)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749312)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749312)Termination reason: Instruction limit
% 9.67/2.24 % (3749312)Termination phase: Saturation
% 9.67/2.24 % (3749312)Time elapsed: 0.165 s
% 9.67/2.24 % (3749312)Peak memory usage: 92 MB
% 9.67/2.24 % (3749312)Instructions burned: 249 (million)
% 9.67/2.24 % (3749317)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=4002780856:i=2350_2993 on theBenchmark for (2993ds/2350Mi)
% 9.67/2.24 % (3749316)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3382228016:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2993 on theBenchmark for (2993ds/294Mi)
% 9.67/2.24 % (3749316)Refutation not found, incomplete strategy
% 9.67/2.24 % (3749316)------------------------------
% 9.67/2.24 % (3749316)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749316)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749316)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749316)Termination reason: Refutation not found, incomplete strategy
% 9.67/2.24 % (3749316)Time elapsed: 0.001 s
% 9.67/2.24 % (3749316)Peak memory usage: 86 MB
% 9.67/2.24 % (3749310)------------------------------
% 9.67/2.24 % (3749310)------------------------------
% 9.67/2.24 % (3749311)------------------------------
% 9.67/2.24 % (3749311)------------------------------
% 9.67/2.24 % (3749318)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=1396575150:cts=off:i=113:fsr=off:ss=included:sgt=4_2993 on theBenchmark for (2993ds/113Mi)
% 9.67/2.24 % (3749318)Refutation not found, incomplete strategy
% 9.67/2.24 % (3749318)------------------------------
% 9.67/2.24 % (3749318)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749318)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749318)Termination reason: Refutation not found, incomplete strategy
% 9.67/2.24 % (3749318)Time elapsed: 0.001 s
% 9.67/2.24 % (3749318)Peak memory usage: 88 MB
% 9.67/2.24 % (3749322)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=835330414:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2992 on theBenchmark for (2992ds/114Mi)
% 9.67/2.24 % (3749322)Refutation not found, incomplete strategy
% 9.67/2.24 % (3749322)------------------------------
% 9.67/2.24 % (3749322)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749322)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749322)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749322)Termination reason: Refutation not found, incomplete strategy
% 9.67/2.24 % (3749322)Time elapsed: 0.001 s
% 9.67/2.24 % (3749322)Peak memory usage: 87 MB
% 9.67/2.24 % (3749321)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=2870625651:i=127:av=off:fsr=off:sup=off_2992 on theBenchmark for (2992ds/127Mi)
% 9.67/2.24 % (3749321)Instruction limit reached!
% 9.67/2.24 % (3749321)------------------------------
% 9.67/2.24 % (3749321)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749321)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749321)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749321)Termination reason: Instruction limit
% 9.67/2.24 % (3749321)Termination phase: Saturation
% 9.67/2.24 % (3749321)Time elapsed: 0.067 s
% 9.67/2.24 % (3749321)Peak memory usage: 89 MB
% 9.67/2.24 % (3749321)Instructions burned: 128 (million)
% 9.67/2.24 % (3749316)------------------------------
% 9.67/2.24 % (3749316)------------------------------
% 9.67/2.24 % (3749318)------------------------------
% 9.67/2.24 % (3749318)------------------------------
% 9.67/2.24 % (3749326)lrs+10_1_sil=8000:sp=occurrence:random_seed=2231688682:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2990 on theBenchmark for (2990ds/907Mi)
% 9.67/2.24 % (3749294)First to succeed.
% 9.67/2.24 % (3749294)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3749289"
% 9.67/2.24 % (3749327)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=3341579883:i=437:sd=1:aac=none:ss=included_2989 on theBenchmark for (2989ds/437Mi)
% 9.67/2.24 % (3749327)Refutation not found, incomplete strategy
% 9.67/2.24 % (3749327)------------------------------
% 9.67/2.24 % (3749327)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749327)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749327)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749327)Termination reason: Refutation not found, incomplete strategy
% 9.67/2.24 % (3749327)Time elapsed: 0.001 s
% 9.67/2.24 % (3749327)Peak memory usage: 88 MB
% 9.67/2.24 % (3749322)------------------------------
% 9.67/2.24 % (3749322)------------------------------
% 9.67/2.24 % (3749328)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=615369098:i=5202:ss=axioms:sgt=16_2989 on theBenchmark for (2989ds/5202Mi)
% 9.67/2.24 % (3749317)Also succeeded, but the first one will report.
% 9.67/2.24 % (3749331)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=2020819475:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2988 on theBenchmark for (2988ds/134Mi)
% 9.67/2.24 % (3749331)Refutation not found, incomplete strategy
% 9.67/2.24 % (3749331)------------------------------
% 9.67/2.24 % (3749331)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.67/2.24 % (3749331)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.67/2.24 % (3749331)CaDiCaL version: 2.1.3
% 9.67/2.24 % (3749331)Termination reason: Refutation not found, incomplete strategy
% 9.67/2.24 % (3749331)Time elapsed: 0.001 s
% 9.67/2.24 % (3749331)Peak memory usage: 89 MB
% 9.67/2.24 % (3749294)Refutation found. Thanks to Tanya!
% 9.67/2.24 % SZS status Theorem for theBenchmark
% 9.67/2.24 % SZS output start Proof for theBenchmark
% See solution above
% 10.34/2.43 % (3749294)------------------------------
% 10.34/2.43 % (3749294)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.34/2.43 % (3749294)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.34/2.43 % (3749294)CaDiCaL version: 2.1.3
% 10.34/2.43 % (3749294)Termination reason: Refutation
% 10.34/2.43 % (3749294)Time elapsed: 0.966 s
% 10.34/2.43 % (3749294)Peak memory usage: 132 MB
% 10.34/2.43 % (3749294)Instructions burned: 1421 (million)
% 10.34/2.43 % (3749294)------------------------------
% 10.34/2.43 % (3749294)------------------------------
% 10.34/2.43 % (3749289)Success in time 1.377 s
% 10.34/2.43 % Vampire exiting
%------------------------------------------------------------------------------