%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL461+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:31 AM UTC 2026
% Result : Theorem 17.54s 3.34s
% Output : Refutation 18.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 54
% Number of leaves : 26
% Syntax : Number of formulae : 195 ( 113 unt; 0 def)
% Number of atoms : 299 ( 75 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 186 ( 82 ~; 75 |; 2 &)
% ( 10 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 16 ( 14 usr; 14 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 370 ( 367 !; 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/sandbox2/benchmark/theBenchmark.p',modus_ponens) ).
fof(f2,axiom,
( substitution_of_equivalents
<=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',substitution_of_equivalents) ).
fof(f3,axiom,
( modus_tollens
<=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_tollens) ).
fof(f4,axiom,
( implies_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_1) ).
fof(f5,axiom,
( implies_2
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_2) ).
fof(f6,axiom,
( implies_3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_3) ).
fof(f7,axiom,
( and_1
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_1) ).
fof(f8,axiom,
( and_2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_2) ).
fof(f9,axiom,
( and_3
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_3) ).
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/sandbox2/benchmark/theBenchmark.p',kn3) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_or) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',op_equiv) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_modus_ponens) ).
fof(f36,axiom,
modus_tollens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_modus_tollens) ).
fof(f37,axiom,
implies_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_implies_1) ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_implies_2) ).
fof(f39,axiom,
implies_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_implies_3) ).
fof(f40,axiom,
and_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_1) ).
fof(f41,axiom,
and_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_2) ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_3) ).
fof(f49,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',use_substitution_of_equivalents) ).
fof(f50,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_op_or) ).
fof(f51,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_op_implies_and) ).
fof(f52,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_op_equiv) ).
fof(f53,conjecture,
kn3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn3) ).
fof(f54,negated_conjecture,
~ kn3,
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f55,plain,
~ kn3,
inference(flattening,[],[f54]) ).
fof(f56,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
=> kn3 ),
inference(unused_predicate_definition_removal,[],[f18]) ).
fof(f63,plain,
( and_3
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f64,plain,
( and_2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f65,plain,
( and_1
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f66,plain,
( implies_3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f6]) ).
fof(f67,plain,
( implies_2
=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f68,plain,
( implies_1
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f69,plain,
( modus_tollens
=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f3]) ).
fof(f70,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f71,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(f74,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f71]) ).
fof(f75,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f74]) ).
fof(f76,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f70]) ).
fof(f77,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ modus_tollens ),
inference(ennf_transformation,[],[f69]) ).
fof(f78,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(ennf_transformation,[],[f68]) ).
fof(f79,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(ennf_transformation,[],[f67]) ).
fof(f80,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(ennf_transformation,[],[f66]) ).
fof(f81,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(ennf_transformation,[],[f65]) ).
fof(f82,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(ennf_transformation,[],[f64]) ).
fof(f83,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(ennf_transformation,[],[f63]) ).
fof(f90,plain,
( kn3
| ? [X0,X1,X2] : ~ is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(ennf_transformation,[],[f56]) ).
fof(f91,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f92,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f93,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f94,plain,
( kn3
| ~ is_a_theorem(implies(implies(sK0,sK1),implies(not(and(sK1,sK2)),not(and(sK2,sK0))))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f90]) ).
fof(f95,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f75]) ).
fof(f96,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f76]) ).
fof(f97,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ modus_tollens ),
inference(cnf_transformation,[],[f77]) ).
fof(f98,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(cnf_transformation,[],[f78]) ).
fof(f99,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(cnf_transformation,[],[f79]) ).
fof(f100,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(cnf_transformation,[],[f80]) ).
fof(f101,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(cnf_transformation,[],[f81]) ).
fof(f102,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(cnf_transformation,[],[f82]) ).
fof(f103,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(cnf_transformation,[],[f83]) ).
fof(f110,plain,
( kn3
| ~ is_a_theorem(implies(implies(sK0,sK1),implies(not(and(sK1,sK2)),not(and(sK2,sK0))))) ),
inference(cnf_transformation,[],[f94]) ).
fof(f111,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f91]) ).
fof(f112,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f92]) ).
fof(f113,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f93]) ).
fof(f117,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f118,plain,
modus_tollens,
inference(cnf_transformation,[],[f36]) ).
fof(f119,plain,
implies_1,
inference(cnf_transformation,[],[f37]) ).
fof(f120,plain,
implies_2,
inference(cnf_transformation,[],[f38]) ).
fof(f121,plain,
implies_3,
inference(cnf_transformation,[],[f39]) ).
fof(f122,plain,
and_1,
inference(cnf_transformation,[],[f40]) ).
fof(f123,plain,
and_2,
inference(cnf_transformation,[],[f41]) ).
fof(f124,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f131,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f49]) ).
fof(f132,plain,
op_or,
inference(cnf_transformation,[],[f50]) ).
fof(f133,plain,
op_implies_and,
inference(cnf_transformation,[],[f51]) ).
fof(f134,plain,
op_equiv,
inference(cnf_transformation,[],[f52]) ).
fof(f135,plain,
~ kn3,
inference(cnf_transformation,[],[f55]) ).
fof(f136,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(forward_subsumption_resolution,[],[f113,f134]) ).
fof(f137,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f112,f133]) ).
fof(f138,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f111,f132]) ).
fof(f139,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(not(and(sK1,sK2)),not(and(sK2,sK0))))),
inference(forward_subsumption_resolution,[],[f110,f135]) ).
fof(f146,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(forward_subsumption_resolution,[],[f103,f124]) ).
fof(f147,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)),
inference(forward_subsumption_resolution,[],[f102,f123]) ).
fof(f148,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(forward_subsumption_resolution,[],[f101,f122]) ).
fof(f149,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(forward_subsumption_resolution,[],[f100,f121]) ).
fof(f150,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
inference(forward_subsumption_resolution,[],[f99,f120]) ).
fof(f151,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(forward_subsumption_resolution,[],[f98,f119]) ).
fof(f152,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))),
inference(forward_subsumption_resolution,[],[f97,f118]) ).
fof(f153,plain,
! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f96,f131]) ).
fof(f154,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f95,f117]) ).
fof(f155,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f138,f137]) ).
fof(f156,plain,
! [X2,X0,X1] : implies(X2,and(X0,not(X1))) = not(and(X2,implies(X0,X1))),
inference(superposition,[],[f137,f137]) ).
fof(f159,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f154,f149]) ).
fof(f160,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f154,f150]) ).
fof(f161,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,and(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f154,f146]) ).
fof(f162,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f154,f151]) ).
fof(f165,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f160,f151]) ).
fof(f166,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f161,f154]) ).
fof(f168,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X0))
| is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(resolution,[],[f159,f160]) ).
fof(f169,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f159,f154]) ).
fof(f171,plain,
! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2),
inference(superposition,[],[f155,f137]) ).
fof(f206,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,[],[f169,f159]) ).
fof(f208,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X2,and(X1,X2))))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f169,f146]) ).
fof(f209,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f169,f151]) ).
fof(f231,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X2,X1)) ),
inference(resolution,[],[f209,f154]) ).
fof(f251,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(equiv(X0,X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[],[f166,f136]) ).
fof(f285,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X2))))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f206,f146]) ).
fof(f299,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(not(X0))),or(X0,X1))),
inference(superposition,[],[f152,f155]) ).
fof(f300,plain,
! [X0,X1] : is_a_theorem(implies(or(X1,not(not(X0))),or(X0,X1))),
inference(forward_demodulation,[],[f299,f155]) ).
fof(f321,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,and(X1,X0)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f208,f160]) ).
fof(f365,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,and(X0,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f285,f160]) ).
fof(f435,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X2,implies(X0,X1))) ),
inference(resolution,[],[f231,f150]) ).
fof(f464,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f162,f168]) ).
fof(f520,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X1))),
inference(resolution,[],[f435,f151]) ).
fof(f668,plain,
! [X0,X1] :
( is_a_theorem(equiv(and(X0,X1),X1))
| ~ is_a_theorem(implies(and(X0,X1),X1))
| ~ is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f251,f321]) ).
fof(f673,plain,
! [X0,X1] :
( is_a_theorem(equiv(and(X0,X1),X0))
| ~ is_a_theorem(implies(and(X0,X1),X0))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f251,f365]) ).
fof(f683,plain,
! [X0,X1] :
( is_a_theorem(equiv(implies(X0,X1),implies(X0,implies(X0,X1))))
| ~ is_a_theorem(implies(implies(X0,X1),implies(X0,implies(X0,X1)))) ),
inference(resolution,[],[f251,f150]) ).
fof(f696,plain,
! [X0,X1] : is_a_theorem(equiv(implies(X0,X1),implies(X0,implies(X0,X1)))),
inference(forward_subsumption_resolution,[],[f683,f151]) ).
fof(f697,plain,
! [X0,X1] :
( is_a_theorem(equiv(and(X0,X1),X0))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_subsumption_resolution,[],[f673,f148]) ).
fof(f700,plain,
! [X0,X1] :
( is_a_theorem(equiv(and(X0,X1),X1))
| ~ is_a_theorem(implies(X1,X0)) ),
inference(forward_subsumption_resolution,[],[f668,f147]) ).
fof(f779,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| and(X1,X0) = X0 ),
inference(resolution,[],[f700,f153]) ).
fof(f782,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| and(X0,X1) = X0 ),
inference(resolution,[],[f697,f153]) ).
fof(f792,plain,
! [X0,X1] : implies(X0,X1) = implies(X0,implies(X0,X1)),
inference(resolution,[],[f696,f153]) ).
fof(f869,plain,
! [X0,X1] : and(implies(X0,X1),X1) = X1,
inference(resolution,[],[f779,f151]) ).
fof(f870,plain,
! [X0,X1] : and(implies(X0,X0),X1) = X1,
inference(resolution,[],[f779,f520]) ).
fof(f950,plain,
! [X0,X1] : not(not(X0)) = implies(implies(X1,X1),X0),
inference(superposition,[],[f137,f870]) ).
fof(f1028,plain,
! [X0,X1] : implies(implies(X0,X0),X1) = not(not(implies(implies(X0,X0),X1))),
inference(superposition,[],[f792,f950]) ).
fof(f1061,plain,
! [X1] : not(not(X1)) = not(not(not(not(X1)))),
inference(forward_demodulation,[],[f1028,f950]) ).
fof(f1170,plain,
! [X0,X1] : not(not(X0)) = implies(implies(X1,not(X0)),X0),
inference(superposition,[],[f137,f869]) ).
fof(f1272,plain,
! [X0,X1] : not(and(X1,not(not(X0)))) = implies(X1,not(not(not(X0)))),
inference(superposition,[],[f137,f1061]) ).
fof(f1294,plain,
! [X0,X1] : implies(X1,not(X0)) = implies(X1,not(not(not(X0)))),
inference(forward_demodulation,[],[f1272,f137]) ).
fof(f1296,plain,
! [X2,X0,X1] : implies(X2,implies(X0,X1)) = implies(X2,not(not(implies(X0,X1)))),
inference(superposition,[],[f1294,f137]) ).
fof(f1568,plain,
! [X0,X1] : and(X0,implies(X1,X1)) = X0,
inference(resolution,[],[f782,f520]) ).
fof(f1594,plain,
! [X0,X1] :
( implies(X0,X1) = and(implies(X0,X1),X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f782,f464]) ).
fof(f1609,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| implies(X0,X1) = X1 ),
inference(forward_demodulation,[],[f1594,f869]) ).
fof(f1875,plain,
! [X0,X1] : implies(implies(X0,X0),X1) = X1,
inference(resolution,[],[f1609,f165]) ).
fof(f1906,plain,
! [X2,X0,X1] : implies(implies(and(X0,X1),X1),X2) = X2,
inference(resolution,[],[f1609,f147]) ).
fof(f1952,plain,
! [X0] : not(not(X0)) = X0,
inference(superposition,[],[f1170,f1875]) ).
fof(f1976,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(X0,X2),implies(implies(X1,X1),X2)))),
inference(superposition,[],[f149,f1875]) ).
fof(f1983,plain,
! [X2,X0,X1] : implies(X1,and(implies(X2,X2),not(X0))) = not(and(X1,X0)),
inference(superposition,[],[f156,f1875]) ).
fof(f2072,plain,
! [X0,X1] : implies(X1,not(X0)) = not(and(X1,X0)),
inference(forward_demodulation,[],[f1983,f870]) ).
fof(f2076,plain,
! [X2,X0] : is_a_theorem(implies(X0,implies(implies(X0,X2),not(not(X2))))),
inference(forward_demodulation,[],[f1976,f950]) ).
fof(f2092,plain,
! [X2,X0] : is_a_theorem(implies(X0,implies(implies(X0,X2),X2))),
inference(forward_demodulation,[],[f2076,f1952]) ).
fof(f2094,plain,
! [X0,X1] : and(X0,not(X1)) = not(implies(X0,X1)),
inference(superposition,[],[f1952,f137]) ).
fof(f2106,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(superposition,[],[f155,f1952]) ).
fof(f2107,plain,
! [X2,X0,X1] : implies(implies(X1,not(X0)),X2) = or(and(X1,X0),X2),
inference(superposition,[],[f171,f1952]) ).
fof(f2201,plain,
! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
inference(superposition,[],[f1952,f2072]) ).
fof(f2224,plain,
! [X2,X0,X1] : implies(and(X0,X1),X2) = or(implies(X0,not(X1)),X2),
inference(superposition,[],[f2106,f2072]) ).
fof(f2928,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X0,X2)))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f2092,f206]) ).
fof(f2977,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X1,X0)))),
inference(resolution,[],[f2928,f146]) ).
fof(f3044,plain,
! [X0,X1] : and(X0,implies(X1,and(X1,X0))) = X0,
inference(resolution,[],[f2977,f782]) ).
fof(f3198,plain,
! [X0,X1] : implies(X0,X0) = implies(X1,and(X1,implies(X0,X0))),
inference(superposition,[],[f870,f3044]) ).
fof(f3200,plain,
! [X0,X1] : implies(X0,X0) = implies(X1,X1),
inference(forward_demodulation,[],[f3198,f1568]) ).
fof(f3356,plain,
! [X0,X1] : implies(X0,X0) = implies(X1,implies(X0,X0)),
inference(superposition,[],[f792,f3200]) ).
fof(f3500,plain,
! [X0,X1] : equiv(implies(X0,X0),X1) = and(implies(implies(X0,X0),X1),implies(X0,X0)),
inference(superposition,[],[f136,f3356]) ).
fof(f3581,plain,
! [X0,X1] : implies(implies(X0,X0),X1) = equiv(implies(X0,X0),X1),
inference(forward_demodulation,[],[f3500,f1568]) ).
fof(f3590,plain,
! [X0,X1] : not(not(X1)) = equiv(implies(X0,X0),X1),
inference(forward_demodulation,[],[f3581,f950]) ).
fof(f3597,plain,
! [X0,X1] : equiv(implies(X0,X0),X1) = X1,
inference(forward_demodulation,[],[f3590,f1952]) ).
fof(f3617,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| implies(X1,X1) = X0 ),
inference(superposition,[],[f153,f3597]) ).
fof(f3686,plain,
! [X2,X0,X1] : implies(X0,X0) = implies(implies(not(X1),not(X2)),implies(X2,X1)),
inference(resolution,[],[f3617,f152]) ).
fof(f3695,plain,
! [X2,X0,X1] : implies(X0,X0) = implies(or(X1,not(not(X2))),or(X2,X1)),
inference(resolution,[],[f3617,f300]) ).
fof(f3718,plain,
! [X2,X0,X1] : implies(X0,X0) = implies(or(X1,X2),or(X2,X1)),
inference(forward_demodulation,[],[f3695,f1952]) ).
fof(f3719,plain,
! [X2,X0,X1] : implies(X0,X0) = or(and(not(X1),X2),implies(X2,X1)),
inference(forward_demodulation,[],[f3686,f2107]) ).
fof(f6707,plain,
! [X2,X0,X1] : implies(X1,X1) = or(and(X0,X2),implies(X2,not(X0))),
inference(superposition,[],[f3719,f1952]) ).
fof(f11440,plain,
! [X2,X3,X0,X1] : implies(X1,X1) = implies(implies(X0,X0),or(implies(X3,not(X2)),and(X2,X3))),
inference(superposition,[],[f3718,f6707]) ).
fof(f11443,plain,
! [X2,X3,X1] : implies(X1,X1) = not(not(or(implies(X3,not(X2)),and(X2,X3)))),
inference(forward_demodulation,[],[f11440,f950]) ).
fof(f11501,plain,
! [X2,X3,X1] : implies(X1,X1) = or(implies(X3,not(X2)),and(X2,X3)),
inference(forward_demodulation,[],[f11443,f1952]) ).
fof(f11527,plain,
! [X2,X3,X1] : implies(X1,X1) = implies(and(X3,X2),and(X2,X3)),
inference(forward_demodulation,[],[f11501,f2224]) ).
fof(f11794,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(X1,and(X2,X3)),implies(implies(X0,X0),implies(X1,and(X3,X2))))),
inference(superposition,[],[f149,f11527]) ).
fof(f11873,plain,
! [X2,X3,X1] : is_a_theorem(implies(implies(X1,and(X2,X3)),not(not(implies(X1,and(X3,X2)))))),
inference(forward_demodulation,[],[f11794,f950]) ).
fof(f11951,plain,
! [X2,X3,X1] : is_a_theorem(implies(implies(X1,and(X2,X3)),implies(X1,and(X3,X2)))),
inference(forward_demodulation,[],[f11873,f1296]) ).
fof(f12453,plain,
! [X2,X0,X1] :
( is_a_theorem(equiv(implies(X0,and(X1,X2)),implies(X0,and(X2,X1))))
| ~ is_a_theorem(implies(implies(X0,and(X1,X2)),implies(X0,and(X2,X1)))) ),
inference(resolution,[],[f11951,f251]) ).
fof(f12619,plain,
! [X2,X0,X1] : is_a_theorem(equiv(implies(X0,and(X1,X2)),implies(X0,and(X2,X1)))),
inference(forward_subsumption_resolution,[],[f12453,f11951]) ).
fof(f14388,plain,
! [X2,X0,X1] : implies(X0,and(X1,X2)) = implies(X0,and(X2,X1)),
inference(resolution,[],[f12619,f153]) ).
fof(f14960,plain,
! [X2,X3,X0,X1] : and(X3,X2) = implies(implies(and(X0,X1),X1),and(X2,X3)),
inference(superposition,[],[f1906,f14388]) ).
fof(f14987,plain,
! [X2,X3] : and(X3,X2) = and(X2,X3),
inference(forward_demodulation,[],[f14960,f1906]) ).
fof(f15194,plain,
! [X0,X1] : implies(X1,not(X0)) = not(and(X0,X1)),
inference(superposition,[],[f2072,f14987]) ).
fof(f15231,plain,
! [X2,X0,X1] : implies(X2,and(X0,not(X1))) = not(and(implies(X0,X1),X2)),
inference(superposition,[],[f156,f14987]) ).
fof(f15235,plain,
! [X0,X1] : implies(X1,X0) = not(and(not(X0),X1)),
inference(superposition,[],[f137,f14987]) ).
fof(f15259,plain,
! [X0,X1] : implies(X1,X0) = implies(not(X0),not(X1)),
inference(forward_demodulation,[],[f15235,f2072]) ).
fof(f15260,plain,
! [X2,X0,X1] : implies(X2,and(X0,not(X1))) = implies(implies(X0,X1),not(X2)),
inference(forward_demodulation,[],[f15231,f2072]) ).
fof(f15276,plain,
! [X0,X1] : implies(X1,X0) = or(X0,not(X1)),
inference(forward_demodulation,[],[f15259,f155]) ).
fof(f15277,plain,
! [X2,X0,X1] : implies(implies(X0,X1),not(X2)) = implies(X2,not(implies(X0,X1))),
inference(forward_demodulation,[],[f15260,f2094]) ).
fof(f15285,plain,
! [X2,X0,X1] : implies(and(X0,X1),X2) = or(X2,implies(X0,not(X1))),
inference(superposition,[],[f15276,f2072]) ).
fof(f15323,plain,
! [X0,X1] : implies(X1,not(X0)) = implies(X0,not(X1)),
inference(superposition,[],[f2106,f15276]) ).
fof(f15612,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(implies(X2,not(X0)),implies(X0,not(X1))))),
inference(superposition,[],[f149,f15323]) ).
fof(f15770,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),or(and(X2,X0),implies(X0,not(X1))))),
inference(forward_demodulation,[],[f15612,f2107]) ).
fof(f16041,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(and(X0,X1),and(X2,X0)))),
inference(forward_demodulation,[],[f15770,f15285]) ).
fof(f16323,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(and(X0,X1),and(X0,X2)))),
inference(superposition,[],[f16041,f14388]) ).
fof(f16789,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK2,not(sK1)),not(and(sK2,sK0))))),
inference(superposition,[],[f139,f15194]) ).
fof(f16858,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(and(sK2,sK0),not(implies(sK2,not(sK1)))))),
inference(forward_demodulation,[],[f16789,f15277]) ).
fof(f16877,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(and(sK2,sK0),and(sK2,sK1)))),
inference(forward_demodulation,[],[f16858,f2201]) ).
fof(f16886,plain,
$false,
inference(forward_subsumption_resolution,[],[f16877,f16323]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL461+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n003.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 15:47:56 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.29/2.30 % (735908)Detected formulas, will run a generic FOF schedule.
% 10.29/2.30 % (735916)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2839809544:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 10.29/2.30 % (735916)Refutation not found, incomplete strategy
% 10.29/2.30 % (735916)------------------------------
% 10.29/2.30 % (735916)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.29/2.30 % (735916)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.29/2.30 % (735916)CaDiCaL version: 2.1.3
% 10.29/2.30 % (735916)Termination reason: Refutation not found, incomplete strategy
% 10.29/2.30 % (735916)Time elapsed: 0.0000 s
% 10.29/2.30 % (735916)Peak memory usage: 86 MB
% 10.29/2.30 % (735913)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=628184759:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 10.29/2.30 % (735915)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=709341:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 10.29/2.30 % (735914)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=1535717097:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 10.29/2.30 % (735917)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=160729385:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 10.29/2.30 % (735919)dis-21_1_sil=8000:lcm=predicate:random_seed=3831966256: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)
% 10.29/2.30 % (735917)Refutation not found, incomplete strategy
% 10.29/2.30 % (735917)------------------------------
% 10.29/2.30 % (735917)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.29/2.30 % (735917)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.29/2.30 % (735917)CaDiCaL version: 2.1.3
% 10.29/2.30 % (735917)Termination reason: Refutation not found, incomplete strategy
% 10.29/2.30 % (735917)Time elapsed: 0.001 s
% 10.29/2.30 % (735917)Peak memory usage: 86 MB
% 10.29/2.30 % (735919)Refutation not found, incomplete strategy
% 10.29/2.30 % (735919)------------------------------
% 10.29/2.30 % (735919)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.29/2.30 % (735919)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.29/2.30 % (735919)CaDiCaL version: 2.1.3
% 10.29/2.30 % (735919)Termination reason: Refutation not found, incomplete strategy
% 10.29/2.30 % (735919)Time elapsed: 0.002 s
% 10.29/2.30 % (735919)Peak memory usage: 88 MB
% 10.29/2.30 % (735919)Instructions burned: 1 (million)
% 10.29/2.30 % (735918)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=371749745:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 10.29/2.30 % (735916)------------------------------
% 10.29/2.30 % (735916)------------------------------
% 10.29/2.30 % (735918)Instruction limit reached!
% 10.29/2.30 % (735918)------------------------------
% 10.29/2.30 % (735918)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.29/2.30 % (735918)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.29/2.30 % (735918)CaDiCaL version: 2.1.3
% 10.29/2.30 % (735918)Termination reason: Instruction limit
% 10.29/2.30 % (735918)Termination phase: Saturation
% 10.29/2.30 % (735918)Time elapsed: 0.091 s
% 10.29/2.30 % (735918)Peak memory usage: 90 MB
% 10.29/2.30 % (735918)Instructions burned: 141 (million)
% 10.29/2.30 % (735927)lrs+10_1_sil=8000:sp=occurrence:random_seed=2097796787:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 10.29/2.30 % (735917)------------------------------
% 10.29/2.30 % (735917)------------------------------
% 10.29/2.30 % (735919)------------------------------
% 10.29/2.30 % (735919)------------------------------
% 10.29/2.30 % (735928)lrs+10_1_sil=32000:urr=on:br=off:random_seed=342923288:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 10.29/2.30 % (735928)Refutation not found, incomplete strategy
% 10.29/2.30 % (735928)------------------------------
% 10.29/2.30 % (735928)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.29/2.30 % (735928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735928)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735928)Termination reason: Refutation not found, incomplete strategy
% 17.54/3.34 % (735928)Time elapsed: 0.001 s
% 17.54/3.34 % (735928)Peak memory usage: 87 MB
% 17.54/3.34 % (735927)Instruction limit reached!
% 17.54/3.34 % (735927)------------------------------
% 17.54/3.34 % (735927)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735927)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735927)Termination reason: Instruction limit
% 17.54/3.34 % (735927)Termination phase: Saturation
% 17.54/3.34 % (735927)Time elapsed: 0.088 s
% 17.54/3.34 % (735927)Peak memory usage: 92 MB
% 17.54/3.34 % (735927)Instructions burned: 287 (million)
% 17.54/3.34 % (735931)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=2325909817:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 17.54/3.34 % (735930)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1997460694:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 17.54/3.34 % (735930)Refutation not found, incomplete strategy
% 17.54/3.34 % (735930)------------------------------
% 17.54/3.34 % (735930)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735930)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735930)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735930)Termination reason: Refutation not found, incomplete strategy
% 17.54/3.34 % (735930)Time elapsed: 0.001 s
% 17.54/3.34 % (735930)Peak memory usage: 86 MB
% 17.54/3.34 % (735933)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2216693471:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 17.54/3.34 % (735933)Refutation not found, incomplete strategy
% 17.54/3.34 % (735933)------------------------------
% 17.54/3.34 % (735933)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735933)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735933)Termination reason: Refutation not found, incomplete strategy
% 17.54/3.34 % (735933)Time elapsed: 0.0000 s
% 17.54/3.34 % (735933)Peak memory usage: 86 MB
% 17.54/3.34 % (735928)------------------------------
% 17.54/3.34 % (735928)------------------------------
% 17.54/3.34 % (735931)Instruction limit reached!
% 17.54/3.34 % (735931)------------------------------
% 17.54/3.34 % (735931)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735931)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735931)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735931)Termination reason: Instruction limit
% 17.54/3.34 % (735931)Termination phase: Saturation
% 17.54/3.34 % (735931)Time elapsed: 0.157 s
% 17.54/3.34 % (735931)Peak memory usage: 93 MB
% 17.54/3.34 % (735931)Instructions burned: 249 (million)
% 17.54/3.34 % (735915)Refutation not found, incomplete strategy
% 17.54/3.34 % (735915)------------------------------
% 17.54/3.34 % (735915)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735915)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735915)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735915)Termination reason: Refutation not found, incomplete strategy
% 17.54/3.34 % (735915)Time elapsed: 0.581 s
% 17.54/3.34 % (735915)Peak memory usage: 125 MB
% 17.54/3.34 % (735915)Instructions burned: 829 (million)
% 17.54/3.34 % (735933)------------------------------
% 17.54/3.34 % (735933)------------------------------
% 17.54/3.34 % (735930)------------------------------
% 17.54/3.34 % (735930)------------------------------
% 17.54/3.34 % (735937)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1440974222:i=2350_2993 on theBenchmark for (2993ds/2350Mi)
% 17.54/3.34 % (735939)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1899195908:i=127:av=off:fsr=off:sup=off_2992 on theBenchmark for (2992ds/127Mi)
% 17.54/3.34 % (735938)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2476743606:cts=off:i=113:fsr=off:ss=included:sgt=4_2992 on theBenchmark for (2992ds/113Mi)
% 17.54/3.34 % (735938)Refutation not found, incomplete strategy
% 17.54/3.34 % (735938)------------------------------
% 17.54/3.34 % (735938)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735938)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735938)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735938)Termination reason: Refutation not found, incomplete strategy
% 17.54/3.34 % (735938)Time elapsed: 0.001 s
% 17.54/3.34 % (735938)Peak memory usage: 88 MB
% 17.54/3.34 % (735939)Instruction limit reached!
% 17.54/3.34 % (735939)------------------------------
% 17.54/3.34 % (735939)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735939)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735939)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735939)Termination reason: Instruction limit
% 17.54/3.34 % (735939)Termination phase: Saturation
% 17.54/3.34 % (735939)Time elapsed: 0.038 s
% 17.54/3.34 % (735939)Peak memory usage: 88 MB
% 17.54/3.34 % (735939)Instructions burned: 130 (million)
% 17.54/3.34 % (735940)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=51212088:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2991 on theBenchmark for (2991ds/114Mi)
% 17.54/3.34 % (735940)Refutation not found, incomplete strategy
% 17.54/3.34 % (735940)------------------------------
% 17.54/3.34 % (735940)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735940)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735940)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735940)Termination reason: Refutation not found, incomplete strategy
% 17.54/3.34 % (735940)Time elapsed: 0.001 s
% 17.54/3.34 % (735940)Peak memory usage: 87 MB
% 17.54/3.34 % (735915)------------------------------
% 17.54/3.34 % (735915)------------------------------
% 17.54/3.34 % (735944)lrs+10_1_sil=8000:sp=occurrence:random_seed=3758812026:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2990 on theBenchmark for (2990ds/907Mi)
% 17.54/3.34 % (735938)------------------------------
% 17.54/3.34 % (735938)------------------------------
% 17.54/3.34 % (735946)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=1316423102:i=437:sd=1:aac=none:ss=included_2989 on theBenchmark for (2989ds/437Mi)
% 17.54/3.34 % (735946)Refutation not found, incomplete strategy
% 17.54/3.34 % (735946)------------------------------
% 17.54/3.34 % (735946)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735946)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735946)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735946)Termination reason: Refutation not found, incomplete strategy
% 17.54/3.34 % (735946)Time elapsed: 0.001 s
% 17.54/3.34 % (735946)Peak memory usage: 88 MB
% 17.54/3.34 % (735940)------------------------------
% 17.54/3.34 % (735940)------------------------------
% 17.54/3.34 % (735948)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1041521282:i=5202:ss=axioms:sgt=16_2988 on theBenchmark for (2988ds/5202Mi)
% 17.54/3.34 % (735944)Instruction limit reached!
% 17.54/3.34 % (735944)------------------------------
% 17.54/3.34 % (735944)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735944)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735944)Termination reason: Instruction limit
% 17.54/3.34 % (735944)Termination phase: Saturation
% 17.54/3.34 % (735944)Time elapsed: 0.290 s
% 17.54/3.34 % (735944)Peak memory usage: 101 MB
% 17.54/3.34 % (735944)Instructions burned: 910 (million)
% 17.54/3.34 % (735946)------------------------------
% 17.54/3.34 % (735946)------------------------------
% 17.54/3.34 % (735950)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=861208067:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2987 on theBenchmark for (2987ds/134Mi)
% 17.54/3.34 % (735950)Refutation not found, incomplete strategy
% 17.54/3.34 % (735950)------------------------------
% 17.54/3.34 % (735950)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735950)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735950)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735950)Termination reason: Refutation not found, incomplete strategy
% 17.54/3.34 % (735950)Time elapsed: 0.001 s
% 17.54/3.34 % (735950)Peak memory usage: 88 MB
% 17.54/3.34 % (735952)lrs+1002_8_sil=8000:sp=occurrence:sos=on:sac=on:random_seed=384904320:st=8:i=592:sd=3:ep=RST:ss=axioms_2986 on theBenchmark for (2986ds/592Mi)
% 17.54/3.34 % (735952)Refutation not found, incomplete strategy
% 17.54/3.34 % (735952)------------------------------
% 17.54/3.34 % (735952)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735952)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735952)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735952)Termination reason: Refutation not found, incomplete strategy
% 17.54/3.34 % (735952)Time elapsed: 0.001 s
% 17.54/3.34 % (735952)Peak memory usage: 88 MB
% 17.54/3.34 % (735952)Instructions burned: 1 (million)
% 17.54/3.34 % (735954)lrs+10_1_ncem=casc2026/models/loop6.pt:sil=32000:npcc=on:random_seed=3779660115:st=3:i=13193:sd=3:ss=axioms_2985 on theBenchmark for (2985ds/13193Mi)
% 17.54/3.34 % (735952)------------------------------
% 17.54/3.34 % (735952)------------------------------
% 17.54/3.34 % (735950)------------------------------
% 17.54/3.34 % (735950)------------------------------
% 17.54/3.34 % (735957)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=474916806:i=125:slsql=off:bs=unit_only:gtg=position:fdi=2:gsp=on:ss=axioms:sgt=8_2983 on theBenchmark for (2983ds/125Mi)
% 17.54/3.34 % (735957)Instruction limit reached!
% 17.54/3.34 % (735957)------------------------------
% 17.54/3.34 % (735957)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735957)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735957)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735957)Termination reason: Instruction limit
% 17.54/3.34 % (735957)Termination phase: Saturation
% 17.54/3.34 % (735957)Time elapsed: 0.049 s
% 17.54/3.34 % (735957)Peak memory usage: 90 MB
% 17.54/3.34 % (735957)Instructions burned: 127 (million)
% 17.54/3.34 % (735958)lrs+10_1024_to=lpo:sil=8000:tgt=full:sp=arity:slsq=on:random_seed=1342796637:i=134:gtgl=5:slsql=off:gtg=exists_sym_2983 on theBenchmark for (2983ds/134Mi)
% 17.54/3.34 % (735960)lrs+10_1_sil=16000:plsq=on:plsqc=1:plsqr=32,1:sos=on:lcm=reverse:fd=off:newcnf=on:random_seed=1969998942:i=141:sd=1:gsp=on:sup=off:ss=axioms:sgt=8_2982 on theBenchmark for (2982ds/141Mi)
% 17.54/3.34 % (735960)Refutation not found, incomplete strategy
% 17.54/3.34 % (735960)------------------------------
% 17.54/3.34 % (735960)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735960)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735960)Termination reason: Refutation not found, incomplete strategy
% 17.54/3.34 % (735960)Time elapsed: 0.0000 s
% 17.54/3.34 % (735960)Peak memory usage: 87 MB
% 17.54/3.34 % (735958)Instruction limit reached!
% 17.54/3.34 % (735958)------------------------------
% 17.54/3.34 % (735958)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735958)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735958)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735958)Termination reason: Instruction limit
% 17.54/3.34 % (735958)Termination phase: Saturation
% 17.54/3.34 % (735958)Time elapsed: 0.093 s
% 17.54/3.34 % (735958)Peak memory usage: 90 MB
% 17.54/3.34 % (735958)Instructions burned: 135 (million)
% 17.54/3.34 % (735960)------------------------------
% 17.54/3.34 % (735960)------------------------------
% 17.54/3.34 % (735963)lrs+1011_1_sil=8000:plsq=on:sp=occurrence:fs=off:random_seed=2973897145:i=431:sd=1:fsr=off:sup=off:ss=axioms:sgt=64_2980 on theBenchmark for (2980ds/431Mi)
% 17.54/3.34 % (735963)Refutation not found, incomplete strategy
% 17.54/3.34 % (735963)------------------------------
% 17.54/3.34 % (735963)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.54/3.34 % (735963)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.54/3.34 % (735963)CaDiCaL version: 2.1.3
% 17.54/3.34 % (735963)Termination reason: Refutation not found, incomplete strategy
% 17.54/3.34 % (735963)Time elapsed: 0.001 s
% 17.54/3.34 % (735963)Peak memory usage: 86 MB
% 17.54/3.34 % (735964)lrs+1010_1_ncem=casc2026/models/loop6.pt:sil=64000:tgt=full:npcc=on:prc=on:urr=ec_only:bsr=on:fd=preordered:gs=on:sac=on:newcnf=on:random_seed=1659862249:i=6060:aac=none:ins=25_2979 on theBenchmark for (2979ds/6060Mi)
% 17.54/3.34 % (735937)First to succeed.
% 17.54/3.34 % (735937)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-735908"
% 17.54/3.34 % (735913)Also succeeded, but the first one will report.
% 17.54/3.34 % (735963)------------------------------
% 17.54/3.34 % (735963)------------------------------
% 17.54/3.34 % (735937)Refutation found. Thanks to Tanya!
% 17.54/3.34 % SZS status Theorem for theBenchmark
% 17.54/3.34 % SZS output start Proof for theBenchmark
% See solution above
% 18.13/3.54 % (735937)------------------------------
% 18.13/3.54 % (735937)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.13/3.54 % (735937)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.13/3.54 % (735937)CaDiCaL version: 2.1.3
% 18.13/3.54 % (735937)Termination reason: Refutation
% 18.13/3.54 % (735937)Time elapsed: 1.359 s
% 18.13/3.54 % (735937)Peak memory usage: 139 MB
% 18.13/3.54 % (735937)Instructions burned: 2113 (million)
% 18.13/3.54 % (735937)------------------------------
% 18.13/3.54 % (735937)------------------------------
% 18.13/3.54 % (735908)Success in time 2.491 s
% 18.13/3.54 % Vampire exiting
%------------------------------------------------------------------------------