%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL549+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 : 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:58:55 AM UTC 2026
% Result : Theorem 19.41s 3.18s
% Output : Refutation 19.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 32
% Syntax : Number of formulae : 144 ( 62 unt; 0 def)
% Number of atoms : 248 ( 28 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 175 ( 71 ~; 67 |; 2 &)
% ( 13 <=>; 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 : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 179 ( 178 !; 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(f4,axiom,
( implies_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_1) ).
fof(f5,axiom,
( implies_2
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_2) ).
fof(f6,axiom,
( implies_3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_3) ).
fof(f8,axiom,
( and_2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_2) ).
fof(f9,axiom,
( and_3
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_3) ).
fof(f15,axiom,
( equivalence_3
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',equivalence_3) ).
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(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(f37,axiom,
implies_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_1) ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_2) ).
fof(f39,axiom,
implies_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_3) ).
fof(f41,axiom,
and_2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_2) ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
fof(f48,axiom,
equivalence_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_equivalence_3) ).
fof(f49,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',use_substitution_of_equivalents) ).
fof(f50,axiom,
( necessitation
<=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',necessitation) ).
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(f57,axiom,
( axiom_B
<=> ! [X0] : is_a_theorem(implies(X0,necessarily(possibly(X0)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_B) ).
fof(f72,axiom,
( axiom_m10
<=> ! [X0] : is_a_theorem(strict_implies(possibly(X0),necessarily(possibly(X0)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_m10) ).
fof(f73,axiom,
( op_possibly
=> ! [X0] : possibly(X0) = not(necessarily(not(X0))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax',op_possibly) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax',op_strict_implies) ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+3.ax',km4b_necessitation) ).
fof(f80,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+3.ax',km4b_axiom_M) ).
fof(f81,axiom,
axiom_4,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+3.ax',km4b_axiom_4) ).
fof(f82,axiom,
axiom_B,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+3.ax',km4b_axiom_B) ).
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(f89,conjecture,
axiom_m10,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_m10_axiom_m10) ).
fof(f90,negated_conjecture,
~ axiom_m10,
inference(negated_conjecture,[status(cth)],[f89]) ).
fof(f91,plain,
~ axiom_m10,
inference(flattening,[],[f90]) ).
fof(f92,plain,
( ! [X0] : is_a_theorem(strict_implies(possibly(X0),necessarily(possibly(X0))))
=> axiom_m10 ),
inference(unused_predicate_definition_removal,[],[f72]) ).
fof(f93,plain,
( axiom_B
=> ! [X0] : is_a_theorem(implies(X0,necessarily(possibly(X0)))) ),
inference(unused_predicate_definition_removal,[],[f57]) ).
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(f98,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(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(f107,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(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(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(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(f123,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(ennf_transformation,[],[f107]) ).
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(f132,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
| ~ equivalence_3 ),
inference(ennf_transformation,[],[f98]) ).
fof(f134,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
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(f140,plain,
( ! [X0] : is_a_theorem(implies(X0,necessarily(possibly(X0))))
| ~ axiom_B ),
inference(ennf_transformation,[],[f93]) ).
fof(f141,plain,
( axiom_m10
| ? [X0] : ~ is_a_theorem(strict_implies(possibly(X0),necessarily(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_m10
| ~ is_a_theorem(strict_implies(possibly(sK0),necessarily(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(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(f151,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(cnf_transformation,[],[f123]) ).
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(f160,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
| ~ equivalence_3 ),
inference(cnf_transformation,[],[f132]) ).
fof(f162,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f134]) ).
fof(f165,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f167,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f169,plain,
implies_1,
inference(cnf_transformation,[],[f37]) ).
fof(f170,plain,
implies_2,
inference(cnf_transformation,[],[f38]) ).
fof(f171,plain,
implies_3,
inference(cnf_transformation,[],[f39]) ).
fof(f173,plain,
and_2,
inference(cnf_transformation,[],[f41]) ).
fof(f174,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f180,plain,
equivalence_3,
inference(cnf_transformation,[],[f48]) ).
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(f186,plain,
! [X0] :
( is_a_theorem(implies(X0,necessarily(possibly(X0))))
| ~ axiom_B ),
inference(cnf_transformation,[],[f140]) ).
fof(f187,plain,
( axiom_m10
| ~ is_a_theorem(strict_implies(possibly(sK0),necessarily(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(f196,plain,
axiom_B,
inference(cnf_transformation,[],[f82]) ).
fof(f197,plain,
op_possibly,
inference(cnf_transformation,[],[f83]) ).
fof(f199,plain,
op_strict_implies,
inference(cnf_transformation,[],[f86]) ).
fof(f202,plain,
~ axiom_m10,
inference(cnf_transformation,[],[f91]) ).
fof(f204,plain,
! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(forward_subsumption_resolution,[],[f189,f199]) ).
fof(f205,plain,
! [X0] : possibly(X0) = not(necessarily(not(X0))),
inference(forward_subsumption_resolution,[],[f188,f197]) ).
fof(f206,plain,
~ is_a_theorem(strict_implies(possibly(sK0),necessarily(possibly(sK0)))),
inference(forward_subsumption_resolution,[],[f187,f202]) ).
fof(f207,plain,
! [X0] : is_a_theorem(implies(X0,necessarily(possibly(X0)))),
inference(forward_subsumption_resolution,[],[f186,f196]) ).
fof(f208,plain,
! [X0] : is_a_theorem(implies(necessarily(X0),necessarily(necessarily(X0)))),
inference(forward_subsumption_resolution,[],[f185,f195]) ).
fof(f209,plain,
! [X0] : is_a_theorem(implies(necessarily(X0),X0)),
inference(forward_subsumption_resolution,[],[f184,f194]) ).
fof(f211,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[],[f182,f192]) ).
fof(f213,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(forward_subsumption_resolution,[],[f162,f165]) ).
fof(f215,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))),
inference(forward_subsumption_resolution,[],[f160,f180]) ).
fof(f221,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(forward_subsumption_resolution,[],[f154,f174]) ).
fof(f222,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)),
inference(forward_subsumption_resolution,[],[f153,f173]) ).
fof(f224,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(forward_subsumption_resolution,[],[f151,f171]) ).
fof(f225,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
inference(forward_subsumption_resolution,[],[f150,f170]) ).
fof(f226,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(forward_subsumption_resolution,[],[f149,f169]) ).
fof(f228,plain,
! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f147,f181]) ).
fof(f229,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(forward_subsumption_resolution,[],[f146,f167]) ).
fof(f234,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(strict_implies(X0,X1)) ),
inference(superposition,[],[f211,f204]) ).
fof(f239,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f229,f226]) ).
fof(f240,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,and(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f229,f221]) ).
fof(f267,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f225,f229]) ).
fof(f300,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X1,X0),equiv(X0,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f215,f229]) ).
fof(f308,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f224,f229]) ).
fof(f334,plain,
! [X0] : is_a_theorem(strict_implies(X0,necessarily(possibly(X0)))),
inference(resolution,[],[f234,f207]) ).
fof(f503,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f267,f226]) ).
fof(f508,plain,
! [X0] : is_a_theorem(implies(implies(X0,X0),implies(X0,X0))),
inference(resolution,[],[f267,f224]) ).
fof(f694,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(equiv(X0,X1)) ),
inference(resolution,[],[f300,f229]) ).
fof(f697,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X0))
| is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(resolution,[],[f308,f267]) ).
fof(f1768,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,[],[f694,f240]) ).
fof(f1808,plain,
! [X0] :
( ~ is_a_theorem(implies(necessarily(necessarily(X0)),necessarily(X0)))
| is_a_theorem(equiv(necessarily(necessarily(X0)),necessarily(X0))) ),
inference(resolution,[],[f694,f208]) ).
fof(f1831,plain,
! [X0] : is_a_theorem(equiv(necessarily(necessarily(X0)),necessarily(X0))),
inference(forward_subsumption_resolution,[],[f1808,f209]) ).
fof(f1840,plain,
! [X0,X1] :
( is_a_theorem(equiv(and(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[],[f1768,f222]) ).
fof(f1852,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f697,f239]) ).
fof(f1912,plain,
! [X0] : necessarily(X0) = necessarily(necessarily(X0)),
inference(resolution,[],[f1831,f228]) ).
fof(f3407,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| and(X0,X1) = X1 ),
inference(resolution,[],[f1840,f228]) ).
fof(f3441,plain,
! [X0,X1] : and(implies(X0,X0),X1) = X1,
inference(resolution,[],[f3407,f503]) ).
fof(f3951,plain,
! [X0,X1] : not(not(X0)) = implies(implies(X1,X1),X0),
inference(superposition,[],[f213,f3441]) ).
fof(f5809,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X1,implies(X0,X1)))
| is_a_theorem(equiv(X1,implies(X0,X1))) ),
inference(resolution,[],[f1852,f694]) ).
fof(f5824,plain,
! [X0,X1] :
( is_a_theorem(equiv(X1,implies(X0,X1)))
| ~ is_a_theorem(X0) ),
inference(forward_subsumption_resolution,[],[f5809,f226]) ).
fof(f6175,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| implies(X0,X1) = X1 ),
inference(resolution,[],[f5824,f228]) ).
fof(f6251,plain,
! [X0,X1] : implies(implies(implies(X0,X0),implies(X0,X0)),X1) = X1,
inference(resolution,[],[f6175,f508]) ).
fof(f6499,plain,
! [X1] : not(not(X1)) = X1,
inference(forward_demodulation,[],[f6251,f3951]) ).
fof(f6782,plain,
! [X0] : not(possibly(X0)) = necessarily(not(X0)),
inference(superposition,[],[f6499,f205]) ).
fof(f9265,plain,
! [X0] : possibly(possibly(X0)) = not(necessarily(necessarily(not(X0)))),
inference(superposition,[],[f205,f6782]) ).
fof(f9513,plain,
! [X0] : possibly(possibly(X0)) = not(necessarily(not(X0))),
inference(forward_demodulation,[],[f9265,f1912]) ).
fof(f9556,plain,
! [X0] : possibly(X0) = possibly(possibly(X0)),
inference(forward_demodulation,[],[f9513,f205]) ).
fof(f9690,plain,
! [X0] : is_a_theorem(strict_implies(possibly(X0),necessarily(possibly(X0)))),
inference(superposition,[],[f334,f9556]) ).
fof(f14974,plain,
$false,
inference(resolution,[],[f9690,f206]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL549+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.04/0.31 % Computer : n012.cluster.edu
% 0.04/0.31 % Model : x86_64 x86_64
% 0.04/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31 % Memory : 8046.5625MB
% 0.04/0.31 % OS : Linux 6.8.0-71-generic
% 0.04/0.31 % CPULimit : 300
% 0.04/0.31 % WCLimit : 300
% 0.04/0.31 % DateTime : Sun Sep 27 15:59:34 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.32 Running first-order model finding
% 0.07/0.32 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
% 15.83/2.60 % (2546431)Will run a generic schedule for satisfiability detection.
% 15.83/2.60 % (2546437)% WARNING: option uhcvi not known.
% 15.83/2.60 % (2546442)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=542650197:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 15.83/2.60 % (2546439)dis+10_1_sil=32000:sp=arity:random_seed=334886940:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 15.83/2.60 % (2546436)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=178981645_2999 on theBenchmark for (2999ds/0Mi)
% 15.83/2.60 % (2546438)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2382214800:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 15.83/2.60 % (2546440)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3845764131:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 15.83/2.60 % (2546437)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2055560201:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 15.83/2.60 % (2546441)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2016357735:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 15.83/2.60 % TRYING [1]
% 15.83/2.60 % TRYING [2]
% 15.83/2.60 % TRYING [3]
% 15.83/2.60 % TRYING [4]
% 15.83/2.60 % (2546439)Instruction limit reached!
% 15.83/2.60 % (2546439)------------------------------
% 15.83/2.60 % (2546439)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.83/2.60 % (2546439)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.83/2.60 % (2546439)CaDiCaL version: 2.1.3
% 15.83/2.60 % (2546439)Termination reason: Instruction limit
% 15.83/2.60 % (2546439)Termination phase: Saturation
% 15.83/2.60 % (2546439)Time elapsed: 0.038 s
% 15.83/2.60 % (2546439)Peak memory usage: 13 MB
% 15.83/2.60 % (2546439)Instructions burned: 103 (million)
% 15.83/2.60 % (2546440)Instruction limit reached!
% 15.83/2.60 % (2546440)------------------------------
% 15.83/2.60 % (2546440)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.83/2.60 % (2546440)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.83/2.60 % (2546440)CaDiCaL version: 2.1.3
% 15.83/2.60 % (2546440)Termination reason: Instruction limit
% 15.83/2.60 % (2546440)Termination phase: Saturation
% 15.83/2.60 % (2546440)Time elapsed: 0.041 s
% 15.83/2.60 % (2546440)Peak memory usage: 13 MB
% 15.83/2.60 % (2546440)Instructions burned: 116 (million)
% 15.83/2.60 % (2546441)Instruction limit reached!
% 15.83/2.60 % (2546441)------------------------------
% 15.83/2.60 % (2546441)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.83/2.60 % (2546441)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.83/2.60 % (2546441)CaDiCaL version: 2.1.3
% 15.83/2.60 % (2546441)Termination reason: Instruction limit
% 15.83/2.60 % (2546441)Termination phase: Saturation
% 15.83/2.60 % (2546441)Time elapsed: 0.048 s
% 15.83/2.60 % (2546441)Peak memory usage: 14 MB
% 15.83/2.60 % (2546441)Instructions burned: 132 (million)
% 15.83/2.60 % (2546450)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4230587162:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 15.83/2.60 % (2546451)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=974961464:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 15.83/2.60 % TRYING [1]
% 15.83/2.60 % TRYING [2]
% 15.83/2.60 % TRYING [3]
% 15.83/2.60 % TRYING [5]
% 15.83/2.60 % (2546452)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=2703718596:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 15.83/2.60 % TRYING [4]
% 15.83/2.60 % (2546442)Instruction limit reached!
% 15.83/2.60 % (2546442)------------------------------
% 15.83/2.60 % (2546442)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.83/2.60 % (2546442)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.83/2.60 % (2546442)CaDiCaL version: 2.1.3
% 15.83/2.60 % (2546442)Termination reason: Instruction limit
% 15.83/2.60 % (2546442)Termination phase: Saturation
% 15.83/2.60 % (2546442)Time elapsed: 0.063 s
% 15.83/2.60 % (2546442)Peak memory usage: 14 MB
% 15.83/2.60 % (2546442)Instructions burned: 160 (million)
% 15.83/2.60 % (2546456)ott-21_1_sil=16000:fs=off:random_seed=4213618016:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 15.83/2.60 % (2546451)Instruction limit reached!
% 15.83/2.60 % (2546451)------------------------------
% 15.83/2.60 % (2546451)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546451)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546451)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546451)Termination reason: Instruction limit
% 19.41/3.18 % (2546451)Termination phase: Saturation
% 19.41/3.18 % (2546451)Time elapsed: 0.050 s
% 19.41/3.18 % (2546451)Peak memory usage: 14 MB
% 19.41/3.18 % (2546451)Instructions burned: 133 (million)
% 19.41/3.18 % (2546458)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4201820949:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 19.41/3.18 % (2546456)Instruction limit reached!
% 19.41/3.18 % (2546456)------------------------------
% 19.41/3.18 % (2546456)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546456)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546456)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546456)Termination reason: Instruction limit
% 19.41/3.18 % (2546456)Termination phase: Saturation
% 19.41/3.18 % (2546456)Time elapsed: 0.052 s
% 19.41/3.18 % (2546456)Peak memory usage: 13 MB
% 19.41/3.18 % (2546456)Instructions burned: 182 (million)
% 19.41/3.18 % TRYING [5]
% 19.41/3.18 % (2546460)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1912109578:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 19.41/3.18 % TRYING [1]
% 19.41/3.18 % TRYING [2]
% 19.41/3.18 % TRYING [3]
% 19.41/3.18 % TRYING [4]
% 19.41/3.18 % (2546450)Instruction limit reached!
% 19.41/3.18 % (2546450)------------------------------
% 19.41/3.18 % (2546450)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546450)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546450)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546450)Termination reason: Instruction limit
% 19.41/3.18 % (2546450)Termination phase: Finite model building SAT solving
% 19.41/3.18 % (2546450)Time elapsed: 0.219 s
% 19.41/3.18 % (2546450)Peak memory usage: 23 MB
% 19.41/3.18 % (2546450)Instructions burned: 715 (million)
% 19.41/3.18 % (2546452)Instruction limit reached!
% 19.41/3.18 % (2546452)------------------------------
% 19.41/3.18 % (2546452)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546452)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546452)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546452)Termination reason: Instruction limit
% 19.41/3.18 % (2546452)Termination phase: Saturation
% 19.41/3.18 % (2546452)Time elapsed: 0.222 s
% 19.41/3.18 % (2546452)Peak memory usage: 20 MB
% 19.41/3.18 % (2546452)Instructions burned: 686 (million)
% 19.41/3.18 % (2546462)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=614090327:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 19.41/3.18 % (2546458)Instruction limit reached!
% 19.41/3.18 % (2546458)------------------------------
% 19.41/3.18 % (2546458)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546458)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546458)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546458)Termination reason: Instruction limit
% 19.41/3.18 % (2546458)Termination phase: Saturation
% 19.41/3.18 % (2546458)Time elapsed: 0.172 s
% 19.41/3.18 % (2546458)Peak memory usage: 14 MB
% 19.41/3.18 % (2546458)Instructions burned: 477 (million)
% 19.41/3.18 % (2546463)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3905958741:i=889:ins=1_2996 on theBenchmark for (2996ds/889Mi)
% 19.41/3.18 % (2546465)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=1741596708:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2996 on theBenchmark for (2996ds/692Mi)
% 19.41/3.18 % (2546460)Instruction limit reached!
% 19.41/3.18 % (2546460)------------------------------
% 19.41/3.18 % (2546460)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546460)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546460)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546460)Termination reason: Instruction limit
% 19.41/3.18 % (2546460)Termination phase: Finite model building SAT solving
% 19.41/3.18 % (2546460)Time elapsed: 0.178 s
% 19.41/3.18 % (2546460)Peak memory usage: 21 MB
% 19.41/3.18 % (2546460)Instructions burned: 871 (million)
% 19.41/3.18 % (2546468)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1631513290:i=879:kws=inv_precedence:fsr=off_2996 on theBenchmark for (2996ds/879Mi)
% 19.41/3.18 % TRYING [14]
% 19.41/3.18 % (2546463)Instruction limit reached!
% 19.41/3.18 % (2546463)------------------------------
% 19.41/3.18 % (2546463)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546463)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546463)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546463)Termination reason: Instruction limit
% 19.41/3.18 % (2546463)Termination phase: Finite model building constraint generation
% 19.41/3.18 % (2546463)Time elapsed: 0.178 s
% 19.41/3.18 % (2546463)Peak memory usage: 69 MB
% 19.41/3.18 % (2546463)Instructions burned: 891 (million)
% 19.41/3.18 % (2546470)fmb+10_1_sil=64000:random_seed=3591306561:i=22061:nm=2:gsp=on_2994 on theBenchmark for (2994ds/22061Mi)
% 19.41/3.18 % TRYING [1]
% 19.41/3.18 % TRYING [2]
% 19.41/3.18 % TRYING [3]
% 19.41/3.18 % TRYING [4]
% 19.41/3.18 % (2546465)Instruction limit reached!
% 19.41/3.18 % (2546465)------------------------------
% 19.41/3.18 % (2546465)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546465)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546465)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546465)Termination reason: Instruction limit
% 19.41/3.18 % (2546465)Termination phase: Saturation
% 19.41/3.18 % (2546465)Time elapsed: 0.238 s
% 19.41/3.18 % (2546465)Peak memory usage: 22 MB
% 19.41/3.18 % (2546465)Instructions burned: 694 (million)
% 19.41/3.18 % (2546472)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=237791601:i=9515:nm=5_2994 on theBenchmark for (2994ds/9515Mi)
% 19.41/3.18 % TRYING [20]
% 19.41/3.18 % TRYING [5]
% 19.41/3.18 % (2546468)Instruction limit reached!
% 19.41/3.18 % (2546468)------------------------------
% 19.41/3.18 % (2546468)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546468)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546468)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546468)Termination reason: Instruction limit
% 19.41/3.18 % (2546468)Termination phase: Saturation
% 19.41/3.18 % (2546468)Time elapsed: 0.287 s
% 19.41/3.18 % (2546468)Peak memory usage: 25 MB
% 19.41/3.18 % (2546468)Instructions burned: 881 (million)
% 19.41/3.18 % (2546474)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=50151313:fmbsr=1.7:i=920_2993 on theBenchmark for (2993ds/920Mi)
% 19.41/3.18 % TRYING [8]
% 19.41/3.18 % TRYING [6]
% 19.41/3.18 % (2546462)Instruction limit reached!
% 19.41/3.18 % (2546462)------------------------------
% 19.41/3.18 % (2546462)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546462)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546462)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546462)Termination reason: Instruction limit
% 19.41/3.18 % (2546462)Termination phase: Saturation
% 19.41/3.18 % (2546462)Time elapsed: 0.377 s
% 19.41/3.18 % (2546462)Peak memory usage: 21 MB
% 19.41/3.18 % (2546462)Instructions burned: 1182 (million)
% 19.41/3.18 % (2546476)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3415056367:i=5131_2993 on theBenchmark for (2993ds/5131Mi)
% 19.41/3.18 % TRYING [6]
% 19.41/3.18 % (2546474)Instruction limit reached!
% 19.41/3.18 % (2546474)------------------------------
% 19.41/3.18 % (2546474)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546474)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546474)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546474)Termination reason: Instruction limit
% 19.41/3.18 % (2546474)Termination phase: Finite model building constraint generation
% 19.41/3.18 % (2546474)Time elapsed: 0.193 s
% 19.41/3.18 % (2546474)Peak memory usage: 65 MB
% 19.41/3.18 % (2546474)Instructions burned: 920 (million)
% 19.41/3.18 % (2546478)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=1123496699:i=1472:ins=7:fdi=8:gsp=on_2991 on theBenchmark for (2991ds/1472Mi)
% 19.41/3.18 % (2546478)Instruction limit reached!
% 19.41/3.18 % (2546478)------------------------------
% 19.41/3.18 % (2546478)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546478)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546478)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546478)Termination reason: Instruction limit
% 19.41/3.18 % (2546478)Termination phase: Saturation
% 19.41/3.18 % (2546478)Time elapsed: 0.444 s
% 19.41/3.18 % (2546478)Peak memory usage: 28 MB
% 19.41/3.18 % (2546478)Instructions burned: 1474 (million)
% 19.41/3.18 % (2546480)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=4173710082:i=6324_2986 on theBenchmark for (2986ds/6324Mi)
% 19.41/3.18 % TRYING [77]
% 19.41/3.18 % TRYING [7]
% 19.41/3.18 % (2546476)Instruction limit reached!
% 19.41/3.18 % (2546476)------------------------------
% 19.41/3.18 % (2546476)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546476)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546476)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546476)Termination reason: Instruction limit
% 19.41/3.18 % (2546476)Termination phase: Saturation
% 19.41/3.18 % (2546476)Time elapsed: 1.564 s
% 19.41/3.18 % (2546476)Peak memory usage: 64 MB
% 19.41/3.18 % (2546476)Instructions burned: 5134 (million)
% 19.41/3.18 % (2546482)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=2028776303:fmbsr=2.30978:i=2174_2977 on theBenchmark for (2977ds/2174Mi)
% 19.41/3.18 % TRYING [16]
% 19.41/3.18 % (2546472)Instruction limit reached!
% 19.41/3.18 % (2546472)------------------------------
% 19.41/3.18 % (2546472)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546472)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546472)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546472)Termination reason: Instruction limit
% 19.41/3.18 % (2546472)Termination phase: Finite model building constraint generation
% 19.41/3.18 % (2546472)Time elapsed: 1.823 s
% 19.41/3.18 % (2546472)Peak memory usage: 538 MB
% 19.41/3.18 % (2546472)Instructions burned: 9519 (million)
% 19.41/3.18 % (2546484)ott-2_1_sil=16000:newcnf=on:random_seed=3945016481:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2975 on theBenchmark for (2975ds/869Mi)
% 19.41/3.18 % TRYING [7]
% 19.41/3.18 % (2546480)Instruction limit reached!
% 19.41/3.18 % (2546480)------------------------------
% 19.41/3.18 % (2546480)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546480)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546480)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546480)Termination reason: Instruction limit
% 19.41/3.18 % (2546480)Termination phase: Finite model building constraint generation
% 19.41/3.18 % (2546480)Time elapsed: 1.283 s
% 19.41/3.18 % (2546480)Peak memory usage: 415 MB
% 19.41/3.18 % (2546480)Instructions burned: 6327 (million)
% 19.41/3.18 % (2546486)ott+10_1_sil=32000:tgt=ground:random_seed=3480086382:i=5114:av=off_2973 on theBenchmark for (2973ds/5114Mi)
% 19.41/3.18 % (2546482)Instruction limit reached!
% 19.41/3.18 % (2546482)------------------------------
% 19.41/3.18 % (2546482)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546482)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546482)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546482)Termination reason: Instruction limit
% 19.41/3.18 % (2546482)Termination phase: Finite model building constraint generation
% 19.41/3.18 % (2546482)Time elapsed: 0.406 s
% 19.41/3.18 % (2546482)Peak memory usage: 132 MB
% 19.41/3.18 % (2546482)Instructions burned: 2179 (million)
% 19.41/3.18 % (2546488)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=2958855984:i=54282_2972 on theBenchmark for (2972ds/54282Mi)
% 19.41/3.18 % TRYING [1]
% 19.41/3.18 % TRYING [2]
% 19.41/3.18 % TRYING [3]
% 19.41/3.18 % TRYING [4]
% 19.41/3.18 % (2546484)Instruction limit reached!
% 19.41/3.18 % (2546484)------------------------------
% 19.41/3.18 % (2546484)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546484)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546484)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546484)Termination reason: Instruction limit
% 19.41/3.18 % (2546484)Termination phase: Saturation
% 19.41/3.18 % (2546484)Time elapsed: 0.312 s
% 19.41/3.18 % (2546484)Peak memory usage: 21 MB
% 19.41/3.18 % (2546484)Instructions burned: 871 (million)
% 19.41/3.18 % TRYING [5]
% 19.41/3.18 % (2546490)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=1368995498:i=3512:aac=none_2972 on theBenchmark for (2972ds/3512Mi)
% 19.41/3.18 % (2546486) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2546431-2546486"...
% 19.41/3.18 % (2546486)...printing done.
% 19.41/3.18 % (2546486)Refutation found. Thanks to Tanya!
% 19.41/3.18 % SZS status Theorem for theBenchmark
% 19.41/3.18 % SZS output start Proof for theBenchmark
% See solution above
% 19.41/3.18 % (2546486)------------------------------
% 19.41/3.18 % (2546486)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.41/3.18 % (2546486)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.41/3.18 % (2546486)CaDiCaL version: 2.1.3
% 19.41/3.18 % (2546486)Termination reason: Refutation
% 19.41/3.18 % (2546486)Time elapsed: 0.177 s
% 19.41/3.18 % (2546486)Peak memory usage: 19 MB
% 19.41/3.18 % (2546486)Instructions burned: 507 (million)
% 19.41/3.18 % (2546431)Success in time 2.851 s
% 19.41/3.18 % Vampire exiting
%------------------------------------------------------------------------------