%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : ANA002-1 : TPTP v9.3.1. Bugfixed v1.0.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 4.49s 1.33s
% Output : Refutation 5.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 23
% Syntax : Number of formulae : 88 ( 15 unt; 6 def)
% Number of atoms : 232 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 247 ( 103 ~; 138 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 7 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 46 !; 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/sandbox2/benchmark/theBenchmark.p',in_interval) ).
fof(f3,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(f4,axiom,
! [X2,X0,X1] :
( ~ less_than_or_equal(X2,X1)
| ~ less_than_or_equal(X0,X2)
| less_than_or_equal(X0,X1) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',interpolation1) ).
fof(f6,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(f7,axiom,
! [X0] :
( ~ less_than_or_equal(X0,h(X0))
| less_than_or_equal(f(X0),n0)
| ~ in_interval(lower_bound,X0,upper_bound) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity1) ).
fof(f8,axiom,
! [X0,X1] :
( ~ less_than_or_equal(f(X1),n0)
| ~ less_than_or_equal(X1,X0)
| less_than_or_equal(f(X0),n0)
| less_than_or_equal(X1,h(X0))
| ~ in_interval(lower_bound,X0,upper_bound) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity2) ).
fof(f9,axiom,
! [X0] :
( ~ less_than_or_equal(k(X0),X0)
| less_than_or_equal(n0,f(X0))
| ~ in_interval(lower_bound,X0,upper_bound) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity3) ).
fof(f10,axiom,
! [X0,X1] :
( ~ less_than_or_equal(n0,f(X1))
| ~ less_than_or_equal(X0,X1)
| less_than_or_equal(n0,f(X0))
| less_than_or_equal(k(X0),X1)
| ~ in_interval(lower_bound,X0,upper_bound) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',continuity4) ).
fof(f11,axiom,
! [X0] :
( ~ less_than_or_equal(f(X0),n0)
| ~ less_than_or_equal(X0,upper_bound)
| less_than_or_equal(X0,l) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',crossover3_and_g_function2) ).
fof(f14,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(f15,axiom,
less_than_or_equal(lower_bound,upper_bound),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_interval) ).
fof(f16,axiom,
less_than_or_equal(f(lower_bound),n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lower_mapping) ).
fof(f17,axiom,
less_than_or_equal(n0,f(upper_bound)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',upper_mapping) ).
fof(f18,negated_conjecture,
! [X0] : ~ in_interval(f(X0),n0,f(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_x_which_crosses) ).
fof(f19,plain,
! [X0] :
( ~ less_than_or_equal(n0,f(X0))
| ~ less_than_or_equal(f(X0),n0) ),
inference(resolution,[],[f1,f18]) ).
fof(f25,plain,
! [X0,X1] :
( less_than_or_equal(g(X0),h(X1))
| less_than_or_equal(f(X1),n0)
| ~ less_than_or_equal(g(X0),X1)
| ~ in_interval(lower_bound,X1,upper_bound)
| less_than_or_equal(l,X0) ),
inference(resolution,[],[f8,f13]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ less_than_or_equal(X0,X1)
| less_than_or_equal(X0,X2)
| less_than_or_equal(X2,X1) ),
inference(resolution,[],[f4,f3]) ).
fof(f35,plain,
! [X0] :
( ~ less_than_or_equal(g(X0),upper_bound)
| less_than_or_equal(g(X0),l)
| less_than_or_equal(l,X0) ),
inference(resolution,[],[f11,f13]) ).
fof(f37,plain,
! [X0] :
( less_than_or_equal(n0,f(X0))
| less_than_or_equal(X0,l)
| ~ less_than_or_equal(X0,upper_bound) ),
inference(resolution,[],[f11,f3]) ).
fof(f38,plain,
! [X0] :
( less_than_or_equal(g(X0),l)
| less_than_or_equal(l,X0) ),
inference(forward_subsumption_resolution,[],[f35,f12]) ).
fof(f42,plain,
( ~ less_than_or_equal(lower_bound,upper_bound)
| less_than_or_equal(lower_bound,l) ),
inference(resolution,[],[f16,f11]) ).
fof(f45,plain,
less_than_or_equal(lower_bound,l),
inference(forward_subsumption_resolution,[],[f42,f15]) ).
fof(f50,plain,
! [X0] :
( ~ in_interval(lower_bound,X0,upper_bound)
| less_than_or_equal(n0,f(X0))
| less_than_or_equal(k(X0),upper_bound)
| ~ less_than_or_equal(X0,upper_bound) ),
inference(resolution,[],[f17,f10]) ).
fof(f57,plain,
( less_than_or_equal(l,upper_bound)
| less_than_or_equal(l,upper_bound) ),
inference(resolution,[],[f12,f14]) ).
fof(f59,plain,
less_than_or_equal(l,upper_bound),
inference(duplicate_literal_removal,[],[f57]) ).
fof(f67,plain,
! [X0,X1] :
( ~ in_interval(lower_bound,X1,upper_bound)
| ~ less_than_or_equal(X0,upper_bound)
| ~ less_than_or_equal(X1,X0)
| less_than_or_equal(n0,f(X1))
| less_than_or_equal(k(X1),X0)
| less_than_or_equal(X0,l) ),
inference(resolution,[],[f37,f10]) ).
fof(f85,plain,
! [X0] :
( less_than_or_equal(f(X0),n0)
| ~ less_than_or_equal(g(h(X0)),X0)
| ~ in_interval(lower_bound,X0,upper_bound)
| less_than_or_equal(l,h(X0))
| less_than_or_equal(l,h(X0)) ),
inference(resolution,[],[f25,f14]) ).
fof(f89,plain,
! [X0] :
( ~ less_than_or_equal(g(h(X0)),X0)
| less_than_or_equal(f(X0),n0)
| ~ in_interval(lower_bound,X0,upper_bound)
| less_than_or_equal(l,h(X0)) ),
inference(duplicate_literal_removal,[],[f85]) ).
fof(f97,plain,
( less_than_or_equal(f(l),n0)
| ~ in_interval(lower_bound,l,upper_bound)
| less_than_or_equal(l,h(l))
| less_than_or_equal(l,h(l)) ),
inference(resolution,[],[f89,f38]) ).
fof(f104,plain,
( less_than_or_equal(f(l),n0)
| ~ in_interval(lower_bound,l,upper_bound)
| less_than_or_equal(l,h(l)) ),
inference(duplicate_literal_removal,[],[f97]) ).
fof(f106,plain,
( less_than_or_equal(f(l),n0)
| ~ in_interval(lower_bound,l,upper_bound) ),
inference(forward_subsumption_resolution,[],[f104,f7]) ).
fof(f117,definition,
( spl0_3
<=> in_interval(lower_bound,l,upper_bound) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f118,plain,
( in_interval(lower_bound,l,upper_bound)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f117]) ).
fof(f119,plain,
( ~ in_interval(lower_bound,l,upper_bound)
| spl0_3 ),
inference(avatar_component_clause,[],[f117]) ).
fof(f121,definition,
( spl0_4
<=> less_than_or_equal(f(l),n0) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f123,plain,
( less_than_or_equal(f(l),n0)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f121]) ).
fof(f124,plain,
( ~ spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f106,f121,f117]) ).
fof(f244,plain,
( ~ less_than_or_equal(lower_bound,l)
| ~ less_than_or_equal(l,upper_bound)
| spl0_3 ),
inference(resolution,[],[f119,f1]) ).
fof(f245,plain,
( ~ less_than_or_equal(l,upper_bound)
| spl0_3 ),
inference(forward_subsumption_resolution,[],[f244,f45]) ).
fof(f246,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[],[f245,f59]) ).
fof(f247,plain,
spl0_3,
inference(avatar_contradiction_clause,[],[f246]) ).
fof(f249,plain,
( ! [X0] :
( ~ less_than_or_equal(X0,upper_bound)
| ~ less_than_or_equal(l,X0)
| less_than_or_equal(n0,f(l))
| less_than_or_equal(k(l),X0)
| less_than_or_equal(X0,l) )
| ~ spl0_3 ),
inference(resolution,[],[f118,f67]) ).
fof(f252,plain,
( less_than_or_equal(n0,f(l))
| less_than_or_equal(k(l),upper_bound)
| ~ less_than_or_equal(l,upper_bound)
| ~ spl0_3 ),
inference(resolution,[],[f118,f50]) ).
fof(f253,plain,
( less_than_or_equal(n0,f(l))
| less_than_or_equal(k(l),upper_bound)
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f252,f59]) ).
fof(f259,definition,
( spl0_13
<=> less_than_or_equal(n0,f(l)) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f260,plain,
( ~ less_than_or_equal(n0,f(l))
| spl0_13 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f261,plain,
( less_than_or_equal(n0,f(l))
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f263,plain,
( ! [X0] :
( ~ less_than_or_equal(X0,upper_bound)
| less_than_or_equal(n0,f(l))
| less_than_or_equal(k(l),X0)
| less_than_or_equal(X0,l) )
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f249,f3]) ).
fof(f265,definition,
( spl0_14
<=> less_than_or_equal(k(l),upper_bound) ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f267,plain,
( less_than_or_equal(k(l),upper_bound)
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f268,plain,
( spl0_14
| spl0_13
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f253,f117,f259,f265]) ).
fof(f270,definition,
( spl0_15
<=> ! [X0] :
( ~ less_than_or_equal(X0,upper_bound)
| less_than_or_equal(X0,l)
| less_than_or_equal(k(l),X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).
fof(f271,plain,
( ! [X0] :
( less_than_or_equal(k(l),X0)
| less_than_or_equal(X0,l)
| ~ less_than_or_equal(X0,upper_bound) )
| ~ spl0_15 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f272,plain,
( spl0_13
| spl0_15
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f263,f117,f270,f259]) ).
fof(f274,plain,
( ~ less_than_or_equal(f(l),n0)
| ~ spl0_13 ),
inference(resolution,[],[f261,f19]) ).
fof(f277,plain,
( $false
| ~ spl0_4
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f274,f123]) ).
fof(f278,plain,
( ~ spl0_4
| ~ spl0_13 ),
inference(avatar_contradiction_clause,[],[f277]) ).
fof(f279,plain,
( ! [X0] :
( less_than_or_equal(k(l),X0)
| less_than_or_equal(X0,upper_bound) )
| ~ spl0_14 ),
inference(resolution,[],[f267,f30]) ).
fof(f284,plain,
( ! [X0] :
( ~ less_than_or_equal(q(X0,k(l)),upper_bound)
| less_than_or_equal(q(X0,k(l)),l)
| less_than_or_equal(k(l),X0) )
| ~ spl0_15 ),
inference(resolution,[],[f271,f5]) ).
fof(f330,definition,
( spl0_23
<=> less_than_or_equal(k(l),l) ),
introduced(definition,[new_symbols(definition,[spl0_23])],[avatar_definition]) ).
fof(f332,plain,
( less_than_or_equal(k(l),l)
| ~ spl0_23 ),
inference(avatar_component_clause,[],[f330]) ).
fof(f341,plain,
( ! [X0] :
( less_than_or_equal(q(X0,k(l)),upper_bound)
| less_than_or_equal(k(l),X0) )
| ~ spl0_14 ),
inference(resolution,[],[f279,f5]) ).
fof(f348,plain,
( ! [X0] :
( less_than_or_equal(k(l),X0)
| less_than_or_equal(q(X0,k(l)),l)
| less_than_or_equal(k(l),X0) )
| ~ spl0_14
| ~ spl0_15 ),
inference(resolution,[],[f341,f284]) ).
fof(f353,plain,
( ! [X0] :
( less_than_or_equal(q(X0,k(l)),l)
| less_than_or_equal(k(l),X0) )
| ~ spl0_14
| ~ spl0_15 ),
inference(duplicate_literal_removal,[],[f348]) ).
fof(f354,plain,
( less_than_or_equal(k(l),l)
| less_than_or_equal(k(l),l)
| ~ spl0_14
| ~ spl0_15 ),
inference(resolution,[],[f353,f6]) ).
fof(f358,plain,
( less_than_or_equal(k(l),l)
| ~ spl0_14
| ~ spl0_15 ),
inference(duplicate_literal_removal,[],[f354]) ).
fof(f359,plain,
( spl0_23
| ~ spl0_14
| ~ spl0_15 ),
inference(avatar_split_clause,[],[f358,f270,f265,f330]) ).
fof(f360,plain,
( less_than_or_equal(n0,f(l))
| ~ in_interval(lower_bound,l,upper_bound)
| ~ spl0_23 ),
inference(resolution,[],[f332,f9]) ).
fof(f364,plain,
( ~ in_interval(lower_bound,l,upper_bound)
| spl0_13
| ~ spl0_23 ),
inference(forward_subsumption_resolution,[],[f360,f260]) ).
fof(f365,plain,
( $false
| ~ spl0_3
| spl0_13
| ~ spl0_23 ),
inference(forward_subsumption_resolution,[],[f364,f118]) ).
fof(f366,plain,
( ~ spl0_3
| spl0_13
| ~ spl0_23 ),
inference(avatar_contradiction_clause,[],[f365]) ).
cnf(s2,plain,
( ~ spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f124]) ).
cnf(s6,plain,
spl0_3,
inference(sat_conversion,[],[f247]) ).
cnf(s8,plain,
( ~ spl0_3
| spl0_13
| spl0_14 ),
inference(sat_conversion,[],[f268]) ).
cnf(s9,plain,
( ~ spl0_3
| spl0_13
| spl0_15 ),
inference(sat_conversion,[],[f272]) ).
cnf(s10,plain,
( ~ spl0_4
| ~ spl0_13 ),
inference(sat_conversion,[],[f278]) ).
cnf(s14,plain,
( ~ spl0_14
| ~ spl0_15
| spl0_23 ),
inference(sat_conversion,[],[f359]) ).
cnf(s15,plain,
( ~ spl0_3
| spl0_13
| ~ spl0_23 ),
inference(sat_conversion,[],[f366]) ).
cnf(s16,plain,
spl0_4,
inference(rat,[],[s2,s6]) ).
cnf(s17,plain,
~ spl0_13,
inference(rat,[],[s10,s16]) ).
cnf(s18,plain,
~ spl0_23,
inference(rat,[],[s15,s6,s17]) ).
cnf(s19,plain,
spl0_15,
inference(rat,[],[s9,s6,s17]) ).
cnf(s20,plain,
spl0_14,
inference(rat,[],[s8,s6,s17]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s14,s18,s19,s20]) ).
fof(f367,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA002-1 : TPTP v9.3.1. Bugfixed v1.0.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n001.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 20:30:49 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running first-order theorem proving
% 0.09/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.49/1.33 % (684190)Input is clausal, will run a generic CNF schedule.
% 4.49/1.33 % (684195)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=1445960304:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.49/1.33 % (684198)lrs+10_1_sil=8000:sp=occurrence:random_seed=2837042627:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.49/1.33 % (684196)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3878261118:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.49/1.33 % (684199)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=274130234:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.49/1.33 % (684200)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=312571805:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.49/1.33 % (684201)dis-21_1_sil=8000:lcm=predicate:random_seed=2753367469: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)
% 4.49/1.33 % (684197)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=600108278:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.49/1.33 % (684199)Instruction limit reached!
% 4.49/1.33 % (684199)------------------------------
% 4.49/1.33 % (684199)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.33 % (684199)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.33 % (684199)CaDiCaL version: 2.1.3
% 4.49/1.33 % (684199)Termination reason: Instruction limit
% 4.49/1.33 % (684199)Termination phase: Saturation
% 4.49/1.33 % (684199)Time elapsed: 0.048 s
% 4.49/1.33 % (684199)Peak memory usage: 87 MB
% 4.49/1.33 % (684199)Instructions burned: 115 (million)
% 4.49/1.33 % (684198)Instruction limit reached!
% 4.49/1.33 % (684198)------------------------------
% 4.49/1.33 % (684198)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.33 % (684198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.33 % (684198)CaDiCaL version: 2.1.3
% 4.49/1.33 % (684198)Termination reason: Instruction limit
% 4.49/1.33 % (684198)Termination phase: Saturation
% 4.49/1.33 % (684198)Time elapsed: 0.066 s
% 4.49/1.33 % (684198)Peak memory usage: 88 MB
% 4.49/1.33 % (684198)Instructions burned: 109 (million)
% 4.49/1.33 % (684201)Instruction limit reached!
% 4.49/1.33 % (684201)------------------------------
% 4.49/1.33 % (684201)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.33 % (684201)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.33 % (684201)CaDiCaL version: 2.1.3
% 4.49/1.33 % (684201)Termination reason: Instruction limit
% 4.49/1.33 % (684201)Termination phase: Saturation
% 4.49/1.33 % (684201)Time elapsed: 0.072 s
% 4.49/1.33 % (684201)Peak memory usage: 88 MB
% 4.49/1.33 % (684201)Instructions burned: 118 (million)
% 4.49/1.33 % (684200)Instruction limit reached!
% 4.49/1.33 % (684200)------------------------------
% 4.49/1.33 % (684200)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.33 % (684200)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.33 % (684200)CaDiCaL version: 2.1.3
% 4.49/1.33 % (684200)Termination reason: Instruction limit
% 4.49/1.33 % (684200)Termination phase: Saturation
% 4.49/1.33 % (684200)Time elapsed: 0.124 s
% 4.49/1.33 % (684200)Peak memory usage: 89 MB
% 4.49/1.33 % (684200)Instructions burned: 180 (million)
% 4.49/1.33 % (684209)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=3003414323:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 4.49/1.33 % (684210)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1735597961: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)
% 4.49/1.33 % (684211)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2464787773:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 4.49/1.33 % (684209)Instruction limit reached!
% 4.49/1.33 % (684209)------------------------------
% 4.49/1.33 % (684209)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.33 % (684209)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.33 % (684209)CaDiCaL version: 2.1.3
% 4.49/1.33 % (684209)Termination reason: Instruction limit
% 4.49/1.33 % (684209)Termination phase: Saturation
% 4.49/1.33 % (684209)Time elapsed: 0.087 s
% 4.49/1.33 % (684209)Peak memory usage: 89 MB
% 4.49/1.33 % (684209)Instructions burned: 144 (million)
% 4.49/1.33 % (684212)lrs+10_64_to=lpo:sil=8000:random_seed=2011138847:i=126:bd=preordered_2996 on theBenchmark for (2996ds/126Mi)
% 4.49/1.33 % (684195)First to succeed.
% 4.49/1.33 % (684195)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-684190"
% 4.49/1.33 % (684210)Instruction limit reached!
% 4.49/1.33 % (684210)------------------------------
% 4.49/1.33 % (684210)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.33 % (684210)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.33 % (684210)CaDiCaL version: 2.1.3
% 4.49/1.33 % (684210)Termination reason: Instruction limit
% 4.49/1.33 % (684210)Termination phase: Saturation
% 4.49/1.33 % (684210)Time elapsed: 0.106 s
% 4.49/1.33 % (684210)Peak memory usage: 89 MB
% 4.49/1.33 % (684210)Instructions burned: 189 (million)
% 4.49/1.33 % (684212)Instruction limit reached!
% 4.49/1.33 % (684212)------------------------------
% 4.49/1.33 % (684212)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.33 % (684212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.33 % (684212)CaDiCaL version: 2.1.3
% 4.49/1.33 % (684212)Termination reason: Instruction limit
% 4.49/1.33 % (684212)Termination phase: Saturation
% 4.49/1.33 % (684212)Time elapsed: 0.075 s
% 4.49/1.33 % (684212)Peak memory usage: 88 MB
% 4.49/1.33 % (684212)Instructions burned: 127 (million)
% 4.49/1.33 % (684211)Instruction limit reached!
% 4.49/1.33 % (684211)------------------------------
% 4.49/1.33 % (684211)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.49/1.33 % (684211)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.49/1.33 % (684211)CaDiCaL version: 2.1.3
% 4.49/1.33 % (684211)Termination reason: Instruction limit
% 4.49/1.33 % (684211)Termination phase: Saturation
% 4.49/1.33 % (684211)Time elapsed: 0.141 s
% 4.49/1.33 % (684211)Peak memory usage: 89 MB
% 4.49/1.33 % (684211)Instructions burned: 220 (million)
% 4.49/1.33 % (684217)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=11589711:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 4.49/1.33 % (684195)Refutation found. Thanks to Tanya!
% 4.49/1.33 % SZS status Unsatisfiable for theBenchmark
% 4.49/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 5.27/1.53 % (684195)------------------------------
% 5.27/1.53 % (684195)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.27/1.53 % (684195)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.27/1.53 % (684195)CaDiCaL version: 2.1.3
% 5.27/1.53 % (684195)Termination reason: Refutation
% 5.27/1.53 % (684195)Time elapsed: 0.359 s
% 5.27/1.53 % (684195)Peak memory usage: 129 MB
% 5.27/1.53 % (684195)Instructions burned: 961 (million)
% 5.27/1.53 % (684195)------------------------------
% 5.27/1.53 % (684195)------------------------------
% 5.27/1.53 % (684190)Success in time 0.651 s
% 5.27/1.53 % Vampire exiting
%------------------------------------------------------------------------------