%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL517+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 : 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:52:50 AM UTC 2026
% Result : Theorem 6.50s 1.96s
% Output : Refutation 8.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 18
% Syntax : Number of formulae : 113 ( 47 unt; 0 def)
% Number of atoms : 204 ( 22 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 168 ( 77 ~; 70 |; 2 &)
% ( 6 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 178 ( 177 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/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(f16,axiom,
( kn1
<=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn1) ).
fof(f17,axiom,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn2) ).
fof(f18,axiom,
( kn3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn3) ).
fof(f21,axiom,
( cn3
<=> ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn3) ).
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(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_modus_ponens) ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn1) ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn3) ).
fof(f39,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',use_substitution_of_equivalents) ).
fof(f40,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_op_or) ).
fof(f42,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_op_equiv) ).
fof(f43,conjecture,
cn3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn3) ).
fof(f44,negated_conjecture,
~ cn3,
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f45,plain,
~ cn3,
inference(flattening,[],[f44]) ).
fof(f46,plain,
( ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0))
=> cn3 ),
inference(unused_predicate_definition_removal,[],[f21]) ).
fof(f47,plain,
( kn3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(unused_predicate_definition_removal,[],[f18]) ).
fof(f48,plain,
( kn2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f17]) ).
fof(f49,plain,
( kn1
=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f50,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f51,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f55,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f51]) ).
fof(f56,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f55]) ).
fof(f57,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f50]) ).
fof(f58,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(ennf_transformation,[],[f49]) ).
fof(f59,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(ennf_transformation,[],[f48]) ).
fof(f60,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(ennf_transformation,[],[f47]) ).
fof(f61,plain,
( cn3
| ? [X0] : ~ is_a_theorem(implies(implies(not(X0),X0),X0)) ),
inference(ennf_transformation,[],[f46]) ).
fof(f62,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f63,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f64,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f65,plain,
( cn3
| ~ is_a_theorem(implies(implies(not(sK0),sK0),sK0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f61]) ).
fof(f66,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f56]) ).
fof(f67,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f57]) ).
fof(f68,plain,
! [X0] :
( is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(cnf_transformation,[],[f58]) ).
fof(f69,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[],[f59]) ).
fof(f70,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(cnf_transformation,[],[f60]) ).
fof(f71,plain,
( cn3
| ~ is_a_theorem(implies(implies(not(sK0),sK0),sK0)) ),
inference(cnf_transformation,[],[f65]) ).
fof(f72,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f62]) ).
fof(f73,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f63]) ).
fof(f74,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f64]) ).
fof(f76,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f78,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f79,plain,
kn1,
inference(cnf_transformation,[],[f36]) ).
fof(f80,plain,
kn2,
inference(cnf_transformation,[],[f37]) ).
fof(f81,plain,
kn3,
inference(cnf_transformation,[],[f38]) ).
fof(f82,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f39]) ).
fof(f83,plain,
op_or,
inference(cnf_transformation,[],[f40]) ).
fof(f84,plain,
op_equiv,
inference(cnf_transformation,[],[f42]) ).
fof(f85,plain,
~ cn3,
inference(cnf_transformation,[],[f45]) ).
fof(f86,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(forward_subsumption_resolution,[],[f74,f84]) ).
fof(f87,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f73,f76]) ).
fof(f88,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f72,f83]) ).
fof(f89,plain,
~ is_a_theorem(implies(implies(not(sK0),sK0),sK0)),
inference(forward_subsumption_resolution,[],[f71,f85]) ).
fof(f90,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))),
inference(forward_subsumption_resolution,[],[f70,f81]) ).
fof(f91,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(forward_subsumption_resolution,[],[f69,f80]) ).
fof(f92,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,X0))),
inference(forward_subsumption_resolution,[],[f68,f79]) ).
fof(f93,plain,
! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f67,f82]) ).
fof(f94,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f66,f78]) ).
fof(f95,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f88,f87]) ).
fof(f97,plain,
! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2),
inference(superposition,[],[f95,f87]) ).
fof(f98,plain,
~ is_a_theorem(implies(or(sK0,sK0),sK0)),
inference(superposition,[],[f89,f95]) ).
fof(f100,plain,
! [X0] :
( is_a_theorem(and(X0,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f94,f92]) ).
fof(f102,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| ~ is_a_theorem(not(X0))
| is_a_theorem(X1) ),
inference(superposition,[],[f94,f95]) ).
fof(f103,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(not(and(X1,X2)),not(and(X2,X0)))) ),
inference(resolution,[],[f90,f94]) ).
fof(f105,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X2,X0),implies(implies(X0,X1),not(and(not(X1),X2))))),
inference(superposition,[],[f90,f87]) ).
fof(f106,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),X2),implies(not(and(X2,X0)),implies(X0,X1)))),
inference(superposition,[],[f90,f87]) ).
fof(f108,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(not(X1),X2),or(and(X2,X0),implies(X0,X1)))),
inference(forward_demodulation,[],[f106,f95]) ).
fof(f110,plain,
! [X2,X0,X1] :
( is_a_theorem(or(and(X1,X2),not(and(X2,X0))))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_demodulation,[],[f103,f95]) ).
fof(f111,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),or(and(X2,X0),implies(X0,X1)))),
inference(forward_demodulation,[],[f108,f95]) ).
fof(f113,plain,
! [X2,X0,X1] :
( is_a_theorem(or(and(X2,X0),implies(X0,X1)))
| ~ is_a_theorem(implies(not(X1),X2)) ),
inference(superposition,[],[f110,f87]) ).
fof(f114,plain,
! [X2,X0,X1] :
( is_a_theorem(or(and(X2,X0),implies(X0,X1)))
| ~ is_a_theorem(or(X1,X2)) ),
inference(forward_demodulation,[],[f113,f95]) ).
fof(f116,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),or(and(X2,not(X0)),or(X0,X1)))),
inference(superposition,[],[f111,f95]) ).
fof(f117,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X1,X2),implies(implies(X2,X0),or(X0,X1)))),
inference(forward_demodulation,[],[f116,f97]) ).
fof(f129,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),or(X2,X0)))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[],[f117,f94]) ).
fof(f131,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),not(and(not(X2),X0))))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f105,f94]) ).
fof(f140,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(not(and(not(X2),X0))) ),
inference(resolution,[],[f131,f94]) ).
fof(f150,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,and(X1,X2)))
| is_a_theorem(not(and(not(X1),X0))) ),
inference(resolution,[],[f140,f91]) ).
fof(f164,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(X0,X1))
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(or(X2,X0)) ),
inference(resolution,[],[f129,f94]) ).
fof(f183,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(not(and(X0,X1)))
| is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X2,X0)) ),
inference(resolution,[],[f102,f110]) ).
fof(f184,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(not(and(X0,X1)))
| is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(X2,X0)) ),
inference(resolution,[],[f102,f114]) ).
fof(f193,plain,
! [X0] : is_a_theorem(not(and(not(X0),X0))),
inference(resolution,[],[f150,f92]) ).
fof(f199,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X1,not(X0)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f193,f184]) ).
fof(f200,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,not(X0)))
| is_a_theorem(not(and(X0,X1))) ),
inference(resolution,[],[f193,f183]) ).
fof(f202,plain,
! [X0] : is_a_theorem(implies(not(not(X0)),X0)),
inference(superposition,[],[f193,f87]) ).
fof(f203,plain,
! [X0] : is_a_theorem(or(not(X0),X0)),
inference(forward_demodulation,[],[f202,f95]) ).
fof(f205,plain,
! [X0,X1] :
( is_a_theorem(or(X1,not(X0)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f203,f164]) ).
fof(f213,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(and(X0,X1),and(X2,X0)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f199,f110]) ).
fof(f214,plain,
! [X0] : is_a_theorem(implies(X0,not(not(X0)))),
inference(resolution,[],[f199,f203]) ).
fof(f219,plain,
! [X0] :
( is_a_theorem(not(not(X0)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f214,f94]) ).
fof(f225,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(and(X2,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(and(X1,X2)) ),
inference(resolution,[],[f213,f94]) ).
fof(f228,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(and(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f225,f100]) ).
fof(f244,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(not(X1))
| is_a_theorem(not(X0)) ),
inference(resolution,[],[f205,f102]) ).
fof(f271,plain,
! [X0,X1] :
( is_a_theorem(not(and(X0,X1)))
| ~ is_a_theorem(not(X0)) ),
inference(resolution,[],[f244,f91]) ).
fof(f280,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(not(X0)) ),
inference(superposition,[],[f271,f87]) ).
fof(f286,plain,
! [X0,X1] :
( is_a_theorem(not(and(X1,X0)))
| ~ is_a_theorem(not(X0)) ),
inference(resolution,[],[f280,f200]) ).
fof(f302,plain,
! [X0,X1] :
( ~ is_a_theorem(not(not(X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(superposition,[],[f286,f87]) ).
fof(f303,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f302,f219]) ).
fof(f307,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f303,f228]) ).
fof(f317,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(equiv(X0,X1)) ),
inference(superposition,[],[f307,f86]) ).
fof(f322,plain,
! [X0] :
( ~ is_a_theorem(implies(and(X0,X0),X0))
| is_a_theorem(equiv(and(X0,X0),X0)) ),
inference(resolution,[],[f317,f92]) ).
fof(f338,plain,
! [X0] : is_a_theorem(equiv(and(X0,X0),X0)),
inference(forward_subsumption_resolution,[],[f322,f91]) ).
fof(f341,plain,
! [X0] : and(X0,X0) = X0,
inference(resolution,[],[f338,f93]) ).
fof(f345,plain,
! [X0] : implies(not(X0),X0) = not(not(X0)),
inference(superposition,[],[f87,f341]) ).
fof(f376,plain,
! [X0] : or(X0,X0) = not(not(X0)),
inference(forward_demodulation,[],[f345,f95]) ).
fof(f401,plain,
~ is_a_theorem(implies(not(not(sK0)),sK0)),
inference(superposition,[],[f98,f376]) ).
fof(f402,plain,
~ is_a_theorem(or(not(sK0),sK0)),
inference(forward_demodulation,[],[f401,f95]) ).
fof(f407,plain,
$false,
inference(forward_subsumption_resolution,[],[f402,f203]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL517+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 : n009.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:55:30 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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
% 6.50/1.96 % (2211364)Detected formulas, will run a generic FOF schedule.
% 6.50/1.96 % (2211373)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2269969995:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.50/1.96 % (2211373)Refutation not found, incomplete strategy
% 6.50/1.96 % (2211373)------------------------------
% 6.50/1.96 % (2211373)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.50/1.96 % (2211373)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.50/1.96 % (2211373)CaDiCaL version: 2.1.3
% 6.50/1.96 % (2211373)Termination reason: Refutation not found, incomplete strategy
% 6.50/1.96 % (2211373)Time elapsed: 0.0000 s
% 6.50/1.96 % (2211373)Peak memory usage: 86 MB
% 6.50/1.96 % (2211369)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=1585795496:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.50/1.96 % (2211370)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=2484506747:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.50/1.96 % (2211372)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3733964826:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.50/1.96 % (2211371)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=4183577752:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.50/1.96 % (2211372)Refutation not found, incomplete strategy
% 6.50/1.96 % (2211372)------------------------------
% 6.50/1.96 % (2211372)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.50/1.96 % (2211372)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.50/1.96 % (2211372)CaDiCaL version: 2.1.3
% 6.50/1.96 % (2211372)Termination reason: Refutation not found, incomplete strategy
% 6.50/1.96 % (2211372)Time elapsed: 0.001 s
% 6.50/1.96 % (2211372)Peak memory usage: 86 MB
% 6.50/1.96 % (2211375)dis-21_1_sil=8000:lcm=predicate:random_seed=2010517407: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)
% 6.50/1.96 % (2211374)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3336918598:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.50/1.96 % (2211375)Refutation not found, incomplete strategy
% 6.50/1.96 % (2211375)------------------------------
% 6.50/1.96 % (2211375)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.50/1.96 % (2211375)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.50/1.96 % (2211375)CaDiCaL version: 2.1.3
% 6.50/1.96 % (2211375)Termination reason: Refutation not found, incomplete strategy
% 6.50/1.96 % (2211375)Time elapsed: 0.002 s
% 6.50/1.96 % (2211375)Peak memory usage: 88 MB
% 6.50/1.96 % (2211375)Instructions burned: 1 (million)
% 6.50/1.96 % (2211374)Instruction limit reached!
% 6.50/1.96 % (2211374)------------------------------
% 6.50/1.96 % (2211374)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.50/1.96 % (2211374)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.50/1.96 % (2211374)CaDiCaL version: 2.1.3
% 6.50/1.96 % (2211374)Termination reason: Instruction limit
% 6.50/1.96 % (2211374)Termination phase: Saturation
% 6.50/1.96 % (2211374)Time elapsed: 0.091 s
% 6.50/1.96 % (2211374)Peak memory usage: 90 MB
% 6.50/1.96 % (2211374)Instructions burned: 139 (million)
% 6.50/1.96 % (2211373)------------------------------
% 6.50/1.96 % (2211373)------------------------------
% 6.50/1.96 % (2211384)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1182466764:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 6.50/1.96 % (2211384)Refutation not found, incomplete strategy
% 6.50/1.96 % (2211384)------------------------------
% 6.50/1.96 % (2211384)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.50/1.96 % (2211384)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.50/1.96 % (2211384)CaDiCaL version: 2.1.3
% 6.50/1.96 % (2211384)Termination reason: Refutation not found, incomplete strategy
% 6.50/1.96 % (2211384)Time elapsed: 0.0000 s
% 6.50/1.96 % (2211384)Peak memory usage: 87 MB
% 6.50/1.96 % (2211383)lrs+10_1_sil=8000:sp=occurrence:random_seed=3743329728:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 6.50/1.96 % (2211372)------------------------------
% 6.50/1.96 % (2211372)------------------------------
% 6.50/1.96 % (2211375)------------------------------
% 6.50/1.96 % (2211375)------------------------------
% 6.50/1.96 % (2211384)------------------------------
% 6.50/1.96 % (2211384)------------------------------
% 6.50/1.96 % (2211387)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2302436995:i=325:sd=1:ss=axioms:sgt=32_2995 on theBenchmark for (2995ds/325Mi)
% 6.50/1.96 % (2211383)Instruction limit reached!
% 6.50/1.96 % (2211383)------------------------------
% 6.50/1.96 % (2211383)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.50/1.96 % (2211383)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.50/1.96 % (2211383)CaDiCaL version: 2.1.3
% 6.50/1.96 % (2211383)Termination reason: Instruction limit
% 6.50/1.96 % (2211383)Termination phase: Saturation
% 6.50/1.96 % (2211383)Time elapsed: 0.165 s
% 6.50/1.96 % (2211383)Peak memory usage: 92 MB
% 6.50/1.96 % (2211383)Instructions burned: 285 (million)
% 6.50/1.96 % (2211387)Refutation not found, incomplete strategy
% 6.50/1.96 % (2211387)------------------------------
% 6.50/1.96 % (2211387)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.50/1.96 % (2211387)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.50/1.96 % (2211387)CaDiCaL version: 2.1.3
% 6.50/1.96 % (2211387)Termination reason: Refutation not found, incomplete strategy
% 6.50/1.96 % (2211387)Time elapsed: 0.001 s
% 6.50/1.96 % (2211387)Peak memory usage: 87 MB
% 6.50/1.96 % (2211388)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=3417044610:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 6.50/1.96 % (2211389)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2558468555:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 6.50/1.96 % (2211389)Refutation not found, incomplete strategy
% 6.50/1.96 % (2211389)------------------------------
% 6.50/1.96 % (2211389)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.50/1.96 % (2211389)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.50/1.96 % (2211389)CaDiCaL version: 2.1.3
% 6.50/1.96 % (2211389)Termination reason: Refutation not found, incomplete strategy
% 6.50/1.96 % (2211389)Time elapsed: 0.0000 s
% 6.50/1.96 % (2211389)Peak memory usage: 86 MB
% 6.50/1.96 % (2211391)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3704326724:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 6.50/1.96 % (2211388)Instruction limit reached!
% 6.50/1.96 % (2211388)------------------------------
% 6.50/1.96 % (2211388)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.50/1.96 % (2211388)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.50/1.96 % (2211388)CaDiCaL version: 2.1.3
% 6.50/1.96 % (2211388)Termination reason: Instruction limit
% 6.50/1.96 % (2211388)Termination phase: Saturation
% 6.50/1.96 % (2211388)Time elapsed: 0.158 s
% 6.50/1.96 % (2211388)Peak memory usage: 92 MB
% 6.50/1.96 % (2211388)Instructions burned: 249 (million)
% 6.50/1.96 % (2211371)Refutation not found, incomplete strategy
% 6.50/1.96 % (2211371)------------------------------
% 6.50/1.96 % (2211371)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.50/1.96 % (2211371)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.50/1.96 % (2211371)CaDiCaL version: 2.1.3
% 6.50/1.96 % (2211371)Termination reason: Refutation not found, incomplete strategy
% 6.50/1.96 % (2211371)Time elapsed: 0.558 s
% 6.50/1.96 % (2211371)Peak memory usage: 125 MB
% 6.50/1.96 % (2211371)Instructions burned: 824 (million)
% 6.50/1.96 % (2211389)------------------------------
% 6.50/1.96 % (2211389)------------------------------
% 6.50/1.96 % (2211387)------------------------------
% 6.50/1.96 % (2211387)------------------------------
% 6.50/1.96 % (2211396)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1555486376:i=127:av=off:fsr=off:sup=off_2992 on theBenchmark for (2992ds/127Mi)
% 6.50/1.96 % (2211369)First to succeed.
% 6.50/1.96 % (2211369)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2211364"
% 6.50/1.96 % (2211395)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=1684507704:cts=off:i=113:fsr=off:ss=included:sgt=4_2992 on theBenchmark for (2992ds/113Mi)
% 6.50/1.96 % (2211395)Refutation not found, incomplete strategy
% 6.50/1.96 % (2211395)------------------------------
% 6.50/1.96 % (2211395)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.50/1.96 % (2211395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.50/1.96 % (2211395)CaDiCaL version: 2.1.3
% 6.50/1.96 % (2211395)Termination reason: Refutation not found, incomplete strategy
% 6.50/1.96 % (2211395)Time elapsed: 0.001 s
% 6.50/1.96 % (2211395)Peak memory usage: 88 MB
% 6.50/1.96 % (2211396)Instruction limit reached!
% 6.50/1.96 % (2211396)------------------------------
% 6.50/1.96 % (2211396)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.50/1.96 % (2211396)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.50/1.96 % (2211396)CaDiCaL version: 2.1.3
% 6.50/1.96 % (2211396)Termination reason: Instruction limit
% 6.50/1.96 % (2211396)Termination phase: Saturation
% 6.50/1.96 % (2211396)Time elapsed: 0.037 s
% 6.50/1.96 % (2211396)Peak memory usage: 89 MB
% 6.50/1.96 % (2211396)Instructions burned: 129 (million)
% 6.50/1.96 % (2211397)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=1205126665:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2992 on theBenchmark for (2992ds/114Mi)
% 6.50/1.96 % (2211397)Refutation not found, incomplete strategy
% 6.50/1.96 % (2211397)------------------------------
% 6.50/1.96 % (2211397)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.50/1.96 % (2211397)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.50/1.96 % (2211397)CaDiCaL version: 2.1.3
% 6.50/1.96 % (2211397)Termination reason: Refutation not found, incomplete strategy
% 6.50/1.96 % (2211397)Time elapsed: 0.001 s
% 6.50/1.96 % (2211397)Peak memory usage: 87 MB
% 6.50/1.96 % (2211400)lrs+10_1_sil=8000:sp=occurrence:random_seed=3017256464:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2991 on theBenchmark for (2991ds/907Mi)
% 6.50/1.96 % (2211371)------------------------------
% 6.50/1.96 % (2211371)------------------------------
% 6.50/1.96 % (2211369)Refutation found. Thanks to Tanya!
% 6.50/1.96 % SZS status Theorem for theBenchmark
% 6.50/1.96 % SZS output start Proof for theBenchmark
% See solution above
% 8.30/2.05 % (2211369)------------------------------
% 8.30/2.05 % (2211369)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.30/2.05 % (2211369)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.30/2.05 % (2211369)CaDiCaL version: 2.1.3
% 8.30/2.05 % (2211369)Termination reason: Refutation
% 8.30/2.05 % (2211369)Time elapsed: 0.684 s
% 8.30/2.05 % (2211369)Peak memory usage: 128 MB
% 8.30/2.05 % (2211369)Instructions burned: 1006 (million)
% 8.30/2.05 % (2211369)------------------------------
% 8.30/2.05 % (2211369)------------------------------
% 8.30/2.05 % (2211364)Success in time 1.1 s
% 8.30/2.05 % Vampire exiting
%------------------------------------------------------------------------------