%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL548+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:54 AM UTC 2026
% Result : Theorem 7.55s 2.01s
% Output : Refutation 10.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 31
% Syntax : Number of formulae : 135 ( 65 unt; 1 def)
% Number of atoms : 226 ( 29 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 158 ( 67 ~; 57 |; 2 &)
% ( 11 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 18 ( 16 usr; 16 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 150 ( 149 !; 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/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
fof(f2,negated_conjecture,
( substitution_of_equivalents
<=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',modus_tollens) ).
fof(f4,axiom,
( implies_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',implies_2) ).
fof(f8,axiom,
( and_2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',and_3) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_and) ).
fof(f31,negated_conjecture,
( op_equiv
=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_equiv) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_modus_ponens) ).
fof(f36,axiom,
modus_tollens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_modus_tollens) ).
fof(f37,axiom,
implies_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_1) ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_2) ).
fof(f41,axiom,
and_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_2) ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_3) ).
fof(f49,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',use_substitution_of_equivalents) ).
fof(f50,axiom,
( necessitation
<=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',necessitation) ).
fof(f55,axiom,
( axiom_M
<=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_M) ).
fof(f56,axiom,
( axiom_4
<=> ! [X0] : is_a_theorem(implies(necessarily(X0),necessarily(necessarily(X0)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f71,axiom,
( axiom_m9
<=> ! [X0] : is_a_theorem(strict_implies(possibly(possibly(X0)),possibly(X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_m9) ).
fof(f73,axiom,
( op_possibly
=> ! [X0] : possibly(X0) = not(necessarily(not(X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_possibly) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km4b_necessitation) ).
fof(f80,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km4b_axiom_M) ).
fof(f81,axiom,
axiom_4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km4b_axiom_4) ).
fof(f83,axiom,
op_possibly,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_possibly) ).
fof(f86,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f87,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_equiv) ).
fof(f89,conjecture,
axiom_m9,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_m6s3m9b_axiom_m9) ).
fof(f90,negated_conjecture,
~ axiom_m9,
inference(negated_conjecture,[status(cth)],[f89]) ).
fof(f91,plain,
~ axiom_m9,
inference(flattening,[],[f90]) ).
fof(f92,plain,
( ! [X0] : is_a_theorem(strict_implies(possibly(possibly(X0)),possibly(X0)))
=> axiom_m9 ),
inference(unused_predicate_definition_removal,[],[f71]) ).
fof(f94,plain,
( axiom_4
=> ! [X0] : is_a_theorem(implies(necessarily(X0),necessarily(necessarily(X0)))) ),
inference(unused_predicate_definition_removal,[],[f56]) ).
fof(f95,plain,
( axiom_M
=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f97,plain,
( necessitation
=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f104,plain,
( and_3
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f105,plain,
( and_2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f108,plain,
( implies_2
=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f109,plain,
( implies_1
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f110,plain,
( modus_tollens
=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f3]) ).
fof(f111,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f112,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(f117,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f112]) ).
fof(f118,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f117]) ).
fof(f119,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f111]) ).
fof(f120,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ modus_tollens ),
inference(ennf_transformation,[],[f110]) ).
fof(f121,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(ennf_transformation,[],[f109]) ).
fof(f122,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(ennf_transformation,[],[f108]) ).
fof(f125,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(ennf_transformation,[],[f105]) ).
fof(f126,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(ennf_transformation,[],[f104]) ).
fof(f134,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f135,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f136,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ necessitation ),
inference(ennf_transformation,[],[f97]) ).
fof(f138,plain,
( ! [X0] : is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(ennf_transformation,[],[f95]) ).
fof(f139,plain,
( ! [X0] : is_a_theorem(implies(necessarily(X0),necessarily(necessarily(X0))))
| ~ axiom_4 ),
inference(ennf_transformation,[],[f94]) ).
fof(f141,plain,
( axiom_m9
| ? [X0] : ~ is_a_theorem(strict_implies(possibly(possibly(X0)),possibly(X0))) ),
inference(ennf_transformation,[],[f92]) ).
fof(f142,plain,
( ! [X0] : possibly(X0) = not(necessarily(not(X0)))
| ~ op_possibly ),
inference(ennf_transformation,[],[f73]) ).
fof(f143,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f75]) ).
fof(f145,plain,
( axiom_m9
| ~ is_a_theorem(strict_implies(possibly(possibly(sK0)),possibly(sK0))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f141]) ).
fof(f146,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f118]) ).
fof(f147,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f119]) ).
fof(f148,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ modus_tollens ),
inference(cnf_transformation,[],[f120]) ).
fof(f149,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(cnf_transformation,[],[f121]) ).
fof(f150,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(cnf_transformation,[],[f122]) ).
fof(f153,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(cnf_transformation,[],[f125]) ).
fof(f154,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(cnf_transformation,[],[f126]) ).
fof(f162,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f134]) ).
fof(f163,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f135]) ).
fof(f165,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f167,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f168,plain,
modus_tollens,
inference(cnf_transformation,[],[f36]) ).
fof(f169,plain,
implies_1,
inference(cnf_transformation,[],[f37]) ).
fof(f170,plain,
implies_2,
inference(cnf_transformation,[],[f38]) ).
fof(f173,plain,
and_2,
inference(cnf_transformation,[],[f41]) ).
fof(f174,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f181,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f49]) ).
fof(f182,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0)
| ~ necessitation ),
inference(cnf_transformation,[],[f136]) ).
fof(f184,plain,
! [X0] :
( is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(cnf_transformation,[],[f138]) ).
fof(f185,plain,
! [X0] :
( is_a_theorem(implies(necessarily(X0),necessarily(necessarily(X0))))
| ~ axiom_4 ),
inference(cnf_transformation,[],[f139]) ).
fof(f187,plain,
( axiom_m9
| ~ is_a_theorem(strict_implies(possibly(possibly(sK0)),possibly(sK0))) ),
inference(cnf_transformation,[],[f145]) ).
fof(f188,plain,
! [X0] :
( possibly(X0) = not(necessarily(not(X0)))
| ~ op_possibly ),
inference(cnf_transformation,[],[f142]) ).
fof(f189,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f143]) ).
fof(f192,plain,
necessitation,
inference(cnf_transformation,[],[f78]) ).
fof(f194,plain,
axiom_M,
inference(cnf_transformation,[],[f80]) ).
fof(f195,plain,
axiom_4,
inference(cnf_transformation,[],[f81]) ).
fof(f197,plain,
op_possibly,
inference(cnf_transformation,[],[f83]) ).
fof(f199,plain,
op_strict_implies,
inference(cnf_transformation,[],[f86]) ).
fof(f200,plain,
op_equiv,
inference(cnf_transformation,[],[f87]) ).
fof(f202,plain,
~ axiom_m9,
inference(cnf_transformation,[],[f91]) ).
fof(f214,definition,
! [X0,X1] : sF5(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f215,plain,
! [X0,X1] : and(implies(X0,X1),implies(X1,X0)) = sF5(X0,X1),
inference(reorient_equations,[],[f214]) ).
fof(f216,plain,
! [X0,X1] :
( equiv(X0,X1) = sF5(X0,X1)
| ~ op_equiv ),
inference(definition_folding,[],[f163,f215]) ).
fof(f221,plain,
! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(forward_subsumption_resolution,[],[f189,f199]) ).
fof(f222,plain,
! [X0] : possibly(X0) = not(necessarily(not(X0))),
inference(forward_subsumption_resolution,[],[f188,f197]) ).
fof(f223,plain,
~ is_a_theorem(strict_implies(possibly(possibly(sK0)),possibly(sK0))),
inference(forward_subsumption_resolution,[],[f187,f202]) ).
fof(f225,plain,
! [X0] : is_a_theorem(implies(necessarily(X0),necessarily(necessarily(X0)))),
inference(forward_subsumption_resolution,[],[f185,f195]) ).
fof(f226,plain,
! [X0] : is_a_theorem(implies(necessarily(X0),X0)),
inference(forward_subsumption_resolution,[],[f184,f194]) ).
fof(f228,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[],[f182,f192]) ).
fof(f229,plain,
! [X0,X1] : equiv(X0,X1) = sF5(X0,X1),
inference(forward_subsumption_resolution,[],[f216,f200]) ).
fof(f230,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f162,f165]) ).
fof(f238,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(forward_subsumption_resolution,[],[f154,f174]) ).
fof(f239,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)),
inference(forward_subsumption_resolution,[],[f153,f173]) ).
fof(f242,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
inference(forward_subsumption_resolution,[],[f150,f170]) ).
fof(f243,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(forward_subsumption_resolution,[],[f149,f169]) ).
fof(f244,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))),
inference(forward_subsumption_resolution,[],[f148,f168]) ).
fof(f245,plain,
! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f147,f181]) ).
fof(f246,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f146,f167]) ).
fof(f249,plain,
~ is_a_theorem(necessarily(implies(possibly(possibly(sK0)),possibly(sK0)))),
inference(forward_demodulation,[],[f223,f221]) ).
fof(f255,plain,
~ is_a_theorem(necessarily(implies(possibly(not(necessarily(not(sK0)))),not(necessarily(not(sK0)))))),
inference(forward_demodulation,[],[f249,f222]) ).
fof(f257,plain,
~ is_a_theorem(necessarily(implies(not(necessarily(not(not(necessarily(not(sK0)))))),not(necessarily(not(sK0)))))),
inference(forward_demodulation,[],[f255,f222]) ).
fof(f258,plain,
~ is_a_theorem(implies(not(necessarily(not(not(necessarily(not(sK0)))))),not(necessarily(not(sK0))))),
inference(resolution,[],[f228,f257]) ).
fof(f265,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,and(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f246,f238]) ).
fof(f288,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f265,f246]) ).
fof(f333,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f242,f246]) ).
fof(f335,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f244,f246]) ).
fof(f338,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f333,f243]) ).
fof(f339,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,X0))),
inference(resolution,[],[f333,f238]) ).
fof(f369,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(superposition,[],[f229,f215]) ).
fof(f376,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(equiv(X0,X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[],[f288,f369]) ).
fof(f432,plain,
! [X0] :
( is_a_theorem(equiv(and(X0,X0),X0))
| ~ is_a_theorem(implies(and(X0,X0),X0)) ),
inference(resolution,[],[f376,f339]) ).
fof(f435,plain,
! [X0] :
( is_a_theorem(equiv(necessarily(necessarily(X0)),necessarily(X0)))
| ~ is_a_theorem(implies(necessarily(necessarily(X0)),necessarily(X0))) ),
inference(resolution,[],[f376,f225]) ).
fof(f438,plain,
! [X0] : is_a_theorem(equiv(necessarily(necessarily(X0)),necessarily(X0))),
inference(forward_subsumption_resolution,[],[f435,f226]) ).
fof(f441,plain,
! [X0] : is_a_theorem(equiv(and(X0,X0),X0)),
inference(forward_subsumption_resolution,[],[f432,f239]) ).
fof(f486,plain,
! [X0] : and(X0,X0) = X0,
inference(resolution,[],[f441,f245]) ).
fof(f506,plain,
! [X0] : implies(not(X0),X0) = not(not(X0)),
inference(superposition,[],[f230,f486]) ).
fof(f521,plain,
! [X0] : necessarily(X0) = necessarily(necessarily(X0)),
inference(resolution,[],[f438,f245]) ).
fof(f760,plain,
! [X0] : is_a_theorem(implies(X0,not(not(X0)))),
inference(superposition,[],[f243,f506]) ).
fof(f801,plain,
! [X0] : is_a_theorem(implies(not(not(X0)),X0)),
inference(resolution,[],[f760,f335]) ).
fof(f851,plain,
! [X0] :
( is_a_theorem(equiv(X0,not(not(X0))))
| ~ is_a_theorem(implies(X0,not(not(X0)))) ),
inference(resolution,[],[f801,f376]) ).
fof(f856,plain,
! [X0] : is_a_theorem(equiv(X0,not(not(X0)))),
inference(forward_subsumption_resolution,[],[f851,f760]) ).
fof(f885,plain,
! [X0] : not(not(X0)) = X0,
inference(resolution,[],[f856,f245]) ).
fof(f907,plain,
~ is_a_theorem(implies(not(necessarily(necessarily(not(sK0)))),not(necessarily(not(sK0))))),
inference(superposition,[],[f258,f885]) ).
fof(f961,plain,
~ is_a_theorem(implies(not(necessarily(not(sK0))),not(necessarily(not(sK0))))),
inference(forward_demodulation,[],[f907,f521]) ).
fof(f966,plain,
$false,
inference(forward_subsumption_resolution,[],[f961,f338]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL548+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Sun Sep 27 15:59:49 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.34/1.57 % (2547204)Detected formulas, will run a generic FOF schedule.
% 6.34/1.57 % (2547212)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2582372032:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.34/1.57 % (2547215)dis-21_1_sil=8000:lcm=predicate:random_seed=3549025627: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.34/1.57 % (2547213)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2849120955:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.34/1.57 % (2547210)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=1821423636:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.34/1.57 % (2547209)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=3929792308:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.34/1.57 % (2547214)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1572505146:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.34/1.57 % (2547211)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=3223693285:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.34/1.57 % (2547213)Refutation not found, incomplete strategy
% 6.34/1.57 % (2547213)------------------------------
% 6.34/1.57 % (2547213)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.57 % (2547213)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.57 % (2547213)CaDiCaL version: 2.1.3
% 6.34/1.57 % (2547212)Refutation not found, incomplete strategy
% 6.34/1.57 % (2547212)------------------------------
% 6.34/1.57 % (2547212)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.57 % (2547213)Termination reason: Refutation not found, incomplete strategy
% 6.34/1.57 % (2547213)Time elapsed: 0.0000 s
% 6.34/1.57 % (2547213)Peak memory usage: 86 MB
% 6.34/1.57 % (2547212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.57 % (2547212)CaDiCaL version: 2.1.3
% 6.34/1.57 % (2547212)Termination reason: Refutation not found, incomplete strategy
% 6.34/1.57 % (2547212)Time elapsed: 0.0000 s
% 6.34/1.57 % (2547212)Peak memory usage: 87 MB
% 6.34/1.57 % (2547215)Refutation not found, incomplete strategy
% 6.34/1.57 % (2547215)------------------------------
% 6.34/1.57 % (2547215)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.57 % (2547215)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.57 % (2547215)CaDiCaL version: 2.1.3
% 6.34/1.57 % (2547215)Termination reason: Refutation not found, incomplete strategy
% 6.34/1.57 % (2547215)Time elapsed: 0.001 s
% 6.34/1.57 % (2547215)Peak memory usage: 88 MB
% 6.34/1.57 % (2547215)Instructions burned: 1 (million)
% 6.34/1.57 % (2547214)Instruction limit reached!
% 6.34/1.57 % (2547214)------------------------------
% 6.34/1.57 % (2547214)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.57 % (2547214)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.57 % (2547214)CaDiCaL version: 2.1.3
% 6.34/1.57 % (2547214)Termination reason: Instruction limit
% 6.34/1.57 % (2547214)Termination phase: Saturation
% 6.34/1.57 % (2547214)Time elapsed: 0.064 s
% 6.34/1.57 % (2547214)Peak memory usage: 90 MB
% 6.34/1.57 % (2547214)Instructions burned: 141 (million)
% 6.34/1.57 % (2547215)------------------------------
% 6.34/1.57 % (2547215)------------------------------
% 6.34/1.57 % (2547213)------------------------------
% 6.34/1.57 % (2547213)------------------------------
% 6.34/1.57 % (2547212)------------------------------
% 6.34/1.57 % (2547212)------------------------------
% 6.34/1.57 % (2547223)lrs+10_1_sil=8000:sp=occurrence:random_seed=2658775194:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 6.34/1.57 % (2547223)Refutation not found, incomplete strategy
% 6.34/1.57 % (2547223)------------------------------
% 6.34/1.57 % (2547223)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.34/1.57 % (2547223)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.34/1.57 % (2547223)CaDiCaL version: 2.1.3
% 6.34/1.57 % (2547223)Termination reason: Refutation not found, incomplete strategy
% 8.17/1.89 % (2547223)Time elapsed: 0.0000 s
% 8.17/1.89 % (2547223)Peak memory usage: 87 MB
% 8.17/1.89 % (2547224)lrs+10_1_sil=32000:urr=on:br=off:random_seed=939186523:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 8.17/1.89 % (2547225)lrs+1011_1_sil=32000:sp=occurrence:random_seed=925070724:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 8.17/1.89 % (2547226)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=1423129965:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 8.17/1.89 % (2547225)Refutation not found, incomplete strategy
% 8.17/1.89 % (2547225)------------------------------
% 8.17/1.89 % (2547225)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.17/1.89 % (2547225)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.17/1.89 % (2547225)CaDiCaL version: 2.1.3
% 8.17/1.89 % (2547225)Termination reason: Refutation not found, incomplete strategy
% 8.17/1.89 % (2547225)Time elapsed: 0.0000 s
% 8.17/1.89 % (2547225)Peak memory usage: 87 MB
% 8.17/1.89 % (2547224)Refutation not found, incomplete strategy
% 8.17/1.89 % (2547224)------------------------------
% 8.17/1.89 % (2547224)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.17/1.89 % (2547224)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.17/1.89 % (2547224)CaDiCaL version: 2.1.3
% 8.17/1.89 % (2547224)Termination reason: Refutation not found, incomplete strategy
% 8.17/1.89 % (2547224)Time elapsed: 0.0000 s
% 8.17/1.89 % (2547224)Peak memory usage: 87 MB
% 8.17/1.89 % (2547211)Refutation not found, incomplete strategy
% 8.17/1.89 % (2547211)------------------------------
% 8.17/1.89 % (2547211)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.17/1.89 % (2547211)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.17/1.89 % (2547211)CaDiCaL version: 2.1.3
% 8.17/1.89 % (2547211)Termination reason: Refutation not found, incomplete strategy
% 8.17/1.89 % (2547211)Time elapsed: 0.316 s
% 8.17/1.89 % (2547211)Peak memory usage: 125 MB
% 8.17/1.89 % (2547211)Instructions burned: 827 (million)
% 8.17/1.89 % (2547223)------------------------------
% 8.17/1.89 % (2547223)------------------------------
% 8.17/1.89 % (2547226)Instruction limit reached!
% 8.17/1.89 % (2547226)------------------------------
% 8.17/1.89 % (2547226)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.17/1.89 % (2547226)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.17/1.89 % (2547226)CaDiCaL version: 2.1.3
% 8.17/1.89 % (2547226)Termination reason: Instruction limit
% 8.17/1.89 % (2547226)Termination phase: Saturation
% 8.17/1.89 % (2547226)Time elapsed: 0.082 s
% 8.17/1.89 % (2547226)Peak memory usage: 93 MB
% 8.17/1.89 % (2547226)Instructions burned: 249 (million)
% 8.17/1.89 % (2547225)------------------------------
% 8.17/1.89 % (2547225)------------------------------
% 8.17/1.89 % (2547224)------------------------------
% 8.17/1.89 % (2547224)------------------------------
% 8.17/1.89 % (2547231)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2481352700:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 8.17/1.89 % (2547231)Refutation not found, incomplete strategy
% 8.17/1.89 % (2547231)------------------------------
% 8.17/1.89 % (2547231)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.17/1.89 % (2547231)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.17/1.89 % (2547231)CaDiCaL version: 2.1.3
% 8.17/1.89 % (2547231)Termination reason: Refutation not found, incomplete strategy
% 8.17/1.89 % (2547231)Time elapsed: 0.0000 s
% 8.17/1.89 % (2547231)Peak memory usage: 87 MB
% 8.17/1.89 % (2547232)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=182029619:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 8.17/1.89 % (2547211)------------------------------
% 8.17/1.89 % (2547211)------------------------------
% 8.17/1.89 % (2547234)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1402319558:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 8.17/1.89 % (2547233)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=680051191:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 8.17/1.89 % (2547233)Refutation not found, incomplete strategy
% 8.17/1.89 % (2547233)------------------------------
% 7.55/2.01 % (2547233)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.01 % (2547233)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.01 % (2547233)CaDiCaL version: 2.1.3
% 7.55/2.01 % (2547233)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.01 % (2547233)Time elapsed: 0.001 s
% 7.55/2.01 % (2547233)Peak memory usage: 88 MB
% 7.55/2.01 % (2547234)Instruction limit reached!
% 7.55/2.01 % (2547234)------------------------------
% 7.55/2.01 % (2547234)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.01 % (2547234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.01 % (2547234)CaDiCaL version: 2.1.3
% 7.55/2.01 % (2547234)Termination reason: Instruction limit
% 7.55/2.01 % (2547234)Termination phase: Saturation
% 7.55/2.01 % (2547234)Time elapsed: 0.039 s
% 7.55/2.01 % (2547234)Peak memory usage: 88 MB
% 7.55/2.01 % (2547234)Instructions burned: 129 (million)
% 7.55/2.01 % (2547231)------------------------------
% 7.55/2.01 % (2547231)------------------------------
% 7.55/2.01 % (2547237)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=1425444474:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2994 on theBenchmark for (2994ds/114Mi)
% 7.55/2.01 % (2547237)Refutation not found, incomplete strategy
% 7.55/2.01 % (2547237)------------------------------
% 7.55/2.01 % (2547237)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.01 % (2547237)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.01 % (2547237)CaDiCaL version: 2.1.3
% 7.55/2.01 % (2547237)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.01 % (2547237)Time elapsed: 0.0000 s
% 7.55/2.01 % (2547237)Peak memory usage: 87 MB
% 7.55/2.01 % (2547240)lrs+10_1_sil=8000:sp=occurrence:random_seed=3306663174:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2993 on theBenchmark for (2993ds/907Mi)
% 7.55/2.01 % (2547233)------------------------------
% 7.55/2.01 % (2547233)------------------------------
% 7.55/2.01 % (2547241)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=3318406727:i=437:sd=1:aac=none:ss=included_2993 on theBenchmark for (2993ds/437Mi)
% 7.55/2.01 % (2547241)Refutation not found, incomplete strategy
% 7.55/2.01 % (2547241)------------------------------
% 7.55/2.01 % (2547241)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.01 % (2547241)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.01 % (2547241)CaDiCaL version: 2.1.3
% 7.55/2.01 % (2547241)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.01 % (2547241)Time elapsed: 0.001 s
% 7.55/2.01 % (2547241)Peak memory usage: 88 MB
% 7.55/2.01 % (2547237)------------------------------
% 7.55/2.01 % (2547237)------------------------------
% 7.55/2.01 % (2547244)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1157242598:i=5202:ss=axioms:sgt=16_2992 on theBenchmark for (2992ds/5202Mi)
% 7.55/2.01 % (2547241)------------------------------
% 7.55/2.01 % (2547241)------------------------------
% 7.55/2.01 % (2547246)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=3848296861:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2991 on theBenchmark for (2991ds/134Mi)
% 7.55/2.01 % (2547246)Refutation not found, incomplete strategy
% 7.55/2.01 % (2547246)------------------------------
% 7.55/2.01 % (2547246)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.01 % (2547246)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.01 % (2547246)CaDiCaL version: 2.1.3
% 7.55/2.01 % (2547246)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.01 % (2547246)Time elapsed: 0.001 s
% 7.55/2.01 % (2547246)Peak memory usage: 89 MB
% 7.55/2.01 % (2547246)Instructions burned: 1 (million)
% 7.55/2.01 % (2547248)lrs+1002_8_sil=8000:sp=occurrence:sos=on:sac=on:random_seed=1448548794:st=8:i=592:sd=3:ep=RST:ss=axioms_2990 on theBenchmark for (2990ds/592Mi)
% 7.55/2.01 % (2547248)Refutation not found, incomplete strategy
% 7.55/2.01 % (2547248)------------------------------
% 7.55/2.01 % (2547248)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.01 % (2547248)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.01 % (2547248)CaDiCaL version: 2.1.3
% 7.55/2.01 % (2547248)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.01 % (2547248)Time elapsed: 0.001 s
% 7.55/2.01 % (2547248)Peak memory usage: 88 MB
% 7.55/2.01 % (2547248)Instructions burned: 1 (million)
% 7.55/2.01 % (2547240)Instruction limit reached!
% 7.55/2.01 % (2547240)------------------------------
% 7.55/2.01 % (2547240)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.01 % (2547240)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.01 % (2547240)CaDiCaL version: 2.1.3
% 7.55/2.01 % (2547240)Termination reason: Instruction limit
% 7.55/2.01 % (2547240)Termination phase: Saturation
% 7.55/2.01 % (2547240)Time elapsed: 0.301 s
% 7.55/2.01 % (2547240)Peak memory usage: 101 MB
% 7.55/2.01 % (2547240)Instructions burned: 910 (million)
% 7.55/2.01 % (2547246)------------------------------
% 7.55/2.01 % (2547246)------------------------------
% 7.55/2.01 % (2547251)lrs+10_1_ncem=casc2026/models/loop6.pt:sil=32000:npcc=on:random_seed=2067450355:st=3:i=13193:sd=3:ss=axioms_2989 on theBenchmark for (2989ds/13193Mi)
% 7.55/2.01 % (2547248)------------------------------
% 7.55/2.01 % (2547248)------------------------------
% 7.55/2.01 % (2547252)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=1798463997:i=125:slsql=off:bs=unit_only:gtg=position:fdi=2:gsp=on:ss=axioms:sgt=8_2988 on theBenchmark for (2988ds/125Mi)
% 7.55/2.01 % (2547252)Refutation not found, incomplete strategy
% 7.55/2.01 % (2547252)------------------------------
% 7.55/2.01 % (2547252)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.01 % (2547252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.01 % (2547252)CaDiCaL version: 2.1.3
% 7.55/2.01 % (2547252)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.01 % (2547252)Time elapsed: 0.001 s
% 7.55/2.01 % (2547252)Peak memory usage: 87 MB
% 7.55/2.01 % (2547252)Instructions burned: 1 (million)
% 7.55/2.01 % (2547254)lrs+10_1024_to=lpo:sil=8000:tgt=full:sp=arity:slsq=on:random_seed=2569024372:i=134:gtgl=5:slsql=off:gtg=exists_sym_2987 on theBenchmark for (2987ds/134Mi)
% 7.55/2.01 % (2547254)First to succeed.
% 7.55/2.01 % (2547254)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2547204"
% 7.55/2.01 [W927 15:59:51.158548964 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 7.55/2.01 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 7.55/2.01 [W927 15:59:51.158568844 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 7.55/2.01 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 7.55/2.01 [W927 15:59:51.158590314 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 7.55/2.01 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 7.55/2.01 [W927 15:59:51.158597325 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 7.55/2.01 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 7.55/2.01 [W927 15:59:51.158613309 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 7.55/2.01 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 7.55/2.01 [W927 15:59:51.158619622 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 7.55/2.01 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 7.55/2.01 [W927 15:59:51.158634385 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 7.55/2.01 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 7.55/2.01 [W927 15:59:51.158640711 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 7.55/2.01 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 7.55/2.01 [W927 15:59:51.158659031 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 7.55/2.01 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 7.55/2.01 [W927 15:59:51.158700553 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 7.55/2.01 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 7.55/2.01 [W927 15:59:51.158721798 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 7.55/2.01 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 7.55/2.01 [W927 15:59:51.158727968 register_special_ops.cpp:225] Warning: Creating a tensor from an empty intlist will create a tensor of default floating point type (currently Float) in python but a tensor of type int in torchscript.
% 7.55/2.01 Pass in a dtype argument to ensure consistent behavior (function createTensorFromList)
% 7.55/2.01 % (2547232)Instruction limit reached!
% 7.55/2.01 % (2547232)------------------------------
% 7.55/2.01 % (2547232)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.01 % (2547232)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.01 % (2547232)CaDiCaL version: 2.1.3
% 7.55/2.01 % (2547232)Termination reason: Instruction limit
% 7.55/2.01 % (2547232)Termination phase: Saturation
% 7.55/2.01 % (2547232)Time elapsed: 0.824 s
% 7.55/2.01 % (2547232)Peak memory usage: 140 MB
% 7.55/2.01 % (2547232)Instructions burned: 2350 (million)
% 7.55/2.01 % (2547252)------------------------------
% 7.55/2.01 % (2547252)------------------------------
% 7.55/2.01 % (2547251)Refutation not found, incomplete strategy
% 7.55/2.01 % (2547251)------------------------------
% 7.55/2.01 % (2547251)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.55/2.01 % (2547251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.55/2.01 % (2547251)CaDiCaL version: 2.1.3
% 7.55/2.01 % (2547251)Termination reason: Refutation not found, incomplete strategy
% 7.55/2.01 % (2547251)Time elapsed: 0.308 s
% 7.55/2.01 % (2547251)Peak memory usage: 126 MB
% 7.55/2.01 % (2547251)Instructions burned: 823 (million)
% 7.55/2.01 % (2547254)Refutation found. Thanks to Tanya!
% 7.55/2.01 % SZS status Theorem for theBenchmark
% 7.55/2.01 % SZS output start Proof for theBenchmark
% See solution above
% 10.56/2.10 % (2547254)------------------------------
% 10.56/2.10 % (2547254)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.56/2.10 % (2547254)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.56/2.10 % (2547254)CaDiCaL version: 2.1.3
% 10.56/2.10 % (2547254)Termination reason: Refutation
% 10.56/2.10 % (2547254)Time elapsed: 0.012 s
% 10.56/2.10 % (2547254)Peak memory usage: 89 MB
% 10.56/2.10 % (2547254)Instructions burned: 29 (million)
% 10.56/2.10 % (2547254)------------------------------
% 10.56/2.10 % (2547254)------------------------------
% 10.56/2.10 % (2547204)Success in time 1.49 s
% 10.56/2.10 % Vampire exiting
%------------------------------------------------------------------------------