%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL523+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 : n002.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:51 AM UTC 2026
% Result : Theorem 42.94s 6.67s
% Output : Refutation 42.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 30
% Syntax : Number of formulae : 141 ( 72 unt; 0 def)
% Number of atoms : 228 ( 35 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 147 ( 60 ~; 55 |; 2 &)
% ( 11 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 18 ( 16 usr; 16 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 168 ( 167 !; 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/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(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(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(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
fof(f34,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_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(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(f55,axiom,
( axiom_M
<=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_M) ).
fof(f56,axiom,
( axiom_4
<=> ! [X0] : is_a_theorem(implies(necessarily(X0),necessarily(necessarily(X0)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_4) ).
fof(f58,axiom,
( axiom_5
<=> ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_5) ).
fof(f73,axiom,
( op_possibly
=> ! [X0] : possibly(X0) = not(necessarily(not(X0))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax',op_possibly) ).
fof(f77,axiom,
op_possibly,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_op_possibly) ).
fof(f80,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_axiom_M) ).
fof(f81,axiom,
axiom_5,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_axiom_5) ).
fof(f82,conjecture,
axiom_4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km4b_axiom_4) ).
fof(f83,negated_conjecture,
~ axiom_4,
inference(negated_conjecture,[status(cth)],[f82]) ).
fof(f84,plain,
~ axiom_4,
inference(flattening,[],[f83]) ).
fof(f85,plain,
( axiom_5
=> ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))) ),
inference(unused_predicate_definition_removal,[],[f58]) ).
fof(f86,plain,
( ! [X0] : is_a_theorem(implies(necessarily(X0),necessarily(necessarily(X0))))
=> axiom_4 ),
inference(unused_predicate_definition_removal,[],[f56]) ).
fof(f87,plain,
( axiom_M
=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f95,plain,
( or_1
=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f96,plain,
( and_3
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f97,plain,
( and_2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f100,plain,
( implies_2
=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f101,plain,
( implies_1
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f102,plain,
( modus_tollens
=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f3]) ).
fof(f103,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f104,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(f110,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f104]) ).
fof(f111,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f110]) ).
fof(f112,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f103]) ).
fof(f113,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ modus_tollens ),
inference(ennf_transformation,[],[f102]) ).
fof(f114,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(ennf_transformation,[],[f101]) ).
fof(f115,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(ennf_transformation,[],[f100]) ).
fof(f118,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(ennf_transformation,[],[f97]) ).
fof(f119,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(ennf_transformation,[],[f96]) ).
fof(f120,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(ennf_transformation,[],[f95]) ).
fof(f126,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f127,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f128,plain,
( ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(ennf_transformation,[],[f31]) ).
fof(f131,plain,
( ! [X0] : is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(ennf_transformation,[],[f87]) ).
fof(f132,plain,
( axiom_4
| ? [X0] : ~ is_a_theorem(implies(necessarily(X0),necessarily(necessarily(X0)))) ),
inference(ennf_transformation,[],[f86]) ).
fof(f133,plain,
( ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0))))
| ~ axiom_5 ),
inference(ennf_transformation,[],[f85]) ).
fof(f134,plain,
( ! [X0] : possibly(X0) = not(necessarily(not(X0)))
| ~ op_possibly ),
inference(ennf_transformation,[],[f73]) ).
fof(f135,plain,
( axiom_4
| ~ is_a_theorem(implies(necessarily(sK0),necessarily(necessarily(sK0)))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f132]) ).
fof(f136,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f111]) ).
fof(f137,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f112]) ).
fof(f138,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ modus_tollens ),
inference(cnf_transformation,[],[f113]) ).
fof(f139,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(cnf_transformation,[],[f114]) ).
fof(f140,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(cnf_transformation,[],[f115]) ).
fof(f143,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(cnf_transformation,[],[f118]) ).
fof(f144,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(cnf_transformation,[],[f119]) ).
fof(f145,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(cnf_transformation,[],[f120]) ).
fof(f151,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f126]) ).
fof(f152,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f127]) ).
fof(f153,plain,
! [X0,X1] :
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ op_equiv ),
inference(cnf_transformation,[],[f128]) ).
fof(f154,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f155,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f156,plain,
op_equiv,
inference(cnf_transformation,[],[f34]) ).
fof(f157,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f158,plain,
modus_tollens,
inference(cnf_transformation,[],[f36]) ).
fof(f159,plain,
implies_1,
inference(cnf_transformation,[],[f37]) ).
fof(f160,plain,
implies_2,
inference(cnf_transformation,[],[f38]) ).
fof(f163,plain,
and_2,
inference(cnf_transformation,[],[f41]) ).
fof(f164,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f165,plain,
or_1,
inference(cnf_transformation,[],[f43]) ).
fof(f171,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f49]) ).
fof(f174,plain,
! [X0] :
( is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(cnf_transformation,[],[f131]) ).
fof(f175,plain,
( axiom_4
| ~ is_a_theorem(implies(necessarily(sK0),necessarily(necessarily(sK0)))) ),
inference(cnf_transformation,[],[f135]) ).
fof(f176,plain,
! [X0] :
( is_a_theorem(implies(possibly(X0),necessarily(possibly(X0))))
| ~ axiom_5 ),
inference(cnf_transformation,[],[f133]) ).
fof(f177,plain,
! [X0] :
( possibly(X0) = not(necessarily(not(X0)))
| ~ op_possibly ),
inference(cnf_transformation,[],[f134]) ).
fof(f178,plain,
op_possibly,
inference(cnf_transformation,[],[f77]) ).
fof(f181,plain,
axiom_M,
inference(cnf_transformation,[],[f80]) ).
fof(f182,plain,
axiom_5,
inference(cnf_transformation,[],[f81]) ).
fof(f183,plain,
~ axiom_4,
inference(cnf_transformation,[],[f84]) ).
fof(f184,plain,
! [X0] : possibly(X0) = not(necessarily(not(X0))),
inference(forward_subsumption_resolution,[],[f177,f178]) ).
fof(f185,plain,
! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))),
inference(forward_subsumption_resolution,[],[f176,f182]) ).
fof(f186,plain,
~ is_a_theorem(implies(necessarily(sK0),necessarily(necessarily(sK0)))),
inference(forward_subsumption_resolution,[],[f175,f183]) ).
fof(f187,plain,
! [X0] : is_a_theorem(implies(necessarily(X0),X0)),
inference(forward_subsumption_resolution,[],[f174,f181]) ).
fof(f190,plain,
! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(forward_subsumption_resolution,[],[f153,f156]) ).
fof(f191,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f152,f155]) ).
fof(f192,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f151,f154]) ).
fof(f198,plain,
! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))),
inference(forward_subsumption_resolution,[],[f145,f165]) ).
fof(f199,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(forward_subsumption_resolution,[],[f144,f164]) ).
fof(f200,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)),
inference(forward_subsumption_resolution,[],[f143,f163]) ).
fof(f203,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
inference(forward_subsumption_resolution,[],[f140,f160]) ).
fof(f204,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(forward_subsumption_resolution,[],[f139,f159]) ).
fof(f205,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))),
inference(forward_subsumption_resolution,[],[f138,f158]) ).
fof(f206,plain,
! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f137,f171]) ).
fof(f207,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f136,f157]) ).
fof(f208,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f192,f191]) ).
fof(f209,plain,
! [X0] : possibly(necessarily(not(X0))) = not(necessarily(possibly(X0))),
inference(superposition,[],[f184,f184]) ).
fof(f213,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,and(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f207,f199]) ).
fof(f229,plain,
! [X0,X1] : is_a_theorem(or(X0,or(not(X0),X1))),
inference(superposition,[],[f198,f208]) ).
fof(f235,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f203,f207]) ).
fof(f246,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(not(X0))),or(X0,X1))),
inference(superposition,[],[f205,f208]) ).
fof(f247,plain,
! [X0,X1] : is_a_theorem(implies(or(X1,not(not(X0))),or(X0,X1))),
inference(forward_demodulation,[],[f246,f208]) ).
fof(f258,plain,
! [X0,X1] : equiv(X1,not(X0)) = and(implies(X1,not(X0)),or(X0,X1)),
inference(superposition,[],[f190,f208]) ).
fof(f290,plain,
! [X0,X1] :
( is_a_theorem(and(X0,X1))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f213,f207]) ).
fof(f301,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(equiv(X0,X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[],[f290,f190]) ).
fof(f370,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f235,f204]) ).
fof(f371,plain,
! [X0] : is_a_theorem(implies(X0,and(X0,X0))),
inference(resolution,[],[f235,f199]) ).
fof(f389,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,not(not(X1))))
| is_a_theorem(or(X1,X0)) ),
inference(resolution,[],[f247,f207]) ).
fof(f656,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,not(X1)))
| ~ is_a_theorem(or(X1,X0))
| is_a_theorem(equiv(X0,not(X1))) ),
inference(superposition,[],[f290,f258]) ).
fof(f8783,plain,
! [X0] :
( is_a_theorem(equiv(and(X0,X0),X0))
| ~ is_a_theorem(implies(and(X0,X0),X0)) ),
inference(resolution,[],[f301,f371]) ).
fof(f8916,plain,
! [X0] :
( is_a_theorem(equiv(necessarily(possibly(X0)),possibly(X0)))
| ~ is_a_theorem(implies(necessarily(possibly(X0)),possibly(X0))) ),
inference(resolution,[],[f301,f185]) ).
fof(f8924,plain,
! [X0] : is_a_theorem(equiv(necessarily(possibly(X0)),possibly(X0))),
inference(forward_subsumption_resolution,[],[f8916,f187]) ).
fof(f8953,plain,
! [X0] : is_a_theorem(equiv(and(X0,X0),X0)),
inference(forward_subsumption_resolution,[],[f8783,f200]) ).
fof(f8962,plain,
! [X0] : and(X0,X0) = X0,
inference(resolution,[],[f8953,f206]) ).
fof(f9124,plain,
! [X0] : implies(not(X0),X0) = not(not(X0)),
inference(superposition,[],[f191,f8962]) ).
fof(f9288,plain,
! [X0] : or(X0,X0) = not(not(X0)),
inference(forward_demodulation,[],[f9124,f208]) ).
fof(f9381,plain,
! [X0] : possibly(X0) = necessarily(possibly(X0)),
inference(resolution,[],[f8924,f206]) ).
fof(f9603,plain,
! [X0] : is_a_theorem(implies(X0,not(not(X0)))),
inference(superposition,[],[f198,f9288]) ).
fof(f9699,plain,
! [X0] : is_a_theorem(or(X0,not(not(not(X0))))),
inference(superposition,[],[f229,f9288]) ).
fof(f10703,plain,
! [X0] : is_a_theorem(or(not(X0),X0)),
inference(resolution,[],[f9699,f389]) ).
fof(f12206,plain,
! [X0] :
( ~ is_a_theorem(or(not(X0),X0))
| is_a_theorem(equiv(X0,not(not(X0)))) ),
inference(resolution,[],[f656,f9603]) ).
fof(f12268,plain,
! [X0] : is_a_theorem(equiv(X0,not(not(X0)))),
inference(forward_subsumption_resolution,[],[f12206,f10703]) ).
fof(f12275,plain,
! [X0] : not(not(X0)) = X0,
inference(resolution,[],[f12268,f206]) ).
fof(f12376,plain,
! [X0] : not(possibly(X0)) = necessarily(not(X0)),
inference(superposition,[],[f12275,f184]) ).
fof(f12408,plain,
! [X0] : not(necessarily(possibly(not(X0)))) = possibly(necessarily(X0)),
inference(superposition,[],[f209,f12275]) ).
fof(f12658,plain,
! [X0] : not(possibly(not(X0))) = possibly(necessarily(X0)),
inference(forward_demodulation,[],[f12408,f9381]) ).
fof(f12673,plain,
! [X0] : necessarily(not(not(X0))) = possibly(necessarily(X0)),
inference(forward_demodulation,[],[f12658,f12376]) ).
fof(f12680,plain,
! [X0] : necessarily(X0) = possibly(necessarily(X0)),
inference(forward_demodulation,[],[f12673,f12275]) ).
fof(f12948,plain,
! [X0] : necessarily(X0) = necessarily(necessarily(X0)),
inference(superposition,[],[f9381,f12680]) ).
fof(f13557,plain,
~ is_a_theorem(implies(necessarily(sK0),necessarily(sK0))),
inference(superposition,[],[f186,f12948]) ).
fof(f13649,plain,
$false,
inference(forward_subsumption_resolution,[],[f13557,f370]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL523+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.13/0.39 % Computer : n002.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 15:58:36 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43 Running first-order model finding
% 0.13/0.43 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
% 22.46/3.63 % (3704834)Will run a generic schedule for satisfiability detection.
% 22.46/3.63 % (3704840)% WARNING: option uhcvi not known.
% 22.46/3.63 % (3704840)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2184464224:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 22.46/3.63 % (3704839)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1716675737_2999 on theBenchmark for (2999ds/0Mi)
% 22.46/3.63 % (3704841)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2624776005:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 22.46/3.63 % (3704842)dis+10_1_sil=32000:sp=arity:random_seed=4282151492:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 22.46/3.63 % (3704843)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3822041604:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 22.46/3.63 % TRYING [1]
% 22.46/3.63 % TRYING [2]
% 22.46/3.63 % (3704845)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1640897672:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 22.46/3.63 % TRYING [3]
% 22.46/3.63 % TRYING [4]
% 22.46/3.63 % (3704844)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1218368022:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 22.46/3.63 % (3704842)Instruction limit reached!
% 22.46/3.63 % (3704842)------------------------------
% 22.46/3.63 % (3704842)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.46/3.63 % (3704842)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.46/3.63 % (3704842)CaDiCaL version: 2.1.3
% 22.46/3.63 % (3704842)Termination reason: Instruction limit
% 22.46/3.63 % (3704842)Termination phase: Saturation
% 22.46/3.63 % (3704842)Time elapsed: 0.066 s
% 22.46/3.63 % (3704842)Peak memory usage: 13 MB
% 22.46/3.63 % (3704842)Instructions burned: 103 (million)
% 22.46/3.63 % TRYING [5]
% 22.46/3.63 % (3704843)Instruction limit reached!
% 22.46/3.63 % (3704843)------------------------------
% 22.46/3.63 % (3704843)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.46/3.63 % (3704843)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.46/3.63 % (3704843)CaDiCaL version: 2.1.3
% 22.46/3.63 % (3704843)Termination reason: Instruction limit
% 22.46/3.63 % (3704843)Termination phase: Saturation
% 22.46/3.63 % (3704843)Time elapsed: 0.076 s
% 22.46/3.63 % (3704843)Peak memory usage: 13 MB
% 22.46/3.63 % (3704843)Instructions burned: 117 (million)
% 22.46/3.63 % (3704858)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1524499154:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 22.46/3.63 % TRYING [1]
% 22.46/3.63 % TRYING [2]
% 22.46/3.63 % TRYING [3]
% 22.46/3.63 % (3704862)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3820210502:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 22.46/3.63 % TRYING [4]
% 22.46/3.63 % (3704845)Instruction limit reached!
% 22.46/3.63 % (3704845)------------------------------
% 22.46/3.63 % (3704845)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.46/3.63 % (3704845)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.46/3.63 % (3704845)CaDiCaL version: 2.1.3
% 22.46/3.63 % (3704845)Termination reason: Instruction limit
% 22.46/3.63 % (3704845)Termination phase: Saturation
% 22.46/3.63 % (3704845)Time elapsed: 0.111 s
% 22.46/3.63 % (3704845)Peak memory usage: 14 MB
% 22.46/3.63 % (3704845)Instructions burned: 159 (million)
% 22.46/3.63 % (3704844)Instruction limit reached!
% 22.46/3.63 % (3704844)------------------------------
% 22.46/3.63 % (3704844)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.46/3.63 % (3704844)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.46/3.63 % (3704844)CaDiCaL version: 2.1.3
% 22.46/3.63 % (3704844)Termination reason: Instruction limit
% 22.46/3.63 % (3704844)Termination phase: Saturation
% 22.46/3.63 % (3704844)Time elapsed: 0.104 s
% 22.46/3.63 % (3704844)Peak memory usage: 14 MB
% 22.46/3.63 % (3704844)Instructions burned: 131 (million)
% 22.46/3.63 % (3704874)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=1860457143:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 22.46/3.63 % (3704876)ott-21_1_sil=16000:fs=off:random_seed=3705781164:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 22.46/3.63 % (3704862)Instruction limit reached!
% 22.46/3.63 % (3704862)------------------------------
% 22.46/3.63 % (3704862)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3704862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3704862)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3704862)Termination reason: Instruction limit
% 42.94/6.67 % (3704862)Termination phase: Saturation
% 42.94/6.67 % (3704862)Time elapsed: 0.089 s
% 42.94/6.67 % (3704862)Peak memory usage: 14 MB
% 42.94/6.67 % (3704862)Instructions burned: 131 (million)
% 42.94/6.67 % TRYING [5]
% 42.94/6.67 % (3704899)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3245301837:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 42.94/6.67 % (3704876)Instruction limit reached!
% 42.94/6.67 % (3704876)------------------------------
% 42.94/6.67 % (3704876)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3704876)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3704876)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3704876)Termination reason: Instruction limit
% 42.94/6.67 % (3704876)Termination phase: Saturation
% 42.94/6.67 % (3704876)Time elapsed: 0.101 s
% 42.94/6.67 % (3704876)Peak memory usage: 13 MB
% 42.94/6.67 % (3704876)Instructions burned: 181 (million)
% 42.94/6.67 % (3704920)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4156742785:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 42.94/6.67 % TRYING [1]
% 42.94/6.67 % TRYING [2]
% 42.94/6.67 % TRYING [6]
% 42.94/6.67 % TRYING [3]
% 42.94/6.67 % TRYING [4]
% 42.94/6.67 % TRYING [6]
% 42.94/6.67 % (3704858)Instruction limit reached!
% 42.94/6.67 % (3704858)------------------------------
% 42.94/6.67 % (3704858)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3704858)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3704858)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3704858)Termination reason: Instruction limit
% 42.94/6.67 % (3704858)Termination phase: Finite model building constraint generation
% 42.94/6.67 % (3704858)Time elapsed: 0.401 s
% 42.94/6.67 % (3704858)Peak memory usage: 23 MB
% 42.94/6.67 % (3704858)Instructions burned: 714 (million)
% 42.94/6.67 % (3704966)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=170878078:i=1179_2994 on theBenchmark for (2994ds/1179Mi)
% 42.94/6.67 % (3704899)Instruction limit reached!
% 42.94/6.67 % (3704899)------------------------------
% 42.94/6.67 % (3704899)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3704899)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3704899)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3704899)Termination reason: Instruction limit
% 42.94/6.67 % (3704899)Termination phase: Saturation
% 42.94/6.67 % (3704899)Time elapsed: 0.315 s
% 42.94/6.67 % (3704899)Peak memory usage: 14 MB
% 42.94/6.67 % (3704899)Instructions burned: 478 (million)
% 42.94/6.67 % (3704968)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2020965904:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 42.94/6.67 % (3704874)Instruction limit reached!
% 42.94/6.67 % (3704874)------------------------------
% 42.94/6.67 % (3704874)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3704874)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3704874)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3704874)Termination reason: Instruction limit
% 42.94/6.67 % (3704874)Termination phase: Saturation
% 42.94/6.67 % (3704874)Time elapsed: 0.407 s
% 42.94/6.67 % (3704874)Peak memory usage: 20 MB
% 42.94/6.67 % (3704874)Instructions burned: 685 (million)
% 42.94/6.67 % (3704970)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=3818775498: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)
% 42.94/6.67 % (3704920)Instruction limit reached!
% 42.94/6.67 % (3704920)------------------------------
% 42.94/6.67 % (3704920)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3704920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3704920)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3704920)Termination reason: Instruction limit
% 42.94/6.67 % (3704920)Termination phase: Finite model building SAT solving
% 42.94/6.67 % (3704920)Time elapsed: 0.335 s
% 42.94/6.67 % (3704920)Peak memory usage: 22 MB
% 42.94/6.67 % (3704920)Instructions burned: 866 (million)
% 42.94/6.67 % (3704972)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=841190519:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 42.94/6.67 % TRYING [14]
% 42.94/6.67 % (3704968)Instruction limit reached!
% 42.94/6.67 % (3704968)------------------------------
% 42.94/6.67 % (3704968)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3704968)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3704968)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3704968)Termination reason: Instruction limit
% 42.94/6.67 % (3704968)Termination phase: Finite model building constraint generation
% 42.94/6.67 % (3704968)Time elapsed: 0.325 s
% 42.94/6.67 % (3704968)Peak memory usage: 69 MB
% 42.94/6.67 % (3704968)Instructions burned: 891 (million)
% 42.94/6.67 % (3704987)fmb+10_1_sil=64000:random_seed=472815076:i=22061:nm=2:gsp=on_2990 on theBenchmark for (2990ds/22061Mi)
% 42.94/6.67 % TRYING [1]
% 42.94/6.67 % TRYING [2]
% 42.94/6.67 % TRYING [3]
% 42.94/6.67 % TRYING [4]
% 42.94/6.67 % TRYING [5]
% 42.94/6.67 % TRYING [7]
% 42.94/6.67 % (3704970)Instruction limit reached!
% 42.94/6.67 % (3704970)------------------------------
% 42.94/6.67 % (3704970)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3704970)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3704970)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3704970)Termination reason: Instruction limit
% 42.94/6.67 % (3704970)Termination phase: Saturation
% 42.94/6.67 % (3704970)Time elapsed: 0.478 s
% 42.94/6.67 % (3704970)Peak memory usage: 21 MB
% 42.94/6.67 % (3704970)Instructions burned: 692 (million)
% 42.94/6.67 % (3704989)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3493829797:i=9515:nm=5_2989 on theBenchmark for (2989ds/9515Mi)
% 42.94/6.67 % TRYING [20]
% 42.94/6.67 % (3704972)Instruction limit reached!
% 42.94/6.67 % (3704972)------------------------------
% 42.94/6.67 % (3704972)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3704972)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3704972)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3704972)Termination reason: Instruction limit
% 42.94/6.67 % (3704972)Termination phase: Saturation
% 42.94/6.67 % (3704972)Time elapsed: 0.527 s
% 42.94/6.67 % (3704972)Peak memory usage: 24 MB
% 42.94/6.67 % (3704972)Instructions burned: 880 (million)
% 42.94/6.67 % TRYING [6]
% 42.94/6.67 % (3704991)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=875549059:fmbsr=1.7:i=920_2988 on theBenchmark for (2988ds/920Mi)
% 42.94/6.67 % TRYING [8]
% 42.94/6.67 % (3704966)Instruction limit reached!
% 42.94/6.67 % (3704966)------------------------------
% 42.94/6.67 % (3704966)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3704966)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3704966)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3704966)Termination reason: Instruction limit
% 42.94/6.67 % (3704966)Termination phase: Saturation
% 42.94/6.67 % (3704966)Time elapsed: 0.693 s
% 42.94/6.67 % (3704966)Peak memory usage: 21 MB
% 42.94/6.67 % (3704966)Instructions burned: 1180 (million)
% 42.94/6.67 % (3704993)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=47293003:i=5131_2987 on theBenchmark for (2987ds/5131Mi)
% 42.94/6.67 % (3704991)Instruction limit reached!
% 42.94/6.67 % (3704991)------------------------------
% 42.94/6.67 % (3704991)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3704991)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3704991)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3704991)Termination reason: Instruction limit
% 42.94/6.67 % (3704991)Termination phase: Finite model building constraint generation
% 42.94/6.67 % (3704991)Time elapsed: 0.583 s
% 42.94/6.67 % (3704991)Peak memory usage: 65 MB
% 42.94/6.67 % (3704991)Instructions burned: 920 (million)
% 42.94/6.67 % (3705012)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3485443229:i=1472:ins=7:fdi=8:gsp=on_2982 on theBenchmark for (2982ds/1472Mi)
% 42.94/6.67 % TRYING [7]
% 42.94/6.67 % (3705012)Instruction limit reached!
% 42.94/6.67 % (3705012)------------------------------
% 42.94/6.67 % (3705012)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3705012)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3705012)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3705012)Termination reason: Instruction limit
% 42.94/6.67 % (3705012)Termination phase: Saturation
% 42.94/6.67 % (3705012)Time elapsed: 1.329 s
% 42.94/6.67 % (3705012)Peak memory usage: 27 MB
% 42.94/6.67 % (3705012)Instructions burned: 1473 (million)
% 42.94/6.67 % (3705038)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2890278273:i=6324_2968 on theBenchmark for (2968ds/6324Mi)
% 42.94/6.67 % TRYING [77]
% 42.94/6.67 % TRYING [8]
% 42.94/6.67 % (3704993)Instruction limit reached!
% 42.94/6.67 % (3704993)------------------------------
% 42.94/6.67 % (3704993)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3704993)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3704993)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3704993)Termination reason: Instruction limit
% 42.94/6.67 % (3704993)Termination phase: Saturation
% 42.94/6.67 % (3704993)Time elapsed: 3.808 s
% 42.94/6.67 % (3704993)Peak memory usage: 64 MB
% 42.94/6.67 % (3704993)Instructions burned: 5132 (million)
% 42.94/6.67 % (3705201)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=490097844:fmbsr=2.30978:i=2174_2949 on theBenchmark for (2949ds/2174Mi)
% 42.94/6.67 % TRYING [16]
% 42.94/6.67 % TRYING [8]
% 42.94/6.67 % (3704989)Instruction limit reached!
% 42.94/6.67 % (3704989)------------------------------
% 42.94/6.67 % (3704989)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3704989)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3704989)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3704989)Termination reason: Instruction limit
% 42.94/6.67 % (3704989)Termination phase: Finite model building constraint generation
% 42.94/6.67 % (3704989)Time elapsed: 4.657 s
% 42.94/6.67 % (3704989)Peak memory usage: 563 MB
% 42.94/6.67 % (3704989)Instructions burned: 9518 (million)
% 42.94/6.67 % (3705201)Instruction limit reached!
% 42.94/6.67 % (3705201)------------------------------
% 42.94/6.67 % (3705201)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3705201)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3705201)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3705201)Termination reason: Instruction limit
% 42.94/6.67 % (3705201)Termination phase: Finite model building constraint generation
% 42.94/6.67 % (3705201)Time elapsed: 0.740 s
% 42.94/6.67 % (3705201)Peak memory usage: 134 MB
% 42.94/6.67 % (3705201)Instructions burned: 2174 (million)
% 42.94/6.67 % (3705203)ott-2_1_sil=16000:newcnf=on:random_seed=2576225280:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2941 on theBenchmark for (2941ds/869Mi)
% 42.94/6.67 % (3705204)ott+10_1_sil=32000:tgt=ground:random_seed=1199136752:i=5114:av=off_2941 on theBenchmark for (2941ds/5114Mi)
% 42.94/6.67 % (3705038)Instruction limit reached!
% 42.94/6.67 % (3705038)------------------------------
% 42.94/6.67 % (3705038)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3705038)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3705038)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3705038)Termination reason: Instruction limit
% 42.94/6.67 % (3705038)Termination phase: Finite model building constraint generation
% 42.94/6.67 % (3705038)Time elapsed: 2.750 s
% 42.94/6.67 % (3705038)Peak memory usage: 516 MB
% 42.94/6.67 % (3705038)Instructions burned: 6326 (million)
% 42.94/6.67 % (3705207)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=400585918:i=54282_2939 on theBenchmark for (2939ds/54282Mi)
% 42.94/6.67 % TRYING [1]
% 42.94/6.67 % TRYING [2]
% 42.94/6.67 % TRYING [3]
% 42.94/6.67 % TRYING [4]
% 42.94/6.67 % TRYING [5]
% 42.94/6.67 % (3705204) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3704834-3705204"...
% 42.94/6.67 % (3705204)...printing done.
% 42.94/6.67 % (3705204)Refutation found. Thanks to Tanya!
% 42.94/6.67 % SZS status Theorem for theBenchmark
% 42.94/6.67 % SZS output start Proof for theBenchmark
% See solution above
% 42.94/6.67 % (3705204)------------------------------
% 42.94/6.67 % (3705204)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 42.94/6.67 % (3705204)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 42.94/6.67 % (3705204)CaDiCaL version: 2.1.3
% 42.94/6.67 % (3705204)Termination reason: Refutation
% 42.94/6.67 % (3705204)Time elapsed: 0.332 s
% 42.94/6.67 % (3705204)Peak memory usage: 17 MB
% 42.94/6.67 % (3705204)Instructions burned: 523 (million)
% 42.94/6.67 % (3704834)Success in time 6.235 s
% 42.94/6.67 % Vampire exiting
%------------------------------------------------------------------------------