%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL524+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 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:58:51 AM UTC 2026
% Result : Theorem 7.42s 1.69s
% Output : Refutation 7.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 50
% Syntax : Number of formulae : 214 ( 71 unt; 26 def)
% Number of atoms : 475 ( 19 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 481 ( 220 ~; 210 |; 2 &)
% ( 35 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 41 ( 39 usr; 39 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 179 ( 0 sgn 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/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(f3,axiom,
( modus_tollens
<=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/LCL006+0.ax',and_2) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(f36,axiom,
modus_tollens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_tollens) ).
fof(f37,axiom,
implies_1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_implies_1) ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_implies_2) ).
fof(f39,axiom,
implies_3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_implies_3) ).
fof(f41,axiom,
and_2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_2) ).
fof(f55,axiom,
( axiom_M
<=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',axiom_M) ).
fof(f57,axiom,
( axiom_B
<=> ! [X0] : is_a_theorem(implies(X0,necessarily(possibly(X0)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',axiom_B) ).
fof(f58,axiom,
( axiom_5
<=> ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',axiom_5) ).
fof(f73,axiom,
( op_possibly
=> ! [X0] : possibly(X0) = not(necessarily(not(X0))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+1.ax',op_possibly) ).
fof(f77,axiom,
op_possibly,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+2.ax',km5_op_possibly) ).
fof(f80,axiom,
axiom_M,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+2.ax',km5_axiom_M) ).
fof(f81,axiom,
axiom_5,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+2.ax',km5_axiom_5) ).
fof(f82,conjecture,
axiom_B,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',km4b_axiom_B) ).
fof(f83,negated_conjecture,
~ axiom_B,
inference(negated_conjecture,[status(cth)],[f82]) ).
fof(f84,plain,
~ axiom_B,
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(X0,necessarily(possibly(X0))))
=> axiom_B ),
inference(unused_predicate_definition_removal,[],[f57]) ).
fof(f87,plain,
( axiom_M
=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f97,plain,
( and_2
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
fof(f99,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(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(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(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(f116,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(ennf_transformation,[],[f99]) ).
fof(f118,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1))
| ~ and_2 ),
inference(ennf_transformation,[],[f97]) ).
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(f131,plain,
( ! [X0] : is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(ennf_transformation,[],[f87]) ).
fof(f132,plain,
( axiom_B
| ? [X0] : ~ is_a_theorem(implies(X0,necessarily(possibly(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,
! [X0,X1] :
( ~ modus_ponens
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f137,plain,
! [X0,X1] :
( ~ modus_tollens
| is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
inference(cnf_transformation,[],[f113]) ).
fof(f138,plain,
! [X0,X1] :
( ~ implies_1
| is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(cnf_transformation,[],[f114]) ).
fof(f139,plain,
! [X0,X1] :
( ~ implies_2
| is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(cnf_transformation,[],[f115]) ).
fof(f140,plain,
! [X2,X0,X1] :
( ~ implies_3
| is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(cnf_transformation,[],[f116]) ).
fof(f142,plain,
! [X0,X1] :
( ~ and_2
| is_a_theorem(implies(and(X0,X1),X1)) ),
inference(cnf_transformation,[],[f118]) ).
fof(f150,plain,
! [X0,X1] :
( ~ op_or
| or(X0,X1) = not(and(not(X0),not(X1))) ),
inference(cnf_transformation,[],[f126]) ).
fof(f151,plain,
! [X0,X1] :
( ~ op_implies_and
| implies(X0,X1) = not(and(X0,not(X1))) ),
inference(cnf_transformation,[],[f127]) ).
fof(f153,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f154,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f156,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f157,plain,
modus_tollens,
inference(cnf_transformation,[],[f36]) ).
fof(f158,plain,
implies_1,
inference(cnf_transformation,[],[f37]) ).
fof(f159,plain,
implies_2,
inference(cnf_transformation,[],[f38]) ).
fof(f160,plain,
implies_3,
inference(cnf_transformation,[],[f39]) ).
fof(f162,plain,
and_2,
inference(cnf_transformation,[],[f41]) ).
fof(f173,plain,
! [X0] :
( ~ axiom_M
| is_a_theorem(implies(necessarily(X0),X0)) ),
inference(cnf_transformation,[],[f131]) ).
fof(f174,plain,
( ~ is_a_theorem(implies(sK0,necessarily(possibly(sK0))))
| axiom_B ),
inference(cnf_transformation,[],[f132]) ).
fof(f175,plain,
! [X0] :
( ~ axiom_5
| is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))) ),
inference(cnf_transformation,[],[f133]) ).
fof(f176,plain,
! [X0] :
( ~ op_possibly
| possibly(X0) = not(necessarily(not(X0))) ),
inference(cnf_transformation,[],[f134]) ).
fof(f177,plain,
op_possibly,
inference(cnf_transformation,[],[f77]) ).
fof(f180,plain,
axiom_M,
inference(cnf_transformation,[],[f80]) ).
fof(f181,plain,
axiom_5,
inference(cnf_transformation,[],[f81]) ).
fof(f182,plain,
~ axiom_B,
inference(cnf_transformation,[],[f84]) ).
fof(f183,plain,
! [X0,X1] :
( modus_tollens
| is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
inference(consistent_polarity_flipping,[],[f137]) ).
fof(f184,plain,
! [X0,X1] :
( implies_1
| is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(consistent_polarity_flipping,[],[f138]) ).
fof(f185,plain,
! [X2,X0,X1] :
( implies_3
| is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(consistent_polarity_flipping,[],[f140]) ).
fof(f187,plain,
! [X0,X1] :
( and_2
| is_a_theorem(implies(and(X0,X1),X1)) ),
inference(consistent_polarity_flipping,[],[f142]) ).
fof(f191,plain,
! [X0,X1] :
( op_or
| or(X0,X1) = not(and(not(X0),not(X1))) ),
inference(consistent_polarity_flipping,[],[f150]) ).
fof(f193,plain,
~ op_or,
inference(consistent_polarity_flipping,[],[f153]) ).
fof(f195,plain,
~ modus_tollens,
inference(consistent_polarity_flipping,[],[f157]) ).
fof(f196,plain,
~ implies_1,
inference(consistent_polarity_flipping,[],[f158]) ).
fof(f197,plain,
~ implies_3,
inference(consistent_polarity_flipping,[],[f160]) ).
fof(f199,plain,
~ and_2,
inference(consistent_polarity_flipping,[],[f162]) ).
fof(f206,definition,
( spl1_1
<=> ! [X0] : possibly(X0) = not(necessarily(not(X0))) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f207,plain,
( ! [X0] : possibly(X0) = not(necessarily(not(X0)))
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f206]) ).
fof(f209,definition,
( spl1_2
<=> op_possibly ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f212,plain,
( spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f176,f209,f206]) ).
fof(f214,definition,
( spl1_3
<=> ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))) ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f215,plain,
( ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0))))
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f214]) ).
fof(f217,definition,
( spl1_4
<=> axiom_5 ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f220,plain,
( spl1_3
| ~ spl1_4 ),
inference(avatar_split_clause,[],[f175,f217,f214]) ).
fof(f222,definition,
( spl1_5
<=> axiom_B ),
introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).
fof(f226,definition,
( spl1_6
<=> is_a_theorem(implies(sK0,necessarily(possibly(sK0)))) ),
introduced(definition,[new_symbols(definition,[spl1_6])],[avatar_definition]) ).
fof(f228,plain,
( ~ is_a_theorem(implies(sK0,necessarily(possibly(sK0))))
| spl1_6 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f229,plain,
( spl1_5
| ~ spl1_6 ),
inference(avatar_split_clause,[],[f174,f226,f222]) ).
fof(f231,definition,
( spl1_7
<=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
introduced(definition,[new_symbols(definition,[spl1_7])],[avatar_definition]) ).
fof(f232,plain,
( ! [X0] : is_a_theorem(implies(necessarily(X0),X0))
| ~ spl1_7 ),
inference(avatar_component_clause,[],[f231]) ).
fof(f234,definition,
( spl1_8
<=> axiom_M ),
introduced(definition,[new_symbols(definition,[spl1_8])],[avatar_definition]) ).
fof(f237,plain,
( spl1_7
| ~ spl1_8 ),
inference(avatar_split_clause,[],[f173,f234,f231]) ).
fof(f263,definition,
( spl1_15
<=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(definition,[new_symbols(definition,[spl1_15])],[avatar_definition]) ).
fof(f264,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ spl1_15 ),
inference(avatar_component_clause,[],[f263]) ).
fof(f266,definition,
( spl1_16
<=> op_implies_and ),
introduced(definition,[new_symbols(definition,[spl1_16])],[avatar_definition]) ).
fof(f269,plain,
( spl1_15
| ~ spl1_16 ),
inference(avatar_split_clause,[],[f151,f266,f263]) ).
fof(f271,definition,
( spl1_17
<=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
introduced(definition,[new_symbols(definition,[spl1_17])],[avatar_definition]) ).
fof(f272,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ spl1_17 ),
inference(avatar_component_clause,[],[f271]) ).
fof(f274,definition,
( spl1_18
<=> op_or ),
introduced(definition,[new_symbols(definition,[spl1_18])],[avatar_definition]) ).
fof(f277,plain,
( spl1_17
| spl1_18 ),
inference(avatar_split_clause,[],[f191,f274,f271]) ).
fof(f335,definition,
( spl1_33
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
introduced(definition,[new_symbols(definition,[spl1_33])],[avatar_definition]) ).
fof(f336,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1))
| ~ spl1_33 ),
inference(avatar_component_clause,[],[f335]) ).
fof(f338,definition,
( spl1_34
<=> and_2 ),
introduced(definition,[new_symbols(definition,[spl1_34])],[avatar_definition]) ).
fof(f341,plain,
( spl1_33
| spl1_34 ),
inference(avatar_split_clause,[],[f187,f338,f335]) ).
fof(f351,definition,
( spl1_37
<=> ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
introduced(definition,[new_symbols(definition,[spl1_37])],[avatar_definition]) ).
fof(f352,plain,
( ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ spl1_37 ),
inference(avatar_component_clause,[],[f351]) ).
fof(f354,definition,
( spl1_38
<=> implies_3 ),
introduced(definition,[new_symbols(definition,[spl1_38])],[avatar_definition]) ).
fof(f357,plain,
( spl1_37
| spl1_38 ),
inference(avatar_split_clause,[],[f185,f354,f351]) ).
fof(f359,definition,
( spl1_39
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
introduced(definition,[new_symbols(definition,[spl1_39])],[avatar_definition]) ).
fof(f360,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ spl1_39 ),
inference(avatar_component_clause,[],[f359]) ).
fof(f362,definition,
( spl1_40
<=> implies_2 ),
introduced(definition,[new_symbols(definition,[spl1_40])],[avatar_definition]) ).
fof(f365,plain,
( spl1_39
| ~ spl1_40 ),
inference(avatar_split_clause,[],[f139,f362,f359]) ).
fof(f367,definition,
( spl1_41
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
introduced(definition,[new_symbols(definition,[spl1_41])],[avatar_definition]) ).
fof(f368,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0)))
| ~ spl1_41 ),
inference(avatar_component_clause,[],[f367]) ).
fof(f370,definition,
( spl1_42
<=> implies_1 ),
introduced(definition,[new_symbols(definition,[spl1_42])],[avatar_definition]) ).
fof(f373,plain,
( spl1_41
| spl1_42 ),
inference(avatar_split_clause,[],[f184,f370,f367]) ).
fof(f375,definition,
( spl1_43
<=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
introduced(definition,[new_symbols(definition,[spl1_43])],[avatar_definition]) ).
fof(f376,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ spl1_43 ),
inference(avatar_component_clause,[],[f375]) ).
fof(f378,definition,
( spl1_44
<=> modus_tollens ),
introduced(definition,[new_symbols(definition,[spl1_44])],[avatar_definition]) ).
fof(f381,plain,
( spl1_43
| spl1_44 ),
inference(avatar_split_clause,[],[f183,f378,f375]) ).
fof(f391,definition,
( spl1_47
<=> ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl1_47])],[avatar_definition]) ).
fof(f392,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) )
| ~ spl1_47 ),
inference(avatar_component_clause,[],[f391]) ).
fof(f394,definition,
( spl1_48
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[spl1_48])],[avatar_definition]) ).
fof(f397,plain,
( spl1_47
| ~ spl1_48 ),
inference(avatar_split_clause,[],[f135,f394,f391]) ).
fof(f398,plain,
~ spl1_5,
inference(avatar_split_clause,[],[f182,f222]) ).
fof(f399,plain,
spl1_16,
inference(avatar_split_clause,[],[f154,f266]) ).
fof(f400,plain,
spl1_48,
inference(avatar_split_clause,[],[f156,f394]) ).
fof(f401,plain,
spl1_40,
inference(avatar_split_clause,[],[f159,f362]) ).
fof(f407,plain,
spl1_2,
inference(avatar_split_clause,[],[f177,f209]) ).
fof(f409,plain,
spl1_8,
inference(avatar_split_clause,[],[f180,f234]) ).
fof(f410,plain,
spl1_4,
inference(avatar_split_clause,[],[f181,f217]) ).
fof(f411,plain,
~ spl1_18,
inference(avatar_split_clause,[],[f193,f274]) ).
fof(f413,plain,
~ spl1_44,
inference(avatar_split_clause,[],[f195,f378]) ).
fof(f414,plain,
~ spl1_42,
inference(avatar_split_clause,[],[f196,f370]) ).
fof(f415,plain,
~ spl1_38,
inference(avatar_split_clause,[],[f197,f354]) ).
fof(f417,plain,
~ spl1_34,
inference(avatar_split_clause,[],[f199,f338]) ).
fof(f425,plain,
( ! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X1) )
| ~ spl1_41
| ~ spl1_47 ),
inference(resolution,[],[f392,f368]) ).
fof(f438,plain,
( ! [X2,X0,X1] : or(and(X0,not(X1)),X2) = not(and(implies(X0,X1),not(X2)))
| ~ spl1_15
| ~ spl1_17 ),
inference(superposition,[],[f272,f264]) ).
fof(f443,plain,
( ! [X0,X1] : or(X0,X1) = implies(not(X0),X1)
| ~ spl1_15
| ~ spl1_17 ),
inference(superposition,[],[f272,f264]) ).
fof(f448,plain,
( ! [X2,X0,X1] : or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2)
| ~ spl1_15
| ~ spl1_17 ),
inference(forward_demodulation,[],[f438,f264]) ).
fof(f450,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) )
| ~ spl1_39
| ~ spl1_47 ),
inference(resolution,[],[f360,f392]) ).
fof(f451,plain,
( ! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(not(X1),not(X0))) )
| ~ spl1_43
| ~ spl1_47 ),
inference(resolution,[],[f376,f392]) ).
fof(f464,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))
| ~ is_a_theorem(implies(X2,X0)) )
| ~ spl1_37
| ~ spl1_47 ),
inference(resolution,[],[f352,f392]) ).
fof(f559,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(X1,not(X0)))
| is_a_theorem(implies(X0,X1)) )
| ~ spl1_15
| ~ spl1_17
| ~ spl1_43
| ~ spl1_47 ),
inference(forward_demodulation,[],[f451,f443]) ).
fof(f684,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),not(X2)))
| is_a_theorem(implies(X2,and(X0,not(X1)))) )
| ~ spl1_15
| ~ spl1_17
| ~ spl1_43
| ~ spl1_47 ),
inference(superposition,[],[f559,f448]) ).
fof(f751,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X0))
| is_a_theorem(implies(implies(X0,X1),X1)) )
| ~ spl1_37
| ~ spl1_39
| ~ spl1_47 ),
inference(resolution,[],[f464,f450]) ).
fof(f752,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl1_37
| ~ spl1_47 ),
inference(resolution,[],[f464,f392]) ).
fof(f2179,plain,
( ! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) )
| ~ spl1_37
| ~ spl1_39
| ~ spl1_41
| ~ spl1_47 ),
inference(resolution,[],[f751,f425]) ).
fof(f2215,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,and(X2,X1)))
| is_a_theorem(implies(X0,X1)) )
| ~ spl1_33
| ~ spl1_37
| ~ spl1_47 ),
inference(resolution,[],[f752,f336]) ).
fof(f2226,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,necessarily(X1)))
| is_a_theorem(implies(X0,X1)) )
| ~ spl1_7
| ~ spl1_37
| ~ spl1_47 ),
inference(resolution,[],[f752,f232]) ).
fof(f2231,plain,
( ! [X0,X1] :
( is_a_theorem(implies(X0,necessarily(possibly(X1))))
| ~ is_a_theorem(implies(X0,possibly(X1))) )
| ~ spl1_3
| ~ spl1_37
| ~ spl1_47 ),
inference(resolution,[],[f752,f215]) ).
fof(f2363,plain,
( ! [X0,X1] :
( is_a_theorem(implies(implies(X0,necessarily(X1)),X1))
| ~ is_a_theorem(X0) )
| ~ spl1_7
| ~ spl1_37
| ~ spl1_39
| ~ spl1_41
| ~ spl1_47 ),
inference(resolution,[],[f2226,f2179]) ).
fof(f2768,definition,
( spl1_52
<=> ! [X1] : ~ is_a_theorem(X1) ),
introduced(definition,[new_symbols(definition,[spl1_52])],[avatar_definition]) ).
fof(f2769,plain,
( ! [X1] : ~ is_a_theorem(X1)
| ~ spl1_52 ),
inference(avatar_component_clause,[],[f2768]) ).
fof(f4166,plain,
( ! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,and(X0,not(necessarily(not(X1)))))) )
| ~ spl1_7
| ~ spl1_15
| ~ spl1_17
| ~ spl1_37
| ~ spl1_39
| ~ spl1_41
| ~ spl1_43
| ~ spl1_47 ),
inference(resolution,[],[f2363,f684]) ).
fof(f4174,plain,
( ! [X0,X1] :
( is_a_theorem(implies(X1,and(X0,possibly(X1))))
| ~ is_a_theorem(X0) )
| ~ spl1_1
| ~ spl1_7
| ~ spl1_15
| ~ spl1_17
| ~ spl1_37
| ~ spl1_39
| ~ spl1_41
| ~ spl1_43
| ~ spl1_47 ),
inference(forward_demodulation,[],[f4166,f207]) ).
fof(f12306,plain,
( $false
| ~ spl1_43
| ~ spl1_52 ),
inference(backward_subsumption_resolution,[],[f376,f2769]) ).
fof(f12465,plain,
( ~ spl1_43
| ~ spl1_52 ),
inference(avatar_contradiction_clause,[],[f12306]) ).
fof(f46161,plain,
( ! [X0,X1] :
( is_a_theorem(implies(X0,possibly(X0)))
| ~ is_a_theorem(X1) )
| ~ spl1_1
| ~ spl1_7
| ~ spl1_15
| ~ spl1_17
| ~ spl1_33
| ~ spl1_37
| ~ spl1_39
| ~ spl1_41
| ~ spl1_43
| ~ spl1_47 ),
inference(resolution,[],[f2215,f4174]) ).
fof(f46212,definition,
( spl1_59
<=> ! [X0] : is_a_theorem(implies(X0,possibly(X0))) ),
introduced(definition,[new_symbols(definition,[spl1_59])],[avatar_definition]) ).
fof(f46213,plain,
( ! [X0] : is_a_theorem(implies(X0,possibly(X0)))
| ~ spl1_59 ),
inference(avatar_component_clause,[],[f46212]) ).
fof(f46214,plain,
( spl1_52
| spl1_59
| ~ spl1_1
| ~ spl1_7
| ~ spl1_15
| ~ spl1_17
| ~ spl1_33
| ~ spl1_37
| ~ spl1_39
| ~ spl1_41
| ~ spl1_43
| ~ spl1_47 ),
inference(avatar_split_clause,[],[f46161,f391,f375,f367,f359,f351,f335,f271,f263,f231,f206,f46212,f2768]) ).
fof(f48627,plain,
( ~ is_a_theorem(implies(sK0,possibly(sK0)))
| ~ spl1_3
| spl1_6
| ~ spl1_37
| ~ spl1_47 ),
inference(resolution,[],[f2231,f228]) ).
fof(f48647,plain,
( $false
| ~ spl1_3
| spl1_6
| ~ spl1_37
| ~ spl1_47
| ~ spl1_59 ),
inference(forward_subsumption_resolution,[],[f48627,f46213]) ).
fof(f48648,plain,
( ~ spl1_3
| spl1_6
| ~ spl1_37
| ~ spl1_47
| ~ spl1_59 ),
inference(avatar_contradiction_clause,[],[f48647]) ).
cnf(s1,plain,
( spl1_1
| ~ spl1_2 ),
inference(sat_conversion,[],[f212]) ).
cnf(s2,plain,
( spl1_3
| ~ spl1_4 ),
inference(sat_conversion,[],[f220]) ).
cnf(s3,plain,
( spl1_5
| ~ spl1_6 ),
inference(sat_conversion,[],[f229]) ).
cnf(s4,plain,
( spl1_7
| ~ spl1_8 ),
inference(sat_conversion,[],[f237]) ).
cnf(s8,plain,
( spl1_15
| ~ spl1_16 ),
inference(sat_conversion,[],[f269]) ).
cnf(s9,plain,
( spl1_17
| spl1_18 ),
inference(sat_conversion,[],[f277]) ).
cnf(s17,plain,
( spl1_33
| spl1_34 ),
inference(sat_conversion,[],[f341]) ).
cnf(s19,plain,
( spl1_37
| spl1_38 ),
inference(sat_conversion,[],[f357]) ).
cnf(s20,plain,
( spl1_39
| ~ spl1_40 ),
inference(sat_conversion,[],[f365]) ).
cnf(s21,plain,
( spl1_41
| spl1_42 ),
inference(sat_conversion,[],[f373]) ).
cnf(s22,plain,
( spl1_43
| spl1_44 ),
inference(sat_conversion,[],[f381]) ).
cnf(s24,plain,
( spl1_47
| ~ spl1_48 ),
inference(sat_conversion,[],[f397]) ).
cnf(s25,plain,
~ spl1_5,
inference(sat_conversion,[],[f398]) ).
cnf(s26,plain,
spl1_16,
inference(sat_conversion,[],[f399]) ).
cnf(s27,plain,
spl1_48,
inference(sat_conversion,[],[f400]) ).
cnf(s28,plain,
spl1_40,
inference(sat_conversion,[],[f401]) ).
cnf(s34,plain,
spl1_2,
inference(sat_conversion,[],[f407]) ).
cnf(s36,plain,
spl1_8,
inference(sat_conversion,[],[f409]) ).
cnf(s37,plain,
spl1_4,
inference(sat_conversion,[],[f410]) ).
cnf(s38,plain,
~ spl1_18,
inference(sat_conversion,[],[f411]) ).
cnf(s40,plain,
~ spl1_44,
inference(sat_conversion,[],[f413]) ).
cnf(s41,plain,
~ spl1_42,
inference(sat_conversion,[],[f414]) ).
cnf(s42,plain,
~ spl1_38,
inference(sat_conversion,[],[f415]) ).
cnf(s44,plain,
~ spl1_34,
inference(sat_conversion,[],[f417]) ).
cnf(s88,plain,
( ~ spl1_43
| ~ spl1_52 ),
inference(sat_conversion,[],[f12465]) ).
cnf(s175,plain,
( ~ spl1_1
| ~ spl1_7
| ~ spl1_15
| ~ spl1_17
| ~ spl1_33
| ~ spl1_37
| ~ spl1_39
| ~ spl1_41
| ~ spl1_43
| ~ spl1_47
| spl1_52
| spl1_59 ),
inference(sat_conversion,[],[f46214]) ).
cnf(s176,plain,
( ~ spl1_3
| spl1_6
| ~ spl1_37
| ~ spl1_47
| ~ spl1_59 ),
inference(sat_conversion,[],[f48648]) ).
cnf(s177,plain,
spl1_47,
inference(rat,[],[s24,s27]) ).
cnf(s179,plain,
spl1_43,
inference(rat,[],[s22,s40]) ).
cnf(s180,plain,
~ spl1_52,
inference(rat,[],[s88,s179]) ).
cnf(s181,plain,
spl1_41,
inference(rat,[],[s21,s41]) ).
cnf(s182,plain,
spl1_39,
inference(rat,[],[s20,s28]) ).
cnf(s183,plain,
spl1_37,
inference(rat,[],[s19,s42]) ).
cnf(s185,plain,
spl1_33,
inference(rat,[],[s17,s44]) ).
cnf(s193,plain,
spl1_17,
inference(rat,[],[s9,s38]) ).
cnf(s194,plain,
spl1_15,
inference(rat,[],[s8,s26]) ).
cnf(s199,plain,
spl1_7,
inference(rat,[],[s4,s36]) ).
cnf(s201,plain,
~ spl1_6,
inference(rat,[],[s3,s25]) ).
cnf(s206,plain,
spl1_3,
inference(rat,[],[s2,s37]) ).
cnf(s207,plain,
~ spl1_59,
inference(rat,[],[s176,s201,s177,s183,s206]) ).
cnf(s208,plain,
~ spl1_1,
inference(rat,[],[s175,s199,s180,s177,s179,s181,s182,s183,s185,s193,s194,s207]) ).
cnf(s209,plain,
$false,
inference(rat,[],[s1,s34,s208]) ).
fof(f48649,plain,
$false,
inference(avatar_sat_refutation,[],[s209]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL524+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37 % Computer : n006.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 15:55:41 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.42/1.69 % (3131004)Will run a generic schedule for satisfiability detection.
% 7.42/1.69 % (3131015)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3028013471:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 7.42/1.69 % (3131010)% WARNING: option uhcvi not known.
% 7.42/1.69 % (3131010)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3334616145:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 7.42/1.69 % (3131012)dis+10_1_sil=32000:sp=arity:random_seed=3041490772:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 7.42/1.69 % (3131009)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2536250529_2999 on theBenchmark for (2999ds/0Mi)
% 7.42/1.69 % (3131011)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2011477202:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 7.42/1.69 % (3131014)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1669835897:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 7.42/1.69 % (3131013)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2714078680:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 7.42/1.69 % TRYING [1]
% 7.42/1.69 % TRYING [2]
% 7.42/1.69 % TRYING [3]
% 7.42/1.69 % TRYING [4]
% 7.42/1.69 % (3131015)Instruction limit reached!
% 7.42/1.69 % (3131015)------------------------------
% 7.42/1.69 % (3131015)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.69 % (3131015)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.69 % (3131015)CaDiCaL version: 2.1.3
% 7.42/1.69 % (3131015)Termination reason: Instruction limit
% 7.42/1.69 % (3131015)Termination phase: Saturation
% 7.42/1.69 % (3131015)Time elapsed: 0.063 s
% 7.42/1.69 % (3131015)Peak memory usage: 14 MB
% 7.42/1.69 % (3131015)Instructions burned: 161 (million)
% 7.42/1.69 % (3131012)Instruction limit reached!
% 7.42/1.69 % (3131012)------------------------------
% 7.42/1.69 % (3131012)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.69 % (3131012)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.69 % (3131012)CaDiCaL version: 2.1.3
% 7.42/1.69 % (3131012)Termination reason: Instruction limit
% 7.42/1.69 % (3131012)Termination phase: Saturation
% 7.42/1.69 % (3131012)Time elapsed: 0.066 s
% 7.42/1.69 % (3131012)Peak memory usage: 13 MB
% 7.42/1.69 % (3131012)Instructions burned: 103 (million)
% 7.42/1.69 % (3131023)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1288853139:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 7.42/1.69 % TRYING [1]
% 7.42/1.69 % TRYING [2]
% 7.42/1.69 % TRYING [3]
% 7.42/1.69 % TRYING [4]
% 7.42/1.69 % (3131013)Instruction limit reached!
% 7.42/1.69 % (3131013)------------------------------
% 7.42/1.69 % (3131013)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.69 % (3131013)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.69 % (3131013)CaDiCaL version: 2.1.3
% 7.42/1.69 % (3131013)Termination reason: Instruction limit
% 7.42/1.69 % (3131013)Termination phase: Saturation
% 7.42/1.69 % (3131013)Time elapsed: 0.076 s
% 7.42/1.69 % (3131013)Peak memory usage: 13 MB
% 7.42/1.69 % (3131013)Instructions burned: 117 (million)
% 7.42/1.69 % (3131025)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2534946138:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 7.42/1.69 % (3131014)Instruction limit reached!
% 7.42/1.69 % (3131014)------------------------------
% 7.42/1.69 % (3131014)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.69 % (3131014)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.69 % (3131014)CaDiCaL version: 2.1.3
% 7.42/1.69 % (3131014)Termination reason: Instruction limit
% 7.42/1.69 % (3131014)Termination phase: Saturation
% 7.42/1.69 % (3131014)Time elapsed: 0.085 s
% 7.42/1.69 % (3131014)Peak memory usage: 14 MB
% 7.42/1.69 % (3131014)Instructions burned: 132 (million)
% 7.42/1.69 % (3131026)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=339094900:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 7.42/1.69 % TRYING [5]
% 7.42/1.69 % (3131028)ott-21_1_sil=16000:fs=off:random_seed=493230963:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 7.42/1.69 % TRYING [5]
% 7.42/1.69 % (3131025)Instruction limit reached!
% 7.42/1.69 % (3131025)------------------------------
% 7.42/1.69 % (3131025)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.69 % (3131025)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.69 % (3131025)CaDiCaL version: 2.1.3
% 7.42/1.69 % (3131025)Termination reason: Instruction limit
% 7.42/1.69 % (3131025)Termination phase: Saturation
% 7.42/1.69 % (3131025)Time elapsed: 0.088 s
% 7.42/1.69 % (3131025)Peak memory usage: 14 MB
% 7.42/1.69 % (3131025)Instructions burned: 132 (million)
% 7.42/1.69 % (3131031)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3034546877:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 7.42/1.69 % (3131028)Instruction limit reached!
% 7.42/1.69 % (3131028)------------------------------
% 7.42/1.69 % (3131028)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.69 % (3131028)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.69 % (3131028)CaDiCaL version: 2.1.3
% 7.42/1.69 % (3131028)Termination reason: Instruction limit
% 7.42/1.69 % (3131028)Termination phase: Saturation
% 7.42/1.69 % (3131028)Time elapsed: 0.100 s
% 7.42/1.69 % (3131028)Peak memory usage: 13 MB
% 7.42/1.69 % (3131028)Instructions burned: 180 (million)
% 7.42/1.69 % (3131033)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2264368474:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 7.42/1.69 % TRYING [1]
% 7.42/1.69 % TRYING [2]
% 7.42/1.69 % TRYING [3]
% 7.42/1.69 % (3131023)Instruction limit reached!
% 7.42/1.69 % (3131023)------------------------------
% 7.42/1.69 % (3131023)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.69 % (3131023)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.69 % (3131023)CaDiCaL version: 2.1.3
% 7.42/1.69 % (3131023)Termination reason: Instruction limit
% 7.42/1.69 % (3131023)Termination phase: Finite model building SAT solving
% 7.42/1.69 % (3131023)Time elapsed: 0.211 s
% 7.42/1.69 % (3131023)Peak memory usage: 23 MB
% 7.42/1.69 % (3131023)Instructions burned: 715 (million)
% 7.42/1.69 % (3131035)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3724763228:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 7.42/1.69 % TRYING [4]
% 7.42/1.69 % (3131026)Instruction limit reached!
% 7.42/1.69 % (3131026)------------------------------
% 7.42/1.69 % (3131026)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.69 % (3131026)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.69 % (3131026)CaDiCaL version: 2.1.3
% 7.42/1.69 % (3131026)Termination reason: Instruction limit
% 7.42/1.69 % (3131026)Termination phase: Saturation
% 7.42/1.69 % (3131026)Time elapsed: 0.406 s
% 7.42/1.69 % (3131026)Peak memory usage: 21 MB
% 7.42/1.69 % (3131026)Instructions burned: 685 (million)
% 7.42/1.69 % (3131031)Instruction limit reached!
% 7.42/1.69 % (3131031)------------------------------
% 7.42/1.69 % (3131031)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.69 % (3131031)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.69 % (3131031)CaDiCaL version: 2.1.3
% 7.42/1.69 % (3131031)Termination reason: Instruction limit
% 7.42/1.69 % (3131031)Termination phase: Saturation
% 7.42/1.69 % (3131031)Time elapsed: 0.316 s
% 7.42/1.69 % (3131031)Peak memory usage: 13 MB
% 7.42/1.69 % (3131031)Instructions burned: 477 (million)
% 7.42/1.69 % (3131037)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=4003698879:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 7.42/1.69 % (3131038)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=4160625105: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)
% 7.42/1.69 % (3131033)Instruction limit reached!
% 7.42/1.69 % (3131033)------------------------------
% 7.42/1.69 % (3131033)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.69 % (3131033)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.69 % (3131033)CaDiCaL version: 2.1.3
% 7.42/1.69 % (3131033)Termination reason: Instruction limit
% 7.42/1.69 % (3131033)Termination phase: Finite model building SAT solving
% 7.42/1.69 % (3131033)Time elapsed: 0.329 s
% 7.42/1.69 % (3131033)Peak memory usage: 22 MB
% 7.42/1.69 % (3131033)Instructions burned: 867 (million)
% 7.42/1.69 % (3131041)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=4135379237:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 7.42/1.69 % TRYING [6]
% 7.42/1.69 % TRYING [14]
% 7.42/1.69 % (3131035)Instruction limit reached!
% 7.42/1.69 % (3131035)------------------------------
% 7.42/1.69 % (3131035)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.69 % (3131035)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.69 % (3131035)CaDiCaL version: 2.1.3
% 7.42/1.69 % (3131035)Termination reason: Instruction limit
% 7.42/1.69 % (3131035)Termination phase: Saturation
% 7.42/1.69 % (3131035)Time elapsed: 0.396 s
% 7.42/1.69 % (3131035)Peak memory usage: 22 MB
% 7.42/1.69 % (3131035)Instructions burned: 1188 (million)
% 7.42/1.69 % (3131043)fmb+10_1_sil=64000:random_seed=3757428059:i=22061:nm=2:gsp=on_2992 on theBenchmark for (2992ds/22061Mi)
% 7.42/1.69 % TRYING [1]
% 7.42/1.69 % TRYING [2]
% 7.42/1.69 % TRYING [3]
% 7.42/1.69 % TRYING [4]
% 7.42/1.69 % TRYING [5]
% 7.42/1.69 % (3131037)Instruction limit reached!
% 7.42/1.69 % (3131037)------------------------------
% 7.42/1.69 % (3131037)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.69 % (3131037)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.69 % (3131037)CaDiCaL version: 2.1.3
% 7.42/1.69 % (3131037)Termination reason: Instruction limit
% 7.42/1.69 % (3131037)Termination phase: Finite model building constraint generation
% 7.42/1.69 % (3131037)Time elapsed: 0.318 s
% 7.42/1.69 % (3131037)Peak memory usage: 69 MB
% 7.42/1.69 % (3131037)Instructions burned: 890 (million)
% 7.42/1.69 % (3131045)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2808665398:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 7.42/1.69 % TRYING [20]
% 7.42/1.69 % TRYING [6]
% 7.42/1.69 % (3131038)Instruction limit reached!
% 7.42/1.69 % (3131038)------------------------------
% 7.42/1.69 % (3131038)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.69 % (3131038)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.69 % (3131038)CaDiCaL version: 2.1.3
% 7.42/1.69 % (3131038)Termination reason: Instruction limit
% 7.42/1.69 % (3131038)Termination phase: Saturation
% 7.42/1.69 % (3131038)Time elapsed: 0.461 s
% 7.42/1.69 % (3131038)Peak memory usage: 22 MB
% 7.42/1.69 % (3131038)Instructions burned: 693 (million)
% 7.42/1.69 % (3131047)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3344769282:fmbsr=1.7:i=920_2989 on theBenchmark for (2989ds/920Mi)
% 7.42/1.69 % TRYING [8]
% 7.42/1.69 % (3131041)Instruction limit reached!
% 7.42/1.69 % (3131041)------------------------------
% 7.42/1.69 % (3131041)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.69 % (3131041)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.69 % (3131041)CaDiCaL version: 2.1.3
% 7.42/1.69 % (3131041)Termination reason: Instruction limit
% 7.42/1.69 % (3131041)Termination phase: Saturation
% 7.42/1.69 % (3131041)Time elapsed: 0.522 s
% 7.42/1.69 % (3131041)Peak memory usage: 24 MB
% 7.42/1.69 % (3131041)Instructions burned: 879 (million)
% 7.42/1.69 % (3131049)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=36670643:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 7.42/1.69 % (3131010) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3131004-3131010"...
% 7.42/1.69 % (3131010)...printing done.
% 7.42/1.69 % (3131010)Refutation found. Thanks to Tanya!
% 7.42/1.69 % SZS status Theorem for theBenchmark
% 7.42/1.69 % SZS output start Proof for theBenchmark
% See solution above
% 7.42/1.70 % (3131010)------------------------------
% 7.42/1.70 % (3131010)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.42/1.70 % (3131010)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.42/1.70 % (3131010)CaDiCaL version: 2.1.3
% 7.42/1.70 % (3131010)Termination reason: Refutation
% 7.42/1.70 % (3131010)Time elapsed: 1.226 s
% 7.42/1.70 % (3131010)Peak memory usage: 39 MB
% 7.42/1.70 % (3131010)Instructions burned: 2219 (million)
% 7.42/1.70 % (3131004)Success in time 1.278 s
% 7.42/1.70 % Vampire exiting
%------------------------------------------------------------------------------