%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ANA002-2 : TPTP v9.3.1. Bugfixed v1.0.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 09:30:48 AM UTC 2026
% Result : Unsatisfiable 1.87s 1.14s
% Output : Refutation 3.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 30
% Syntax : Number of formulae : 119 ( 18 unt; 12 def)
% Number of atoms : 313 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 340 ( 146 ~; 182 |; 0 &)
% ( 12 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 14 usr; 13 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] :
( in_interval(X0,X1,X2)
| ~ less_than_or_equal(X0,X1)
| ~ less_than_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_interval) ).
fof(f2,axiom,
! [X0] : less_than_or_equal(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_less) ).
fof(f3,axiom,
! [X0,X1] :
( less_than_or_equal(X0,X1)
| less_than_or_equal(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',totality_of_less) ).
fof(f4,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/sandbox/benchmark/theBenchmark.p',transitivity_of_less) ).
fof(f5,axiom,
! [X0,X1] :
( ~ less_than_or_equal(X0,q(X1,X0))
| less_than_or_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',interpolation1) ).
fof(f6,axiom,
! [X0,X1] :
( less_than_or_equal(X1,X0)
| ~ less_than_or_equal(q(X0,X1),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',interpolation2) ).
fof(f7,axiom,
! [X0] :
( less_than_or_equal(f(X0),n0)
| ~ less_than_or_equal(X0,h(X0))
| ~ in_interval(lower_bound,X0,upper_bound) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',continuity1) ).
fof(f8,axiom,
! [X0,X1] :
( less_than_or_equal(X1,h(X0))
| ~ less_than_or_equal(X1,X0)
| ~ less_than_or_equal(f(X1),n0)
| less_than_or_equal(f(X0),n0)
| ~ in_interval(lower_bound,X0,upper_bound) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',continuity2) ).
fof(f9,axiom,
! [X0] :
( less_than_or_equal(n0,f(X0))
| ~ less_than_or_equal(k(X0),X0)
| ~ in_interval(lower_bound,X0,upper_bound) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',continuity3) ).
fof(f10,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)
| ~ in_interval(lower_bound,X0,upper_bound) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',continuity4) ).
fof(f11,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/sandbox/benchmark/theBenchmark.p',crossover1) ).
fof(f12,axiom,
! [X0] :
( less_than_or_equal(g(X0),upper_bound)
| less_than_or_equal(l,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover2_and_g_function1) ).
fof(f13,axiom,
! [X0] :
( less_than_or_equal(f(g(X0)),n0)
| less_than_or_equal(l,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover3_and_g_function2) ).
fof(f14,axiom,
! [X0] :
( less_than_or_equal(l,X0)
| ~ less_than_or_equal(g(X0),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crossover4_and_g_function3) ).
fof(f15,axiom,
less_than_or_equal(lower_bound,upper_bound),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_interval) ).
fof(f16,axiom,
less_than_or_equal(f(lower_bound),n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lower_mapping) ).
fof(f17,axiom,
less_than_or_equal(n0,f(upper_bound)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',upper_mapping) ).
fof(f18,negated_conjecture,
~ in_interval(f(l),n0,f(l)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_x_which_crosses) ).
fof(f19,plain,
( ~ less_than_or_equal(f(l),n0)
| ~ less_than_or_equal(n0,f(l)) ),
inference(resolution,[],[f1,f18]) ).
fof(f21,definition,
( spl0_1
<=> less_than_or_equal(n0,f(l)) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f23,plain,
( ~ less_than_or_equal(n0,f(l))
| spl0_1 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f25,definition,
( spl0_2
<=> less_than_or_equal(f(l),n0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f27,plain,
( ~ less_than_or_equal(f(l),n0)
| spl0_2 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f28,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f19,f25,f21]) ).
fof(f31,plain,
( ~ less_than_or_equal(l,h(l))
| ~ in_interval(lower_bound,l,upper_bound)
| spl0_2 ),
inference(resolution,[],[f27,f7]) ).
fof(f34,definition,
( spl0_3
<=> in_interval(lower_bound,l,upper_bound) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f35,plain,
( in_interval(lower_bound,l,upper_bound)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f36,plain,
( ~ in_interval(lower_bound,l,upper_bound)
| spl0_3 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f38,definition,
( spl0_4
<=> less_than_or_equal(l,h(l)) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f40,plain,
( ~ less_than_or_equal(l,h(l))
| spl0_4 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f41,plain,
( ~ spl0_3
| ~ spl0_4
| spl0_2 ),
inference(avatar_split_clause,[],[f31,f25,f38,f34]) ).
fof(f42,plain,
( ~ less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(l,upper_bound)
| spl0_3 ),
inference(resolution,[],[f36,f1]) ).
fof(f44,definition,
( spl0_5
<=> less_than_or_equal(l,upper_bound) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f45,plain,
( less_than_or_equal(l,upper_bound)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f46,plain,
( ~ less_than_or_equal(l,upper_bound)
| spl0_5 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f48,definition,
( spl0_6
<=> less_than_or_equal(lower_bound,l) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f50,plain,
( ~ less_than_or_equal(lower_bound,l)
| spl0_6 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f51,plain,
( ~ spl0_5
| ~ spl0_6
| spl0_3 ),
inference(avatar_split_clause,[],[f42,f34,f48,f44]) ).
fof(f52,plain,
( ~ less_than_or_equal(g(upper_bound),upper_bound)
| spl0_5 ),
inference(resolution,[],[f46,f14]) ).
fof(f56,plain,
( less_than_or_equal(l,upper_bound)
| spl0_5 ),
inference(resolution,[],[f52,f12]) ).
fof(f58,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[],[f56,f46]) ).
fof(f59,plain,
spl0_5,
inference(avatar_contradiction_clause,[],[f58]) ).
fof(f62,plain,
! [X2,X0,X1] :
( ~ less_than_or_equal(X1,q(X2,X0))
| ~ less_than_or_equal(X0,X1)
| less_than_or_equal(X0,X2) ),
inference(resolution,[],[f4,f5]) ).
fof(f64,plain,
( ~ less_than_or_equal(lower_bound,upper_bound)
| ~ less_than_or_equal(f(lower_bound),n0)
| spl0_6 ),
inference(resolution,[],[f50,f11]) ).
fof(f68,plain,
( ~ less_than_or_equal(f(lower_bound),n0)
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f64,f15]) ).
fof(f69,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f68,f16]) ).
fof(f70,plain,
spl0_6,
inference(avatar_contradiction_clause,[],[f69]) ).
fof(f71,plain,
( ~ less_than_or_equal(g(h(l)),h(l))
| spl0_4 ),
inference(resolution,[],[f40,f14]) ).
fof(f79,plain,
( ~ less_than_or_equal(g(h(l)),l)
| ~ less_than_or_equal(f(g(h(l))),n0)
| less_than_or_equal(f(l),n0)
| ~ in_interval(lower_bound,l,upper_bound)
| spl0_4 ),
inference(resolution,[],[f71,f8]) ).
fof(f83,plain,
( ~ less_than_or_equal(g(h(l)),l)
| ~ less_than_or_equal(f(g(h(l))),n0)
| ~ in_interval(lower_bound,l,upper_bound)
| spl0_2
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f79,f27]) ).
fof(f84,plain,
( ~ less_than_or_equal(g(h(l)),l)
| ~ less_than_or_equal(f(g(h(l))),n0)
| spl0_2
| ~ spl0_3
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f83,f35]) ).
fof(f86,definition,
( spl0_7
<=> less_than_or_equal(f(g(h(l))),n0) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f88,plain,
( ~ less_than_or_equal(f(g(h(l))),n0)
| spl0_7 ),
inference(avatar_component_clause,[],[f86]) ).
fof(f90,definition,
( spl0_8
<=> less_than_or_equal(g(h(l)),l) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f92,plain,
( ~ less_than_or_equal(g(h(l)),l)
| spl0_8 ),
inference(avatar_component_clause,[],[f90]) ).
fof(f93,plain,
( ~ spl0_7
| ~ spl0_8
| spl0_2
| ~ spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f84,f38,f34,f25,f90,f86]) ).
fof(f142,plain,
! [X2,X0,X1] :
( less_than_or_equal(q(X2,X0),X1)
| less_than_or_equal(X0,X2)
| ~ less_than_or_equal(X0,X1) ),
inference(resolution,[],[f62,f3]) ).
fof(f164,plain,
( less_than_or_equal(l,h(l))
| spl0_7 ),
inference(resolution,[],[f88,f13]) ).
fof(f178,plain,
( $false
| spl0_4
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f164,f40]) ).
fof(f179,plain,
( spl0_4
| spl0_7 ),
inference(avatar_contradiction_clause,[],[f178]) ).
fof(f195,plain,
( ~ less_than_or_equal(g(h(l)),upper_bound)
| ~ less_than_or_equal(f(g(h(l))),n0)
| spl0_8 ),
inference(resolution,[],[f92,f11]) ).
fof(f200,definition,
( spl0_20
<=> less_than_or_equal(g(h(l)),upper_bound) ),
introduced(definition,[new_symbols(definition,[spl0_20])],[avatar_definition]) ).
fof(f202,plain,
( ~ less_than_or_equal(g(h(l)),upper_bound)
| spl0_20 ),
inference(avatar_component_clause,[],[f200]) ).
fof(f203,plain,
( ~ spl0_7
| ~ spl0_20
| spl0_8 ),
inference(avatar_split_clause,[],[f195,f90,f200,f86]) ).
fof(f209,plain,
( less_than_or_equal(l,h(l))
| spl0_20 ),
inference(resolution,[],[f202,f12]) ).
fof(f215,plain,
( spl0_4
| spl0_20 ),
inference(avatar_split_clause,[],[f209,f200,f38]) ).
fof(f216,plain,
( ! [X0] :
( ~ less_than_or_equal(l,X0)
| ~ less_than_or_equal(n0,f(X0))
| less_than_or_equal(k(l),X0)
| ~ in_interval(lower_bound,l,upper_bound) )
| spl0_1 ),
inference(resolution,[],[f23,f10]) ).
fof(f217,plain,
( ~ less_than_or_equal(k(l),l)
| ~ in_interval(lower_bound,l,upper_bound)
| spl0_1 ),
inference(resolution,[],[f23,f9]) ).
fof(f221,plain,
( ~ less_than_or_equal(k(l),l)
| spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f217,f35]) ).
fof(f222,plain,
( ! [X0] :
( less_than_or_equal(k(l),X0)
| ~ less_than_or_equal(n0,f(X0))
| ~ less_than_or_equal(l,X0) )
| spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f216,f35]) ).
fof(f224,plain,
( ! [X0] :
( ~ less_than_or_equal(k(l),X0)
| ~ less_than_or_equal(X0,l) )
| spl0_1
| ~ spl0_3 ),
inference(resolution,[],[f221,f4]) ).
fof(f225,plain,
( ~ less_than_or_equal(q(l,k(l)),l)
| spl0_1
| ~ spl0_3 ),
inference(resolution,[],[f221,f6]) ).
fof(f232,definition,
( spl0_22
<=> less_than_or_equal(k(l),upper_bound) ),
introduced(definition,[new_symbols(definition,[spl0_22])],[avatar_definition]) ).
fof(f233,plain,
( less_than_or_equal(k(l),upper_bound)
| ~ spl0_22 ),
inference(avatar_component_clause,[],[f232]) ).
fof(f234,plain,
( ~ less_than_or_equal(k(l),upper_bound)
| spl0_22 ),
inference(avatar_component_clause,[],[f232]) ).
fof(f280,plain,
( ! [X0] :
( ~ less_than_or_equal(l,q(X0,k(l)))
| ~ less_than_or_equal(n0,f(q(X0,k(l))))
| less_than_or_equal(k(l),X0) )
| spl0_1
| ~ spl0_3 ),
inference(resolution,[],[f222,f5]) ).
fof(f312,plain,
( less_than_or_equal(l,q(l,k(l)))
| spl0_1
| ~ spl0_3 ),
inference(resolution,[],[f225,f3]) ).
fof(f314,definition,
( spl0_32
<=> less_than_or_equal(f(q(l,k(l))),n0) ),
introduced(definition,[new_symbols(definition,[spl0_32])],[avatar_definition]) ).
fof(f318,definition,
( spl0_33
<=> less_than_or_equal(q(l,k(l)),upper_bound) ),
introduced(definition,[new_symbols(definition,[spl0_33])],[avatar_definition]) ).
fof(f320,plain,
( ~ less_than_or_equal(q(l,k(l)),upper_bound)
| spl0_33 ),
inference(avatar_component_clause,[],[f318]) ).
fof(f328,plain,
( ~ less_than_or_equal(n0,f(upper_bound))
| ~ less_than_or_equal(l,upper_bound)
| spl0_1
| ~ spl0_3
| spl0_22 ),
inference(resolution,[],[f234,f222]) ).
fof(f332,plain,
( ~ less_than_or_equal(l,upper_bound)
| spl0_1
| ~ spl0_3
| spl0_22 ),
inference(forward_subsumption_resolution,[],[f328,f17]) ).
fof(f333,plain,
( $false
| spl0_1
| ~ spl0_3
| ~ spl0_5
| spl0_22 ),
inference(forward_subsumption_resolution,[],[f332,f45]) ).
fof(f334,plain,
( spl0_1
| ~ spl0_3
| ~ spl0_5
| spl0_22 ),
inference(avatar_contradiction_clause,[],[f333]) ).
fof(f339,plain,
( ! [X0] :
( ~ less_than_or_equal(q(X0,k(l)),X0)
| ~ less_than_or_equal(X0,l) )
| spl0_1
| ~ spl0_3 ),
inference(resolution,[],[f224,f6]) ).
fof(f650,plain,
( ~ less_than_or_equal(n0,f(q(l,k(l))))
| less_than_or_equal(k(l),l)
| spl0_1
| ~ spl0_3 ),
inference(resolution,[],[f312,f280]) ).
fof(f655,plain,
( ~ less_than_or_equal(n0,f(q(l,k(l))))
| spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f650,f221]) ).
fof(f968,plain,
( ~ less_than_or_equal(l,l)
| ~ less_than_or_equal(q(l,k(l)),upper_bound)
| ~ less_than_or_equal(f(q(l,k(l))),n0)
| spl0_1
| ~ spl0_3 ),
inference(resolution,[],[f339,f11]) ).
fof(f2149,plain,
( less_than_or_equal(f(q(l,k(l))),n0)
| spl0_1
| ~ spl0_3 ),
inference(resolution,[],[f655,f3]) ).
fof(f2166,plain,
( ~ less_than_or_equal(q(l,k(l)),upper_bound)
| ~ less_than_or_equal(f(q(l,k(l))),n0)
| spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f968,f2]) ).
fof(f2167,plain,
( spl0_32
| spl0_1
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f2149,f34,f21,f314]) ).
fof(f2169,plain,
( ~ spl0_32
| ~ spl0_33
| spl0_1
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f2166,f34,f21,f318,f314]) ).
fof(f2171,plain,
( less_than_or_equal(k(l),l)
| ~ less_than_or_equal(k(l),upper_bound)
| spl0_33 ),
inference(resolution,[],[f320,f142]) ).
fof(f2175,plain,
( ~ less_than_or_equal(k(l),upper_bound)
| spl0_1
| ~ spl0_3
| spl0_33 ),
inference(forward_subsumption_resolution,[],[f2171,f221]) ).
fof(f2177,plain,
( $false
| spl0_1
| ~ spl0_3
| ~ spl0_22
| spl0_33 ),
inference(forward_subsumption_resolution,[],[f2175,f233]) ).
fof(f2178,plain,
( spl0_1
| ~ spl0_3
| ~ spl0_22
| spl0_33 ),
inference(avatar_contradiction_clause,[],[f2177]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f28]) ).
cnf(s3,plain,
( spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(sat_conversion,[],[f41]) ).
cnf(s4,plain,
( spl0_3
| ~ spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f51]) ).
cnf(s5,plain,
spl0_5,
inference(sat_conversion,[],[f59]) ).
cnf(s6,plain,
spl0_6,
inference(sat_conversion,[],[f70]) ).
cnf(s7,plain,
( spl0_2
| ~ spl0_3
| spl0_4
| ~ spl0_7
| ~ spl0_8 ),
inference(sat_conversion,[],[f93]) ).
cnf(s13,plain,
( spl0_4
| spl0_7 ),
inference(sat_conversion,[],[f179]) ).
cnf(s15,plain,
( ~ spl0_7
| spl0_8
| ~ spl0_20 ),
inference(sat_conversion,[],[f203]) ).
cnf(s18,plain,
( spl0_4
| spl0_20 ),
inference(sat_conversion,[],[f215]) ).
cnf(s28,plain,
( spl0_1
| ~ spl0_3
| ~ spl0_5
| spl0_22 ),
inference(sat_conversion,[],[f334]) ).
cnf(s93,plain,
( spl0_1
| ~ spl0_3
| spl0_32 ),
inference(sat_conversion,[],[f2167]) ).
cnf(s95,plain,
( spl0_1
| ~ spl0_3
| ~ spl0_32
| ~ spl0_33 ),
inference(sat_conversion,[],[f2169]) ).
cnf(s96,plain,
( spl0_1
| ~ spl0_3
| ~ spl0_22
| spl0_33 ),
inference(sat_conversion,[],[f2178]) ).
cnf(s98,plain,
spl0_3,
inference(rat,[],[s4,s6,s5]) ).
cnf(s99,plain,
( spl0_2
| ~ spl0_4 ),
inference(rat,[],[s3,s98]) ).
cnf(s100,plain,
spl0_1,
inference(rat,[],[s96,s95,s28,s93,s98,s5]) ).
cnf(s101,plain,
~ spl0_2,
inference(rat,[],[s1,s100]) ).
cnf(s102,plain,
~ spl0_4,
inference(rat,[],[s99,s101]) ).
cnf(s103,plain,
spl0_20,
inference(rat,[],[s18,s102]) ).
cnf(s104,plain,
spl0_7,
inference(rat,[],[s13,s102]) ).
cnf(s105,plain,
spl0_8,
inference(rat,[],[s15,s103,s104]) ).
cnf(s106,plain,
$false,
inference(rat,[],[s7,s102,s101,s98,s105,s104]) ).
fof(f2179,plain,
$false,
inference(avatar_sat_refutation,[],[s106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA002-2 : TPTP v9.3.1. Bugfixed v1.0.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n006.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 20:24:40 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running first-order theorem proving
% 0.08/0.23 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.87/1.14 % (137548)Input is clausal, will run a generic CNF schedule.
% 1.87/1.14 % (137557)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3057035053:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 1.87/1.14 % (137557)Instruction limit reached!
% 1.87/1.14 % (137557)------------------------------
% 1.87/1.14 % (137557)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.87/1.14 % (137557)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.87/1.14 % (137557)CaDiCaL version: 2.1.3
% 1.87/1.14 % (137557)Termination reason: Instruction limit
% 1.87/1.14 % (137557)Termination phase: Saturation
% 1.87/1.14 % (137557)Time elapsed: 0.026 s
% 1.87/1.14 % (137557)Peak memory usage: 88 MB
% 1.87/1.14 % (137557)Instructions burned: 114 (million)
% 1.87/1.14 % (137555)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=204692620:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 1.87/1.14 % (137554)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=4190952196:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 1.87/1.14 % (137558)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2193823024:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 1.87/1.14 % (137553)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2545154835:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 1.87/1.14 % (137556)lrs+10_1_sil=8000:sp=occurrence:random_seed=697622882:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 1.87/1.14 % (137559)dis-21_1_sil=8000:lcm=predicate:random_seed=2666065077:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 1.87/1.14 % (137558)First to succeed.
% 1.87/1.14 % (137558)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-137548"
% 1.87/1.14 % (137556)Instruction limit reached!
% 1.87/1.14 % (137556)------------------------------
% 1.87/1.14 % (137556)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.87/1.14 % (137556)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.87/1.14 % (137556)CaDiCaL version: 2.1.3
% 1.87/1.14 % (137556)Termination reason: Instruction limit
% 1.87/1.14 % (137556)Termination phase: Saturation
% 1.87/1.14 % (137556)Time elapsed: 0.068 s
% 1.87/1.14 % (137556)Peak memory usage: 88 MB
% 1.87/1.14 % (137556)Instructions burned: 107 (million)
% 1.87/1.14 % (137559)Instruction limit reached!
% 1.87/1.14 % (137559)------------------------------
% 1.87/1.14 % (137559)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.87/1.14 % (137559)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.87/1.14 % (137559)CaDiCaL version: 2.1.3
% 1.87/1.14 % (137559)Termination reason: Instruction limit
% 1.87/1.14 % (137559)Termination phase: Saturation
% 1.87/1.14 % (137559)Time elapsed: 0.073 s
% 1.87/1.14 % (137559)Peak memory usage: 89 MB
% 1.87/1.14 % (137559)Instructions burned: 118 (million)
% 1.87/1.14 % (137561)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=1731343077:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 1.87/1.14 % (137561)Instruction limit reached!
% 1.87/1.14 % (137561)------------------------------
% 1.87/1.14 % (137561)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.87/1.14 % (137561)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.87/1.14 % (137561)CaDiCaL version: 2.1.3
% 1.87/1.14 % (137561)Termination reason: Instruction limit
% 1.87/1.14 % (137561)Termination phase: Saturation
% 1.87/1.14 % (137561)Time elapsed: 0.047 s
% 1.87/1.14 % (137561)Peak memory usage: 89 MB
% 1.87/1.14 % (137561)Instructions burned: 144 (million)
% 1.87/1.14 % (137568)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2623373639:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 1.87/1.14 % (137568)Refutation not found, incomplete strategy
% 1.87/1.14 % (137568)------------------------------
% 1.87/1.14 % (137568)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.87/1.14 % (137568)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.87/1.14 % (137568)CaDiCaL version: 2.1.3
% 1.87/1.14 % (137568)Termination reason: Refutation not found, incomplete strategy
% 1.87/1.14 % (137568)Time elapsed: 0.002 s
% 1.87/1.14 % (137568)Peak memory usage: 87 MB
% 1.87/1.14 % (137568)Instructions burned: 2 (million)
% 1.87/1.14 % (137569)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=975953340:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 1.87/1.14 % (137571)lrs+10_64_to=lpo:sil=8000:random_seed=769395064:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 1.87/1.14 % (137558)Refutation found. Thanks to Tanya!
% 1.87/1.14 % SZS status Unsatisfiable for theBenchmark
% 1.87/1.14 % SZS output start Proof for theBenchmark
% See solution above
% 3.98/1.34 % (137558)------------------------------
% 3.98/1.34 % (137558)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.98/1.34 % (137558)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.98/1.34 % (137558)CaDiCaL version: 2.1.3
% 3.98/1.34 % (137558)Termination reason: Refutation
% 3.98/1.34 % (137558)Time elapsed: 0.048 s
% 3.98/1.34 % (137558)Peak memory usage: 90 MB
% 3.98/1.34 % (137558)Instructions burned: 67 (million)
% 3.98/1.34 % (137558)------------------------------
% 3.98/1.34 % (137558)------------------------------
% 3.98/1.34 % (137548)Success in time 0.469 s
% 3.98/1.34 % Vampire exiting
%------------------------------------------------------------------------------