%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL533+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 : n006.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:52 AM UTC 2026
% Result : Theorem 12.44s 2.79s
% Output : Refutation 14.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 32
% Syntax : Number of formulae : 152 ( 76 unt; 0 def)
% Number of atoms : 249 ( 37 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 162 ( 65 ~; 61 |; 2 &)
% ( 12 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 19 ( 17 usr; 17 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 207 ( 206 !; 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(f3,axiom,
( modus_tollens
<=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',modus_tollens) ).
fof(f4,axiom,
( implies_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_1) ).
fof(f5,axiom,
( implies_2
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_2) ).
fof(f6,axiom,
( implies_3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_3) ).
fof(f8,axiom,
( and_2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_2) ).
fof(f9,axiom,
( and_3
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_3) ).
fof(f15,axiom,
( equivalence_3
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalence_3) ).
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(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_modus_ponens) ).
fof(f36,axiom,
modus_tollens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_modus_tollens) ).
fof(f37,axiom,
implies_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_implies_1) ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_implies_2) ).
fof(f39,axiom,
implies_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_implies_3) ).
fof(f41,axiom,
and_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_2) ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_3) ).
fof(f48,axiom,
equivalence_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_equivalence_3) ).
fof(f49,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',use_substitution_of_equivalents) ).
fof(f50,axiom,
( necessitation
<=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',necessitation) ).
fof(f55,axiom,
( axiom_M
<=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_M) ).
fof(f68,axiom,
( axiom_m6
<=> ! [X0] : is_a_theorem(strict_implies(X0,possibly(X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_m6) ).
fof(f73,axiom,
( op_possibly
=> ! [X0] : possibly(X0) = not(necessarily(not(X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_possibly) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',km5_necessitation) ).
fof(f80,axiom,
axiom_M,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',km5_axiom_M) ).
fof(f82,axiom,
op_possibly,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_possibly) ).
fof(f83,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_or) ).
fof(f85,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f88,conjecture,
axiom_m6,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_m6s3m9b_axiom_m6) ).
fof(f89,negated_conjecture,
~ axiom_m6,
inference(negated_conjecture,[status(cth)],[f88]) ).
fof(f90,plain,
~ axiom_m6,
inference(flattening,[],[f89]) ).
fof(f91,plain,
( ! [X0] : is_a_theorem(strict_implies(X0,possibly(X0)))
=> axiom_m6 ),
inference(unused_predicate_definition_removal,[],[f68]) ).
fof(f93,plain,
( axiom_M
=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f95,plain,
( necessitation
=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f96,plain,
( equivalence_3
=> ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f102,plain,
( and_3
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(unused_predicate_definition_removal,[],[f9]) ).
fof(f103,plain,
( and_2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f105,plain,
( implies_3
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f6]) ).
fof(f106,plain,
( implies_2
=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f107,plain,
( implies_1
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f108,plain,
( modus_tollens
=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f3]) ).
fof(f109,plain,
( substitution_of_equivalents
=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f110,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(f115,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f110]) ).
fof(f116,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) )
| ~ modus_ponens ),
inference(flattening,[],[f115]) ).
fof(f117,plain,
( ! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) )
| ~ substitution_of_equivalents ),
inference(ennf_transformation,[],[f109]) ).
fof(f118,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ modus_tollens ),
inference(ennf_transformation,[],[f108]) ).
fof(f119,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(ennf_transformation,[],[f107]) ).
fof(f120,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(ennf_transformation,[],[f106]) ).
fof(f121,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(ennf_transformation,[],[f105]) ).
fof(f123,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(ennf_transformation,[],[f103]) ).
fof(f124,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(ennf_transformation,[],[f102]) ).
fof(f130,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
| ~ equivalence_3 ),
inference(ennf_transformation,[],[f96]) ).
fof(f131,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f132,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f134,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ necessitation ),
inference(ennf_transformation,[],[f95]) ).
fof(f136,plain,
( ! [X0] : is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(ennf_transformation,[],[f93]) ).
fof(f138,plain,
( axiom_m6
| ? [X0] : ~ is_a_theorem(strict_implies(X0,possibly(X0))) ),
inference(ennf_transformation,[],[f91]) ).
fof(f139,plain,
( ! [X0] : possibly(X0) = not(necessarily(not(X0)))
| ~ op_possibly ),
inference(ennf_transformation,[],[f73]) ).
fof(f140,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f75]) ).
fof(f142,plain,
( axiom_m6
| ~ is_a_theorem(strict_implies(sK0,possibly(sK0))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f138]) ).
fof(f143,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| ~ modus_ponens ),
inference(cnf_transformation,[],[f116]) ).
fof(f144,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[],[f117]) ).
fof(f145,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ modus_tollens ),
inference(cnf_transformation,[],[f118]) ).
fof(f146,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(cnf_transformation,[],[f119]) ).
fof(f147,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(cnf_transformation,[],[f120]) ).
fof(f148,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(cnf_transformation,[],[f121]) ).
fof(f150,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(cnf_transformation,[],[f123]) ).
fof(f151,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(cnf_transformation,[],[f124]) ).
fof(f157,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
| ~ equivalence_3 ),
inference(cnf_transformation,[],[f130]) ).
fof(f158,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f131]) ).
fof(f159,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f132]) ).
fof(f162,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f164,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f165,plain,
modus_tollens,
inference(cnf_transformation,[],[f36]) ).
fof(f166,plain,
implies_1,
inference(cnf_transformation,[],[f37]) ).
fof(f167,plain,
implies_2,
inference(cnf_transformation,[],[f38]) ).
fof(f168,plain,
implies_3,
inference(cnf_transformation,[],[f39]) ).
fof(f170,plain,
and_2,
inference(cnf_transformation,[],[f41]) ).
fof(f171,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f177,plain,
equivalence_3,
inference(cnf_transformation,[],[f48]) ).
fof(f178,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f49]) ).
fof(f179,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0)
| ~ necessitation ),
inference(cnf_transformation,[],[f134]) ).
fof(f181,plain,
! [X0] :
( is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(cnf_transformation,[],[f136]) ).
fof(f183,plain,
( axiom_m6
| ~ is_a_theorem(strict_implies(sK0,possibly(sK0))) ),
inference(cnf_transformation,[],[f142]) ).
fof(f184,plain,
! [X0] :
( possibly(X0) = not(necessarily(not(X0)))
| ~ op_possibly ),
inference(cnf_transformation,[],[f139]) ).
fof(f185,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f140]) ).
fof(f188,plain,
necessitation,
inference(cnf_transformation,[],[f78]) ).
fof(f190,plain,
axiom_M,
inference(cnf_transformation,[],[f80]) ).
fof(f192,plain,
op_possibly,
inference(cnf_transformation,[],[f82]) ).
fof(f193,plain,
op_or,
inference(cnf_transformation,[],[f83]) ).
fof(f194,plain,
op_strict_implies,
inference(cnf_transformation,[],[f85]) ).
fof(f197,plain,
~ axiom_m6,
inference(cnf_transformation,[],[f90]) ).
fof(f199,plain,
! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(forward_subsumption_resolution,[],[f185,f194]) ).
fof(f200,plain,
! [X0] : possibly(X0) = not(necessarily(not(X0))),
inference(forward_subsumption_resolution,[],[f184,f192]) ).
fof(f201,plain,
~ is_a_theorem(strict_implies(sK0,possibly(sK0))),
inference(forward_subsumption_resolution,[],[f183,f197]) ).
fof(f203,plain,
! [X0] : is_a_theorem(implies(necessarily(X0),X0)),
inference(forward_subsumption_resolution,[],[f181,f190]) ).
fof(f205,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[],[f179,f188]) ).
fof(f207,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f159,f162]) ).
fof(f208,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(forward_subsumption_resolution,[],[f158,f193]) ).
fof(f209,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))),
inference(forward_subsumption_resolution,[],[f157,f177]) ).
fof(f215,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(forward_subsumption_resolution,[],[f151,f171]) ).
fof(f216,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)),
inference(forward_subsumption_resolution,[],[f150,f170]) ).
fof(f218,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(forward_subsumption_resolution,[],[f148,f168]) ).
fof(f219,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
inference(forward_subsumption_resolution,[],[f147,f167]) ).
fof(f220,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(forward_subsumption_resolution,[],[f146,f166]) ).
fof(f221,plain,
! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))),
inference(forward_subsumption_resolution,[],[f145,f165]) ).
fof(f222,plain,
! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f144,f178]) ).
fof(f223,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f143,f164]) ).
fof(f225,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(forward_demodulation,[],[f208,f207]) ).
fof(f226,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(superposition,[],[f205,f199]) ).
fof(f229,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f219,f223]) ).
fof(f232,plain,
! [X0] : is_a_theorem(strict_implies(necessarily(X0),X0)),
inference(resolution,[],[f203,f226]) ).
fof(f245,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f220,f229]) ).
fof(f251,plain,
! [X0] : is_a_theorem(strict_implies(X0,X0)),
inference(resolution,[],[f245,f226]) ).
fof(f290,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,and(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f215,f223]) ).
fof(f308,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f221,f223]) ).
fof(f320,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X0,not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(forward_demodulation,[],[f308,f225]) ).
fof(f326,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X1,X0),equiv(X0,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f209,f223]) ).
fof(f331,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(equiv(X0,X1)) ),
inference(resolution,[],[f326,f223]) ).
fof(f337,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(and(X0,X1),X1))
| is_a_theorem(equiv(and(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f331,f290]) ).
fof(f339,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),implies(X0,implies(X0,X1))))
| is_a_theorem(equiv(implies(X0,X1),implies(X0,implies(X0,X1)))) ),
inference(resolution,[],[f331,f219]) ).
fof(f353,plain,
! [X0,X1] : is_a_theorem(equiv(implies(X0,X1),implies(X0,implies(X0,X1)))),
inference(forward_subsumption_resolution,[],[f339,f220]) ).
fof(f355,plain,
! [X0,X1] :
( is_a_theorem(equiv(and(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[],[f337,f216]) ).
fof(f402,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| and(X0,X1) = X1 ),
inference(resolution,[],[f355,f222]) ).
fof(f416,plain,
! [X0,X1] : and(implies(necessarily(X0),X0),X1) = X1,
inference(resolution,[],[f402,f203]) ).
fof(f426,plain,
! [X0,X1] : and(strict_implies(X0,X0),X1) = X1,
inference(resolution,[],[f402,f251]) ).
fof(f427,plain,
! [X0,X1] : and(strict_implies(necessarily(X0),X0),X1) = X1,
inference(resolution,[],[f402,f232]) ).
fof(f542,plain,
! [X0,X1] : not(not(X0)) = implies(strict_implies(X1,X1),X0),
inference(superposition,[],[f207,f426]) ).
fof(f1263,plain,
! [X0,X1] : implies(X0,X1) = implies(X0,implies(X0,X1)),
inference(resolution,[],[f353,f222]) ).
fof(f1341,plain,
! [X0,X1] : implies(strict_implies(X0,X0),X1) = not(not(implies(strict_implies(X0,X0),X1))),
inference(superposition,[],[f542,f1263]) ).
fof(f1342,plain,
! [X1] : not(not(X1)) = not(not(not(not(X1)))),
inference(forward_demodulation,[],[f1341,f542]) ).
fof(f1531,plain,
! [X0,X1] : implies(X1,not(not(not(X0)))) = not(and(X1,not(not(X0)))),
inference(superposition,[],[f207,f1342]) ).
fof(f1547,plain,
! [X0,X1] : implies(X1,not(X0)) = implies(X1,not(not(not(X0)))),
inference(forward_demodulation,[],[f1531,f207]) ).
fof(f1551,plain,
! [X2,X0,X1] : implies(X2,implies(X0,X1)) = implies(X2,not(not(implies(X0,X1)))),
inference(superposition,[],[f1547,f207]) ).
fof(f1614,plain,
! [X0,X1] : implies(not(X0),not(X1)) = or(X0,not(not(not(X1)))),
inference(superposition,[],[f225,f1547]) ).
fof(f1618,plain,
! [X0,X1] : or(X0,not(X1)) = or(X0,not(not(not(X1)))),
inference(forward_demodulation,[],[f1614,f225]) ).
fof(f1843,plain,
! [X0,X1] : not(not(X0)) = implies(strict_implies(necessarily(X1),X1),X0),
inference(superposition,[],[f207,f427]) ).
fof(f2264,plain,
! [X0,X1] : not(not(X0)) = implies(implies(necessarily(X1),X1),X0),
inference(superposition,[],[f207,f416]) ).
fof(f2289,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,necessarily(X1)),not(not(implies(X0,X1))))),
inference(superposition,[],[f218,f2264]) ).
fof(f2391,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,necessarily(X1)),implies(X0,X1))),
inference(forward_demodulation,[],[f2289,f1551]) ).
fof(f2438,plain,
! [X0,X1] : is_a_theorem(implies(implies(strict_implies(necessarily(X1),X1),necessarily(X0)),not(not(X0)))),
inference(superposition,[],[f2391,f1843]) ).
fof(f2446,plain,
! [X0] : is_a_theorem(implies(not(not(necessarily(X0))),not(not(X0)))),
inference(forward_demodulation,[],[f2438,f1843]) ).
fof(f2458,plain,
! [X0] : is_a_theorem(or(not(necessarily(X0)),not(not(X0)))),
inference(forward_demodulation,[],[f2446,f225]) ).
fof(f2735,plain,
! [X0] : is_a_theorem(or(possibly(X0),not(not(not(X0))))),
inference(superposition,[],[f2458,f200]) ).
fof(f2762,plain,
! [X0] : is_a_theorem(or(possibly(X0),not(X0))),
inference(forward_demodulation,[],[f2735,f1618]) ).
fof(f2767,plain,
! [X0] : is_a_theorem(implies(X0,possibly(X0))),
inference(resolution,[],[f2762,f320]) ).
fof(f2786,plain,
! [X0] : is_a_theorem(strict_implies(X0,possibly(X0))),
inference(resolution,[],[f2767,f226]) ).
fof(f2793,plain,
$false,
inference(resolution,[],[f2786,f201]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL533+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.10/0.38 % Computer : n006.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Sun Sep 27 15:56:26 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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
% 12.44/2.79 % (3133217)Detected formulas, will run a generic FOF schedule.
% 12.44/2.79 % (3133238)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1761990369:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 12.44/2.79 % (3133238)Refutation not found, incomplete strategy
% 12.44/2.79 % (3133238)------------------------------
% 12.44/2.79 % (3133238)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.44/2.79 % (3133238)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.44/2.79 % (3133238)CaDiCaL version: 2.1.3
% 12.44/2.79 % (3133238)Termination reason: Refutation not found, incomplete strategy
% 12.44/2.79 % (3133238)Time elapsed: 0.0000 s
% 12.44/2.79 % (3133238)Peak memory usage: 87 MB
% 12.44/2.79 % (3133239)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1783261427:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 12.44/2.79 % (3133239)Refutation not found, incomplete strategy
% 12.44/2.79 % (3133239)------------------------------
% 12.44/2.79 % (3133239)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.44/2.79 % (3133239)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.44/2.79 % (3133239)CaDiCaL version: 2.1.3
% 12.44/2.79 % (3133239)Termination reason: Refutation not found, incomplete strategy
% 12.44/2.79 % (3133239)Time elapsed: 0.001 s
% 12.44/2.79 % (3133239)Peak memory usage: 86 MB
% 12.44/2.79 % (3133237)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=3255181736:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 12.44/2.79 % (3133235)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=247951882:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 12.44/2.79 % (3133240)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1146661095:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 12.44/2.79 % (3133236)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=3594825974:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 12.44/2.79 % (3133241)dis-21_1_sil=8000:lcm=predicate:random_seed=2360007699: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)
% 12.44/2.79 % (3133241)Refutation not found, incomplete strategy
% 12.44/2.79 % (3133241)------------------------------
% 12.44/2.79 % (3133241)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.44/2.79 % (3133241)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.44/2.79 % (3133241)CaDiCaL version: 2.1.3
% 12.44/2.79 % (3133241)Termination reason: Refutation not found, incomplete strategy
% 12.44/2.79 % (3133241)Time elapsed: 0.003 s
% 12.44/2.79 % (3133241)Peak memory usage: 88 MB
% 12.44/2.79 % (3133241)Instructions burned: 1 (million)
% 12.44/2.79 % (3133240)Instruction limit reached!
% 12.44/2.79 % (3133240)------------------------------
% 12.44/2.79 % (3133240)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.44/2.79 % (3133240)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.44/2.79 % (3133240)CaDiCaL version: 2.1.3
% 12.44/2.79 % (3133240)Termination reason: Instruction limit
% 12.44/2.79 % (3133240)Termination phase: Saturation
% 12.44/2.79 % (3133240)Time elapsed: 0.139 s
% 12.44/2.79 % (3133240)Peak memory usage: 90 MB
% 12.44/2.79 % (3133240)Instructions burned: 139 (million)
% 12.44/2.79 % (3133238)------------------------------
% 12.44/2.79 % (3133238)------------------------------
% 12.44/2.79 % (3133259)lrs+10_1_sil=8000:sp=occurrence:random_seed=1483080234:i=285:sd=3:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/285Mi)
% 12.44/2.79 % (3133259)Refutation not found, incomplete strategy
% 12.44/2.79 % (3133259)------------------------------
% 12.44/2.79 % (3133259)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.44/2.79 % (3133259)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.44/2.79 % (3133259)CaDiCaL version: 2.1.3
% 12.44/2.79 % (3133259)Termination reason: Refutation not found, incomplete strategy
% 12.44/2.79 % (3133259)Time elapsed: 0.001 s
% 12.44/2.79 % (3133259)Peak memory usage: 87 MB
% 12.44/2.79 % (3133239)------------------------------
% 12.44/2.79 % (3133239)------------------------------
% 12.44/2.79 % (3133241)------------------------------
% 12.44/2.79 % (3133241)------------------------------
% 12.44/2.79 % (3133265)lrs+10_1_sil=32000:urr=on:br=off:random_seed=609012495:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 12.44/2.79 % (3133265)Refutation not found, incomplete strategy
% 12.44/2.79 % (3133265)------------------------------
% 12.44/2.79 % (3133265)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.44/2.79 % (3133265)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.44/2.79 % (3133265)CaDiCaL version: 2.1.3
% 12.44/2.79 % (3133265)Termination reason: Refutation not found, incomplete strategy
% 12.44/2.79 % (3133265)Time elapsed: 0.001 s
% 12.44/2.79 % (3133265)Peak memory usage: 87 MB
% 12.44/2.79 % (3133265)------------------------------
% 12.44/2.79 % (3133265)------------------------------
% 12.44/2.79 % (3133259)------------------------------
% 12.44/2.79 % (3133259)------------------------------
% 12.44/2.79 % (3133269)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2504207938:i=325:sd=1:ss=axioms:sgt=32_2994 on theBenchmark for (2994ds/325Mi)
% 12.44/2.79 % (3133269)Refutation not found, incomplete strategy
% 12.44/2.79 % (3133269)------------------------------
% 12.44/2.79 % (3133269)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.44/2.79 % (3133269)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.44/2.79 % (3133269)CaDiCaL version: 2.1.3
% 12.44/2.79 % (3133269)Termination reason: Refutation not found, incomplete strategy
% 12.44/2.79 % (3133269)Time elapsed: 0.001 s
% 12.44/2.79 % (3133269)Peak memory usage: 87 MB
% 12.44/2.79 % (3133271)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=1262627683:s2a=on:i=248:s2at=1.23:gtg=position_2994 on theBenchmark for (2994ds/248Mi)
% 12.44/2.79 % (3133276)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3552210696:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2991 on theBenchmark for (2991ds/294Mi)
% 12.44/2.79 % (3133276)Refutation not found, incomplete strategy
% 12.44/2.79 % (3133276)------------------------------
% 12.44/2.79 % (3133276)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.44/2.79 % (3133276)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.44/2.79 % (3133276)CaDiCaL version: 2.1.3
% 12.44/2.79 % (3133276)Termination reason: Refutation not found, incomplete strategy
% 12.44/2.79 % (3133276)Time elapsed: 0.001 s
% 12.44/2.79 % (3133276)Peak memory usage: 87 MB
% 12.44/2.79 % (3133237)Refutation not found, incomplete strategy
% 12.44/2.79 % (3133237)------------------------------
% 12.44/2.79 % (3133237)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.44/2.79 % (3133237)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.44/2.79 % (3133237)CaDiCaL version: 2.1.3
% 12.44/2.79 % (3133237)Termination reason: Refutation not found, incomplete strategy
% 12.44/2.79 % (3133237)Time elapsed: 0.847 s
% 12.44/2.79 % (3133237)Peak memory usage: 127 MB
% 12.44/2.79 % (3133237)Instructions burned: 826 (million)
% 12.44/2.79 % (3133271)Instruction limit reached!
% 12.44/2.79 % (3133271)------------------------------
% 12.44/2.79 % (3133271)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.44/2.79 % (3133271)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.44/2.79 % (3133271)CaDiCaL version: 2.1.3
% 12.44/2.79 % (3133271)Termination reason: Instruction limit
% 12.44/2.79 % (3133271)Termination phase: Saturation
% 12.44/2.79 % (3133271)Time elapsed: 0.222 s
% 12.44/2.79 % (3133271)Peak memory usage: 93 MB
% 12.44/2.79 % (3133271)Instructions burned: 248 (million)
% 12.44/2.79 % (3133277)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3102385518:i=2350_2991 on theBenchmark for (2991ds/2350Mi)
% 12.44/2.79 % (3133269)------------------------------
% 12.44/2.79 % (3133269)------------------------------
% 12.44/2.79 % (3133276)------------------------------
% 12.44/2.79 % (3133276)------------------------------
% 12.44/2.79 % (3133285)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=1827958152:cts=off:i=113:fsr=off:ss=included:sgt=4_2989 on theBenchmark for (2989ds/113Mi)
% 12.44/2.79 % (3133285)Refutation not found, incomplete strategy
% 12.44/2.79 % (3133285)------------------------------
% 12.44/2.79 % (3133285)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.44/2.79 % (3133285)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.44/2.79 % (3133285)CaDiCaL version: 2.1.3
% 12.44/2.79 % (3133285)Termination reason: Refutation not found, incomplete strategy
% 12.44/2.79 % (3133285)Time elapsed: 0.002 s
% 12.44/2.79 % (3133285)Peak memory usage: 88 MB
% 12.44/2.79 % (3133237)------------------------------
% 12.44/2.79 % (3133237)------------------------------
% 12.44/2.79 % (3133291)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=3554405923:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2987 on theBenchmark for (2987ds/114Mi)
% 12.44/2.79 % (3133291)Refutation not found, incomplete strategy
% 12.44/2.79 % (3133291)------------------------------
% 12.44/2.79 % (3133291)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.44/2.79 % (3133291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.44/2.79 % (3133291)CaDiCaL version: 2.1.3
% 12.44/2.79 % (3133291)Termination reason: Refutation not found, incomplete strategy
% 12.44/2.79 % (3133291)Time elapsed: 0.001 s
% 12.44/2.79 % (3133291)Peak memory usage: 87 MB
% 12.44/2.79 % (3133289)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=10376606:i=127:av=off:fsr=off:sup=off_2987 on theBenchmark for (2987ds/127Mi)
% 12.44/2.79 % (3133235)First to succeed.
% 12.44/2.79 % (3133235)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3133217"
% 12.44/2.79 % (3133289)Instruction limit reached!
% 12.44/2.79 % (3133289)------------------------------
% 12.44/2.79 % (3133289)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.44/2.79 % (3133289)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.44/2.79 % (3133289)CaDiCaL version: 2.1.3
% 12.44/2.79 % (3133289)Termination reason: Instruction limit
% 12.44/2.79 % (3133289)Termination phase: Saturation
% 12.44/2.79 % (3133289)Time elapsed: 0.121 s
% 12.44/2.79 % (3133289)Peak memory usage: 89 MB
% 12.44/2.79 % (3133289)Instructions burned: 127 (million)
% 12.44/2.79 % (3133295)lrs+10_1_sil=8000:sp=occurrence:random_seed=2342503862:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2986 on theBenchmark for (2986ds/907Mi)
% 12.44/2.79 % (3133291)------------------------------
% 12.44/2.79 % (3133291)------------------------------
% 12.44/2.79 % (3133285)------------------------------
% 12.44/2.79 % (3133285)------------------------------
% 12.44/2.79 % (3133299)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=982275043:i=437:sd=1:aac=none:ss=included_2984 on theBenchmark for (2984ds/437Mi)
% 12.44/2.79 % (3133299)Refutation not found, incomplete strategy
% 12.44/2.79 % (3133299)------------------------------
% 12.44/2.79 % (3133299)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.44/2.79 % (3133299)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.44/2.79 % (3133299)CaDiCaL version: 2.1.3
% 12.44/2.79 % (3133299)Termination reason: Refutation not found, incomplete strategy
% 12.44/2.79 % (3133299)Time elapsed: 0.002 s
% 12.44/2.79 % (3133299)Peak memory usage: 88 MB
% 12.44/2.79 % (3133304)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=2283907314:i=5202:ss=axioms:sgt=16_2983 on theBenchmark for (2983ds/5202Mi)
% 12.44/2.79 % (3133235)Refutation found. Thanks to Tanya!
% 12.44/2.79 % SZS status Theorem for theBenchmark
% 12.44/2.79 % SZS output start Proof for theBenchmark
% See solution above
% 14.07/2.94 % (3133235)------------------------------
% 14.07/2.94 % (3133235)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.07/2.94 % (3133235)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.07/2.94 % (3133235)CaDiCaL version: 2.1.3
% 14.07/2.94 % (3133235)Termination reason: Refutation
% 14.07/2.94 % (3133235)Time elapsed: 1.328 s
% 14.07/2.94 % (3133235)Peak memory usage: 130 MB
% 14.07/2.94 % (3133235)Instructions burned: 1246 (million)
% 14.07/2.94 % (3133235)------------------------------
% 14.07/2.94 % (3133235)------------------------------
% 14.07/2.94 % (3133217)Success in time 1.92 s
% 14.07/2.94 % Vampire exiting
%------------------------------------------------------------------------------