%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL461+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:58:44 AM UTC 2026
% Result : Theorem 35.65s 5.70s
% Output : Refutation 37.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 26
% Syntax : Number of formulae : 166 ( 90 unt; 0 def)
% Number of atoms : 261 ( 38 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 168 ( 73 ~; 66 |; 2 &)
% ( 10 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 277 ( 274 !; 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/Axioms/LCL006+0.ax',modus_ponens) ).
fof(f2,axiom,
( substitution_of_equivalents
<=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',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/sandbox/benchmark/Axioms/LCL006+0.ax',modus_tollens) ).
fof(f4,axiom,
( implies_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_1) ).
fof(f5,axiom,
( implies_2
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',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/sandbox/benchmark/Axioms/LCL006+0.ax',implies_3) ).
fof(f8,axiom,
( and_2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_2) ).
fof(f9,axiom,
( and_3
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_3) ).
fof(f10,axiom,
( or_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',or_1) ).
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/Axioms/LCL006+0.ax',kn3) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',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/Axioms/LCL006+1.ax',op_equiv) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(f36,axiom,
modus_tollens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_tollens) ).
fof(f37,axiom,
implies_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_1) ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_2) ).
fof(f39,axiom,
implies_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_3) ).
fof(f41,axiom,
and_2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_2) ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
fof(f43,axiom,
or_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_or_1) ).
fof(f49,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',use_substitution_of_equivalents) ).
fof(f50,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_or) ).
fof(f51,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_implies_and) ).
fof(f52,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_equiv) ).
fof(f53,conjecture,
kn3,
file('/export/starexec/sandbox/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(f62,plain,
( or_1
=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
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(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(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(f84,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(ennf_transformation,[],[f62]) ).
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(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(f104,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(cnf_transformation,[],[f84]) ).
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(f123,plain,
and_2,
inference(cnf_transformation,[],[f41]) ).
fof(f124,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f125,plain,
or_1,
inference(cnf_transformation,[],[f43]) ).
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(f145,plain,
! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))),
inference(forward_subsumption_resolution,[],[f104,f125]) ).
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(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(f158,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f154,f151]) ).
fof(f160,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,and(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f154,f146]) ).
fof(f164,plain,
~ is_a_theorem(implies(implies(sK0,sK1),or(and(sK1,sK2),not(and(sK2,sK0))))),
inference(superposition,[],[f139,f155]) ).
fof(f173,plain,
! [X0,X1] : is_a_theorem(or(X0,or(not(X0),X1))),
inference(superposition,[],[f145,f155]) ).
fof(f174,plain,
! [X2,X0,X1] : implies(X2,and(X0,not(X1))) = not(and(X2,implies(X0,X1))),
inference(superposition,[],[f137,f137]) ).
fof(f175,plain,
! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2),
inference(superposition,[],[f155,f137]) ).
fof(f176,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f150,f154]) ).
fof(f186,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f152,f154]) ).
fof(f187,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),not(X2)),implies(X2,and(X0,not(X1))))),
inference(superposition,[],[f152,f137]) ).
fof(f190,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(not(X0))),or(X0,X1))),
inference(superposition,[],[f152,f155]) ).
fof(f191,plain,
! [X0,X1] : is_a_theorem(implies(or(X1,not(not(X0))),or(X0,X1))),
inference(forward_demodulation,[],[f190,f155]) ).
fof(f193,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(forward_demodulation,[],[f186,f155]) ).
fof(f194,plain,
! [X0,X1] : equiv(not(X0),X1) = and(or(X0,X1),implies(X1,not(X0))),
inference(superposition,[],[f136,f155]) ).
fof(f205,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f149,f154]) ).
fof(f222,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f160,f154]) ).
fof(f237,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(equiv(X0,X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[],[f222,f136]) ).
fof(f256,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,X0))),
inference(resolution,[],[f176,f146]) ).
fof(f273,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,not(not(X1))))
| is_a_theorem(or(X1,X0)) ),
inference(resolution,[],[f191,f154]) ).
fof(f279,plain,
! [X2,X3,X0,X1] : implies(implies(X2,and(X0,not(X1))),X3) = or(and(X2,implies(X0,X1)),X3),
inference(superposition,[],[f175,f137]) ).
fof(f292,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),not(X2)))
| is_a_theorem(implies(X2,and(X0,not(X1)))) ),
inference(superposition,[],[f193,f175]) ).
fof(f322,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X0))
| is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(resolution,[],[f205,f176]) ).
fof(f323,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f205,f154]) ).
fof(f338,plain,
! [X2,X0,X1] : implies(X2,and(not(X0),not(X1))) = not(and(X2,or(X0,X1))),
inference(superposition,[],[f174,f155]) ).
fof(f350,plain,
! [X2,X3,X0,X1] : is_a_theorem(or(and(X0,implies(X1,X2)),or(implies(X0,and(X1,not(X2))),X3))),
inference(superposition,[],[f173,f174]) ).
fof(f373,plain,
! [X0,X1] : implies(or(X0,X1),and(X1,not(not(X0)))) = not(equiv(not(X0),X1)),
inference(superposition,[],[f174,f194]) ).
fof(f425,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(or(X0,X1),not(X2)),implies(X2,and(not(X0),not(X1))))),
inference(superposition,[],[f187,f155]) ).
fof(f432,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(or(X0,X1),not(X2)),not(and(X2,or(X0,X1))))),
inference(forward_demodulation,[],[f425,f338]) ).
fof(f520,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f322,f158]) ).
fof(f526,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,and(X1,X2)))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f323,f147]) ).
fof(f722,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,and(X1,not(not(X0)))))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f292,f520]) ).
fof(f777,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(X0,X3),implies(implies(X3,and(not(X1),not(X2))),not(and(X0,or(X1,X2)))))),
inference(superposition,[],[f149,f338]) ).
fof(f858,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(X0,X3),or(and(X3,implies(not(X1),X2)),not(and(X0,or(X1,X2)))))),
inference(forward_demodulation,[],[f777,f279]) ).
fof(f896,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(X0,X3),or(and(X3,or(X1,X2)),not(and(X0,or(X1,X2)))))),
inference(forward_demodulation,[],[f858,f155]) ).
fof(f959,plain,
! [X2,X0,X1] : is_a_theorem(implies(and(X0,or(X1,X2)),and(or(X1,X2),not(not(X0))))),
inference(resolution,[],[f432,f292]) ).
fof(f2803,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,not(not(X1)))) ),
inference(resolution,[],[f722,f526]) ).
fof(f2961,plain,
! [X0] : is_a_theorem(implies(X0,not(not(X0)))),
inference(resolution,[],[f2803,f350]) ).
fof(f2974,plain,
! [X0] : is_a_theorem(or(X0,not(not(not(X0))))),
inference(superposition,[],[f2961,f155]) ).
fof(f3095,plain,
! [X0] : is_a_theorem(or(not(X0),X0)),
inference(resolution,[],[f2974,f273]) ).
fof(f3188,plain,
! [X0,X1] :
( is_a_theorem(equiv(X0,implies(X1,X0)))
| ~ is_a_theorem(implies(X0,implies(X1,X0)))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f237,f520]) ).
fof(f3252,plain,
! [X0] :
( is_a_theorem(equiv(not(not(X0)),X0))
| ~ is_a_theorem(implies(not(not(X0)),X0)) ),
inference(resolution,[],[f237,f2961]) ).
fof(f3254,plain,
! [X0] :
( is_a_theorem(equiv(and(X0,X0),X0))
| ~ is_a_theorem(implies(and(X0,X0),X0)) ),
inference(resolution,[],[f237,f256]) ).
fof(f3278,plain,
! [X0] : is_a_theorem(equiv(and(X0,X0),X0)),
inference(forward_subsumption_resolution,[],[f3254,f147]) ).
fof(f3280,plain,
! [X0] :
( ~ is_a_theorem(or(not(X0),X0))
| is_a_theorem(equiv(not(not(X0)),X0)) ),
inference(forward_demodulation,[],[f3252,f155]) ).
fof(f3296,plain,
! [X0,X1] :
( is_a_theorem(equiv(X0,implies(X1,X0)))
| ~ is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f3188,f151]) ).
fof(f3297,plain,
! [X0] : is_a_theorem(equiv(not(not(X0)),X0)),
inference(forward_subsumption_resolution,[],[f3280,f3095]) ).
fof(f3301,plain,
! [X0] : and(X0,X0) = X0,
inference(resolution,[],[f3278,f153]) ).
fof(f3378,plain,
! [X0] : implies(not(X0),X0) = not(not(X0)),
inference(superposition,[],[f137,f3301]) ).
fof(f3421,plain,
! [X0] : not(equiv(not(X0),not(not(X0)))) = implies(or(X0,not(not(X0))),not(not(X0))),
inference(superposition,[],[f373,f3301]) ).
fof(f3479,plain,
! [X0] : or(X0,X0) = not(not(X0)),
inference(forward_demodulation,[],[f3378,f155]) ).
fof(f3523,plain,
! [X0] : not(not(X0)) = X0,
inference(resolution,[],[f3297,f153]) ).
fof(f3553,plain,
! [X0,X1] : implies(X1,not(X0)) = not(and(X1,X0)),
inference(superposition,[],[f137,f3523]) ).
fof(f3598,plain,
! [X2,X0,X1] : not(and(X1,or(X2,not(X0)))) = implies(X1,and(not(X2),X0)),
inference(superposition,[],[f338,f3523]) ).
fof(f3815,plain,
! [X0] : is_a_theorem(implies(or(X0,not(not(X0))),not(not(X0)))),
inference(superposition,[],[f191,f3479]) ).
fof(f3963,plain,
! [X0] : is_a_theorem(not(equiv(not(X0),not(not(X0))))),
inference(forward_demodulation,[],[f3815,f3421]) ).
fof(f4020,plain,
! [X0] : is_a_theorem(not(equiv(not(X0),X0))),
inference(forward_demodulation,[],[f3963,f3523]) ).
fof(f9188,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| implies(X0,X1) = X1 ),
inference(resolution,[],[f3296,f153]) ).
fof(f9372,plain,
! [X0,X1] : implies(not(equiv(not(X0),X0)),X1) = X1,
inference(resolution,[],[f9188,f4020]) ).
fof(f9435,plain,
! [X0,X1] : or(equiv(not(X0),X0),X1) = X1,
inference(forward_demodulation,[],[f9372,f155]) ).
fof(f10082,plain,
! [X0,X1] : is_a_theorem(implies(and(X1,not(not(X0))),and(not(not(X0)),not(not(X1))))),
inference(superposition,[],[f959,f3479]) ).
fof(f10089,plain,
! [X0,X1] : is_a_theorem(not(and(and(X1,not(not(X0))),or(not(X0),not(X1))))),
inference(forward_demodulation,[],[f10082,f338]) ).
fof(f10107,plain,
! [X0,X1] : is_a_theorem(implies(and(X1,not(not(X0))),and(not(not(X0)),X1))),
inference(forward_demodulation,[],[f10089,f3598]) ).
fof(f10112,plain,
! [X0,X1] : is_a_theorem(implies(and(X1,X0),and(X0,X1))),
inference(forward_demodulation,[],[f10107,f3523]) ).
fof(f10665,plain,
! [X0,X1] :
( is_a_theorem(equiv(and(X0,X1),and(X1,X0)))
| ~ is_a_theorem(implies(and(X0,X1),and(X1,X0))) ),
inference(resolution,[],[f10112,f237]) ).
fof(f10709,plain,
! [X0,X1] : is_a_theorem(equiv(and(X0,X1),and(X1,X0))),
inference(forward_subsumption_resolution,[],[f10665,f10112]) ).
fof(f14080,plain,
! [X0,X1] : and(X0,X1) = and(X1,X0),
inference(resolution,[],[f10709,f153]) ).
fof(f14578,plain,
! [X0,X1] : implies(X1,X0) = not(and(not(X0),X1)),
inference(superposition,[],[f137,f14080]) ).
fof(f14733,plain,
! [X0,X1] : implies(X1,X0) = implies(not(X0),not(X1)),
inference(forward_demodulation,[],[f14578,f3553]) ).
fof(f14871,plain,
! [X0,X1] : implies(X1,X0) = or(X0,not(X1)),
inference(forward_demodulation,[],[f14733,f155]) ).
fof(f21746,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),or(and(X2,X0),not(and(X1,X0))))),
inference(superposition,[],[f896,f9435]) ).
fof(f21772,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(and(X1,X0),and(X2,X0)))),
inference(forward_demodulation,[],[f21746,f14871]) ).
fof(f28522,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(and(sK2,sK0),and(sK1,sK2)))),
inference(superposition,[],[f164,f14871]) ).
fof(f28566,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(and(sK0,sK2),and(sK1,sK2)))),
inference(forward_demodulation,[],[f28522,f14080]) ).
fof(f28693,plain,
$false,
inference(forward_subsumption_resolution,[],[f28566,f21772]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL461+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 15:46:15 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.58/3.05 % (2203352)Will run a generic schedule for satisfiability detection.
% 18.58/3.05 % (2203362)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3661050014:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 18.58/3.05 % (2203357)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1136163661_2999 on theBenchmark for (2999ds/0Mi)
% 18.58/3.05 % (2203359)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=937616293:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 18.58/3.05 % (2203360)dis+10_1_sil=32000:sp=arity:random_seed=4071707733:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 18.58/3.05 % (2203361)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3449013:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 18.58/3.05 % (2203363)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=918384899:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 18.58/3.05 % (2203358)% WARNING: option uhcvi not known.
% 18.58/3.05 % TRYING [1]
% 18.58/3.05 % TRYING [2]
% 18.58/3.05 % TRYING [3]
% 18.58/3.05 % (2203358)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2401891236:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 18.58/3.05 % TRYING [4]
% 18.58/3.05 % (2203362)Instruction limit reached!
% 18.58/3.05 % (2203362)------------------------------
% 18.58/3.05 % (2203362)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.58/3.05 % (2203362)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.58/3.05 % (2203362)CaDiCaL version: 2.1.3
% 18.58/3.05 % (2203362)Termination reason: Instruction limit
% 18.58/3.05 % (2203362)Termination phase: Saturation
% 18.58/3.05 % (2203362)Time elapsed: 0.049 s
% 18.58/3.05 % (2203362)Peak memory usage: 14 MB
% 18.58/3.05 % (2203362)Instructions burned: 133 (million)
% 18.58/3.05 % (2203371)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1214849095:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 18.58/3.05 % TRYING [1]
% 18.58/3.05 % TRYING [2]
% 18.58/3.05 % TRYING [3]
% 18.58/3.05 % TRYING [4]
% 18.58/3.05 % (2203360)Instruction limit reached!
% 18.58/3.05 % (2203360)------------------------------
% 18.58/3.05 % (2203360)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.58/3.05 % (2203360)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.58/3.05 % (2203360)CaDiCaL version: 2.1.3
% 18.58/3.05 % (2203360)Termination reason: Instruction limit
% 18.58/3.05 % (2203360)Termination phase: Saturation
% 18.58/3.05 % (2203360)Time elapsed: 0.070 s
% 18.58/3.05 % (2203360)Peak memory usage: 13 MB
% 18.58/3.05 % (2203360)Instructions burned: 105 (million)
% 18.58/3.05 % (2203361)Instruction limit reached!
% 18.58/3.05 % (2203361)------------------------------
% 18.58/3.05 % (2203361)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.58/3.05 % (2203361)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.58/3.05 % (2203361)CaDiCaL version: 2.1.3
% 18.58/3.05 % (2203361)Termination reason: Instruction limit
% 18.58/3.05 % (2203361)Termination phase: Saturation
% 18.58/3.05 % (2203361)Time elapsed: 0.078 s
% 18.58/3.05 % (2203361)Peak memory usage: 13 MB
% 18.58/3.05 % (2203361)Instructions burned: 116 (million)
% 18.58/3.05 % (2203373)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1352802568:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 18.58/3.05 % (2203374)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1862844934:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 18.58/3.05 % TRYING [5]
% 18.58/3.05 % (2203363)Instruction limit reached!
% 18.58/3.05 % (2203363)------------------------------
% 18.58/3.05 % (2203363)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 18.58/3.05 % (2203363)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.58/3.05 % (2203363)CaDiCaL version: 2.1.3
% 18.58/3.05 % (2203363)Termination reason: Instruction limit
% 18.58/3.05 % (2203363)Termination phase: Saturation
% 18.58/3.05 % (2203363)Time elapsed: 0.117 s
% 18.58/3.05 % (2203363)Peak memory usage: 14 MB
% 18.58/3.05 % (2203363)Instructions burned: 160 (million)
% 18.58/3.05 % TRYING [5]
% 18.58/3.05 % (2203377)ott-21_1_sil=16000:fs=off:random_seed=4276939508:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 18.58/3.05 % (2203373)Instruction limit reached!
% 18.58/3.05 % (2203373)------------------------------
% 18.58/3.05 % (2203373)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203373)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203373)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203373)Termination reason: Instruction limit
% 35.65/5.70 % (2203373)Termination phase: Saturation
% 35.65/5.70 % (2203373)Time elapsed: 0.090 s
% 35.65/5.70 % (2203373)Peak memory usage: 14 MB
% 35.65/5.70 % (2203373)Instructions burned: 131 (million)
% 35.65/5.70 % (2203379)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3206352046:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 35.65/5.70 % (2203377)Instruction limit reached!
% 35.65/5.70 % (2203377)------------------------------
% 35.65/5.70 % (2203377)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203377)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203377)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203377)Termination reason: Instruction limit
% 35.65/5.70 % (2203377)Termination phase: Saturation
% 35.65/5.70 % (2203377)Time elapsed: 0.094 s
% 35.65/5.70 % (2203377)Peak memory usage: 13 MB
% 35.65/5.70 % (2203377)Instructions burned: 182 (million)
% 35.65/5.70 % (2203381)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3428791212:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 35.65/5.70 % TRYING [1]
% 35.65/5.70 % TRYING [2]
% 35.65/5.70 % (2203371)Instruction limit reached!
% 35.65/5.70 % (2203371)------------------------------
% 35.65/5.70 % (2203371)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203371)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203371)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203371)Termination reason: Instruction limit
% 35.65/5.70 % (2203371)Termination phase: Finite model building SAT solving
% 35.65/5.70 % (2203371)Time elapsed: 0.213 s
% 35.65/5.70 % (2203371)Peak memory usage: 22 MB
% 35.65/5.70 % (2203371)Instructions burned: 717 (million)
% 35.65/5.70 % (2203383)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1876008879:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 35.65/5.70 % TRYING [3]
% 35.65/5.70 % TRYING [4]
% 35.65/5.70 % (2203374)Instruction limit reached!
% 35.65/5.70 % (2203374)------------------------------
% 35.65/5.70 % (2203374)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203374)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203374)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203374)Termination reason: Instruction limit
% 35.65/5.70 % (2203374)Termination phase: Saturation
% 35.65/5.70 % (2203374)Time elapsed: 0.413 s
% 35.65/5.70 % (2203374)Peak memory usage: 22 MB
% 35.65/5.70 % (2203374)Instructions burned: 686 (million)
% 35.65/5.70 % (2203379)Instruction limit reached!
% 35.65/5.70 % (2203379)------------------------------
% 35.65/5.70 % (2203379)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203379)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203379)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203379)Termination reason: Instruction limit
% 35.65/5.70 % (2203379)Termination phase: Saturation
% 35.65/5.70 % (2203379)Time elapsed: 0.313 s
% 35.65/5.70 % (2203379)Peak memory usage: 14 MB
% 35.65/5.70 % (2203379)Instructions burned: 478 (million)
% 35.65/5.70 % TRYING [5]
% 35.65/5.70 % (2203385)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=4265354222:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 35.65/5.70 % (2203386)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3201002826:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 35.65/5.70 % (2203381)Instruction limit reached!
% 35.65/5.70 % (2203381)------------------------------
% 35.65/5.70 % (2203381)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203381)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203381)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203381)Termination reason: Instruction limit
% 35.65/5.70 % (2203381)Termination phase: Finite model building SAT solving
% 35.65/5.70 % (2203381)Time elapsed: 0.356 s
% 35.65/5.70 % (2203381)Peak memory usage: 23 MB
% 35.65/5.70 % (2203381)Instructions burned: 868 (million)
% 35.65/5.70 % TRYING [14]
% 35.65/5.70 % (2203389)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2549384182:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 35.65/5.70 % (2203383)Instruction limit reached!
% 35.65/5.70 % (2203383)------------------------------
% 35.65/5.70 % (2203383)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203383)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203383)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203383)Termination reason: Instruction limit
% 35.65/5.70 % (2203383)Termination phase: Saturation
% 35.65/5.70 % (2203383)Time elapsed: 0.395 s
% 35.65/5.70 % (2203383)Peak memory usage: 24 MB
% 35.65/5.70 % (2203383)Instructions burned: 1182 (million)
% 35.65/5.70 % (2203391)fmb+10_1_sil=64000:random_seed=3993233202:i=22061:nm=2:gsp=on_2992 on theBenchmark for (2992ds/22061Mi)
% 35.65/5.70 % TRYING [1]
% 35.65/5.70 % TRYING [2]
% 35.65/5.70 % TRYING [3]
% 35.65/5.70 % TRYING [4]
% 35.65/5.70 % TRYING [5]
% 35.65/5.70 % (2203385)Instruction limit reached!
% 35.65/5.70 % (2203385)------------------------------
% 35.65/5.70 % (2203385)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203385)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203385)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203385)Termination reason: Instruction limit
% 35.65/5.70 % (2203385)Termination phase: Finite model building constraint generation
% 35.65/5.70 % (2203385)Time elapsed: 0.319 s
% 35.65/5.70 % (2203385)Peak memory usage: 69 MB
% 35.65/5.70 % (2203385)Instructions burned: 890 (million)
% 35.65/5.70 % (2203393)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=259809056:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 35.65/5.70 % TRYING [20]
% 35.65/5.70 % TRYING [6]
% 35.65/5.70 % (2203386)Instruction limit reached!
% 35.65/5.70 % (2203386)------------------------------
% 35.65/5.70 % (2203386)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203386)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203386)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203386)Termination reason: Instruction limit
% 35.65/5.70 % (2203386)Termination phase: Saturation
% 35.65/5.70 % (2203386)Time elapsed: 0.481 s
% 35.65/5.70 % (2203386)Peak memory usage: 21 MB
% 35.65/5.70 % (2203386)Instructions burned: 692 (million)
% 35.65/5.70 % (2203395)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=526572571:fmbsr=1.7:i=920_2989 on theBenchmark for (2989ds/920Mi)
% 35.65/5.70 % TRYING [8]
% 35.65/5.70 % TRYING [6]
% 35.65/5.70 % (2203389)Instruction limit reached!
% 35.65/5.70 % (2203389)------------------------------
% 35.65/5.70 % (2203389)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203389)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203389)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203389)Termination reason: Instruction limit
% 35.65/5.70 % (2203389)Termination phase: Saturation
% 35.65/5.70 % (2203389)Time elapsed: 0.531 s
% 35.65/5.70 % (2203389)Peak memory usage: 23 MB
% 35.65/5.70 % (2203389)Instructions burned: 880 (million)
% 35.65/5.70 % (2203397)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3664427171:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 35.65/5.70 % (2203395)Instruction limit reached!
% 35.65/5.70 % (2203395)------------------------------
% 35.65/5.70 % (2203395)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203395)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203395)Termination reason: Instruction limit
% 35.65/5.70 % (2203395)Termination phase: Finite model building constraint generation
% 35.65/5.70 % (2203395)Time elapsed: 0.347 s
% 35.65/5.70 % (2203395)Peak memory usage: 65 MB
% 35.65/5.70 % (2203395)Instructions burned: 921 (million)
% 35.65/5.70 % (2203399)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2670375437:i=1472:ins=7:fdi=8:gsp=on_2985 on theBenchmark for (2985ds/1472Mi)
% 35.65/5.70 % (2203399)Instruction limit reached!
% 35.65/5.70 % (2203399)------------------------------
% 35.65/5.70 % (2203399)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203399)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203399)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203399)Termination reason: Instruction limit
% 35.65/5.70 % (2203399)Termination phase: Saturation
% 35.65/5.70 % (2203399)Time elapsed: 0.778 s
% 35.65/5.70 % (2203399)Peak memory usage: 27 MB
% 35.65/5.70 % (2203399)Instructions burned: 1472 (million)
% 35.65/5.70 % (2203401)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1541689570:i=6324_2977 on theBenchmark for (2977ds/6324Mi)
% 35.65/5.70 % TRYING [77]
% 35.65/5.70 % TRYING [7]
% 35.65/5.70 % (2203397)Instruction limit reached!
% 35.65/5.70 % (2203397)------------------------------
% 35.65/5.70 % (2203397)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203397)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203397)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203397)Termination reason: Instruction limit
% 35.65/5.70 % (2203397)Termination phase: Saturation
% 35.65/5.70 % (2203397)Time elapsed: 2.932 s
% 35.65/5.70 % (2203397)Peak memory usage: 59 MB
% 35.65/5.70 % (2203397)Instructions burned: 5131 (million)
% 35.65/5.70 % (2203403)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=464616544:fmbsr=2.30978:i=2174_2958 on theBenchmark for (2958ds/2174Mi)
% 35.65/5.70 % TRYING [16]
% 35.65/5.70 % (2203393)Instruction limit reached!
% 35.65/5.70 % (2203393)------------------------------
% 35.65/5.70 % (2203393)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203393)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203393)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203393)Termination reason: Instruction limit
% 35.65/5.70 % (2203393)Termination phase: Finite model building constraint generation
% 35.65/5.70 % (2203393)Time elapsed: 3.323 s
% 35.65/5.70 % (2203393)Peak memory usage: 563 MB
% 35.65/5.70 % (2203393)Instructions burned: 9517 (million)
% 35.65/5.70 % (2203405)ott-2_1_sil=16000:newcnf=on:random_seed=519135489:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2956 on theBenchmark for (2956ds/869Mi)
% 35.65/5.70 % (2203401)Instruction limit reached!
% 35.65/5.70 % (2203401)------------------------------
% 35.65/5.70 % (2203401)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203401)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203401)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203401)Termination reason: Instruction limit
% 35.65/5.70 % (2203401)Termination phase: Finite model building constraint generation
% 35.65/5.70 % (2203401)Time elapsed: 2.316 s
% 35.65/5.70 % (2203401)Peak memory usage: 415 MB
% 35.65/5.70 % (2203401)Instructions burned: 6325 (million)
% 35.65/5.70 % (2203407)ott+10_1_sil=32000:tgt=ground:random_seed=15971375:i=5114:av=off_2953 on theBenchmark for (2953ds/5114Mi)
% 35.65/5.70 % (2203405)Instruction limit reached!
% 35.65/5.70 % (2203405)------------------------------
% 35.65/5.70 % (2203405)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203405)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203405)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203405)Termination reason: Instruction limit
% 35.65/5.70 % (2203405)Termination phase: Saturation
% 35.65/5.70 % (2203405)Time elapsed: 0.566 s
% 35.65/5.70 % (2203405)Peak memory usage: 19 MB
% 35.65/5.70 % (2203405)Instructions burned: 869 (million)
% 35.65/5.70 % (2203409)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=793341197:i=54282_2951 on theBenchmark for (2951ds/54282Mi)
% 35.65/5.70 % (2203403)Instruction limit reached!
% 35.65/5.70 % (2203403)------------------------------
% 35.65/5.70 % (2203403)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.65/5.70 % (2203403)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.65/5.70 % (2203403)CaDiCaL version: 2.1.3
% 35.65/5.70 % (2203403)Termination reason: Instruction limit
% 35.65/5.70 % (2203403)Termination phase: Finite model building constraint generation
% 35.65/5.70 % (2203403)Time elapsed: 0.735 s
% 35.65/5.70 % (2203403)Peak memory usage: 132 MB
% 35.65/5.70 % (2203403)Instructions burned: 2175 (million)
% 35.65/5.70 % TRYING [1]
% 35.65/5.70 % TRYING [2]
% 35.65/5.70 % TRYING [3]
% 35.65/5.70 % TRYING [4]
% 35.65/5.70 % (2203411)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=4240143360:i=3512:aac=none_2950 on theBenchmark for (2950ds/3512Mi)
% 35.65/5.70 % TRYING [5]
% 35.65/5.70 % (2203407) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2203352-2203407"...
% 35.65/5.70 % (2203407)...printing done.
% 35.65/5.70 % (2203407)Refutation found. Thanks to Tanya!
% 35.65/5.70 % SZS status Theorem for theBenchmark
% 35.65/5.70 % SZS output start Proof for theBenchmark
% See solution above
% 37.47/5.70 % (2203407)------------------------------
% 37.47/5.70 % (2203407)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 37.47/5.70 % (2203407)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 37.47/5.70 % (2203407)CaDiCaL version: 2.1.3
% 37.47/5.70 % (2203407)Termination reason: Refutation
% 37.47/5.70 % (2203407)Time elapsed: 0.629 s
% 37.47/5.70 % (2203407)Peak memory usage: 21 MB
% 37.47/5.70 % (2203407)Instructions burned: 962 (million)
% 37.47/5.70 % (2203352)Success in time 5.286 s
% 37.47/5.70 % Vampire exiting
%------------------------------------------------------------------------------