%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ANA002-3 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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 09:31:14 AM UTC 2026
% Result : Unsatisfiable 22.42s 3.56s
% Output : Refutation 22.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 36
% Syntax : Number of formulae : 197 ( 26 unt; 19 def)
% Number of atoms : 587 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 599 ( 209 ~; 371 |; 0 &)
% ( 19 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 21 ( 20 usr; 20 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn 76 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : less_than_or_equal(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_of_less) ).
fof(f2,axiom,
! [X0,X1] :
( less_than_or_equal(X0,X1)
| less_than_or_equal(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality_of_less) ).
fof(f3,axiom,
! [X2,X0,X1] :
( less_than_or_equal(X0,X1)
| ~ less_than_or_equal(X0,X2)
| ~ less_than_or_equal(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less) ).
fof(f4,axiom,
! [X0,X1] :
( ~ less_than_or_equal(X0,q(X1,X0))
| less_than_or_equal(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',interpolation1) ).
fof(f5,axiom,
! [X0,X1] :
( ~ less_than_or_equal(q(X0,X1),X0)
| less_than_or_equal(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',interpolation2) ).
fof(f6,axiom,
! [X0] :
( less_than_or_equal(f(X0),n0)
| ~ less_than_or_equal(X0,h(X0))
| ~ less_than_or_equal(lower_bound,X0)
| ~ less_than_or_equal(X0,upper_bound) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity1) ).
fof(f7,axiom,
! [X0,X1] :
( less_than_or_equal(f(X0),n0)
| ~ less_than_or_equal(X1,X0)
| ~ less_than_or_equal(f(X1),n0)
| less_than_or_equal(X1,h(X0))
| ~ less_than_or_equal(lower_bound,X0)
| ~ less_than_or_equal(X0,upper_bound) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity2) ).
fof(f8,axiom,
! [X0] :
( less_than_or_equal(n0,f(X0))
| ~ less_than_or_equal(k(X0),X0)
| ~ less_than_or_equal(lower_bound,X0)
| ~ less_than_or_equal(X0,upper_bound) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity3) ).
fof(f9,axiom,
! [X0,X1] :
( less_than_or_equal(n0,f(X0))
| ~ less_than_or_equal(X0,X1)
| ~ less_than_or_equal(n0,f(X1))
| less_than_or_equal(k(X0),X1)
| ~ less_than_or_equal(lower_bound,X0)
| ~ less_than_or_equal(X0,upper_bound) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity4) ).
fof(f10,axiom,
! [X0] :
( less_than_or_equal(X0,l)
| ~ less_than_or_equal(X0,upper_bound)
| ~ less_than_or_equal(f(X0),n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover1) ).
fof(f11,axiom,
! [X0] :
( less_than_or_equal(g(X0),upper_bound)
| less_than_or_equal(l,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover2_and_g_function1) ).
fof(f12,axiom,
! [X0] :
( less_than_or_equal(f(g(X0)),n0)
| less_than_or_equal(l,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover3_and_g_function2) ).
fof(f13,axiom,
! [X0] :
( ~ less_than_or_equal(g(X0),X0)
| less_than_or_equal(l,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',crossover4_and_g_function3) ).
fof(f14,axiom,
less_than_or_equal(lower_bound,upper_bound),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_interval) ).
fof(f15,axiom,
less_than_or_equal(f(lower_bound),n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lower_mapping) ).
fof(f16,axiom,
less_than_or_equal(n0,f(upper_bound)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upper_mapping) ).
fof(f17,negated_conjecture,
! [X0] :
( ~ less_than_or_equal(f(X0),n0)
| ~ less_than_or_equal(n0,f(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_x_which_crosses) ).
fof(f18,plain,
! [X0] : ~ less_than_or_equal(X0,X0),
inference(consistent_polarity_flipping,[],[f1]) ).
fof(f19,plain,
! [X0,X1] :
( ~ less_than_or_equal(X1,X0)
| ~ less_than_or_equal(X0,X1) ),
inference(consistent_polarity_flipping,[],[f2]) ).
fof(f20,plain,
! [X2,X0,X1] :
( ~ less_than_or_equal(X0,X1)
| less_than_or_equal(X0,X2)
| less_than_or_equal(X2,X1) ),
inference(consistent_polarity_flipping,[],[f3]) ).
fof(f21,plain,
! [X0,X1] :
( less_than_or_equal(X0,q(X1,X0))
| ~ less_than_or_equal(X0,X1) ),
inference(consistent_polarity_flipping,[],[f4]) ).
fof(f22,plain,
! [X0,X1] :
( less_than_or_equal(q(X0,X1),X0)
| ~ less_than_or_equal(X1,X0) ),
inference(consistent_polarity_flipping,[],[f5]) ).
fof(f23,plain,
! [X0] :
( ~ less_than_or_equal(f(X0),n0)
| less_than_or_equal(X0,h(X0))
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(X0,upper_bound) ),
inference(consistent_polarity_flipping,[],[f6]) ).
fof(f24,plain,
! [X0,X1] :
( ~ less_than_or_equal(f(X0),n0)
| less_than_or_equal(X1,X0)
| less_than_or_equal(f(X1),n0)
| ~ less_than_or_equal(X1,h(X0))
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(X0,upper_bound) ),
inference(consistent_polarity_flipping,[],[f7]) ).
fof(f25,plain,
! [X0] :
( less_than_or_equal(k(X0),X0)
| ~ less_than_or_equal(n0,f(X0))
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(X0,upper_bound) ),
inference(consistent_polarity_flipping,[],[f8]) ).
fof(f26,plain,
! [X0,X1] :
( ~ less_than_or_equal(k(X0),X1)
| less_than_or_equal(X0,X1)
| less_than_or_equal(n0,f(X1))
| ~ less_than_or_equal(n0,f(X0))
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(X0,upper_bound) ),
inference(consistent_polarity_flipping,[],[f9]) ).
fof(f27,plain,
! [X0] :
( ~ less_than_or_equal(X0,l)
| less_than_or_equal(X0,upper_bound)
| less_than_or_equal(f(X0),n0) ),
inference(consistent_polarity_flipping,[],[f10]) ).
fof(f28,plain,
! [X0] :
( ~ less_than_or_equal(g(X0),upper_bound)
| ~ less_than_or_equal(l,X0) ),
inference(consistent_polarity_flipping,[],[f11]) ).
fof(f29,plain,
! [X0] :
( ~ less_than_or_equal(f(g(X0)),n0)
| ~ less_than_or_equal(l,X0) ),
inference(consistent_polarity_flipping,[],[f12]) ).
fof(f30,plain,
! [X0] :
( less_than_or_equal(g(X0),X0)
| ~ less_than_or_equal(l,X0) ),
inference(consistent_polarity_flipping,[],[f13]) ).
fof(f31,plain,
~ less_than_or_equal(lower_bound,upper_bound),
inference(consistent_polarity_flipping,[],[f14]) ).
fof(f32,plain,
~ less_than_or_equal(f(lower_bound),n0),
inference(consistent_polarity_flipping,[],[f15]) ).
fof(f33,plain,
~ less_than_or_equal(n0,f(upper_bound)),
inference(consistent_polarity_flipping,[],[f16]) ).
fof(f34,plain,
! [X0] :
( less_than_or_equal(f(X0),n0)
| less_than_or_equal(n0,f(X0)) ),
inference(consistent_polarity_flipping,[],[f17]) ).
fof(f38,plain,
( ~ less_than_or_equal(l,upper_bound)
| ~ less_than_or_equal(l,upper_bound) ),
inference(resolution,[],[f30,f28]) ).
fof(f40,plain,
~ less_than_or_equal(l,upper_bound),
inference(duplicate_literal_removal,[],[f38]) ).
fof(f41,plain,
! [X0,X1] :
( ~ less_than_or_equal(q(X1,X0),X0)
| ~ less_than_or_equal(X0,X1) ),
inference(resolution,[],[f21,f19]) ).
fof(f43,plain,
! [X0] :
( less_than_or_equal(n0,f(g(X0)))
| ~ less_than_or_equal(l,X0) ),
inference(resolution,[],[f29,f34]) ).
fof(f46,plain,
! [X2,X0,X1] :
( less_than_or_equal(q(X0,X1),X2)
| less_than_or_equal(X2,X0)
| ~ less_than_or_equal(X1,X0) ),
inference(resolution,[],[f20,f22]) ).
fof(f49,plain,
! [X0,X1] :
( ~ less_than_or_equal(l,X1)
| less_than_or_equal(X0,f(g(X1)))
| less_than_or_equal(n0,X0) ),
inference(resolution,[],[f20,f43]) ).
fof(f94,plain,
! [X0] :
( less_than_or_equal(X0,h(X0))
| less_than_or_equal(n0,f(X0))
| less_than_or_equal(X0,upper_bound)
| less_than_or_equal(lower_bound,X0) ),
inference(resolution,[],[f23,f34]) ).
fof(f96,plain,
! [X0,X1] :
( less_than_or_equal(k(X0),X1)
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(X0,upper_bound)
| ~ less_than_or_equal(n0,f(X0))
| less_than_or_equal(X1,X0) ),
inference(resolution,[],[f25,f20]) ).
fof(f101,definition,
( spl0_5
<=> less_than_or_equal(f(k(l)),n0) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f103,plain,
( less_than_or_equal(f(k(l)),n0)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f101]) ).
fof(f105,definition,
( spl0_6
<=> less_than_or_equal(k(l),upper_bound) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f106,plain,
( ~ less_than_or_equal(k(l),upper_bound)
| spl0_6 ),
inference(avatar_component_clause,[],[f105]) ).
fof(f107,plain,
( less_than_or_equal(k(l),upper_bound)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f105]) ).
fof(f109,definition,
( spl0_7
<=> less_than_or_equal(lower_bound,l) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f110,plain,
( ~ less_than_or_equal(lower_bound,l)
| spl0_7 ),
inference(avatar_component_clause,[],[f109]) ).
fof(f111,plain,
( less_than_or_equal(lower_bound,l)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f109]) ).
fof(f113,definition,
( spl0_8
<=> less_than_or_equal(n0,f(l)) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f114,plain,
( less_than_or_equal(n0,f(l))
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f113]) ).
fof(f115,plain,
( ~ less_than_or_equal(n0,f(l))
| spl0_8 ),
inference(avatar_component_clause,[],[f113]) ).
fof(f120,plain,
! [X0,X1] :
( ~ less_than_or_equal(X0,h(X1))
| less_than_or_equal(f(X0),n0)
| less_than_or_equal(X0,X1)
| less_than_or_equal(lower_bound,X1)
| less_than_or_equal(X1,upper_bound)
| less_than_or_equal(n0,f(X1)) ),
inference(resolution,[],[f24,f34]) ).
fof(f123,plain,
! [X0,X1] :
( ~ less_than_or_equal(k(X0),X1)
| less_than_or_equal(n0,f(q(X1,k(X0))))
| ~ less_than_or_equal(n0,f(X0))
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(X0,upper_bound)
| less_than_or_equal(X0,q(X1,k(X0))) ),
inference(resolution,[],[f26,f21]) ).
fof(f173,plain,
! [X0,X1] :
( less_than_or_equal(n0,f(X0))
| less_than_or_equal(X1,h(X0))
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(X0,X1)
| less_than_or_equal(X0,upper_bound) ),
inference(resolution,[],[f94,f20]) ).
fof(f185,plain,
! [X0] :
( less_than_or_equal(f(g(h(X0))),n0)
| less_than_or_equal(g(h(X0)),X0)
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(X0,upper_bound)
| less_than_or_equal(n0,f(X0))
| ~ less_than_or_equal(l,h(X0)) ),
inference(resolution,[],[f120,f30]) ).
fof(f187,plain,
! [X0] :
( ~ less_than_or_equal(l,h(X0))
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(X0,upper_bound)
| less_than_or_equal(n0,f(X0))
| less_than_or_equal(g(h(X0)),X0) ),
inference(forward_subsumption_resolution,[],[f185,f29]) ).
fof(f283,plain,
( ~ less_than_or_equal(f(l),n0)
| ~ spl0_8 ),
inference(resolution,[],[f114,f19]) ).
fof(f285,plain,
( less_than_or_equal(k(l),h(k(l)))
| less_than_or_equal(lower_bound,k(l))
| less_than_or_equal(k(l),upper_bound)
| ~ spl0_5 ),
inference(resolution,[],[f103,f23]) ).
fof(f287,plain,
( ~ less_than_or_equal(n0,f(k(l)))
| ~ spl0_5 ),
inference(resolution,[],[f103,f19]) ).
fof(f289,definition,
( spl0_25
<=> less_than_or_equal(lower_bound,k(l)) ),
introduced(definition,[new_symbols(definition,[spl0_25])],[avatar_definition]) ).
fof(f290,plain,
( ~ less_than_or_equal(lower_bound,k(l))
| spl0_25 ),
inference(avatar_component_clause,[],[f289]) ).
fof(f291,plain,
( less_than_or_equal(lower_bound,k(l))
| ~ spl0_25 ),
inference(avatar_component_clause,[],[f289]) ).
fof(f293,definition,
( spl0_26
<=> less_than_or_equal(k(l),h(k(l))) ),
introduced(definition,[new_symbols(definition,[spl0_26])],[avatar_definition]) ).
fof(f295,plain,
( less_than_or_equal(k(l),h(k(l)))
| ~ spl0_26 ),
inference(avatar_component_clause,[],[f293]) ).
fof(f296,plain,
( spl0_6
| spl0_25
| spl0_26
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f285,f101,f293,f289,f105]) ).
fof(f303,plain,
( less_than_or_equal(l,upper_bound)
| less_than_or_equal(n0,f(upper_bound))
| ~ less_than_or_equal(n0,f(l))
| less_than_or_equal(lower_bound,l)
| less_than_or_equal(l,upper_bound)
| ~ spl0_6 ),
inference(resolution,[],[f107,f26]) ).
fof(f306,plain,
( less_than_or_equal(l,upper_bound)
| less_than_or_equal(n0,f(upper_bound))
| ~ less_than_or_equal(n0,f(l))
| less_than_or_equal(lower_bound,l)
| ~ spl0_6 ),
inference(duplicate_literal_removal,[],[f303]) ).
fof(f307,plain,
( less_than_or_equal(n0,f(upper_bound))
| ~ less_than_or_equal(n0,f(l))
| less_than_or_equal(lower_bound,l)
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f306,f40]) ).
fof(f308,plain,
( ~ less_than_or_equal(n0,f(l))
| less_than_or_equal(lower_bound,l)
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f307,f33]) ).
fof(f309,plain,
( less_than_or_equal(lower_bound,l)
| ~ spl0_6
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f308,f114]) ).
fof(f310,plain,
( spl0_7
| ~ spl0_6
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f309,f113,f105,f109]) ).
fof(f333,plain,
! [X2,X0,X1] :
( ~ less_than_or_equal(X0,q(X1,X2))
| ~ less_than_or_equal(X2,X1)
| less_than_or_equal(X0,X1) ),
inference(resolution,[],[f46,f19]) ).
fof(f335,plain,
! [X2,X0,X1] :
( ~ less_than_or_equal(X2,X1)
| less_than_or_equal(h(X0),X1)
| less_than_or_equal(f(q(X1,X2)),n0)
| less_than_or_equal(q(X1,X2),X0)
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(X0,upper_bound)
| less_than_or_equal(n0,f(X0)) ),
inference(resolution,[],[f46,f120]) ).
fof(f365,definition,
( spl0_30
<=> less_than_or_equal(n0,f(k(l))) ),
introduced(definition,[new_symbols(definition,[spl0_30])],[avatar_definition]) ).
fof(f414,plain,
! [X0] :
( less_than_or_equal(X0,f(g(h(l))))
| less_than_or_equal(n0,X0)
| less_than_or_equal(n0,f(l))
| less_than_or_equal(l,upper_bound)
| less_than_or_equal(lower_bound,l) ),
inference(resolution,[],[f49,f94]) ).
fof(f582,definition,
( spl0_45
<=> ! [X1] :
( less_than_or_equal(X1,f(g(h(l))))
| less_than_or_equal(n0,X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_45])],[avatar_definition]) ).
fof(f583,plain,
( ! [X1] :
( less_than_or_equal(X1,f(g(h(l))))
| less_than_or_equal(n0,X1) )
| ~ spl0_45 ),
inference(avatar_component_clause,[],[f582]) ).
fof(f592,plain,
! [X0] :
( less_than_or_equal(lower_bound,X0)
| less_than_or_equal(X0,upper_bound)
| less_than_or_equal(n0,f(X0))
| less_than_or_equal(g(h(X0)),X0)
| less_than_or_equal(n0,f(X0))
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(X0,l)
| less_than_or_equal(X0,upper_bound) ),
inference(resolution,[],[f187,f173]) ).
fof(f593,plain,
! [X0] :
( less_than_or_equal(g(h(X0)),X0)
| less_than_or_equal(X0,upper_bound)
| less_than_or_equal(n0,f(X0))
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(X0,l) ),
inference(duplicate_literal_removal,[],[f592]) ).
fof(f935,definition,
( spl0_93
<=> less_than_or_equal(l,h(k(l))) ),
introduced(definition,[new_symbols(definition,[spl0_93])],[avatar_definition]) ).
fof(f937,plain,
( less_than_or_equal(l,h(k(l)))
| ~ spl0_93 ),
inference(avatar_component_clause,[],[f935]) ).
fof(f988,definition,
( spl0_98
<=> less_than_or_equal(l,q(h(k(l)),k(l))) ),
introduced(definition,[new_symbols(definition,[spl0_98])],[avatar_definition]) ).
fof(f990,plain,
( less_than_or_equal(l,q(h(k(l)),k(l)))
| ~ spl0_98 ),
inference(avatar_component_clause,[],[f988]) ).
fof(f992,definition,
( spl0_99
<=> less_than_or_equal(n0,f(q(h(k(l)),k(l)))) ),
introduced(definition,[new_symbols(definition,[spl0_99])],[avatar_definition]) ).
fof(f994,plain,
( less_than_or_equal(n0,f(q(h(k(l)),k(l))))
| ~ spl0_99 ),
inference(avatar_component_clause,[],[f992]) ).
fof(f1003,plain,
( ~ spl0_30
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f287,f101,f365]) ).
fof(f1004,plain,
( less_than_or_equal(n0,f(q(h(k(l)),k(l))))
| ~ less_than_or_equal(n0,f(l))
| less_than_or_equal(lower_bound,l)
| less_than_or_equal(l,upper_bound)
| less_than_or_equal(l,q(h(k(l)),k(l)))
| ~ spl0_26 ),
inference(resolution,[],[f295,f123]) ).
fof(f1008,plain,
( ! [X0] :
( less_than_or_equal(h(X0),h(k(l)))
| less_than_or_equal(f(q(h(k(l)),k(l))),n0)
| less_than_or_equal(q(h(k(l)),k(l)),X0)
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(X0,upper_bound)
| less_than_or_equal(n0,f(X0)) )
| ~ spl0_26 ),
inference(resolution,[],[f295,f335]) ).
fof(f1012,definition,
( spl0_100
<=> less_than_or_equal(f(q(h(k(l)),k(l))),n0) ),
introduced(definition,[new_symbols(definition,[spl0_100])],[avatar_definition]) ).
fof(f1016,definition,
( spl0_101
<=> ! [X0] :
( less_than_or_equal(h(X0),h(k(l)))
| less_than_or_equal(n0,f(X0))
| less_than_or_equal(X0,upper_bound)
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(q(h(k(l)),k(l)),X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_101])],[avatar_definition]) ).
fof(f1017,plain,
( ! [X0] :
( less_than_or_equal(q(h(k(l)),k(l)),X0)
| less_than_or_equal(n0,f(X0))
| less_than_or_equal(X0,upper_bound)
| less_than_or_equal(lower_bound,X0)
| less_than_or_equal(h(X0),h(k(l))) )
| ~ spl0_101 ),
inference(avatar_component_clause,[],[f1016]) ).
fof(f1018,plain,
( spl0_100
| spl0_101
| ~ spl0_26 ),
inference(avatar_split_clause,[],[f1008,f293,f1016,f1012]) ).
fof(f1021,plain,
( less_than_or_equal(n0,f(q(h(k(l)),k(l))))
| less_than_or_equal(lower_bound,l)
| less_than_or_equal(l,upper_bound)
| less_than_or_equal(l,q(h(k(l)),k(l)))
| ~ spl0_8
| ~ spl0_26 ),
inference(forward_subsumption_resolution,[],[f1004,f114]) ).
fof(f1028,plain,
( less_than_or_equal(n0,f(q(h(k(l)),k(l))))
| less_than_or_equal(lower_bound,l)
| less_than_or_equal(l,q(h(k(l)),k(l)))
| ~ spl0_8
| ~ spl0_26 ),
inference(forward_subsumption_resolution,[],[f1021,f40]) ).
fof(f1030,plain,
( spl0_98
| spl0_7
| spl0_99
| ~ spl0_8
| ~ spl0_26 ),
inference(avatar_split_clause,[],[f1028,f293,f113,f992,f109,f988]) ).
fof(f1855,definition,
( spl0_177
<=> less_than_or_equal(k(l),l) ),
introduced(definition,[new_symbols(definition,[spl0_177])],[avatar_definition]) ).
fof(f1856,plain,
( ~ less_than_or_equal(k(l),l)
| spl0_177 ),
inference(avatar_component_clause,[],[f1855]) ).
fof(f1857,plain,
( less_than_or_equal(k(l),l)
| ~ spl0_177 ),
inference(avatar_component_clause,[],[f1855]) ).
fof(f2038,plain,
( less_than_or_equal(f(l),n0)
| less_than_or_equal(l,k(l))
| less_than_or_equal(lower_bound,k(l))
| less_than_or_equal(k(l),upper_bound)
| less_than_or_equal(n0,f(k(l)))
| ~ spl0_93 ),
inference(resolution,[],[f937,f120]) ).
fof(f2052,plain,
( less_than_or_equal(l,k(l))
| less_than_or_equal(lower_bound,k(l))
| less_than_or_equal(k(l),upper_bound)
| less_than_or_equal(n0,f(k(l)))
| ~ spl0_8
| ~ spl0_93 ),
inference(forward_subsumption_resolution,[],[f2038,f283]) ).
fof(f2056,plain,
( less_than_or_equal(l,k(l))
| less_than_or_equal(lower_bound,k(l))
| less_than_or_equal(n0,f(k(l)))
| spl0_6
| ~ spl0_8
| ~ spl0_93 ),
inference(forward_subsumption_resolution,[],[f2052,f106]) ).
fof(f2064,definition,
( spl0_207
<=> less_than_or_equal(l,k(l)) ),
introduced(definition,[new_symbols(definition,[spl0_207])],[avatar_definition]) ).
fof(f2067,plain,
( spl0_30
| spl0_25
| spl0_207
| spl0_6
| ~ spl0_8
| ~ spl0_93 ),
inference(avatar_split_clause,[],[f2056,f935,f113,f105,f2064,f289,f365]) ).
fof(f2380,plain,
( ~ less_than_or_equal(k(l),h(k(l)))
| less_than_or_equal(l,h(k(l)))
| ~ spl0_98 ),
inference(resolution,[],[f990,f333]) ).
fof(f2640,plain,
( less_than_or_equal(k(l),upper_bound)
| less_than_or_equal(f(k(l)),n0)
| ~ spl0_177 ),
inference(resolution,[],[f1857,f27]) ).
fof(f2645,plain,
( ~ less_than_or_equal(l,k(l))
| ~ spl0_177 ),
inference(resolution,[],[f1857,f19]) ).
fof(f2646,plain,
( ~ spl0_207
| ~ spl0_177 ),
inference(avatar_split_clause,[],[f2645,f1855,f2064]) ).
fof(f2688,plain,
( ~ less_than_or_equal(f(q(h(k(l)),k(l))),n0)
| ~ spl0_99 ),
inference(resolution,[],[f994,f19]) ).
fof(f2689,plain,
( ~ spl0_100
| ~ spl0_99 ),
inference(avatar_split_clause,[],[f2688,f992,f1012]) ).
fof(f2821,plain,
( less_than_or_equal(lower_bound,l)
| less_than_or_equal(l,upper_bound)
| ~ less_than_or_equal(n0,f(l))
| less_than_or_equal(l,l)
| spl0_177 ),
inference(resolution,[],[f1856,f96]) ).
fof(f2823,plain,
( less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(n0,f(l))
| less_than_or_equal(l,l)
| spl0_177 ),
inference(forward_subsumption_resolution,[],[f2821,f40]) ).
fof(f2850,plain,
( less_than_or_equal(l,h(k(l)))
| ~ spl0_26
| ~ spl0_98 ),
inference(forward_subsumption_resolution,[],[f2380,f295]) ).
fof(f2855,plain,
( spl0_93
| ~ spl0_26
| ~ spl0_98 ),
inference(avatar_split_clause,[],[f2850,f988,f293,f935]) ).
fof(f2991,plain,
( ~ less_than_or_equal(k(l),lower_bound)
| ~ spl0_25 ),
inference(resolution,[],[f291,f19]) ).
fof(f5383,plain,
( less_than_or_equal(l,upper_bound)
| less_than_or_equal(n0,f(l))
| less_than_or_equal(lower_bound,l)
| less_than_or_equal(l,l)
| less_than_or_equal(g(h(l)),upper_bound)
| less_than_or_equal(f(g(h(l))),n0) ),
inference(resolution,[],[f593,f27]) ).
fof(f5510,definition,
( spl0_511
<=> less_than_or_equal(n0,f(g(h(l)))) ),
introduced(definition,[new_symbols(definition,[spl0_511])],[avatar_definition]) ).
fof(f5511,plain,
( less_than_or_equal(n0,f(g(h(l))))
| ~ spl0_511 ),
inference(avatar_component_clause,[],[f5510]) ).
fof(f5514,definition,
( spl0_512
<=> less_than_or_equal(g(h(l)),upper_bound) ),
introduced(definition,[new_symbols(definition,[spl0_512])],[avatar_definition]) ).
fof(f5516,plain,
( less_than_or_equal(g(h(l)),upper_bound)
| ~ spl0_512 ),
inference(avatar_component_clause,[],[f5514]) ).
fof(f5527,definition,
( spl0_515
<=> less_than_or_equal(f(g(h(l))),n0) ),
introduced(definition,[new_symbols(definition,[spl0_515])],[avatar_definition]) ).
fof(f5593,plain,
( ~ less_than_or_equal(l,h(l))
| ~ spl0_512 ),
inference(resolution,[],[f5516,f28]) ).
fof(f5654,plain,
( ~ less_than_or_equal(f(g(h(l))),n0)
| ~ spl0_511 ),
inference(resolution,[],[f5511,f19]) ).
fof(f5655,plain,
( ~ spl0_515
| ~ spl0_511 ),
inference(avatar_split_clause,[],[f5654,f5510,f5527]) ).
fof(f5689,plain,
( less_than_or_equal(n0,f(g(h(l))))
| ~ spl0_45 ),
inference(resolution,[],[f583,f18]) ).
fof(f15666,plain,
( less_than_or_equal(n0,f(k(l)))
| less_than_or_equal(k(l),upper_bound)
| less_than_or_equal(lower_bound,k(l))
| less_than_or_equal(h(k(l)),h(k(l)))
| ~ less_than_or_equal(k(l),h(k(l)))
| ~ spl0_101 ),
inference(resolution,[],[f1017,f41]) ).
fof(f15722,plain,
( less_than_or_equal(n0,f(k(l)))
| less_than_or_equal(k(l),upper_bound)
| less_than_or_equal(lower_bound,k(l))
| less_than_or_equal(h(k(l)),h(k(l)))
| ~ spl0_101 ),
inference(forward_subsumption_resolution,[],[f15666,f173]) ).
fof(f37518,plain,
( less_than_or_equal(lower_bound,l)
| less_than_or_equal(l,upper_bound)
| ~ less_than_or_equal(n0,f(l))
| less_than_or_equal(lower_bound,l)
| ~ spl0_25 ),
inference(resolution,[],[f2991,f96]) ).
fof(f37524,plain,
( less_than_or_equal(lower_bound,l)
| less_than_or_equal(l,upper_bound)
| ~ less_than_or_equal(n0,f(l))
| ~ spl0_25 ),
inference(duplicate_literal_removal,[],[f37518]) ).
fof(f37553,plain,
( less_than_or_equal(n0,f(l))
| less_than_or_equal(lower_bound,l)
| less_than_or_equal(l,l)
| less_than_or_equal(g(h(l)),upper_bound)
| less_than_or_equal(f(g(h(l))),n0) ),
inference(forward_subsumption_resolution,[],[f5383,f40]) ).
fof(f38498,definition,
( spl0_2694
<=> less_than_or_equal(l,h(l)) ),
introduced(definition,[new_symbols(definition,[spl0_2694])],[avatar_definition]) ).
fof(f38500,plain,
( ~ less_than_or_equal(l,h(l))
| spl0_2694 ),
inference(avatar_component_clause,[],[f38498]) ).
fof(f38631,plain,
( spl0_511
| ~ spl0_45 ),
inference(avatar_split_clause,[],[f5689,f582,f5510]) ).
fof(f38846,plain,
( less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(n0,f(l))
| ~ spl0_25 ),
inference(forward_subsumption_resolution,[],[f37524,f40]) ).
fof(f38942,plain,
( less_than_or_equal(n0,f(l))
| less_than_or_equal(lower_bound,l)
| less_than_or_equal(g(h(l)),upper_bound)
| less_than_or_equal(f(g(h(l))),n0) ),
inference(forward_subsumption_resolution,[],[f37553,f18]) ).
fof(f39254,plain,
( ~ spl0_8
| spl0_7
| ~ spl0_25 ),
inference(avatar_split_clause,[],[f38846,f289,f109,f113]) ).
fof(f39494,plain,
! [X0] :
( less_than_or_equal(X0,f(g(h(l))))
| less_than_or_equal(n0,X0)
| less_than_or_equal(n0,f(l))
| less_than_or_equal(lower_bound,l) ),
inference(forward_subsumption_resolution,[],[f414,f40]) ).
fof(f39610,plain,
( spl0_7
| spl0_8
| spl0_45 ),
inference(avatar_split_clause,[],[f39494,f582,f113,f109]) ).
fof(f40166,plain,
( less_than_or_equal(lower_bound,upper_bound)
| less_than_or_equal(f(lower_bound),n0)
| ~ spl0_7 ),
inference(resolution,[],[f111,f27]) ).
fof(f40288,plain,
( less_than_or_equal(f(lower_bound),n0)
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f40166,f31]) ).
fof(f40306,plain,
( $false
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f40288,f32]) ).
fof(f40307,plain,
~ spl0_7,
inference(avatar_contradiction_clause,[],[f40306]) ).
fof(f40820,plain,
( ~ spl0_2694
| ~ spl0_512 ),
inference(avatar_split_clause,[],[f5593,f5514,f38498]) ).
fof(f40897,plain,
( spl0_515
| spl0_512
| spl0_7
| spl0_8 ),
inference(avatar_split_clause,[],[f38942,f113,f109,f5514,f5527]) ).
fof(f40923,plain,
( less_than_or_equal(f(k(l)),n0)
| spl0_6
| ~ spl0_177 ),
inference(forward_subsumption_resolution,[],[f2640,f106]) ).
fof(f41067,plain,
( spl0_5
| spl0_6
| ~ spl0_177 ),
inference(avatar_split_clause,[],[f40923,f1855,f105,f101]) ).
fof(f41124,plain,
( less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(n0,f(l))
| spl0_177 ),
inference(forward_subsumption_resolution,[],[f2823,f18]) ).
fof(f41166,plain,
( ~ spl0_8
| spl0_7
| spl0_177 ),
inference(avatar_split_clause,[],[f41124,f1855,f109,f113]) ).
fof(f42527,plain,
( less_than_or_equal(n0,f(k(l)))
| less_than_or_equal(k(l),upper_bound)
| less_than_or_equal(h(k(l)),h(k(l)))
| spl0_25
| ~ spl0_101 ),
inference(forward_subsumption_resolution,[],[f15722,f290]) ).
fof(f42556,plain,
( less_than_or_equal(n0,f(k(l)))
| less_than_or_equal(k(l),upper_bound)
| spl0_25
| ~ spl0_101 ),
inference(forward_subsumption_resolution,[],[f42527,f18]) ).
fof(f42573,plain,
( spl0_6
| spl0_30
| spl0_25
| ~ spl0_101 ),
inference(avatar_split_clause,[],[f42556,f1016,f289,f365,f105]) ).
fof(f42924,plain,
( less_than_or_equal(n0,f(l))
| less_than_or_equal(lower_bound,l)
| less_than_or_equal(l,l)
| less_than_or_equal(l,upper_bound)
| spl0_2694 ),
inference(resolution,[],[f38500,f173]) ).
fof(f42931,plain,
( less_than_or_equal(lower_bound,l)
| less_than_or_equal(l,l)
| less_than_or_equal(l,upper_bound)
| spl0_8
| spl0_2694 ),
inference(forward_subsumption_resolution,[],[f42924,f115]) ).
fof(f42938,plain,
( less_than_or_equal(l,l)
| less_than_or_equal(l,upper_bound)
| spl0_7
| spl0_8
| spl0_2694 ),
inference(forward_subsumption_resolution,[],[f42931,f110]) ).
fof(f42945,plain,
( less_than_or_equal(l,upper_bound)
| spl0_7
| spl0_8
| spl0_2694 ),
inference(forward_subsumption_resolution,[],[f42938,f18]) ).
fof(f42952,plain,
( $false
| spl0_7
| spl0_8
| spl0_2694 ),
inference(forward_subsumption_resolution,[],[f42945,f40]) ).
fof(f42953,plain,
( spl0_7
| spl0_8
| spl0_2694 ),
inference(avatar_contradiction_clause,[],[f42952]) ).
cnf(s19,plain,
( ~ spl0_5
| spl0_6
| spl0_25
| spl0_26 ),
inference(sat_conversion,[],[f296]) ).
cnf(s21,plain,
( ~ spl0_6
| spl0_7
| ~ spl0_8 ),
inference(sat_conversion,[],[f310]) ).
cnf(s79,plain,
( ~ spl0_5
| ~ spl0_30 ),
inference(sat_conversion,[],[f1003]) ).
cnf(s80,plain,
( ~ spl0_26
| spl0_100
| spl0_101 ),
inference(sat_conversion,[],[f1018]) ).
cnf(s83,plain,
( spl0_7
| ~ spl0_8
| ~ spl0_26
| spl0_98
| spl0_99 ),
inference(sat_conversion,[],[f1030]) ).
cnf(s203,plain,
( spl0_6
| ~ spl0_8
| spl0_25
| spl0_30
| ~ spl0_93
| spl0_207 ),
inference(sat_conversion,[],[f2067]) ).
cnf(s261,plain,
( ~ spl0_177
| ~ spl0_207 ),
inference(sat_conversion,[],[f2646]) ).
cnf(s267,plain,
( ~ spl0_99
| ~ spl0_100 ),
inference(sat_conversion,[],[f2689]) ).
cnf(s309,plain,
( ~ spl0_26
| spl0_93
| ~ spl0_98 ),
inference(sat_conversion,[],[f2855]) ).
cnf(s572,plain,
( ~ spl0_511
| ~ spl0_515 ),
inference(sat_conversion,[],[f5655]) ).
cnf(s4322,plain,
( ~ spl0_45
| spl0_511 ),
inference(sat_conversion,[],[f38631]) ).
cnf(s4559,plain,
( spl0_7
| ~ spl0_8
| ~ spl0_25 ),
inference(sat_conversion,[],[f39254]) ).
cnf(s4772,plain,
( spl0_7
| spl0_8
| spl0_45 ),
inference(sat_conversion,[],[f39610]) ).
cnf(s5086,plain,
~ spl0_7,
inference(sat_conversion,[],[f40307]) ).
cnf(s5525,plain,
( ~ spl0_512
| ~ spl0_2694 ),
inference(sat_conversion,[],[f40820]) ).
cnf(s5571,plain,
( spl0_7
| spl0_8
| spl0_512
| spl0_515 ),
inference(sat_conversion,[],[f40897]) ).
cnf(s5663,plain,
( spl0_5
| spl0_6
| ~ spl0_177 ),
inference(sat_conversion,[],[f41067]) ).
cnf(s5741,plain,
( spl0_7
| ~ spl0_8
| spl0_177 ),
inference(sat_conversion,[],[f41166]) ).
cnf(s6233,plain,
( spl0_6
| spl0_25
| spl0_30
| ~ spl0_101 ),
inference(sat_conversion,[],[f42573]) ).
cnf(s6311,plain,
( spl0_7
| spl0_8
| spl0_2694 ),
inference(sat_conversion,[],[f42953]) ).
cnf(s6357,plain,
( spl0_8
| spl0_45 ),
inference(rat,[],[s4772,s5086]) ).
cnf(s6486,plain,
( ~ spl0_8
| ~ spl0_25 ),
inference(rat,[],[s4559,s5086]) ).
cnf(s7119,plain,
( ~ spl0_8
| ~ spl0_26
| spl0_98
| spl0_99 ),
inference(rat,[],[s83,s5086]) ).
cnf(s7134,plain,
( ~ spl0_6
| ~ spl0_8 ),
inference(rat,[],[s21,s5086]) ).
cnf(s7138,plain,
spl0_8,
inference(rat,[],[s572,s5571,s4322,s5525,s6357,s6311,s5086]) ).
cnf(s7139,plain,
spl0_177,
inference(rat,[],[s5741,s5086,s7138]) ).
cnf(s7140,plain,
~ spl0_25,
inference(rat,[],[s6486,s7138]) ).
cnf(s7150,plain,
~ spl0_6,
inference(rat,[],[s7134,s7138]) ).
cnf(s7152,plain,
~ spl0_207,
inference(rat,[],[s261,s7139]) ).
cnf(s7154,plain,
spl0_5,
inference(rat,[],[s5663,s7139,s7150]) ).
cnf(s7155,plain,
~ spl0_30,
inference(rat,[],[s79,s7154]) ).
cnf(s7157,plain,
spl0_26,
inference(rat,[],[s19,s7140,s7150,s7154]) ).
cnf(s7158,plain,
~ spl0_101,
inference(rat,[],[s6233,s7140,s7150,s7155]) ).
cnf(s7159,plain,
~ spl0_93,
inference(rat,[],[s203,s7152,s7138,s7140,s7150,s7155]) ).
cnf(s7163,plain,
~ spl0_98,
inference(rat,[],[s309,s7159,s7157]) ).
cnf(s7164,plain,
spl0_99,
inference(rat,[],[s7119,s7138,s7163,s7157]) ).
cnf(s7165,plain,
spl0_100,
inference(rat,[],[s80,s7158,s7157]) ).
cnf(s7167,plain,
$false,
inference(rat,[],[s267,s7165,s7164]) ).
fof(f42954,plain,
$false,
inference(avatar_sat_refutation,[],[s7167]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA002-3 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19 % Computer : n007.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 20:23:11 UTC 2026
% 0.07/0.20 % CPUTime :
% 0.07/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.23 Running first-order model finding
% 0.07/0.23 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
% 19.51/3.10 % (2760934)Will run a generic schedule for satisfiability detection.
% 19.51/3.10 % (2760944)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1929576536:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 19.51/3.10 % (2760942)dis+10_1_sil=32000:sp=arity:random_seed=4153237576:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 19.51/3.10 % (2760939)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2769497288_2999 on theBenchmark for (2999ds/0Mi)
% 19.51/3.10 % (2760940)% WARNING: option uhcvi not known.
% 19.51/3.10 % TRYING [1]
% 19.51/3.10 % TRYING [2]
% 19.51/3.10 % TRYING [3]
% 19.51/3.10 % TRYING [4]
% 19.51/3.10 % (2760940)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4115835737:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 19.51/3.10 % (2760941)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2859060858:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 19.51/3.10 % TRYING [5]
% 19.51/3.10 % TRYING [6]
% 19.51/3.10 % TRYING [7]
% 19.51/3.10 % (2760945)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1809355404:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 19.51/3.10 % (2760943)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1763088129:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 19.51/3.10 % TRYING [8]
% 19.51/3.10 % (2760942)Instruction limit reached!
% 19.51/3.10 % (2760942)------------------------------
% 19.51/3.10 % (2760942)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.51/3.10 % (2760942)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.51/3.10 % (2760942)CaDiCaL version: 2.1.3
% 19.51/3.10 % (2760942)Termination reason: Instruction limit
% 19.51/3.10 % (2760942)Termination phase: Saturation
% 19.51/3.10 % (2760942)Time elapsed: 0.095 s
% 19.51/3.10 % (2760942)Peak memory usage: 11 MB
% 19.51/3.10 % (2760942)Instructions burned: 103 (million)
% 19.51/3.10 % (2760961)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3027516671:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 19.51/3.10 % (2760944)Instruction limit reached!
% 19.51/3.10 % (2760944)------------------------------
% 19.51/3.10 % (2760944)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.51/3.10 % (2760944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.51/3.10 % (2760944)CaDiCaL version: 2.1.3
% 19.51/3.10 % (2760944)Termination reason: Instruction limit
% 19.51/3.10 % (2760944)Termination phase: Saturation
% 19.51/3.10 % (2760944)Time elapsed: 0.136 s
% 19.51/3.10 % (2760944)Peak memory usage: 12 MB
% 19.51/3.10 % (2760944)Instructions burned: 132 (million)
% 19.51/3.10 % TRYING [1]
% 19.51/3.10 % TRYING [2]
% 19.51/3.10 % TRYING [3]
% 19.51/3.10 % TRYING [4]
% 19.51/3.10 % TRYING [5]
% 19.51/3.10 % TRYING [6]
% 19.51/3.10 % TRYING [9]
% 19.51/3.10 % TRYING [7]
% 19.51/3.10 % (2760964)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2360147450:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 19.51/3.10 % TRYING [8]
% 19.51/3.10 % (2760943)Instruction limit reached!
% 19.51/3.10 % (2760943)------------------------------
% 19.51/3.10 % (2760943)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.51/3.10 % (2760943)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.51/3.10 % (2760943)CaDiCaL version: 2.1.3
% 19.51/3.10 % (2760943)Termination reason: Instruction limit
% 19.51/3.10 % (2760943)Termination phase: Saturation
% 19.51/3.10 % (2760943)Time elapsed: 0.164 s
% 19.51/3.10 % (2760943)Peak memory usage: 11 MB
% 19.51/3.10 % (2760943)Instructions burned: 117 (million)
% 19.51/3.10 % (2760969)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=912791654:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2997 on theBenchmark for (2997ds/684Mi)
% 19.51/3.10 % (2760945)Instruction limit reached!
% 19.51/3.10 % (2760945)------------------------------
% 19.51/3.10 % (2760945)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.51/3.10 % (2760945)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 19.51/3.10 % (2760945)CaDiCaL version: 2.1.3
% 19.51/3.10 % (2760945)Termination reason: Instruction limit
% 19.51/3.10 % (2760945)Termination phase: Saturation
% 19.51/3.10 % (2760945)Time elapsed: 0.191 s
% 19.51/3.10 % (2760945)Peak memory usage: 13 MB
% 19.51/3.10 % (2760945)Instructions burned: 160 (million)
% 19.51/3.10 % (2760964)Instruction limit reached!
% 19.51/3.10 % (2760964)------------------------------
% 19.51/3.10 % (2760964)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 19.51/3.10 % (2760964)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.42/3.56 % (2760964)CaDiCaL version: 2.1.3
% 22.42/3.56 % (2760964)Termination reason: Instruction limit
% 22.42/3.56 % (2760964)Termination phase: Saturation
% 22.42/3.56 % (2760964)Time elapsed: 0.114 s
% 22.42/3.56 % (2760964)Peak memory usage: 12 MB
% 22.42/3.56 % (2760964)Instructions burned: 131 (million)
% 22.42/3.56 % (2760971)ott-21_1_sil=16000:fs=off:random_seed=853706159:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 22.42/3.56 % TRYING [9]
% 22.42/3.56 % (2760973)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2157372732:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 22.42/3.56 % TRYING [10]
% 22.42/3.56 % (2760971)Instruction limit reached!
% 22.42/3.56 % (2760971)------------------------------
% 22.42/3.56 % (2760971)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.42/3.56 % (2760971)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.42/3.56 % (2760971)CaDiCaL version: 2.1.3
% 22.42/3.56 % (2760971)Termination reason: Instruction limit
% 22.42/3.56 % (2760971)Termination phase: Saturation
% 22.42/3.56 % (2760971)Time elapsed: 0.166 s
% 22.42/3.56 % (2760971)Peak memory usage: 12 MB
% 22.42/3.56 % (2760971)Instructions burned: 180 (million)
% 22.42/3.56 % (2760978)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=616400278:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 22.42/3.56 % TRYING [1]
% 22.42/3.56 % TRYING [2]
% 22.42/3.56 % TRYING [3]
% 22.42/3.56 % TRYING [4]
% 22.42/3.56 % TRYING [5]
% 22.42/3.56 % TRYING [6]
% 22.42/3.56 % TRYING [7]
% 22.42/3.56 % (2760969)Instruction limit reached!
% 22.42/3.56 % (2760969)------------------------------
% 22.42/3.56 % (2760969)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.42/3.56 % (2760969)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.42/3.56 % (2760969)CaDiCaL version: 2.1.3
% 22.42/3.56 % (2760969)Termination reason: Instruction limit
% 22.42/3.56 % (2760969)Termination phase: Saturation
% 22.42/3.56 % (2760969)Time elapsed: 0.267 s
% 22.42/3.56 % (2760969)Peak memory usage: 15 MB
% 22.42/3.56 % (2760969)Instructions burned: 685 (million)
% 22.42/3.56 % (2760983)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2741928918:i=1179_2994 on theBenchmark for (2994ds/1179Mi)
% 22.42/3.56 % TRYING [8]
% 22.42/3.56 % TRYING [9]
% 22.42/3.56 % TRYING [10]
% 22.42/3.56 % TRYING [10]
% 22.42/3.56 % (2760961)Instruction limit reached!
% 22.42/3.56 % (2760961)------------------------------
% 22.42/3.56 % (2760961)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.42/3.56 % (2760961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.42/3.56 % (2760961)CaDiCaL version: 2.1.3
% 22.42/3.56 % (2760961)Termination reason: Instruction limit
% 22.42/3.56 % (2760961)Termination phase: Finite model building SAT solving
% 22.42/3.56 % (2760961)Time elapsed: 0.619 s
% 22.42/3.56 % (2760961)Peak memory usage: 14 MB
% 22.42/3.56 % (2760961)Instructions burned: 714 (million)
% 22.42/3.56 % (2760973)Instruction limit reached!
% 22.42/3.56 % (2760973)------------------------------
% 22.42/3.56 % (2760973)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.42/3.56 % (2760973)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.42/3.56 % (2760973)CaDiCaL version: 2.1.3
% 22.42/3.56 % (2760973)Termination reason: Instruction limit
% 22.42/3.56 % (2760973)Termination phase: Saturation
% 22.42/3.56 % (2760973)Time elapsed: 0.473 s
% 22.42/3.56 % (2760973)Peak memory usage: 13 MB
% 22.42/3.56 % (2760973)Instructions burned: 477 (million)
% 22.42/3.56 % (2760988)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1006554032:i=889:ins=1_2992 on theBenchmark for (2992ds/889Mi)
% 22.42/3.56 % TRYING [14]
% 22.42/3.56 % (2760991)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=3441341945:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2991 on theBenchmark for (2991ds/692Mi)
% 22.42/3.56 % (2760983)Instruction limit reached!
% 22.42/3.56 % (2760983)------------------------------
% 22.42/3.56 % (2760983)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.42/3.56 % (2760983)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.42/3.56 % (2760983)CaDiCaL version: 2.1.3
% 22.42/3.56 % (2760983)Termination reason: Instruction limit
% 22.42/3.56 % (2760983)Termination phase: Saturation
% 22.42/3.56 % (2760983)Time elapsed: 0.538 s
% 22.42/3.56 % (2760983)Peak memory usage: 19 MB
% 22.42/3.56 % (2760983)Instructions burned: 1181 (million)
% 22.42/3.56 % (2760998)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1611886451:i=879:kws=inv_precedence:fsr=off_2989 on theBenchmark for (2989ds/879Mi)
% 22.42/3.56 % (2760978)Instruction limit reached!
% 22.42/3.56 % (2760978)------------------------------
% 22.42/3.56 % (2760978)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.42/3.56 % (2760978)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.42/3.56 % (2760978)CaDiCaL version: 2.1.3
% 22.42/3.56 % (2760978)Termination reason: Instruction limit
% 22.42/3.56 % (2760978)Termination phase: Finite model building SAT solving
% 22.42/3.56 % (2760978)Time elapsed: 0.641 s
% 22.42/3.56 % (2760978)Peak memory usage: 13 MB
% 22.42/3.56 % (2760978)Instructions burned: 865 (million)
% 22.42/3.56 % (2761001)fmb+10_1_sil=64000:random_seed=2641685482:i=22061:nm=2:gsp=on_2988 on theBenchmark for (2988ds/22061Mi)
% 22.42/3.56 % TRYING [1]
% 22.42/3.56 % TRYING [2]
% 22.42/3.56 % TRYING [3]
% 22.42/3.56 % TRYING [4]
% 22.42/3.56 % TRYING [5]
% 22.42/3.56 % TRYING [6]
% 22.42/3.56 % TRYING [7]
% 22.42/3.56 % TRYING [8]
% 22.42/3.56 % TRYING [9]
% 22.42/3.56 % TRYING [10]
% 22.42/3.56 % (2760988)Instruction limit reached!
% 22.42/3.56 % (2760988)------------------------------
% 22.42/3.56 % (2760988)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.42/3.56 % (2760988)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.42/3.56 % (2760988)CaDiCaL version: 2.1.3
% 22.42/3.56 % (2760988)Termination reason: Instruction limit
% 22.42/3.56 % (2760988)Termination phase: Finite model building SAT solving
% 22.42/3.56 % (2760988)Time elapsed: 0.595 s
% 22.42/3.56 % (2760988)Peak memory usage: 17 MB
% 22.42/3.56 % (2760988)Instructions burned: 889 (million)
% 22.42/3.56 % (2761007)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3413070446:i=9515:nm=5_2985 on theBenchmark for (2985ds/9515Mi)
% 22.42/3.56 % TRYING [20]
% 22.42/3.56 % (2760991)Instruction limit reached!
% 22.42/3.56 % (2760991)------------------------------
% 22.42/3.56 % (2760991)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.42/3.56 % (2760991)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.42/3.56 % (2760991)CaDiCaL version: 2.1.3
% 22.42/3.56 % (2760991)Termination reason: Instruction limit
% 22.42/3.56 % (2760991)Termination phase: Saturation
% 22.42/3.56 % (2760991)Time elapsed: 0.676 s
% 22.42/3.56 % (2760991)Peak memory usage: 18 MB
% 22.42/3.56 % (2760991)Instructions burned: 692 (million)
% 22.42/3.56 % (2761010)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=71775170:fmbsr=1.7:i=920_2984 on theBenchmark for (2984ds/920Mi)
% 22.42/3.56 % TRYING [8]
% 22.42/3.56 % TRYING [11]
% 22.42/3.56 % TRYING [9]
% 22.42/3.56 % (2760998)Instruction limit reached!
% 22.42/3.56 % (2760998)------------------------------
% 22.42/3.56 % (2760998)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.42/3.56 % (2760998)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.42/3.56 % (2760998)CaDiCaL version: 2.1.3
% 22.42/3.56 % (2760998)Termination reason: Instruction limit
% 22.42/3.56 % (2760998)Termination phase: Saturation
% 22.42/3.56 % (2760998)Time elapsed: 0.587 s
% 22.42/3.56 % (2760998)Peak memory usage: 18 MB
% 22.42/3.56 % (2760998)Instructions burned: 879 (million)
% 22.42/3.56 % TRYING [11]
% 22.42/3.56 % (2761012)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2123984537:i=5131_2983 on theBenchmark for (2983ds/5131Mi)
% 22.42/3.56 % TRYING [10]
% 22.42/3.56 % TRYING [12]
% 22.42/3.56 % (2761010)Instruction limit reached!
% 22.42/3.56 % (2761010)------------------------------
% 22.42/3.56 % (2761010)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.42/3.56 % (2761010)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.42/3.56 % (2761010)CaDiCaL version: 2.1.3
% 22.42/3.56 % (2761010)Termination reason: Instruction limit
% 22.42/3.56 % (2761010)Termination phase: Finite model building SAT solving
% 22.42/3.56 % (2761010)Time elapsed: 0.536 s
% 22.42/3.56 % (2761010)Peak memory usage: 15 MB
% 22.42/3.56 % (2761010)Instructions burned: 921 (million)
% 22.42/3.56 % (2761090)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=206320242:i=1472:ins=7:fdi=8:gsp=on_2979 on theBenchmark for (2979ds/1472Mi)
% 22.42/3.56 % (2761090)Instruction limit reached!
% 22.42/3.56 % (2761090)------------------------------
% 22.42/3.56 % (2761090)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.42/3.56 % (2761090)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.42/3.56 % (2761090)CaDiCaL version: 2.1.3
% 22.42/3.56 % (2761090)Termination reason: Instruction limit
% 22.42/3.56 % (2761090)Termination phase: Saturation
% 22.42/3.56 % (2761090)Time elapsed: 0.741 s
% 22.42/3.56 % (2761090)Peak memory usage: 17 MB
% 22.42/3.56 % (2761090)Instructions burned: 1473 (million)
% 22.42/3.56 % (2761169)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=3823798989:i=6324_2971 on theBenchmark for (2971ds/6324Mi)
% 22.42/3.56 % TRYING [77]
% 22.42/3.56 % (2760940) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2760934-2760940"...
% 22.42/3.56 % (2760940)...printing done.
% 22.42/3.56 % (2760940)Refutation found. Thanks to Tanya!
% 22.42/3.56 % SZS status Unsatisfiable for theBenchmark
% 22.42/3.56 % SZS output start Proof for theBenchmark
% See solution above
% 22.42/3.56 % (2760940)------------------------------
% 22.42/3.56 % (2760940)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 22.42/3.56 % (2760940)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 22.42/3.56 % (2760940)CaDiCaL version: 2.1.3
% 22.42/3.56 % (2760940)Termination reason: Refutation
% 22.42/3.56 % (2760940)Time elapsed: 3.244 s
% 22.42/3.56 % (2760940)Peak memory usage: 31 MB
% 22.42/3.56 % (2760940)Instructions burned: 4949 (million)
% 22.42/3.56 % (2760934)Success in time 3.313 s
% 22.42/3.56 % Vampire exiting
%------------------------------------------------------------------------------