↑ Up

Vampire---5.0.1.SAT-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : GRP125-3.004 : TPTP v9.3.1. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n005.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 10:12:44 AM UTC 2026

% Result   : Satisfiable 4.38s 1.55s
% Output   : Saturation 5.57s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u52,axiom,
    ~ greater(e_1,e_1) ).

cnf(u55,axiom,
    cycle(e_1,e_0) ).

cnf(u70,axiom,
    ~ cycle(e_3,e_3) ).

cnf(u74,axiom,
    ~ cycle(e_3,e_2) ).

cnf(u79,axiom,
    cycle(e_3,e_1) ).

cnf(u82,axiom,
    ~ cycle(e_3,e_0) ).

cnf(u87,axiom,
    ~ cycle(e_2,e_3) ).

cnf(u92,axiom,
    cycle(e_2,e_2) ).

cnf(u99,axiom,
    ~ cycle(e_2,e_0) ).

cnf(u104,axiom,
    ~ cycle(e_1,e_3) ).

cnf(u127,axiom,
    ( ~ cycle(e_1,X0)
    | ~ greater(X0,e_0) ) ).

cnf(u155,axiom,
    ~ next(e_2,e_4) ).

cnf(u194,axiom,
    ~ greater(e_1,e_3) ).

cnf(u198,axiom,
    ~ next(e_1,e_4) ).

cnf(u205,axiom,
    ~ greater(e_1,e_2) ).

cnf(u215,axiom,
    ~ next(e_2,e_1) ).

cnf(u229,axiom,
    ~ next(e_3,e_2) ).

cnf(u237,axiom,
    ~ next(e_2,e_2) ).

cnf(u262,axiom,
    ~ greater(e_0,e_3) ).

cnf(u270,axiom,
    ~ greater(e_3,e_3) ).

cnf(u286,axiom,
    ~ greater(e_0,e_1) ).

cnf(u308,axiom,
    ~ next(e_3,e_3) ).

cnf(u345,axiom,
    ( ~ next(e_0,X0)
    | equalish(e_1,X0) ) ).

cnf(u398,axiom,
    ~ greater(e_0,e_2) ).

cnf(u403,axiom,
    ~ greater(e_2,e_2) ).

cnf(u416,axiom,
    ~ product(e_4,e_1,e_4) ).

cnf(u420,axiom,
    ~ product(e_4,e_1,e_3) ).

cnf(u425,axiom,
    product(e_4,e_1,e_2) ).

cnf(u434,axiom,
    product(e_3,e_1,e_4) ).

cnf(u437,axiom,
    ~ product(e_3,e_1,e_3) ).

cnf(u441,axiom,
    ~ product(e_3,e_1,e_2) ).

cnf(u445,axiom,
    ~ product(e_3,e_1,e_1) ).

cnf(u450,axiom,
    ~ product(e_2,e_1,e_4) ).

cnf(u455,axiom,
    product(e_2,e_1,e_3) ).

cnf(u462,axiom,
    ~ product(e_2,e_1,e_1) ).

cnf(u491,axiom,
    ( ~ next(e_4,X1)
    | equalish(e_3,X1) ) ).

cnf(u502,axiom,
    ( ~ next(e_3,X1)
    | equalish(e_4,X1) ) ).

cnf(u570,axiom,
    ( ~ next(e_2,X1)
    | equalish(e_3,X1) ) ).

cnf(u606,axiom,
    ( ~ next(e_4,X1)
    | equalish(e_2,X1) ) ).

cnf(u623,axiom,
    ~ product(e_4,e_2,e_4) ).

cnf(u628,axiom,
    product(e_4,e_2,e_3) ).

cnf(u640,axiom,
    ~ product(e_3,e_2,e_4) ).

cnf(u644,axiom,
    ~ product(e_3,e_2,e_3) ).

cnf(u648,axiom,
    ~ product(e_3,e_2,e_2) ).

cnf(u653,axiom,
    product(e_3,e_2,e_1) ).

cnf(u658,axiom,
    product(e_1,e_2,e_4) ).

cnf(u665,axiom,
    ~ product(e_1,e_2,e_2) ).

cnf(u669,axiom,
    ~ product(e_1,e_2,e_1) ).

cnf(u751,axiom,
    product(e_2,e_3,e_4) ).

cnf(u767,axiom,
    ~ product(e_1,e_3,e_4) ).

cnf(u776,axiom,
    product(e_1,e_3,e_2) ).

cnf(u779,axiom,
    ~ product(e_1,e_3,e_1) ).

cnf(u339,axiom,
    ( ~ cycle(X0,e_0)
    | ~ next(X0,e_1)
    | ~ greater(X0,e_3) ) ).

cnf(e_2_then_e_3,axiom,
    next(e_2,e_3) ).

cnf(u135,axiom,
    ~ greater(e_0,e_0) ).

cnf(u587,axiom,
    ( ~ product(X0,e_1,e_4)
    | equalish(X0,e_3) ) ).

cnf(element_1,axiom,
    group_element(e_1) ).

cnf(u707,negated_conjecture,
    ( ~ product(e_2,e_3,X0)
    | product(X0,e_1,e_2) ) ).

cnf(u138,axiom,
    ( ~ cycle(X0,X1)
    | ~ next(X0,e_1)
    | ~ greater(X1,e_0)
    | ~ next(e_0,X2)
    | equalish(X1,X2) ) ).

cnf(e_4_is_not_e_3,axiom,
    ~ equalish(e_4,e_3) ).

cnf(u725,axiom,
    ( ~ product(X0,e_2,e_4)
    | equalish(X0,e_1) ) ).

cnf(product_right_cancellation,axiom,
    ( ~ product(X0,X3,X2)
    | ~ product(X0,X1,X2)
    | equalish(X1,X3) ) ).

cnf(e_3_greater_e_0,axiom,
    greater(e_3,e_0) ).

cnf(u682,negated_conjecture,
    ( ~ product(e_2,e_4,X0)
    | product(X0,e_3,e_2) ) ).

cnf(e_3_greater_e_1,axiom,
    greater(e_3,e_1) ).

cnf(u829,axiom,
    ( ~ product(e_1,e_3,X0)
    | equalish(X0,e_2) ) ).

cnf(element_4,axiom,
    group_element(e_4) ).

cnf(u792,negated_conjecture,
    ( ~ product(e_1,X0,e_3)
    | equalish(X0,e_4) ) ).

cnf(u44,negated_conjecture,
    ( ~ product(X0,X0,X1)
    | product(X1,X0,X0) ) ).

cnf(u787,axiom,
    ( ~ product(e_2,e_3,X0)
    | equalish(X0,e_4) ) ).

cnf(u331,axiom,
    ( ~ cycle(e_3,X0)
    | equalish(X0,e_1) ) ).

cnf(u732,negated_conjecture,
    ( ~ product(e_3,e_4,X0)
    | product(X0,e_1,e_3) ) ).

cnf(u785,axiom,
    ( ~ product(X0,e_3,e_4)
    | equalish(X0,e_2) ) ).

cnf(e_4_greater_e_3,axiom,
    greater(e_4,e_3) ).

cnf(u730,negated_conjecture,
    ( ~ product(e_4,X0,e_1)
    | equalish(X0,e_3) ) ).

cnf(e_0_then_e_1,axiom,
    next(e_0,e_1) ).

cnf(e_2_is_not_e_1,axiom,
    ~ equalish(e_2,e_1) ).

cnf(u409,axiom,
    ( ~ group_element(X0)
    | product(X0,e_4,e_1)
    | product(X0,e_4,e_2)
    | product(X0,e_4,e_3)
    | product(X0,e_4,e_4) ) ).

cnf(e_3_is_not_e_1,axiom,
    ~ equalish(e_3,e_1) ).

cnf(u788,negated_conjecture,
    ( ~ product(e_3,e_2,X0)
    | product(X0,e_4,e_3) ) ).

cnf(u827,axiom,
    ( ~ product(X0,e_3,e_2)
    | equalish(X0,e_1) ) ).

cnf(u136,axiom,
    ( ~ cycle(e_1,X0)
    | equalish(X0,e_0) ) ).

cnf(u588,axiom,
    ( ~ product(e_3,X0,e_4)
    | equalish(X0,e_1) ) ).

cnf(u567,negated_conjecture,
    ( ~ product(e_1,e_2,X0)
    | product(X0,e_3,e_1) ) ).

cnf(u602,negated_conjecture,
    ( ~ product(e_1,e_4,X0)
    | product(X0,e_2,e_1) ) ).

cnf(u58,axiom,
    ( ~ product(X0,X0,X1)
    | equalish(X1,X0) ) ).

cnf(u793,negated_conjecture,
    ( ~ product(e_1,e_4,X0)
    | equalish(X0,e_3) ) ).

cnf(u190,axiom,
    ~ next(e_4,e_4) ).

cnf(e_1_greater_e_0,axiom,
    greater(e_1,e_0) ).

cnf(e_4_greater_e_0,axiom,
    greater(e_4,e_0) ).

cnf(e_4_is_not_e_2,axiom,
    ~ equalish(e_4,e_2) ).

cnf(e_2_is_not_e_4,axiom,
    ~ equalish(e_2,e_4) ).

cnf(qg3,negated_conjecture,
    ( ~ product(X1,X0,X3)
    | ~ product(X0,X1,X2)
    | product(X2,X3,X0) ) ).

cnf(u791,negated_conjecture,
    ( ~ product(X0,e_4,e_3)
    | equalish(X0,e_1) ) ).

cnf(u724,negated_conjecture,
    product(e_4,e_3,e_1) ).

cnf(e_3_is_not_e_4,axiom,
    ~ equalish(e_3,e_4) ).

cnf(u62,axiom,
    ( ~ product(X0,X1,X1)
    | equalish(X0,X1) ) ).

cnf(u731,negated_conjecture,
    ( ~ product(e_4,e_3,X0)
    | equalish(X0,e_1) ) ).

cnf(u166,axiom,
    ( ~ cycle(X1,X2)
    | ~ cycle(X0,e_0)
    | ~ next(X0,e_1)
    | ~ greater(X0,X1)
    | ~ greater(X2,e_0) ) ).

cnf(u386,axiom,
    ~ next(e_4,e_3) ).

cnf(cycle5,axiom,
    ( ~ cycle(X3,X4)
    | ~ cycle(X2,e_0)
    | ~ cycle(X0,X1)
    | ~ next(X2,X3)
    | ~ greater(X2,X0)
    | ~ greater(X1,X4) ) ).

cnf(u728,negated_conjecture,
    ( ~ product(e_2,e_1,X0)
    | product(X0,e_4,e_2) ) ).

cnf(u737,negated_conjecture,
    ( ~ product(X0,e_4,e_2)
    | equalish(X0,e_3) ) ).

cnf(e_3_greater_e_2,axiom,
    greater(e_3,e_2) ).

cnf(u360,axiom,
    ( ~ cycle(X0,e_0)
    | ~ next(X0,e_1)
    | ~ greater(X0,e_2) ) ).

cnf(u828,axiom,
    ( ~ product(e_1,X0,e_2)
    | equalish(X0,e_3) ) ).

cnf(u383,axiom,
    ( ~ cycle(X0,e_0)
    | ~ next(X0,e_3)
    | ~ greater(X0,e_2) ) ).

cnf(u826,negated_conjecture,
    product(e_2,e_4,e_1) ).

cnf(u603,axiom,
    ~ greater(e_2,e_4) ).

cnf(product_total_function1,axiom,
    ( ~ group_element(X1)
    | ~ group_element(X0)
    | product(X0,X1,e_1)
    | product(X0,X1,e_2)
    | product(X0,X1,e_3)
    | product(X0,X1,e_4) ) ).

cnf(u565,axiom,
    ( ~ product(e_2,X0,e_3)
    | equalish(X0,e_1) ) ).

cnf(u726,axiom,
    ( ~ product(e_1,X0,e_4)
    | equalish(X0,e_2) ) ).

cnf(u333,axiom,
    ( ~ cycle(X1,X2)
    | ~ cycle(X0,e_0)
    | ~ next(X0,e_3)
    | ~ greater(X0,X1)
    | ~ greater(X2,e_1) ) ).

cnf(u169,axiom,
    ( ~ cycle(X1,X2)
    | ~ cycle(X0,e_0)
    | ~ next(X0,e_4)
    | ~ greater(X0,X1)
    | ~ greater(X2,e_0) ) ).

cnf(u408,axiom,
    ( ~ group_element(X0)
    | product(X0,e_3,e_1)
    | product(X0,e_3,e_2)
    | product(X0,e_3,e_3)
    | product(X0,e_3,e_4) ) ).

cnf(u359,axiom,
    ( ~ cycle(X0,e_0)
    | ~ next(X0,e_4)
    | ~ greater(X0,e_2) ) ).

cnf(element_2,axiom,
    group_element(e_2) ).

cnf(u830,negated_conjecture,
    ( ~ product(e_3,e_1,X0)
    | product(X0,e_2,e_3) ) ).

cnf(e_1_is_not_e_2,axiom,
    ~ equalish(e_1,e_2) ).

cnf(u377,axiom,
    ( ~ next(e_1,X0)
    | equalish(e_2,X0) ) ).

cnf(product_left_cancellation,axiom,
    ( ~ product(X3,X1,X2)
    | ~ product(X0,X1,X2)
    | equalish(X0,X3) ) ).

cnf(u60,axiom,
    ( ~ product(X0,X1,X0)
    | equalish(X1,X0) ) ).

cnf(e_3_then_e_4,axiom,
    next(e_3,e_4) ).

cnf(u352,axiom,
    ( ~ cycle(e_2,X0)
    | equalish(X0,e_2) ) ).

cnf(e_4_greater_e_1,axiom,
    greater(e_4,e_1) ).

cnf(u407,axiom,
    ( ~ group_element(X0)
    | product(X0,e_2,e_1)
    | product(X0,e_2,e_2)
    | product(X0,e_2,e_3)
    | product(X0,e_2,e_4) ) ).

cnf(e_1_then_e_2,axiom,
    next(e_1,e_2) ).

cnf(e_2_is_not_e_3,axiom,
    ~ equalish(e_2,e_3) ).

cnf(u589,axiom,
    ( ~ product(e_3,e_1,X0)
    | equalish(X0,e_4) ) ).

cnf(cycle3,axiom,
    cycle(e_4,e_0) ).

cnf(u353,axiom,
    ( ~ cycle(X0,X1)
    | ~ next(X0,e_2)
    | ~ greater(X1,e_0)
    | ~ next(e_2,X2)
    | equalish(X1,X2) ) ).

cnf(u705,axiom,
    ( ~ product(e_3,X0,e_1)
    | equalish(X0,e_2) ) ).

cnf(u338,axiom,
    ( ~ cycle(X0,e_0)
    | ~ next(X0,e_4)
    | ~ greater(X0,e_3) ) ).

cnf(u736,negated_conjecture,
    product(e_3,e_4,e_2) ).

cnf(u794,negated_conjecture,
    ( ~ product(e_4,e_1,X0)
    | product(X0,e_3,e_4) ) ).

cnf(u247,axiom,
    ~ next(e_4,e_1) ).

cnf(e_2_greater_e_0,axiom,
    greater(e_2,e_0) ).

cnf(u354,axiom,
    ( ~ cycle(X1,X2)
    | ~ cycle(X0,e_0)
    | ~ next(X0,e_2)
    | ~ greater(X0,X1)
    | ~ greater(X2,e_2) ) ).

cnf(cycle7,axiom,
    ( ~ product(X0,e_1,X2)
    | ~ cycle(X0,X1)
    | ~ greater(X1,e_0)
    | ~ next(X0,X3)
    | equalish(X2,X3) ) ).

cnf(e_3_is_not_e_2,axiom,
    ~ equalish(e_3,e_2) ).

cnf(element_3,axiom,
    group_element(e_3) ).

cnf(u564,axiom,
    ( ~ product(X0,e_1,e_3)
    | equalish(X0,e_2) ) ).

cnf(u332,axiom,
    ( ~ cycle(X0,X1)
    | ~ next(X0,e_3)
    | ~ greater(X1,e_0)
    | ~ next(e_1,X2)
    | equalish(X1,X2) ) ).

cnf(u47,axiom,
    equalish(e_0,e_0) ).

cnf(u59,axiom,
    equalish(X0,X0) ).

cnf(u680,axiom,
    ( ~ product(e_4,X0,e_3)
    | equalish(X0,e_2) ) ).

cnf(u740,negated_conjecture,
    ( ~ product(e_4,e_3,X0)
    | product(X0,e_2,e_4) ) ).

cnf(u738,negated_conjecture,
    ( ~ product(e_3,X0,e_2)
    | equalish(X0,e_4) ) ).

cnf(u681,axiom,
    ( ~ product(e_4,e_2,X0)
    | equalish(X0,e_3) ) ).

cnf(e_2_greater_e_1,axiom,
    greater(e_2,e_1) ).

cnf(u141,axiom,
    ( ~ cycle(X0,X1)
    | ~ next(X0,e_4)
    | ~ greater(X1,e_0)
    | ~ next(e_0,X2)
    | equalish(X1,X2) ) ).

cnf(e_1_is_not_e_4,axiom,
    ~ equalish(e_1,e_4) ).

cnf(u835,negated_conjecture,
    ( ~ product(e_4,e_2,X0)
    | product(X0,e_1,e_4) ) ).

cnf(e_4_is_not_e_1,axiom,
    ~ equalish(e_4,e_1) ).

cnf(u832,negated_conjecture,
    ( ~ product(X0,e_4,e_1)
    | equalish(X0,e_2) ) ).

cnf(u566,axiom,
    ( ~ product(e_2,e_1,X0)
    | equalish(X0,e_3) ) ).

cnf(u590,negated_conjecture,
    ( ~ product(e_1,e_3,X0)
    | product(X0,e_4,e_1) ) ).

cnf(u786,axiom,
    ( ~ product(e_2,X0,e_4)
    | equalish(X0,e_3) ) ).

cnf(u679,axiom,
    ( ~ product(X0,e_2,e_3)
    | equalish(X0,e_4) ) ).

cnf(u789,negated_conjecture,
    product(e_1,e_4,e_3) ).

cnf(cycle2,axiom,
    ( ~ group_element(X0)
    | cycle(X0,e_0)
    | cycle(X0,e_1)
    | cycle(X0,e_2)
    | cycle(X0,e_3) ) ).

cnf(u833,negated_conjecture,
    ( ~ product(e_2,X0,e_1)
    | equalish(X0,e_4) ) ).

cnf(u406,axiom,
    ( ~ group_element(X0)
    | product(X0,e_1,e_1)
    | product(X0,e_1,e_2)
    | product(X0,e_1,e_3)
    | product(X0,e_1,e_4) ) ).

cnf(e_4_greater_e_2,axiom,
    greater(e_4,e_2) ).

cnf(u600,axiom,
    ( ~ product(e_4,X0,e_2)
    | equalish(X0,e_1) ) ).

cnf(product_total_function2,axiom,
    ( ~ product(X0,X1,X3)
    | ~ product(X0,X1,X2)
    | equalish(X2,X3) ) ).

cnf(u704,axiom,
    ( ~ product(X0,e_2,e_1)
    | equalish(X0,e_3) ) ).

cnf(product_idempotence,axiom,
    product(X0,X0,X0) ).

cnf(u834,negated_conjecture,
    ( ~ product(e_2,e_4,X0)
    | equalish(X0,e_1) ) ).

cnf(u727,axiom,
    ( ~ product(e_1,e_2,X0)
    | equalish(X0,e_4) ) ).

cnf(u739,negated_conjecture,
    ( ~ product(e_3,e_4,X0)
    | equalish(X0,e_2) ) ).

cnf(u601,axiom,
    ( ~ product(e_4,e_1,X0)
    | equalish(X0,e_2) ) ).

cnf(cycle6,axiom,
    ( ~ product(X0,e_1,X1)
    | ~ cycle(X0,e_0)
    | ~ greater(X1,X0) ) ).

cnf(cycle1,axiom,
    ( ~ cycle(X0,X2)
    | ~ cycle(X0,X1)
    | equalish(X1,X2) ) ).

cnf(e_1_is_not_e_3,axiom,
    ~ equalish(e_1,e_3) ).

cnf(u599,axiom,
    ( ~ product(X0,e_1,e_2)
    | equalish(X0,e_4) ) ).

cnf(cycle4,axiom,
    ( ~ cycle(X2,X3)
    | ~ cycle(X0,X1)
    | ~ next(X0,X2)
    | ~ greater(X1,e_0)
    | ~ next(X3,X4)
    | equalish(X1,X4) ) ).

cnf(u46,axiom,
    ( ~ cycle(e_4,X0)
    | equalish(X0,e_0) ) ).

cnf(u729,negated_conjecture,
    ( ~ product(X0,e_3,e_1)
    | equalish(X0,e_4) ) ).

cnf(u706,axiom,
    ( ~ product(e_3,e_2,X0)
    | equalish(X0,e_1) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP125-3.004 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n005.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sun Sep 27 09:21:47 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  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.38/1.55  % (3732539)Input is clausal, will run a generic CNF schedule.
% 4.38/1.55  % (3732547)lrs+10_1_sil=8000:sp=occurrence:random_seed=977917048:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.38/1.55  % (3732547)Instruction limit reached! 
% 4.38/1.55  % (3732547)------------------------------
% 4.38/1.55  % (3732547)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.38/1.55  % (3732547)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.55  % (3732547)CaDiCaL version: 2.1.3
% 4.38/1.55  % (3732547)Termination reason: Instruction limit
% 4.38/1.55  % (3732547)Termination phase: Saturation
% 4.38/1.55  % (3732547)Time elapsed: 0.035 s
% 4.38/1.55  % (3732547)Peak memory usage: 88 MB
% 4.38/1.55  % (3732547)Instructions burned: 110 (million)
% 4.38/1.55  % (3732550)dis-21_1_sil=8000:lcm=predicate:random_seed=1512430863: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.38/1.55  % (3732546)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=258512042:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.38/1.55  % (3732544)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=3700999977:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.38/1.55  % (3732548)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3185567521:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.38/1.55  % (3732545)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3332628026:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.38/1.55  % (3732549)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1771610799:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.38/1.55  % (3732548)Instruction limit reached! 
% 4.38/1.55  % (3732548)------------------------------
% 4.38/1.55  % (3732548)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.38/1.55  % (3732548)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.55  % (3732548)CaDiCaL version: 2.1.3
% 4.38/1.55  % (3732548)Termination reason: Instruction limit
% 4.38/1.55  % (3732548)Termination phase: Saturation
% 4.38/1.55  % (3732548)Time elapsed: 0.061 s
% 4.38/1.55  % (3732548)Peak memory usage: 88 MB
% 4.38/1.55  % (3732548)Instructions burned: 115 (million)
% 4.38/1.55  % (3732550)Instruction limit reached! 
% 4.38/1.55  % (3732550)------------------------------
% 4.38/1.55  % (3732550)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.38/1.55  % (3732550)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.55  % (3732550)CaDiCaL version: 2.1.3
% 4.38/1.55  % (3732550)Termination reason: Instruction limit
% 4.38/1.55  % (3732550)Termination phase: Saturation
% 4.38/1.55  % (3732550)Time elapsed: 0.077 s
% 4.38/1.55  % (3732550)Peak memory usage: 88 MB
% 4.38/1.55  % (3732550)Instructions burned: 117 (million)
% 4.38/1.55  % (3732552)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=739058653:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 4.38/1.55  % (3732549)Instruction limit reached! 
% 4.38/1.55  % (3732549)------------------------------
% 4.38/1.55  % (3732549)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.38/1.55  % (3732549)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.55  % (3732549)CaDiCaL version: 2.1.3
% 4.38/1.55  % (3732549)Termination reason: Instruction limit
% 4.38/1.55  % (3732549)Termination phase: Saturation
% 4.38/1.55  % (3732549)Time elapsed: 0.121 s
% 4.38/1.55  % (3732549)Peak memory usage: 89 MB
% 4.38/1.55  % (3732549)Instructions burned: 180 (million)
% 4.38/1.55  % (3732552)Instruction limit reached! 
% 4.38/1.55  % (3732552)------------------------------
% 4.38/1.55  % (3732552)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.38/1.55  % (3732552)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.55  % (3732552)CaDiCaL version: 2.1.3
% 4.38/1.55  % (3732552)Termination reason: Instruction limit
% 4.38/1.55  % (3732552)Termination phase: Saturation
% 4.38/1.55  % (3732552)Time elapsed: 0.043 s
% 4.38/1.55  % (3732552)Peak memory usage: 89 MB
% 4.38/1.55  % (3732552)Instructions burned: 144 (million)
% 4.38/1.55  % (3732559)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2301409195: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.38/1.55  % (3732559)Refutation not found, incomplete strategy
% 4.38/1.55  % (3732559)------------------------------
% 4.38/1.55  % (3732559)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.38/1.55  % (3732559)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.55  % (3732559)CaDiCaL version: 2.1.3
% 4.38/1.55  % (3732559)Termination reason: Refutation not found, incomplete strategy
% 4.38/1.55  % (3732559)Time elapsed: 0.002 s
% 4.38/1.55  % (3732559)Peak memory usage: 87 MB
% 4.38/1.55  % (3732559)Instructions burned: 2 (million)
% 4.38/1.55  % (3732560)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=4262638003:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 4.38/1.55  % (3732562)lrs+10_64_to=lpo:sil=8000:random_seed=99115190:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 4.38/1.55  % (3732563)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=2835165203:avsq=on:i=194:fgj=on:bd=preordered_2996 on theBenchmark for (2996ds/194Mi)
% 4.38/1.55  % (3732562)First to succeed.
% 4.38/1.55  % (3732562)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3732539"
% 4.38/1.55  % (3732563)Instruction limit reached! 
% 4.38/1.55  % (3732563)------------------------------
% 4.38/1.55  % (3732563)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.38/1.55  % (3732563)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.55  % (3732563)CaDiCaL version: 2.1.3
% 4.38/1.55  % (3732563)Termination reason: Instruction limit
% 4.38/1.55  % (3732563)Termination phase: Saturation
% 4.38/1.55  % (3732563)Time elapsed: 0.049 s
% 4.38/1.55  % (3732563)Peak memory usage: 88 MB
% 4.38/1.55  % (3732563)Instructions burned: 199 (million)
% 4.38/1.55  % (3732560)Instruction limit reached! 
% 4.38/1.55  % (3732560)------------------------------
% 4.38/1.55  % (3732560)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.38/1.55  % (3732560)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.55  % (3732560)CaDiCaL version: 2.1.3
% 4.38/1.55  % (3732560)Termination reason: Instruction limit
% 4.38/1.55  % (3732560)Termination phase: Saturation
% 4.38/1.55  % (3732560)Time elapsed: 0.124 s
% 4.38/1.55  % (3732560)Peak memory usage: 89 MB
% 4.38/1.55  % (3732560)Instructions burned: 219 (million)
% 4.38/1.55  % (3732559)------------------------------
% 4.38/1.55  % (3732559)------------------------------
% 4.38/1.55  % (3732568)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=2653613162:i=157:gtg=all_2995 on theBenchmark for (2995ds/157Mi)
% 4.38/1.55  % (3732568)Instruction limit reached! 
% 4.38/1.55  % (3732568)------------------------------
% 4.38/1.55  % (3732568)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.38/1.55  % (3732568)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.38/1.55  % (3732568)CaDiCaL version: 2.1.3
% 4.38/1.55  % (3732568)Termination reason: Instruction limit
% 4.38/1.55  % (3732568)Termination phase: Saturation
% 4.38/1.55  % (3732568)Time elapsed: 0.049 s
% 4.38/1.55  % (3732568)Peak memory usage: 89 MB
% 4.38/1.55  % (3732568)Instructions burned: 157 (million)
% 4.38/1.55  % (3732569)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:random_seed=568039163:i=3394:sd=4:ss=included:sgt=64_2994 on theBenchmark for (2994ds/3394Mi)
% 4.38/1.55  % SZS status Satisfiable for theBenchmark
% 4.38/1.55  % SZS output start Saturation.
% See solution above
% 5.57/1.74  % SZS output start Definitions and Model Updates.
% 5.57/1.74  % SZS output end Definitions and Model Updates.
% 5.57/1.74  % (3732562)------------------------------
% 5.57/1.74  % (3732562)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.57/1.74  % (3732562)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.57/1.74  % (3732562)CaDiCaL version: 2.1.3
% 5.57/1.74  % (3732562)Termination reason: Satisfiable
% 5.57/1.74  % (3732562)Time elapsed: 0.012 s
% 5.57/1.74  % (3732562)Peak memory usage: 88 MB
% 5.57/1.74  % (3732562)Instructions burned: 15 (million)
% 5.57/1.74  % (3732562)------------------------------
% 5.57/1.74  % (3732562)------------------------------
% 5.57/1.74  % (3732539)Success in time 0.705 s
% 5.57/1.74  % Vampire exiting
%------------------------------------------------------------------------------