%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP130-3.004 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:13:00 AM UTC 2026
% Result : Satisfiable 3.20s 1.60s
% Output : Saturation 0.15s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u51,axiom,
~ cycle(e_3,e_3) ).
cnf(u55,axiom,
~ cycle(e_3,e_2) ).
cnf(u60,axiom,
cycle(e_3,e_1) ).
cnf(u63,axiom,
~ cycle(e_3,e_0) ).
cnf(u68,axiom,
~ cycle(e_2,e_3) ).
cnf(u73,axiom,
cycle(e_2,e_2) ).
cnf(u76,axiom,
~ cycle(e_2,e_1) ).
cnf(u80,axiom,
~ cycle(e_2,e_0) ).
cnf(u85,axiom,
~ cycle(e_1,e_3) ).
cnf(u89,axiom,
~ cycle(e_1,e_2) ).
cnf(u93,axiom,
~ cycle(e_1,e_1) ).
cnf(u98,axiom,
cycle(e_1,e_0) ).
cnf(u120,axiom,
~ greater(e_0,e_0) ).
cnf(u124,axiom,
~ next(e_4,e_4) ).
cnf(u136,axiom,
~ next(e_2,e_4) ).
cnf(u141,axiom,
~ next(e_1,e_4) ).
cnf(u166,axiom,
~ next(e_3,e_1) ).
cnf(u174,axiom,
~ next(e_2,e_1) ).
cnf(u179,axiom,
~ next(e_1,e_1) ).
cnf(u191,axiom,
~ next(e_3,e_2) ).
cnf(u196,axiom,
~ next(e_2,e_2) ).
cnf(u234,axiom,
~ next(e_3,e_3) ).
cnf(u243,axiom,
~ next(e_1,e_3) ).
cnf(u253,axiom,
~ greater(e_0,e_3) ).
cnf(u261,axiom,
~ greater(e_1,e_3) ).
cnf(u264,axiom,
( ~ cycle(X0,e_0)
| ~ greater(X0,e_3)
| ~ next(X0,e_1) ) ).
cnf(u269,axiom,
~ greater(e_2,e_3) ).
cnf(u272,axiom,
( ~ cycle(X0,e_0)
| ~ greater(X0,e_2)
| ~ next(X0,e_1) ) ).
cnf(u277,axiom,
~ greater(e_3,e_3) ).
cnf(u289,axiom,
~ greater(e_0,e_1) ).
cnf(u297,axiom,
~ greater(e_1,e_1) ).
cnf(u314,axiom,
~ greater(e_0,e_2) ).
cnf(u322,axiom,
~ greater(e_1,e_2) ).
cnf(u330,axiom,
~ greater(e_2,e_2) ).
cnf(u365,axiom,
~ product(e_4,e_1,e_4) ).
cnf(u369,axiom,
~ product(e_4,e_1,e_3) ).
cnf(u374,axiom,
product(e_4,e_1,e_2) ).
cnf(u377,axiom,
~ product(e_4,e_1,e_1) ).
cnf(u383,axiom,
product(e_3,e_1,e_4) ).
cnf(u386,axiom,
~ product(e_3,e_1,e_3) ).
cnf(u390,axiom,
~ product(e_3,e_1,e_2) ).
cnf(u394,axiom,
~ product(e_3,e_1,e_1) ).
cnf(u399,axiom,
~ product(e_2,e_1,e_4) ).
cnf(u404,axiom,
product(e_2,e_1,e_3) ).
cnf(u407,axiom,
~ product(e_2,e_1,e_2) ).
cnf(u411,axiom,
~ product(e_2,e_1,e_1) ).
cnf(u416,axiom,
~ product(e_1,e_1,e_4) ).
cnf(u420,axiom,
~ product(e_1,e_1,e_3) ).
cnf(u424,axiom,
~ product(e_1,e_1,e_2) ).
cnf(u429,axiom,
product(e_1,e_1,e_1) ).
cnf(u440,axiom,
( ~ next(e_4,X1)
| equalish(e_4,X1) ) ).
cnf(u443,axiom,
( ~ cycle(e_4,X0)
| ~ greater(X0,e_0) ) ).
cnf(u493,axiom,
( ~ next(e_3,X1)
| equalish(e_4,X1) ) ).
cnf(u541,axiom,
( ~ cycle(e_1,X0)
| ~ greater(X0,e_0) ) ).
cnf(u573,axiom,
~ product(e_3,e_2,e_4) ).
cnf(u577,axiom,
~ product(e_3,e_2,e_3) ).
cnf(u581,axiom,
~ product(e_3,e_2,e_2) ).
cnf(u586,axiom,
product(e_3,e_2,e_1) ).
cnf(u590,axiom,
~ product(e_2,e_2,e_4) ).
cnf(u594,axiom,
~ product(e_2,e_2,e_3) ).
cnf(u599,axiom,
product(e_2,e_2,e_2) ).
cnf(u602,axiom,
~ product(e_2,e_2,e_1) ).
cnf(u608,axiom,
product(e_1,e_2,e_4) ).
cnf(u611,axiom,
~ product(e_1,e_2,e_3) ).
cnf(u615,axiom,
~ product(e_1,e_2,e_2) ).
cnf(u619,axiom,
~ product(e_1,e_2,e_1) ).
cnf(u624,negated_conjecture,
~ product(e_4,e_2,e_4) ).
cnf(u629,negated_conjecture,
product(e_4,e_2,e_3) ).
cnf(u632,negated_conjecture,
~ product(e_4,e_2,e_2) ).
cnf(u637,axiom,
~ product(e_4,e_2,e_1) ).
cnf(u763,axiom,
( ~ next(e_2,X1)
| equalish(e_3,X1) ) ).
cnf(u830,axiom,
( ~ next(e_1,X1)
| equalish(e_2,X1) ) ).
cnf(u1107,axiom,
~ product(e_3,e_3,e_4) ).
cnf(u1112,axiom,
product(e_3,e_3,e_3) ).
cnf(u1115,axiom,
~ product(e_3,e_3,e_2) ).
cnf(u1119,axiom,
~ product(e_3,e_3,e_1) ).
cnf(u1125,axiom,
product(e_2,e_3,e_4) ).
cnf(u1128,axiom,
~ product(e_2,e_3,e_3) ).
cnf(u1132,axiom,
~ product(e_2,e_3,e_2) ).
cnf(u1136,axiom,
~ product(e_2,e_3,e_1) ).
cnf(u1141,axiom,
~ product(e_1,e_3,e_4) ).
cnf(u1145,axiom,
~ product(e_1,e_3,e_3) ).
cnf(u1150,axiom,
product(e_1,e_3,e_2) ).
cnf(u1153,axiom,
~ product(e_1,e_3,e_1) ).
cnf(u1158,negated_conjecture,
~ product(e_4,e_3,e_4) ).
cnf(u1162,negated_conjecture,
~ product(e_4,e_3,e_3) ).
cnf(u1166,negated_conjecture,
~ product(e_4,e_3,e_2) ).
cnf(u1291,axiom,
~ product(e_3,e_4,e_4) ).
cnf(u1295,axiom,
~ product(e_3,e_4,e_3) ).
cnf(u1300,axiom,
product(e_3,e_4,e_2) ).
cnf(u1303,axiom,
~ product(e_3,e_4,e_1) ).
cnf(u1308,axiom,
~ product(e_2,e_4,e_4) ).
cnf(u1312,axiom,
~ product(e_2,e_4,e_3) ).
cnf(u1316,axiom,
~ product(e_2,e_4,e_2) ).
cnf(u1321,axiom,
product(e_2,e_4,e_1) ).
cnf(u1325,axiom,
~ product(e_1,e_4,e_4) ).
cnf(u1330,axiom,
product(e_1,e_4,e_3) ).
cnf(u1333,axiom,
~ product(e_1,e_4,e_2) ).
cnf(u1337,axiom,
~ product(e_1,e_4,e_1) ).
cnf(u1343,negated_conjecture,
product(e_4,e_4,e_4) ).
cnf(u1346,negated_conjecture,
~ product(e_4,e_4,e_3) ).
cnf(u1350,negated_conjecture,
~ product(e_4,e_4,e_2) ).
cnf(u2018,axiom,
( ~ product(X0,e_4,e_2)
| equalish(X0,e_3) ) ).
cnf(u1935,axiom,
( ~ product(e_2,X0,e_3)
| equalish(X0,e_1) ) ).
cnf(u2027,axiom,
( ~ product(e_1,X0,e_2)
| equalish(X0,e_3) ) ).
cnf(u1542,axiom,
( ~ cycle(X1,X2)
| ~ cycle(X0,e_0)
| ~ next(X0,e_1)
| ~ greater(X0,X1)
| ~ greater(X2,e_0) ) ).
cnf(u2021,negated_conjecture,
( ~ product(e_3,X0,e_4)
| product(e_2,X0,e_3) ) ).
cnf(u1988,axiom,
( ~ product(e_3,X0,e_3)
| equalish(X0,e_3) ) ).
cnf(u2144,axiom,
( ~ next(e_0,X0)
| equalish(e_1,X0) ) ).
cnf(u1940,axiom,
( ~ product(e_3,X0,e_1)
| equalish(X0,e_2) ) ).
cnf(u43,axiom,
( ~ cycle(e_4,X0)
| equalish(X0,e_0) ) ).
cnf(u1936,axiom,
( ~ product(e_2,e_1,X0)
| equalish(X0,e_3) ) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1) ).
cnf(product_total_function2,axiom,
( ~ product(X0,X1,X3)
| ~ product(X0,X1,X2)
| equalish(X2,X3) ) ).
cnf(u1500,negated_conjecture,
equalish(e_3,e_3) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2) ).
cnf(element_4,axiom,
group_element(e_4) ).
cnf(u2044,axiom,
( ~ product(X0,e_4,e_3)
| equalish(X0,e_1) ) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4) ).
cnf(cycle5,axiom,
( ~ cycle(X3,X4)
| ~ cycle(X2,e_0)
| ~ cycle(X0,X1)
| ~ next(X2,X3)
| ~ greater(X2,X0)
| ~ greater(X1,X4) ) ).
cnf(element_1,axiom,
group_element(e_1) ).
cnf(u1675,axiom,
( ~ product(e_2,X0,e_2)
| equalish(X0,e_2) ) ).
cnf(cycle7,axiom,
( ~ product(X0,e_1,X2)
| ~ cycle(X0,X1)
| ~ greater(X1,e_0)
| ~ next(X0,X3)
| equalish(X2,X3) ) ).
cnf(u2168,axiom,
( ~ cycle(X0,X1)
| ~ next(X0,e_2)
| ~ greater(X1,e_0)
| ~ next(e_2,X2)
| equalish(X1,X2) ) ).
cnf(e_4_greater_e_0,axiom,
greater(e_4,e_0) ).
cnf(u1955,negated_conjecture,
( ~ product(e_1,X0,e_2)
| product(e_4,X0,e_1) ) ).
cnf(cycle1,axiom,
( ~ cycle(X0,X2)
| ~ cycle(X0,X1)
| equalish(X1,X2) ) ).
cnf(e_1_then_e_2,axiom,
next(e_1,e_2) ).
cnf(e_0_then_e_1,axiom,
next(e_0,e_1) ).
cnf(u1967,axiom,
( ~ product(e_2,e_3,X0)
| equalish(X0,e_4) ) ).
cnf(u1931,negated_conjecture,
( ~ product(e_3,X0,e_1)
| product(e_4,X0,e_3) ) ).
cnf(u1463,negated_conjecture,
product(e_4,e_3,e_1) ).
cnf(u2114,axiom,
~ next(e_4,e_1) ).
cnf(u1880,negated_conjecture,
( ~ product(X0,e_2,e_3)
| equalish(X0,e_4) ) ).
cnf(u2026,axiom,
( ~ product(X0,e_3,e_2)
| equalish(X0,e_1) ) ).
cnf(u2137,axiom,
( ~ cycle(X1,X2)
| ~ cycle(X0,e_0)
| ~ next(X0,e_3)
| ~ greater(X0,X1)
| ~ greater(X2,e_1) ) ).
cnf(u1912,negated_conjecture,
( ~ product(X0,e_3,e_1)
| equalish(X0,e_4) ) ).
cnf(u202,axiom,
( ~ cycle(X1,X2)
| ~ cycle(X0,e_0)
| ~ next(X0,e_4)
| ~ greater(X0,X1)
| ~ greater(X2,e_0) ) ).
cnf(u748,axiom,
equalish(e_4,e_4) ).
cnf(u2020,axiom,
( ~ product(e_3,e_4,X0)
| equalish(X0,e_2) ) ).
cnf(e_3_then_e_4,axiom,
next(e_3,e_4) ).
cnf(u2029,negated_conjecture,
( ~ product(e_1,X0,e_3)
| product(e_2,X0,e_1) ) ).
cnf(u1907,axiom,
( ~ product(e_4,X0,e_2)
| equalish(X0,e_1) ) ).
cnf(u1968,negated_conjecture,
( ~ product(e_2,X0,e_3)
| product(e_4,X0,e_2) ) ).
cnf(u1555,axiom,
( ~ product(e_1,e_1,X0)
| equalish(X0,e_1) ) ).
cnf(u2047,negated_conjecture,
( ~ product(e_1,X0,e_4)
| product(e_3,X0,e_1) ) ).
cnf(product_right_cancellation,axiom,
( ~ product(X0,X3,X2)
| ~ product(X0,X1,X2)
| equalish(X1,X3) ) ).
cnf(u355,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_3_is_not_e_4,axiom,
~ equalish(e_3,e_4) ).
cnf(u1883,negated_conjecture,
( ~ product(e_4,X0,e_2)
| product(e_3,X0,e_4) ) ).
cnf(u1540,axiom,
( ~ cycle(e_1,X0)
| equalish(X0,e_0) ) ).
cnf(u357,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(u1954,axiom,
( ~ product(e_1,e_2,X0)
| equalish(X0,e_4) ) ).
cnf(u1934,axiom,
( ~ product(X0,e_1,e_3)
| equalish(X0,e_2) ) ).
cnf(u1906,axiom,
( ~ product(X0,e_1,e_2)
| equalish(X0,e_4) ) ).
cnf(u1930,axiom,
( ~ product(e_3,e_1,X0)
| equalish(X0,e_4) ) ).
cnf(u1915,negated_conjecture,
( ~ product(e_4,X0,e_3)
| product(e_1,X0,e_4) ) ).
cnf(u462,axiom,
~ greater(e_2,e_4) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2) ).
cnf(u1953,axiom,
( ~ product(e_1,X0,e_4)
| equalish(X0,e_2) ) ).
cnf(e_4_is_not_e_2,axiom,
~ equalish(e_4,e_2) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1) ).
cnf(cycle2,axiom,
( ~ group_element(X0)
| cycle(X0,e_0)
| cycle(X0,e_1)
| cycle(X0,e_2)
| cycle(X0,e_3) ) ).
cnf(element_2,axiom,
group_element(e_2) ).
cnf(e_3_greater_e_1,axiom,
greater(e_3,e_1) ).
cnf(u2169,axiom,
( ~ cycle(X1,X2)
| ~ cycle(X0,e_0)
| ~ next(X0,e_2)
| ~ greater(X0,X1)
| ~ greater(X2,e_2) ) ).
cnf(u1987,axiom,
( ~ product(X0,e_3,e_3)
| equalish(X0,e_3) ) ).
cnf(e_2_greater_e_1,axiom,
greater(e_2,e_1) ).
cnf(u2028,axiom,
( ~ product(e_1,e_3,X0)
| equalish(X0,e_2) ) ).
cnf(u1578,negated_conjecture,
( ~ product(e_4,X0,e_4)
| equalish(X0,e_4) ) ).
cnf(e_3_greater_e_2,axiom,
greater(e_3,e_2) ).
cnf(e_2_then_e_3,axiom,
next(e_2,e_3) ).
cnf(e_2_greater_e_0,axiom,
greater(e_2,e_0) ).
cnf(u1541,axiom,
( ~ cycle(X0,X1)
| ~ next(X0,e_1)
| ~ greater(X1,e_0)
| ~ next(e_0,X2)
| equalish(X1,X2) ) ).
cnf(e_1_greater_e_0,axiom,
greater(e_1,e_0) ).
cnf(u1939,axiom,
( ~ product(X0,e_2,e_1)
| equalish(X0,e_3) ) ).
cnf(u2034,negated_conjecture,
( ~ product(e_2,X0,e_4)
| product(e_1,X0,e_2) ) ).
cnf(u1501,negated_conjecture,
equalish(e_1,e_1) ).
cnf(u1966,axiom,
( ~ product(e_2,X0,e_4)
| equalish(X0,e_3) ) ).
cnf(u1929,axiom,
( ~ product(e_3,X0,e_4)
| equalish(X0,e_1) ) ).
cnf(u1577,negated_conjecture,
( ~ product(X0,e_4,e_4)
| equalish(X0,e_4) ) ).
cnf(u1579,negated_conjecture,
( ~ product(e_4,e_4,X0)
| equalish(X0,e_4) ) ).
cnf(u1942,negated_conjecture,
( ~ product(e_3,X0,e_2)
| product(e_1,X0,e_3) ) ).
cnf(u1914,negated_conjecture,
( ~ product(e_4,e_3,X0)
| equalish(X0,e_1) ) ).
cnf(u2167,axiom,
( ~ cycle(e_2,X0)
| equalish(X0,e_2) ) ).
cnf(u2183,axiom,
( ~ cycle(X0,e_0)
| ~ next(X0,e_3)
| ~ greater(X0,e_2) ) ).
cnf(u1554,axiom,
( ~ product(e_1,X0,e_1)
| equalish(X0,e_1) ) ).
cnf(u1553,axiom,
( ~ product(X0,e_1,e_1)
| equalish(X0,e_1) ) ).
cnf(u2033,axiom,
( ~ product(e_2,e_4,X0)
| equalish(X0,e_1) ) ).
cnf(u2142,axiom,
( ~ cycle(X0,e_0)
| ~ next(X0,e_4)
| ~ greater(X0,e_3) ) ).
cnf(u109,axiom,
( ~ cycle(X0,X1)
| ~ next(X0,e_4)
| ~ greater(X1,e_0)
| ~ next(e_0,X2)
| equalish(X1,X2) ) ).
cnf(u2135,axiom,
( ~ cycle(e_3,X0)
| equalish(X0,e_1) ) ).
cnf(u926,axiom,
equalish(e_2,e_2) ).
cnf(u1965,axiom,
( ~ product(X0,e_3,e_4)
| equalish(X0,e_2) ) ).
cnf(u1908,axiom,
( ~ product(e_4,e_1,X0)
| equalish(X0,e_2) ) ).
cnf(qg3,negated_conjecture,
( ~ product(X0,X2,X3)
| ~ product(X0,X1,X2)
| product(X3,X1,X0) ) ).
cnf(u2019,axiom,
( ~ product(e_3,X0,e_2)
| equalish(X0,e_4) ) ).
cnf(product_left_cancellation,axiom,
( ~ product(X3,X1,X2)
| ~ product(X0,X1,X2)
| equalish(X0,X3) ) ).
cnf(u44,axiom,
equalish(e_0,e_0) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1) ).
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(u1909,negated_conjecture,
( ~ product(e_4,X0,e_1)
| product(e_2,X0,e_4) ) ).
cnf(e_4_is_not_e_3,axiom,
~ equalish(e_4,e_3) ).
cnf(u2031,axiom,
( ~ product(X0,e_4,e_1)
| equalish(X0,e_2) ) ).
cnf(u1928,axiom,
( ~ product(X0,e_1,e_4)
| equalish(X0,e_3) ) ).
cnf(element_3,axiom,
group_element(e_3) ).
cnf(e_2_is_not_e_4,axiom,
~ equalish(e_2,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(cycle3,axiom,
cycle(e_4,e_0) ).
cnf(u1676,axiom,
( ~ product(e_2,e_2,X0)
| equalish(X0,e_2) ) ).
cnf(u2046,axiom,
( ~ product(e_1,e_4,X0)
| equalish(X0,e_3) ) ).
cnf(u1952,axiom,
( ~ product(X0,e_2,e_4)
| equalish(X0,e_1) ) ).
cnf(u1881,negated_conjecture,
( ~ product(e_4,X0,e_3)
| equalish(X0,e_2) ) ).
cnf(u1989,axiom,
( ~ product(e_3,e_3,X0)
| equalish(X0,e_3) ) ).
cnf(u305,axiom,
~ next(e_4,e_3) ).
cnf(u1941,axiom,
( ~ product(e_3,e_2,X0)
| equalish(X0,e_1) ) ).
cnf(u1913,negated_conjecture,
( ~ product(e_4,X0,e_1)
| equalish(X0,e_3) ) ).
cnf(e_4_greater_e_3,axiom,
greater(e_4,e_3) ).
cnf(u1937,negated_conjecture,
( ~ product(e_2,X0,e_1)
| product(e_3,X0,e_2) ) ).
cnf(cycle6,axiom,
( ~ product(X0,e_1,X1)
| ~ cycle(X0,e_0)
| ~ greater(X1,X0) ) ).
cnf(e_4_greater_e_1,axiom,
greater(e_4,e_1) ).
cnf(e_4_greater_e_2,axiom,
greater(e_4,e_2) ).
cnf(u2045,axiom,
( ~ product(e_1,X0,e_3)
| equalish(X0,e_4) ) ).
cnf(u2032,axiom,
( ~ product(e_2,X0,e_1)
| equalish(X0,e_4) ) ).
cnf(e_3_greater_e_0,axiom,
greater(e_3,e_0) ).
cnf(u356,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(u1674,axiom,
( ~ product(X0,e_2,e_2)
| equalish(X0,e_2) ) ).
cnf(u1882,negated_conjecture,
( ~ product(e_4,e_2,X0)
| equalish(X0,e_3) ) ).
cnf(u358,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(u2136,axiom,
( ~ cycle(X0,X1)
| ~ next(X0,e_3)
| ~ greater(X1,e_0)
| ~ next(e_1,X2)
| equalish(X1,X2) ) ).
cnf(u2175,axiom,
( ~ cycle(X0,e_0)
| ~ next(X0,e_4)
| ~ greater(X0,e_2) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP130-3.004 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n015.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 09:32:47 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 3.20/1.60 % (1399098)Input is clausal, will run a generic CNF schedule.
% 3.20/1.60 % (1399103)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=144546890:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.20/1.60 % (1399105)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=792363295:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.20/1.60 % (1399107)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=992165033:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.20/1.60 % (1399108)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1761789128:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.20/1.60 % (1399106)lrs+10_1_sil=8000:sp=occurrence:random_seed=3703690929:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.20/1.60 % (1399109)dis-21_1_sil=8000:lcm=predicate:random_seed=2941259043: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)
% 3.20/1.60 % (1399104)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2557202394:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.20/1.60 % (1399106)Instruction limit reached!
% 3.20/1.60 % (1399106)------------------------------
% 3.20/1.60 % (1399106)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.20/1.60 % (1399106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.20/1.60 % (1399106)CaDiCaL version: 2.1.3
% 3.20/1.60 % (1399106)Termination reason: Instruction limit
% 3.20/1.60 % (1399106)Termination phase: Saturation
% 3.20/1.60 % (1399106)Time elapsed: 0.063 s
% 3.20/1.60 % (1399106)Peak memory usage: 88 MB
% 3.20/1.60 % (1399106)Instructions burned: 108 (million)
% 3.20/1.60 % (1399107)Instruction limit reached!
% 3.20/1.60 % (1399107)------------------------------
% 3.20/1.60 % (1399107)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.20/1.60 % (1399107)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.20/1.60 % (1399107)CaDiCaL version: 2.1.3
% 3.20/1.60 % (1399107)Termination reason: Instruction limit
% 3.20/1.60 % (1399107)Termination phase: Saturation
% 3.20/1.60 % (1399107)Time elapsed: 0.064 s
% 3.20/1.60 % (1399107)Peak memory usage: 88 MB
% 3.20/1.60 % (1399107)Instructions burned: 115 (million)
% 3.20/1.60 % (1399109)Instruction limit reached!
% 3.20/1.60 % (1399109)------------------------------
% 3.20/1.60 % (1399109)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.20/1.60 % (1399109)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.20/1.60 % (1399109)CaDiCaL version: 2.1.3
% 3.20/1.60 % (1399109)Termination reason: Instruction limit
% 3.20/1.60 % (1399109)Termination phase: Saturation
% 3.20/1.60 % (1399109)Time elapsed: 0.079 s
% 3.20/1.60 % (1399109)Peak memory usage: 89 MB
% 3.20/1.60 % (1399109)Instructions burned: 118 (million)
% 3.20/1.60 % (1399108)Instruction limit reached!
% 3.20/1.60 % (1399108)------------------------------
% 3.20/1.60 % (1399108)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.20/1.60 % (1399108)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.20/1.60 % (1399108)CaDiCaL version: 2.1.3
% 3.20/1.60 % (1399108)Termination reason: Instruction limit
% 3.20/1.60 % (1399108)Termination phase: Saturation
% 3.20/1.60 % (1399108)Time elapsed: 0.116 s
% 3.20/1.60 % (1399108)Peak memory usage: 89 MB
% 3.20/1.60 % (1399108)Instructions burned: 180 (million)
% 3.20/1.60 % (1399118)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2858847306: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)
% 3.20/1.60 % (1399117)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=3196027493:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 3.20/1.60 % (1399118)Refutation not found, incomplete strategy
% 3.20/1.60 % (1399118)------------------------------
% 3.20/1.60 % (1399118)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.20/1.60 % (1399118)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.20/1.60 % (1399118)CaDiCaL version: 2.1.3
% 3.20/1.60 % (1399118)Termination reason: Refutation not found, incomplete strategy
% 3.20/1.60 % (1399118)Time elapsed: 0.002 s
% 3.20/1.60 % (1399118)Peak memory usage: 87 MB
% 3.20/1.60 % (1399118)Instructions burned: 2 (million)
% 3.20/1.60 % (1399119)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=2343453464:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 3.20/1.60 % (1399120)lrs+10_64_to=lpo:sil=8000:random_seed=2108175949:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 3.20/1.60 % (1399120)First to succeed.
% 3.20/1.60 % (1399117)Instruction limit reached!
% 3.20/1.60 % (1399117)------------------------------
% 3.20/1.60 % (1399117)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.20/1.60 % (1399117)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.20/1.60 % (1399117)CaDiCaL version: 2.1.3
% 3.20/1.60 % (1399117)Termination reason: Instruction limit
% 3.20/1.60 % (1399117)Termination phase: Saturation
% 3.20/1.60 % (1399117)Time elapsed: 0.088 s
% 3.20/1.60 % (1399117)Peak memory usage: 88 MB
% 3.20/1.60 % (1399117)Instructions burned: 143 (million)
% 3.20/1.60 % (1399120)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1399098"
% 3.20/1.60 % (1399119)Instruction limit reached!
% 3.20/1.60 % (1399119)------------------------------
% 3.20/1.60 % (1399119)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.20/1.60 % (1399119)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.20/1.60 % (1399119)CaDiCaL version: 2.1.3
% 3.20/1.60 % (1399119)Termination reason: Instruction limit
% 3.20/1.60 % (1399119)Termination phase: Saturation
% 3.20/1.60 % (1399119)Time elapsed: 0.128 s
% 3.20/1.60 % (1399119)Peak memory usage: 89 MB
% 3.20/1.60 % (1399119)Instructions burned: 220 (million)
% 3.20/1.60 % (1399118)------------------------------
% 3.20/1.60 % (1399118)------------------------------
% 3.20/1.60 % (1399125)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=3773687422:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 3.20/1.60 % (1399126)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=189616095:i=157:gtg=all_2994 on theBenchmark for (2994ds/157Mi)
% 3.20/1.60 % (1399125)Instruction limit reached!
% 3.20/1.60 % (1399125)------------------------------
% 3.20/1.60 % (1399125)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.20/1.60 % (1399125)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.20/1.60 % (1399125)CaDiCaL version: 2.1.3
% 3.20/1.60 % (1399125)Termination reason: Instruction limit
% 3.20/1.60 % (1399125)Termination phase: Saturation
% 3.20/1.60 % (1399125)Time elapsed: 0.073 s
% 3.20/1.60 % (1399125)Peak memory usage: 87 MB
% 3.20/1.60 % (1399125)Instructions burned: 196 (million)
% 3.20/1.60 % SZS status Satisfiable for theBenchmark
% 3.20/1.60 % SZS output start Saturation.
% See solution above
% 0.15/1.80 % SZS output start Definitions and Model Updates.
% 0.15/1.80 % SZS output end Definitions and Model Updates.
% 0.15/1.80 % (1399120)------------------------------
% 0.15/1.80 % (1399120)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.15/1.80 % (1399120)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/1.80 % (1399120)CaDiCaL version: 2.1.3
% 0.15/1.80 % (1399120)Termination reason: Satisfiable
% 0.15/1.80 % (1399120)Time elapsed: 0.035 s
% 0.15/1.80 % (1399120)Peak memory usage: 88 MB
% 0.15/1.80 % (1399120)Instructions burned: 53 (million)
% 0.15/1.80 % (1399120)------------------------------
% 0.15/1.80 % (1399120)------------------------------
% 0.15/1.80 % (1399098)Success in time 0.743 s
% 0.15/1.80 % Vampire exiting
%------------------------------------------------------------------------------