%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL535+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 : n009.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:53 AM UTC 2026
% Result : Theorem 14.65s 2.59s
% Output : Refutation 14.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 68
% Syntax : Number of formulae : 286 ( 96 unt; 34 def)
% Number of atoms : 702 ( 43 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 766 ( 350 ~; 344 |; 2 &)
% ( 47 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 54 ( 52 usr; 52 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 219 ( 0 sgn 218 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(f2,axiom,
( substitution_of_equivalents
<=> ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
=> X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',substitution_of_equivalents) ).
fof(f3,axiom,
( modus_tollens
<=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_tollens) ).
fof(f4,axiom,
( implies_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_1) ).
fof(f5,axiom,
( implies_2
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_2) ).
fof(f8,axiom,
( and_2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_2) ).
fof(f9,axiom,
( and_3
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_3) ).
fof(f10,axiom,
( or_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',or_1) ).
fof(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(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_or) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(f36,axiom,
modus_tollens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_tollens) ).
fof(f37,axiom,
implies_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_1) ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_2) ).
fof(f41,axiom,
and_2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_2) ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
fof(f43,axiom,
or_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_or_1) ).
fof(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(f58,axiom,
( axiom_5
<=> ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_5) ).
fof(f71,axiom,
( axiom_m9
<=> ! [X0] : is_a_theorem(strict_implies(possibly(possibly(X0)),possibly(X0))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_m9) ).
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(f77,axiom,
op_possibly,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_op_possibly) ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_necessitation) ).
fof(f80,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_axiom_M) ).
fof(f81,axiom,
axiom_5,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_axiom_5) ).
fof(f85,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f88,conjecture,
axiom_m9,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_m6s3m9b_axiom_m9) ).
fof(f89,negated_conjecture,
~ axiom_m9,
inference(negated_conjecture,[status(cth)],[f88]) ).
fof(f90,plain,
~ axiom_m9,
inference(flattening,[],[f89]) ).
fof(f91,plain,
( ! [X0] : is_a_theorem(strict_implies(possibly(possibly(X0)),possibly(X0)))
=> axiom_m9 ),
inference(unused_predicate_definition_removal,[],[f71]) ).
fof(f92,plain,
( axiom_5
=> ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))) ),
inference(unused_predicate_definition_removal,[],[f58]) ).
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(f101,plain,
( or_1
=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
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(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(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(f125,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(ennf_transformation,[],[f101]) ).
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(f137,plain,
( ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0))))
| ~ axiom_5 ),
inference(ennf_transformation,[],[f92]) ).
fof(f138,plain,
( axiom_m9
| ? [X0] : ~ is_a_theorem(strict_implies(possibly(possibly(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,
! [X0,X1] :
( ~ modus_ponens
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f116]) ).
fof(f143,plain,
! [X0,X1] :
( ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f117]) ).
fof(f144,plain,
! [X0,X1] :
( ~ modus_tollens
| is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
inference(cnf_transformation,[],[f118]) ).
fof(f145,plain,
! [X0,X1] :
( ~ implies_1
| is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(cnf_transformation,[],[f119]) ).
fof(f146,plain,
! [X0,X1] :
( ~ implies_2
| is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(cnf_transformation,[],[f120]) ).
fof(f149,plain,
! [X0,X1] :
( ~ and_2
| is_a_theorem(implies(and(X0,X1),X1)) ),
inference(cnf_transformation,[],[f123]) ).
fof(f150,plain,
! [X0,X1] :
( ~ and_3
| is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(cnf_transformation,[],[f124]) ).
fof(f151,plain,
! [X0,X1] :
( ~ or_1
| is_a_theorem(implies(X0,or(X0,X1))) ),
inference(cnf_transformation,[],[f125]) ).
fof(f156,plain,
! [X0,X1] :
( ~ equivalence_3
| is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
inference(cnf_transformation,[],[f130]) ).
fof(f157,plain,
! [X0,X1] :
( ~ op_or
| or(X0,X1) = not(and(not(X0),not(X1))) ),
inference(cnf_transformation,[],[f131]) ).
fof(f158,plain,
! [X0,X1] :
( ~ op_implies_and
| implies(X0,X1) = not(and(X0,not(X1))) ),
inference(cnf_transformation,[],[f132]) ).
fof(f160,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f161,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f163,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f164,plain,
modus_tollens,
inference(cnf_transformation,[],[f36]) ).
fof(f165,plain,
implies_1,
inference(cnf_transformation,[],[f37]) ).
fof(f166,plain,
implies_2,
inference(cnf_transformation,[],[f38]) ).
fof(f169,plain,
and_2,
inference(cnf_transformation,[],[f41]) ).
fof(f170,plain,
and_3,
inference(cnf_transformation,[],[f42]) ).
fof(f171,plain,
or_1,
inference(cnf_transformation,[],[f43]) ).
fof(f176,plain,
equivalence_3,
inference(cnf_transformation,[],[f48]) ).
fof(f177,plain,
substitution_of_equivalents,
inference(cnf_transformation,[],[f49]) ).
fof(f178,plain,
! [X0] :
( ~ necessitation
| ~ is_a_theorem(X0)
| is_a_theorem(necessarily(X0)) ),
inference(cnf_transformation,[],[f134]) ).
fof(f180,plain,
! [X0] :
( ~ axiom_M
| is_a_theorem(implies(necessarily(X0),X0)) ),
inference(cnf_transformation,[],[f136]) ).
fof(f181,plain,
! [X0] :
( ~ axiom_5
| is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))) ),
inference(cnf_transformation,[],[f137]) ).
fof(f182,plain,
( ~ is_a_theorem(strict_implies(possibly(possibly(sK0)),possibly(sK0)))
| axiom_m9 ),
inference(cnf_transformation,[],[f138]) ).
fof(f183,plain,
! [X0] :
( ~ op_possibly
| possibly(X0) = not(necessarily(not(X0))) ),
inference(cnf_transformation,[],[f139]) ).
fof(f184,plain,
! [X0,X1] :
( ~ op_strict_implies
| strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
inference(cnf_transformation,[],[f140]) ).
fof(f186,plain,
op_possibly,
inference(cnf_transformation,[],[f77]) ).
fof(f187,plain,
necessitation,
inference(cnf_transformation,[],[f78]) ).
fof(f189,plain,
axiom_M,
inference(cnf_transformation,[],[f80]) ).
fof(f190,plain,
axiom_5,
inference(cnf_transformation,[],[f81]) ).
fof(f193,plain,
op_strict_implies,
inference(cnf_transformation,[],[f85]) ).
fof(f196,plain,
~ axiom_m9,
inference(cnf_transformation,[],[f90]) ).
fof(f197,plain,
! [X0,X1] :
( substitution_of_equivalents
| ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ),
inference(consistent_polarity_flipping,[],[f143]) ).
fof(f198,plain,
! [X0,X1] :
( modus_tollens
| is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
inference(consistent_polarity_flipping,[],[f144]) ).
fof(f200,plain,
! [X0,X1] :
( or_1
| is_a_theorem(implies(X0,or(X0,X1))) ),
inference(consistent_polarity_flipping,[],[f151]) ).
fof(f202,plain,
! [X0,X1] :
( equivalence_3
| is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
inference(consistent_polarity_flipping,[],[f156]) ).
fof(f203,plain,
! [X0,X1] :
( op_implies_and
| implies(X0,X1) = not(and(X0,not(X1))) ),
inference(consistent_polarity_flipping,[],[f158]) ).
fof(f204,plain,
~ op_implies_and,
inference(consistent_polarity_flipping,[],[f161]) ).
fof(f205,plain,
~ modus_tollens,
inference(consistent_polarity_flipping,[],[f164]) ).
fof(f207,plain,
~ or_1,
inference(consistent_polarity_flipping,[],[f171]) ).
fof(f209,plain,
~ equivalence_3,
inference(consistent_polarity_flipping,[],[f176]) ).
fof(f210,plain,
~ substitution_of_equivalents,
inference(consistent_polarity_flipping,[],[f177]) ).
fof(f211,plain,
! [X0] :
( necessitation
| ~ is_a_theorem(X0)
| is_a_theorem(necessarily(X0)) ),
inference(consistent_polarity_flipping,[],[f178]) ).
fof(f212,plain,
! [X0,X1] :
( op_strict_implies
| strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
inference(consistent_polarity_flipping,[],[f184]) ).
fof(f214,plain,
~ necessitation,
inference(consistent_polarity_flipping,[],[f187]) ).
fof(f215,plain,
~ op_strict_implies,
inference(consistent_polarity_flipping,[],[f193]) ).
fof(f226,definition,
( spl1_3
<=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f227,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f229,definition,
( spl1_4
<=> op_strict_implies ),
introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition]) ).
fof(f232,plain,
( spl1_3
| spl1_4 ),
inference(avatar_split_clause,[],[f212,f229,f226]) ).
fof(f234,definition,
( spl1_5
<=> ! [X0] : possibly(X0) = not(necessarily(not(X0))) ),
introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).
fof(f235,plain,
( ! [X0] : possibly(X0) = not(necessarily(not(X0)))
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f234]) ).
fof(f237,definition,
( spl1_6
<=> op_possibly ),
introduced(definition,[new_symbols(definition,[spl1_6])],[avatar_definition]) ).
fof(f240,plain,
( spl1_5
| ~ spl1_6 ),
inference(avatar_split_clause,[],[f183,f237,f234]) ).
fof(f242,definition,
( spl1_7
<=> axiom_m9 ),
introduced(definition,[new_symbols(definition,[spl1_7])],[avatar_definition]) ).
fof(f246,definition,
( spl1_8
<=> is_a_theorem(strict_implies(possibly(possibly(sK0)),possibly(sK0))) ),
introduced(definition,[new_symbols(definition,[spl1_8])],[avatar_definition]) ).
fof(f248,plain,
( ~ is_a_theorem(strict_implies(possibly(possibly(sK0)),possibly(sK0)))
| spl1_8 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f249,plain,
( spl1_7
| ~ spl1_8 ),
inference(avatar_split_clause,[],[f182,f246,f242]) ).
fof(f251,definition,
( spl1_9
<=> ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))) ),
introduced(definition,[new_symbols(definition,[spl1_9])],[avatar_definition]) ).
fof(f252,plain,
( ! [X0] : is_a_theorem(implies(possibly(X0),necessarily(possibly(X0))))
| ~ spl1_9 ),
inference(avatar_component_clause,[],[f251]) ).
fof(f254,definition,
( spl1_10
<=> axiom_5 ),
introduced(definition,[new_symbols(definition,[spl1_10])],[avatar_definition]) ).
fof(f257,plain,
( spl1_9
| ~ spl1_10 ),
inference(avatar_split_clause,[],[f181,f254,f251]) ).
fof(f259,definition,
( spl1_11
<=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
introduced(definition,[new_symbols(definition,[spl1_11])],[avatar_definition]) ).
fof(f260,plain,
( ! [X0] : is_a_theorem(implies(necessarily(X0),X0))
| ~ spl1_11 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f262,definition,
( spl1_12
<=> axiom_M ),
introduced(definition,[new_symbols(definition,[spl1_12])],[avatar_definition]) ).
fof(f265,plain,
( spl1_11
| ~ spl1_12 ),
inference(avatar_split_clause,[],[f180,f262,f259]) ).
fof(f275,definition,
( spl1_15
<=> ! [X0] :
( ~ is_a_theorem(X0)
| is_a_theorem(necessarily(X0)) ) ),
introduced(definition,[new_symbols(definition,[spl1_15])],[avatar_definition]) ).
fof(f276,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ spl1_15 ),
inference(avatar_component_clause,[],[f275]) ).
fof(f278,definition,
( spl1_16
<=> necessitation ),
introduced(definition,[new_symbols(definition,[spl1_16])],[avatar_definition]) ).
fof(f281,plain,
( spl1_15
| spl1_16 ),
inference(avatar_split_clause,[],[f211,f278,f275]) ).
fof(f291,definition,
( spl1_19
<=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(definition,[new_symbols(definition,[spl1_19])],[avatar_definition]) ).
fof(f292,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ spl1_19 ),
inference(avatar_component_clause,[],[f291]) ).
fof(f294,definition,
( spl1_20
<=> op_implies_and ),
introduced(definition,[new_symbols(definition,[spl1_20])],[avatar_definition]) ).
fof(f297,plain,
( spl1_19
| spl1_20 ),
inference(avatar_split_clause,[],[f203,f294,f291]) ).
fof(f299,definition,
( spl1_21
<=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
introduced(definition,[new_symbols(definition,[spl1_21])],[avatar_definition]) ).
fof(f300,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ spl1_21 ),
inference(avatar_component_clause,[],[f299]) ).
fof(f302,definition,
( spl1_22
<=> op_or ),
introduced(definition,[new_symbols(definition,[spl1_22])],[avatar_definition]) ).
fof(f305,plain,
( spl1_21
| ~ spl1_22 ),
inference(avatar_split_clause,[],[f157,f302,f299]) ).
fof(f307,definition,
( spl1_23
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
introduced(definition,[new_symbols(definition,[spl1_23])],[avatar_definition]) ).
fof(f308,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
| ~ spl1_23 ),
inference(avatar_component_clause,[],[f307]) ).
fof(f310,definition,
( spl1_24
<=> equivalence_3 ),
introduced(definition,[new_symbols(definition,[spl1_24])],[avatar_definition]) ).
fof(f313,plain,
( spl1_23
| spl1_24 ),
inference(avatar_split_clause,[],[f202,f310,f307]) ).
fof(f347,definition,
( spl1_33
<=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
introduced(definition,[new_symbols(definition,[spl1_33])],[avatar_definition]) ).
fof(f348,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ spl1_33 ),
inference(avatar_component_clause,[],[f347]) ).
fof(f350,definition,
( spl1_34
<=> or_1 ),
introduced(definition,[new_symbols(definition,[spl1_34])],[avatar_definition]) ).
fof(f353,plain,
( spl1_33
| spl1_34 ),
inference(avatar_split_clause,[],[f200,f350,f347]) ).
fof(f355,definition,
( spl1_35
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
introduced(definition,[new_symbols(definition,[spl1_35])],[avatar_definition]) ).
fof(f356,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ spl1_35 ),
inference(avatar_component_clause,[],[f355]) ).
fof(f358,definition,
( spl1_36
<=> and_3 ),
introduced(definition,[new_symbols(definition,[spl1_36])],[avatar_definition]) ).
fof(f361,plain,
( spl1_35
| ~ spl1_36 ),
inference(avatar_split_clause,[],[f150,f358,f355]) ).
fof(f363,definition,
( spl1_37
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1)) ),
introduced(definition,[new_symbols(definition,[spl1_37])],[avatar_definition]) ).
fof(f364,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X1))
| ~ spl1_37 ),
inference(avatar_component_clause,[],[f363]) ).
fof(f366,definition,
( spl1_38
<=> and_2 ),
introduced(definition,[new_symbols(definition,[spl1_38])],[avatar_definition]) ).
fof(f369,plain,
( spl1_37
| ~ spl1_38 ),
inference(avatar_split_clause,[],[f149,f366,f363]) ).
fof(f387,definition,
( spl1_43
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
introduced(definition,[new_symbols(definition,[spl1_43])],[avatar_definition]) ).
fof(f388,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ spl1_43 ),
inference(avatar_component_clause,[],[f387]) ).
fof(f390,definition,
( spl1_44
<=> implies_2 ),
introduced(definition,[new_symbols(definition,[spl1_44])],[avatar_definition]) ).
fof(f393,plain,
( spl1_43
| ~ spl1_44 ),
inference(avatar_split_clause,[],[f146,f390,f387]) ).
fof(f395,definition,
( spl1_45
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))) ),
introduced(definition,[new_symbols(definition,[spl1_45])],[avatar_definition]) ).
fof(f396,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0)))
| ~ spl1_45 ),
inference(avatar_component_clause,[],[f395]) ).
fof(f398,definition,
( spl1_46
<=> implies_1 ),
introduced(definition,[new_symbols(definition,[spl1_46])],[avatar_definition]) ).
fof(f401,plain,
( spl1_45
| ~ spl1_46 ),
inference(avatar_split_clause,[],[f145,f398,f395]) ).
fof(f403,definition,
( spl1_47
<=> ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1))) ),
introduced(definition,[new_symbols(definition,[spl1_47])],[avatar_definition]) ).
fof(f404,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X1),not(X0)),implies(X0,X1)))
| ~ spl1_47 ),
inference(avatar_component_clause,[],[f403]) ).
fof(f406,definition,
( spl1_48
<=> modus_tollens ),
introduced(definition,[new_symbols(definition,[spl1_48])],[avatar_definition]) ).
fof(f409,plain,
( spl1_47
| spl1_48 ),
inference(avatar_split_clause,[],[f198,f406,f403]) ).
fof(f411,definition,
( spl1_49
<=> ! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 ) ),
introduced(definition,[new_symbols(definition,[spl1_49])],[avatar_definition]) ).
fof(f412,plain,
( ! [X0,X1] :
( ~ is_a_theorem(equiv(X0,X1))
| X0 = X1 )
| ~ spl1_49 ),
inference(avatar_component_clause,[],[f411]) ).
fof(f414,definition,
( spl1_50
<=> substitution_of_equivalents ),
introduced(definition,[new_symbols(definition,[spl1_50])],[avatar_definition]) ).
fof(f417,plain,
( spl1_49
| spl1_50 ),
inference(avatar_split_clause,[],[f197,f414,f411]) ).
fof(f419,definition,
( spl1_51
<=> ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl1_51])],[avatar_definition]) ).
fof(f420,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) )
| ~ spl1_51 ),
inference(avatar_component_clause,[],[f419]) ).
fof(f422,definition,
( spl1_52
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[spl1_52])],[avatar_definition]) ).
fof(f425,plain,
( spl1_51
| ~ spl1_52 ),
inference(avatar_split_clause,[],[f142,f422,f419]) ).
fof(f426,plain,
~ spl1_7,
inference(avatar_split_clause,[],[f196,f242]) ).
fof(f427,plain,
spl1_22,
inference(avatar_split_clause,[],[f160,f302]) ).
fof(f429,plain,
spl1_52,
inference(avatar_split_clause,[],[f163,f422]) ).
fof(f430,plain,
spl1_46,
inference(avatar_split_clause,[],[f165,f398]) ).
fof(f431,plain,
spl1_44,
inference(avatar_split_clause,[],[f166,f390]) ).
fof(f433,plain,
spl1_38,
inference(avatar_split_clause,[],[f169,f366]) ).
fof(f434,plain,
spl1_36,
inference(avatar_split_clause,[],[f170,f358]) ).
fof(f438,plain,
spl1_6,
inference(avatar_split_clause,[],[f186,f237]) ).
fof(f440,plain,
spl1_12,
inference(avatar_split_clause,[],[f189,f262]) ).
fof(f441,plain,
spl1_10,
inference(avatar_split_clause,[],[f190,f254]) ).
fof(f442,plain,
~ spl1_20,
inference(avatar_split_clause,[],[f204,f294]) ).
fof(f443,plain,
~ spl1_48,
inference(avatar_split_clause,[],[f205,f406]) ).
fof(f445,plain,
~ spl1_34,
inference(avatar_split_clause,[],[f207,f350]) ).
fof(f447,plain,
~ spl1_24,
inference(avatar_split_clause,[],[f209,f310]) ).
fof(f448,plain,
~ spl1_50,
inference(avatar_split_clause,[],[f210,f414]) ).
fof(f449,plain,
~ spl1_16,
inference(avatar_split_clause,[],[f214,f278]) ).
fof(f450,plain,
~ spl1_4,
inference(avatar_split_clause,[],[f215,f229]) ).
fof(f452,plain,
( ! [X0] : possibly(necessarily(not(X0))) = not(necessarily(possibly(X0)))
| ~ spl1_5 ),
inference(superposition,[],[f235,f235]) ).
fof(f453,plain,
( ! [X0,X1] :
( is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl1_3
| ~ spl1_15 ),
inference(superposition,[],[f276,f227]) ).
fof(f475,plain,
( ! [X0,X1] : or(X0,X1) = implies(not(X0),X1)
| ~ spl1_19
| ~ spl1_21 ),
inference(superposition,[],[f300,f292]) ).
fof(f484,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) )
| ~ spl1_43
| ~ spl1_51 ),
inference(resolution,[],[f388,f420]) ).
fof(f485,plain,
( ! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(not(X1),not(X0))) )
| ~ spl1_47
| ~ spl1_51 ),
inference(resolution,[],[f404,f420]) ).
fof(f503,plain,
( ! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),equiv(X1,X0)))
| ~ is_a_theorem(implies(X1,X0)) )
| ~ spl1_23
| ~ spl1_51 ),
inference(resolution,[],[f308,f420]) ).
fof(f511,plain,
( ~ is_a_theorem(implies(possibly(possibly(sK0)),possibly(sK0)))
| ~ spl1_3
| spl1_8
| ~ spl1_15 ),
inference(resolution,[],[f453,f248]) ).
fof(f545,plain,
( ! [X0,X1] : is_a_theorem(or(X0,or(not(X0),X1)))
| ~ spl1_19
| ~ spl1_21
| ~ spl1_33 ),
inference(superposition,[],[f348,f475]) ).
fof(f595,plain,
( ! [X0] : is_a_theorem(implies(X0,X0))
| ~ spl1_43
| ~ spl1_45
| ~ spl1_51 ),
inference(resolution,[],[f484,f396]) ).
fof(f596,plain,
( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
| ~ spl1_35
| ~ spl1_43
| ~ spl1_51 ),
inference(resolution,[],[f484,f356]) ).
fof(f606,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(X1,not(X0)))
| is_a_theorem(implies(X0,X1)) )
| ~ spl1_19
| ~ spl1_21
| ~ spl1_47
| ~ spl1_51 ),
inference(forward_demodulation,[],[f485,f475]) ).
fof(f611,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(or(X2,or(X0,X1)))
| is_a_theorem(implies(and(not(X0),not(X1)),X2)) )
| ~ spl1_19
| ~ spl1_21
| ~ spl1_47
| ~ spl1_51 ),
inference(superposition,[],[f606,f300]) ).
fof(f790,plain,
( ! [X0,X1] :
( is_a_theorem(equiv(X0,X1))
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X1,X0)) )
| ~ spl1_23
| ~ spl1_51 ),
inference(resolution,[],[f503,f420]) ).
fof(f2361,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(X0,X1))
| X0 = X1 )
| ~ spl1_23
| ~ spl1_49
| ~ spl1_51 ),
inference(resolution,[],[f790,f412]) ).
fof(f3253,plain,
( ! [X0,X1] : is_a_theorem(implies(and(not(not(X0)),not(X1)),X0))
| ~ spl1_19
| ~ spl1_21
| ~ spl1_33
| ~ spl1_47
| ~ spl1_51 ),
inference(resolution,[],[f611,f545]) ).
fof(f53733,plain,
( ! [X0] :
( ~ is_a_theorem(implies(and(X0,X0),X0))
| and(X0,X0) = X0 )
| ~ spl1_23
| ~ spl1_35
| ~ spl1_43
| ~ spl1_49
| ~ spl1_51 ),
inference(resolution,[],[f2361,f596]) ).
fof(f53765,plain,
( ! [X0] :
( ~ is_a_theorem(implies(necessarily(possibly(X0)),possibly(X0)))
| possibly(X0) = necessarily(possibly(X0)) )
| ~ spl1_9
| ~ spl1_23
| ~ spl1_49
| ~ spl1_51 ),
inference(resolution,[],[f2361,f252]) ).
fof(f53785,plain,
( ! [X0] : possibly(X0) = necessarily(possibly(X0))
| ~ spl1_9
| ~ spl1_11
| ~ spl1_23
| ~ spl1_49
| ~ spl1_51 ),
inference(forward_subsumption_resolution,[],[f53765,f260]) ).
fof(f53790,plain,
( ! [X0] : and(X0,X0) = X0
| ~ spl1_23
| ~ spl1_35
| ~ spl1_37
| ~ spl1_43
| ~ spl1_49
| ~ spl1_51 ),
inference(forward_subsumption_resolution,[],[f53733,f364]) ).
fof(f54206,plain,
( ! [X0] : is_a_theorem(implies(not(not(X0)),X0))
| ~ spl1_19
| ~ spl1_21
| ~ spl1_23
| ~ spl1_33
| ~ spl1_35
| ~ spl1_37
| ~ spl1_43
| ~ spl1_47
| ~ spl1_49
| ~ spl1_51 ),
inference(superposition,[],[f3253,f53790]) ).
fof(f54224,plain,
( ! [X0] : is_a_theorem(or(not(X0),X0))
| ~ spl1_19
| ~ spl1_21
| ~ spl1_23
| ~ spl1_33
| ~ spl1_35
| ~ spl1_37
| ~ spl1_43
| ~ spl1_47
| ~ spl1_49
| ~ spl1_51 ),
inference(forward_demodulation,[],[f54206,f475]) ).
fof(f54338,plain,
( ! [X0] : is_a_theorem(implies(X0,not(not(X0))))
| ~ spl1_19
| ~ spl1_21
| ~ spl1_23
| ~ spl1_33
| ~ spl1_35
| ~ spl1_37
| ~ spl1_43
| ~ spl1_47
| ~ spl1_49
| ~ spl1_51 ),
inference(resolution,[],[f54224,f606]) ).
fof(f54549,plain,
( ! [X0] : not(necessarily(possibly(X0))) = necessarily(not(necessarily(possibly(X0))))
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11
| ~ spl1_23
| ~ spl1_49
| ~ spl1_51 ),
inference(superposition,[],[f53785,f452]) ).
fof(f54617,plain,
( ! [X0] : not(possibly(X0)) = necessarily(not(possibly(X0)))
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11
| ~ spl1_23
| ~ spl1_49
| ~ spl1_51 ),
inference(forward_demodulation,[],[f54549,f53785]) ).
fof(f54687,plain,
( ! [X0] :
( ~ is_a_theorem(implies(not(not(X0)),X0))
| not(not(X0)) = X0 )
| ~ spl1_19
| ~ spl1_21
| ~ spl1_23
| ~ spl1_33
| ~ spl1_35
| ~ spl1_37
| ~ spl1_43
| ~ spl1_47
| ~ spl1_49
| ~ spl1_51 ),
inference(resolution,[],[f54338,f2361]) ).
fof(f54739,plain,
( ! [X0] :
( ~ is_a_theorem(or(not(X0),X0))
| not(not(X0)) = X0 )
| ~ spl1_19
| ~ spl1_21
| ~ spl1_23
| ~ spl1_33
| ~ spl1_35
| ~ spl1_37
| ~ spl1_43
| ~ spl1_47
| ~ spl1_49
| ~ spl1_51 ),
inference(forward_demodulation,[],[f54687,f475]) ).
fof(f54740,plain,
( ! [X0] : not(not(X0)) = X0
| ~ spl1_19
| ~ spl1_21
| ~ spl1_23
| ~ spl1_33
| ~ spl1_35
| ~ spl1_37
| ~ spl1_43
| ~ spl1_47
| ~ spl1_49
| ~ spl1_51 ),
inference(forward_subsumption_resolution,[],[f54739,f54224]) ).
fof(f87359,plain,
( ! [X0] : possibly(possibly(X0)) = not(not(possibly(X0)))
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11
| ~ spl1_23
| ~ spl1_49
| ~ spl1_51 ),
inference(superposition,[],[f235,f54617]) ).
fof(f87530,plain,
( ! [X0] : possibly(X0) = possibly(possibly(X0))
| ~ spl1_5
| ~ spl1_9
| ~ spl1_11
| ~ spl1_19
| ~ spl1_21
| ~ spl1_23
| ~ spl1_33
| ~ spl1_35
| ~ spl1_37
| ~ spl1_43
| ~ spl1_47
| ~ spl1_49
| ~ spl1_51 ),
inference(forward_demodulation,[],[f87359,f54740]) ).
fof(f87586,plain,
( ~ is_a_theorem(implies(possibly(sK0),possibly(sK0)))
| ~ spl1_3
| ~ spl1_5
| spl1_8
| ~ spl1_9
| ~ spl1_11
| ~ spl1_15
| ~ spl1_19
| ~ spl1_21
| ~ spl1_23
| ~ spl1_33
| ~ spl1_35
| ~ spl1_37
| ~ spl1_43
| ~ spl1_47
| ~ spl1_49
| ~ spl1_51 ),
inference(superposition,[],[f511,f87530]) ).
fof(f87777,plain,
( $false
| ~ spl1_3
| ~ spl1_5
| spl1_8
| ~ spl1_9
| ~ spl1_11
| ~ spl1_15
| ~ spl1_19
| ~ spl1_21
| ~ spl1_23
| ~ spl1_33
| ~ spl1_35
| ~ spl1_37
| ~ spl1_43
| ~ spl1_45
| ~ spl1_47
| ~ spl1_49
| ~ spl1_51 ),
inference(forward_subsumption_resolution,[],[f87586,f595]) ).
fof(f87778,plain,
( ~ spl1_3
| ~ spl1_5
| spl1_8
| ~ spl1_9
| ~ spl1_11
| ~ spl1_15
| ~ spl1_19
| ~ spl1_21
| ~ spl1_23
| ~ spl1_33
| ~ spl1_35
| ~ spl1_37
| ~ spl1_43
| ~ spl1_45
| ~ spl1_47
| ~ spl1_49
| ~ spl1_51 ),
inference(avatar_contradiction_clause,[],[f87777]) ).
cnf(s2,plain,
( spl1_3
| spl1_4 ),
inference(sat_conversion,[],[f232]) ).
cnf(s3,plain,
( spl1_5
| ~ spl1_6 ),
inference(sat_conversion,[],[f240]) ).
cnf(s4,plain,
( spl1_7
| ~ spl1_8 ),
inference(sat_conversion,[],[f249]) ).
cnf(s5,plain,
( spl1_9
| ~ spl1_10 ),
inference(sat_conversion,[],[f257]) ).
cnf(s6,plain,
( spl1_11
| ~ spl1_12 ),
inference(sat_conversion,[],[f265]) ).
cnf(s8,plain,
( spl1_15
| spl1_16 ),
inference(sat_conversion,[],[f281]) ).
cnf(s10,plain,
( spl1_19
| spl1_20 ),
inference(sat_conversion,[],[f297]) ).
cnf(s11,plain,
( spl1_21
| ~ spl1_22 ),
inference(sat_conversion,[],[f305]) ).
cnf(s12,plain,
( spl1_23
| spl1_24 ),
inference(sat_conversion,[],[f313]) ).
cnf(s17,plain,
( spl1_33
| spl1_34 ),
inference(sat_conversion,[],[f353]) ).
cnf(s18,plain,
( spl1_35
| ~ spl1_36 ),
inference(sat_conversion,[],[f361]) ).
cnf(s19,plain,
( spl1_37
| ~ spl1_38 ),
inference(sat_conversion,[],[f369]) ).
cnf(s22,plain,
( spl1_43
| ~ spl1_44 ),
inference(sat_conversion,[],[f393]) ).
cnf(s23,plain,
( spl1_45
| ~ spl1_46 ),
inference(sat_conversion,[],[f401]) ).
cnf(s24,plain,
( spl1_47
| spl1_48 ),
inference(sat_conversion,[],[f409]) ).
cnf(s25,plain,
( spl1_49
| spl1_50 ),
inference(sat_conversion,[],[f417]) ).
cnf(s26,plain,
( spl1_51
| ~ spl1_52 ),
inference(sat_conversion,[],[f425]) ).
cnf(s27,plain,
~ spl1_7,
inference(sat_conversion,[],[f426]) ).
cnf(s28,plain,
spl1_22,
inference(sat_conversion,[],[f427]) ).
cnf(s30,plain,
spl1_52,
inference(sat_conversion,[],[f429]) ).
cnf(s31,plain,
spl1_46,
inference(sat_conversion,[],[f430]) ).
cnf(s32,plain,
spl1_44,
inference(sat_conversion,[],[f431]) ).
cnf(s34,plain,
spl1_38,
inference(sat_conversion,[],[f433]) ).
cnf(s35,plain,
spl1_36,
inference(sat_conversion,[],[f434]) ).
cnf(s39,plain,
spl1_6,
inference(sat_conversion,[],[f438]) ).
cnf(s41,plain,
spl1_12,
inference(sat_conversion,[],[f440]) ).
cnf(s42,plain,
spl1_10,
inference(sat_conversion,[],[f441]) ).
cnf(s46,plain,
~ spl1_20,
inference(sat_conversion,[],[f442]) ).
cnf(s47,plain,
~ spl1_48,
inference(sat_conversion,[],[f443]) ).
cnf(s49,plain,
~ spl1_34,
inference(sat_conversion,[],[f445]) ).
cnf(s51,plain,
~ spl1_24,
inference(sat_conversion,[],[f447]) ).
cnf(s52,plain,
~ spl1_50,
inference(sat_conversion,[],[f448]) ).
cnf(s53,plain,
~ spl1_16,
inference(sat_conversion,[],[f449]) ).
cnf(s54,plain,
~ spl1_4,
inference(sat_conversion,[],[f450]) ).
cnf(s227,plain,
( ~ spl1_3
| ~ spl1_5
| spl1_8
| ~ spl1_9
| ~ spl1_11
| ~ spl1_15
| ~ spl1_19
| ~ spl1_21
| ~ spl1_23
| ~ spl1_33
| ~ spl1_35
| ~ spl1_37
| ~ spl1_43
| ~ spl1_45
| ~ spl1_47
| ~ spl1_49
| ~ spl1_51 ),
inference(sat_conversion,[],[f87778]) ).
cnf(s228,plain,
spl1_51,
inference(rat,[],[s26,s30]) ).
cnf(s229,plain,
spl1_49,
inference(rat,[],[s25,s52]) ).
cnf(s230,plain,
spl1_47,
inference(rat,[],[s24,s47]) ).
cnf(s232,plain,
spl1_45,
inference(rat,[],[s23,s31]) ).
cnf(s233,plain,
spl1_43,
inference(rat,[],[s22,s32]) ).
cnf(s236,plain,
spl1_37,
inference(rat,[],[s19,s34]) ).
cnf(s237,plain,
spl1_35,
inference(rat,[],[s18,s35]) ).
cnf(s238,plain,
spl1_33,
inference(rat,[],[s17,s49]) ).
cnf(s243,plain,
spl1_23,
inference(rat,[],[s12,s51]) ).
cnf(s244,plain,
spl1_21,
inference(rat,[],[s11,s28]) ).
cnf(s245,plain,
spl1_19,
inference(rat,[],[s10,s46]) ).
cnf(s249,plain,
spl1_15,
inference(rat,[],[s8,s53]) ).
cnf(s251,plain,
spl1_11,
inference(rat,[],[s6,s41]) ).
cnf(s253,plain,
spl1_9,
inference(rat,[],[s5,s42]) ).
cnf(s254,plain,
~ spl1_8,
inference(rat,[],[s4,s27]) ).
cnf(s263,plain,
spl1_5,
inference(rat,[],[s3,s39]) ).
cnf(s264,plain,
~ spl1_3,
inference(rat,[],[s227,s228,s229,s230,s232,s233,s236,s237,s238,s243,s244,s245,s249,s251,s253,s254,s263]) ).
cnf(s268,plain,
$false,
inference(rat,[],[s2,s54,s264]) ).
fof(f87870,plain,
$false,
inference(avatar_sat_refutation,[],[s268]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL535+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38 % Computer : n009.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 15:57:30 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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
% 14.65/2.55 % (2214613)Will run a generic schedule for satisfiability detection.
% 14.65/2.55 % (2214621)dis+10_1_sil=32000:sp=arity:random_seed=349750125:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 14.65/2.55 % (2214619)% WARNING: option uhcvi not known.
% 14.65/2.55 % (2214618)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=774449691_2999 on theBenchmark for (2999ds/0Mi)
% 14.65/2.55 % (2214623)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3577296507:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 14.65/2.55 % (2214619)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3466188501:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 14.65/2.55 % (2214622)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3198127311:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 14.65/2.55 % (2214620)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=783188741:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 14.65/2.55 % (2214624)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3916170139:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 14.65/2.55 % TRYING [1]
% 14.65/2.55 % TRYING [2]
% 14.65/2.55 % TRYING [3]
% 14.65/2.55 % TRYING [4]
% 14.65/2.55 % (2214621)Instruction limit reached!
% 14.65/2.55 % (2214621)------------------------------
% 14.65/2.55 % (2214621)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.55 % (2214621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.55 % (2214621)CaDiCaL version: 2.1.3
% 14.65/2.55 % (2214621)Termination reason: Instruction limit
% 14.65/2.55 % (2214621)Termination phase: Saturation
% 14.65/2.55 % (2214621)Time elapsed: 0.039 s
% 14.65/2.55 % (2214621)Peak memory usage: 13 MB
% 14.65/2.55 % (2214621)Instructions burned: 105 (million)
% 14.65/2.55 % (2214632)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2756912735:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 14.65/2.55 % TRYING [1]
% 14.65/2.55 % TRYING [2]
% 14.65/2.55 % TRYING [3]
% 14.65/2.55 % TRYING [4]
% 14.65/2.55 % (2214622)Instruction limit reached!
% 14.65/2.55 % (2214622)------------------------------
% 14.65/2.55 % (2214622)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.55 % (2214622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.55 % (2214622)CaDiCaL version: 2.1.3
% 14.65/2.55 % (2214622)Termination reason: Instruction limit
% 14.65/2.55 % (2214622)Termination phase: Saturation
% 14.65/2.55 % (2214622)Time elapsed: 0.076 s
% 14.65/2.55 % (2214622)Peak memory usage: 13 MB
% 14.65/2.55 % (2214622)Instructions burned: 117 (million)
% 14.65/2.55 % (2214623)Instruction limit reached!
% 14.65/2.55 % (2214623)------------------------------
% 14.65/2.55 % (2214623)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.55 % (2214623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.55 % (2214623)CaDiCaL version: 2.1.3
% 14.65/2.55 % (2214623)Termination reason: Instruction limit
% 14.65/2.55 % (2214623)Termination phase: Saturation
% 14.65/2.55 % (2214623)Time elapsed: 0.089 s
% 14.65/2.55 % (2214623)Peak memory usage: 13 MB
% 14.65/2.55 % (2214623)Instructions burned: 131 (million)
% 14.65/2.55 % (2214634)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1641278355:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 14.65/2.55 % (2214635)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=1646177934:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 14.65/2.55 % (2214624)Instruction limit reached!
% 14.65/2.55 % (2214624)------------------------------
% 14.65/2.55 % (2214624)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.55 % (2214624)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.55 % (2214624)CaDiCaL version: 2.1.3
% 14.65/2.55 % (2214624)Termination reason: Instruction limit
% 14.65/2.55 % (2214624)Termination phase: Saturation
% 14.65/2.55 % (2214624)Time elapsed: 0.109 s
% 14.65/2.55 % (2214624)Peak memory usage: 14 MB
% 14.65/2.55 % (2214624)Instructions burned: 160 (million)
% 14.65/2.55 % TRYING [5]
% 14.65/2.55 % TRYING [5]
% 14.65/2.55 % (2214638)ott-21_1_sil=16000:fs=off:random_seed=3319326558:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 14.65/2.55 % (2214634)Instruction limit reached!
% 14.65/2.55 % (2214634)------------------------------
% 14.65/2.55 % (2214634)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.59 % (2214634)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.59 % (2214634)CaDiCaL version: 2.1.3
% 14.65/2.59 % (2214634)Termination reason: Instruction limit
% 14.65/2.59 % (2214634)Termination phase: Saturation
% 14.65/2.59 % (2214634)Time elapsed: 0.090 s
% 14.65/2.59 % (2214634)Peak memory usage: 14 MB
% 14.65/2.59 % (2214634)Instructions burned: 131 (million)
% 14.65/2.59 % (2214640)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3542075853:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 14.65/2.59 % (2214638)Instruction limit reached!
% 14.65/2.59 % (2214638)------------------------------
% 14.65/2.59 % (2214638)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.59 % (2214638)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.59 % (2214638)CaDiCaL version: 2.1.3
% 14.65/2.59 % (2214638)Termination reason: Instruction limit
% 14.65/2.59 % (2214638)Termination phase: Saturation
% 14.65/2.59 % (2214638)Time elapsed: 0.098 s
% 14.65/2.59 % (2214638)Peak memory usage: 12 MB
% 14.65/2.59 % (2214638)Instructions burned: 180 (million)
% 14.65/2.59 % (2214642)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=532200670:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 14.65/2.59 % (2214632)Instruction limit reached!
% 14.65/2.59 % (2214632)------------------------------
% 14.65/2.59 % (2214632)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.59 % (2214632)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.59 % (2214632)CaDiCaL version: 2.1.3
% 14.65/2.59 % (2214632)Termination reason: Instruction limit
% 14.65/2.59 % (2214632)Termination phase: Finite model building SAT solving
% 14.65/2.59 % (2214632)Time elapsed: 0.215 s
% 14.65/2.59 % (2214632)Peak memory usage: 22 MB
% 14.65/2.59 % (2214632)Instructions burned: 716 (million)
% 14.65/2.59 % TRYING [1]
% 14.65/2.59 % TRYING [2]
% 14.65/2.59 % (2214644)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3722952402:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 14.65/2.59 % TRYING [3]
% 14.65/2.59 % TRYING [4]
% 14.65/2.59 % (2214635)Instruction limit reached!
% 14.65/2.59 % (2214635)------------------------------
% 14.65/2.59 % (2214635)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.59 % (2214635)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.59 % (2214635)CaDiCaL version: 2.1.3
% 14.65/2.59 % (2214635)Termination reason: Instruction limit
% 14.65/2.59 % (2214635)Termination phase: Saturation
% 14.65/2.59 % (2214635)Time elapsed: 0.407 s
% 14.65/2.59 % (2214635)Peak memory usage: 21 MB
% 14.65/2.59 % (2214635)Instructions burned: 685 (million)
% 14.65/2.59 % (2214640)Instruction limit reached!
% 14.65/2.59 % (2214640)------------------------------
% 14.65/2.59 % (2214640)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.59 % (2214640)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.59 % (2214640)CaDiCaL version: 2.1.3
% 14.65/2.59 % (2214640)Termination reason: Instruction limit
% 14.65/2.59 % (2214640)Termination phase: Saturation
% 14.65/2.59 % (2214640)Time elapsed: 0.314 s
% 14.65/2.59 % (2214640)Peak memory usage: 13 MB
% 14.65/2.59 % (2214640)Instructions burned: 477 (million)
% 14.65/2.59 % (2214646)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3764143842:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 14.65/2.59 % (2214647)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=1551118424: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)
% 14.65/2.59 % (2214642)Instruction limit reached!
% 14.65/2.59 % (2214642)------------------------------
% 14.65/2.59 % (2214642)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.59 % (2214642)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.59 % (2214642)CaDiCaL version: 2.1.3
% 14.65/2.59 % (2214642)Termination reason: Instruction limit
% 14.65/2.59 % (2214642)Termination phase: Finite model building SAT solving
% 14.65/2.59 % (2214642)Time elapsed: 0.327 s
% 14.65/2.59 % (2214642)Peak memory usage: 21 MB
% 14.65/2.59 % (2214642)Instructions burned: 868 (million)
% 14.65/2.59 % (2214650)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=363258806:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 14.65/2.59 % TRYING [14]
% 14.65/2.59 % (2214644)Instruction limit reached!
% 14.65/2.59 % (2214644)------------------------------
% 14.65/2.59 % (2214644)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.59 % (2214644)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.59 % (2214644)CaDiCaL version: 2.1.3
% 14.65/2.59 % (2214644)Termination reason: Instruction limit
% 14.65/2.59 % (2214644)Termination phase: Saturation
% 14.65/2.59 % (2214644)Time elapsed: 0.393 s
% 14.65/2.59 % (2214644)Peak memory usage: 22 MB
% 14.65/2.59 % (2214644)Instructions burned: 1182 (million)
% 14.65/2.59 % (2214652)fmb+10_1_sil=64000:random_seed=4243965454:i=22061:nm=2:gsp=on_2992 on theBenchmark for (2992ds/22061Mi)
% 14.65/2.59 % TRYING [1]
% 14.65/2.59 % TRYING [2]
% 14.65/2.59 % TRYING [3]
% 14.65/2.59 % TRYING [4]
% 14.65/2.59 % TRYING [5]
% 14.65/2.59 % TRYING [6]
% 14.65/2.59 % (2214646)Instruction limit reached!
% 14.65/2.59 % (2214646)------------------------------
% 14.65/2.59 % (2214646)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.59 % (2214646)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.59 % (2214646)CaDiCaL version: 2.1.3
% 14.65/2.59 % (2214646)Termination reason: Instruction limit
% 14.65/2.59 % (2214646)Termination phase: Finite model building constraint generation
% 14.65/2.59 % (2214646)Time elapsed: 0.323 s
% 14.65/2.59 % (2214646)Peak memory usage: 69 MB
% 14.65/2.59 % (2214646)Instructions burned: 890 (million)
% 14.65/2.59 % (2214654)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1255313510:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 14.65/2.59 % TRYING [20]
% 14.65/2.59 % (2214647)Instruction limit reached!
% 14.65/2.59 % (2214647)------------------------------
% 14.65/2.59 % (2214647)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.59 % (2214647)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.59 % (2214647)CaDiCaL version: 2.1.3
% 14.65/2.59 % (2214647)Termination reason: Instruction limit
% 14.65/2.59 % (2214647)Termination phase: Saturation
% 14.65/2.59 % (2214647)Time elapsed: 0.465 s
% 14.65/2.59 % (2214647)Peak memory usage: 21 MB
% 14.65/2.59 % (2214647)Instructions burned: 693 (million)
% 14.65/2.59 % (2214656)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3666128935:fmbsr=1.7:i=920_2989 on theBenchmark for (2989ds/920Mi)
% 14.65/2.59 % TRYING [8]
% 14.65/2.59 % TRYING [6]
% 14.65/2.59 % (2214650)Instruction limit reached!
% 14.65/2.59 % (2214650)------------------------------
% 14.65/2.59 % (2214650)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.59 % (2214650)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.59 % (2214650)CaDiCaL version: 2.1.3
% 14.65/2.59 % (2214650)Termination reason: Instruction limit
% 14.65/2.59 % (2214650)Termination phase: Saturation
% 14.65/2.59 % (2214650)Time elapsed: 0.539 s
% 14.65/2.59 % (2214650)Peak memory usage: 23 MB
% 14.65/2.59 % (2214650)Instructions burned: 879 (million)
% 14.65/2.59 % (2214658)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2054121568:i=5131_2988 on theBenchmark for (2988ds/5131Mi)
% 14.65/2.59 % (2214656)Instruction limit reached!
% 14.65/2.59 % (2214656)------------------------------
% 14.65/2.59 % (2214656)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.59 % (2214656)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.59 % (2214656)CaDiCaL version: 2.1.3
% 14.65/2.59 % (2214656)Termination reason: Instruction limit
% 14.65/2.59 % (2214656)Termination phase: Finite model building constraint generation
% 14.65/2.59 % (2214656)Time elapsed: 0.348 s
% 14.65/2.59 % (2214656)Peak memory usage: 65 MB
% 14.65/2.59 % (2214656)Instructions burned: 921 (million)
% 14.65/2.59 % (2214661)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3654957353:i=1472:ins=7:fdi=8:gsp=on_2985 on theBenchmark for (2985ds/1472Mi)
% 14.65/2.59 % (2214661)Instruction limit reached!
% 14.65/2.59 % (2214661)------------------------------
% 14.65/2.59 % (2214661)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.59 % (2214661)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.59 % (2214661)CaDiCaL version: 2.1.3
% 14.65/2.59 % (2214661)Termination reason: Instruction limit
% 14.65/2.59 % (2214661)Termination phase: Saturation
% 14.65/2.59 % (2214661)Time elapsed: 0.644 s
% 14.65/2.59 % (2214661)Peak memory usage: 22 MB
% 14.65/2.59 % (2214661)Instructions burned: 1472 (million)
% 14.65/2.59 % (2214663)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1341123632:i=6324_2979 on theBenchmark for (2979ds/6324Mi)
% 14.65/2.59 % TRYING [77]
% 14.65/2.59 % (2214619) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2214613-2214619"...
% 14.65/2.59 % (2214619)...printing done.
% 14.65/2.59 % (2214619)Refutation found. Thanks to Tanya!
% 14.65/2.59 % SZS status Theorem for theBenchmark
% 14.65/2.59 % SZS output start Proof for theBenchmark
% See solution above
% 14.65/2.59 % (2214619)------------------------------
% 14.65/2.59 % (2214619)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.65/2.59 % (2214619)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.65/2.59 % (2214619)CaDiCaL version: 2.1.3
% 14.65/2.59 % (2214619)Termination reason: Refutation
% 14.65/2.59 % (2214619)Time elapsed: 2.091 s
% 14.65/2.59 % (2214619)Peak memory usage: 54 MB
% 14.65/2.59 % (2214619)Instructions burned: 3602 (million)
% 14.65/2.59 % (2214613)Success in time 2.165 s
% 14.65/2.59 % Vampire exiting
%------------------------------------------------------------------------------