%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP124-8.005 : 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 : n008.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:43 AM UTC 2026
% Result : Satisfiable 4.12s 1.54s
% Output : Saturation 5.37s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u87,axiom,
~ cycle(e_4,e_4) ).
cnf(u91,axiom,
~ cycle(e_4,e_3) ).
cnf(u95,axiom,
~ cycle(e_4,e_2) ).
cnf(u100,axiom,
cycle(e_4,e_1) ).
cnf(u103,axiom,
~ cycle(e_4,e_0) ).
cnf(u108,axiom,
~ cycle(e_3,e_4) ).
cnf(u112,axiom,
~ cycle(e_3,e_3) ).
cnf(u117,axiom,
cycle(e_3,e_2) ).
cnf(u120,axiom,
~ cycle(e_3,e_1) ).
cnf(u129,axiom,
~ cycle(e_2,e_4) ).
cnf(u133,axiom,
~ cycle(e_2,e_3) ).
cnf(u137,axiom,
~ cycle(e_2,e_2) ).
cnf(u141,axiom,
~ cycle(e_2,e_1) ).
cnf(u146,axiom,
cycle(e_2,e_0) ).
cnf(u150,axiom,
~ cycle(e_1,e_4) ).
cnf(u154,axiom,
~ cycle(e_1,e_3) ).
cnf(u158,axiom,
~ cycle(e_1,e_2) ).
cnf(u162,axiom,
~ cycle(e_1,e_1) ).
cnf(u167,axiom,
cycle(e_1,e_0) ).
cnf(u193,axiom,
~ greater(e_0,e_0) ).
cnf(u197,axiom,
~ next(e_5,e_5) ).
cnf(u210,axiom,
~ next(e_3,e_5) ).
cnf(u215,axiom,
~ next(e_2,e_5) ).
cnf(u220,axiom,
~ next(e_1,e_5) ).
cnf(u256,axiom,
~ next(e_4,e_1) ).
cnf(u264,axiom,
~ next(e_3,e_1) ).
cnf(u269,axiom,
~ next(e_2,e_1) ).
cnf(u274,axiom,
~ next(e_1,e_1) ).
cnf(u288,axiom,
~ next(e_4,e_2) ).
cnf(u293,axiom,
~ next(e_3,e_2) ).
cnf(u298,axiom,
~ next(e_2,e_2) ).
cnf(u319,axiom,
~ next(e_4,e_3) ).
cnf(u324,axiom,
~ next(e_3,e_3) ).
cnf(u330,axiom,
~ next(e_1,e_3) ).
cnf(u374,axiom,
~ next(e_4,e_4) ).
cnf(u383,axiom,
~ next(e_1,e_4) ).
cnf(u531,axiom,
~ greater(e_0,e_4) ).
cnf(u539,axiom,
~ greater(e_1,e_4) ).
cnf(u542,axiom,
( ~ cycle(X0,e_0)
| ~ greater(X0,e_4)
| ~ next(X0,e_2) ) ).
cnf(u546,axiom,
( ~ cycle(X0,e_0)
| ~ greater(X0,e_3)
| ~ next(X0,e_2) ) ).
cnf(u551,axiom,
~ greater(e_4,e_4) ).
cnf(u568,axiom,
~ greater(e_0,e_1) ).
cnf(u576,axiom,
~ greater(e_1,e_1) ).
cnf(u612,axiom,
~ greater(e_2,e_4) ).
cnf(u630,axiom,
~ greater(e_1,e_3) ).
cnf(u645,axiom,
~ next(e_2,e_4) ).
cnf(u697,axiom,
~ greater(e_3,e_4) ).
cnf(u801,axiom,
~ greater(e_0,e_2) ).
cnf(u806,axiom,
~ greater(e_1,e_2) ).
cnf(u811,axiom,
~ greater(e_2,e_2) ).
cnf(u848,axiom,
~ product1(e_5,e_1,e_5) ).
cnf(u852,axiom,
~ product1(e_5,e_1,e_4) ).
cnf(u856,axiom,
~ product1(e_5,e_1,e_3) ).
cnf(u861,axiom,
product1(e_5,e_1,e_2) ).
cnf(u864,axiom,
~ product1(e_5,e_1,e_1) ).
cnf(u869,axiom,
~ product1(e_4,e_1,e_5) ).
cnf(u873,axiom,
~ product1(e_4,e_1,e_4) ).
cnf(u878,axiom,
product1(e_4,e_1,e_3) ).
cnf(u881,axiom,
~ product1(e_4,e_1,e_2) ).
cnf(u885,axiom,
~ product1(e_4,e_1,e_1) ).
cnf(u890,axiom,
~ product1(e_3,e_1,e_5) ).
cnf(u895,axiom,
product1(e_3,e_1,e_4) ).
cnf(u898,axiom,
~ product1(e_3,e_1,e_3) ).
cnf(u902,axiom,
~ product1(e_3,e_1,e_2) ).
cnf(u906,axiom,
~ product1(e_3,e_1,e_1) ).
cnf(u912,axiom,
product1(e_2,e_1,e_5) ).
cnf(u915,axiom,
~ product1(e_2,e_1,e_4) ).
cnf(u919,axiom,
~ product1(e_2,e_1,e_3) ).
cnf(u923,axiom,
~ product1(e_2,e_1,e_2) ).
cnf(u927,axiom,
~ product1(e_2,e_1,e_1) ).
cnf(u980,axiom,
~ product1(e_5,e_2,e_5) ).
cnf(u985,axiom,
product1(e_5,e_2,e_4) ).
cnf(u988,axiom,
~ product1(e_5,e_2,e_3) ).
cnf(u992,axiom,
~ product1(e_5,e_2,e_2) ).
cnf(u996,axiom,
~ product1(e_5,e_2,e_1) ).
cnf(u1002,axiom,
product1(e_4,e_2,e_5) ).
cnf(u1005,axiom,
~ product1(e_4,e_2,e_4) ).
cnf(u1009,axiom,
~ product1(e_4,e_2,e_3) ).
cnf(u1013,axiom,
~ product1(e_4,e_2,e_2) ).
cnf(u1017,axiom,
~ product1(e_4,e_2,e_1) ).
cnf(u1022,axiom,
~ product1(e_3,e_2,e_5) ).
cnf(u1026,axiom,
~ product1(e_3,e_2,e_4) ).
cnf(u1030,axiom,
~ product1(e_3,e_2,e_3) ).
cnf(u1034,axiom,
~ product1(e_3,e_2,e_2) ).
cnf(u1039,axiom,
product1(e_3,e_2,e_1) ).
cnf(u1052,axiom,
product1(e_1,e_2,e_3) ).
cnf(u1059,axiom,
~ product1(e_1,e_2,e_1) ).
cnf(u1221,axiom,
~ product1(e_5,e_3,e_5) ).
cnf(u1225,axiom,
~ product1(e_5,e_3,e_4) ).
cnf(u1229,axiom,
~ product1(e_5,e_3,e_3) ).
cnf(u1233,axiom,
~ product1(e_5,e_3,e_2) ).
cnf(u1238,axiom,
product1(e_5,e_3,e_1) ).
cnf(u1242,axiom,
~ product1(e_4,e_3,e_5) ).
cnf(u1246,axiom,
~ product1(e_4,e_3,e_4) ).
cnf(u1250,axiom,
~ product1(e_4,e_3,e_3) ).
cnf(u1255,axiom,
product1(e_4,e_3,e_2) ).
cnf(u1258,axiom,
~ product1(e_4,e_3,e_1) ).
cnf(u1263,axiom,
~ product1(e_2,e_3,e_5) ).
cnf(u1268,axiom,
product1(e_2,e_3,e_4) ).
cnf(u1271,axiom,
~ product1(e_2,e_3,e_3) ).
cnf(u1275,axiom,
~ product1(e_2,e_3,e_2) ).
cnf(u1279,axiom,
~ product1(e_2,e_3,e_1) ).
cnf(u1285,axiom,
product1(e_1,e_3,e_5) ).
cnf(u1288,axiom,
~ product1(e_1,e_3,e_4) ).
cnf(u1292,axiom,
~ product1(e_1,e_3,e_3) ).
cnf(u1296,axiom,
~ product1(e_1,e_3,e_2) ).
cnf(u1300,axiom,
~ product1(e_1,e_3,e_1) ).
cnf(u1479,axiom,
~ product1(e_5,e_4,e_5) ).
cnf(u1483,axiom,
~ product1(e_5,e_4,e_4) ).
cnf(u1488,axiom,
product1(e_5,e_4,e_3) ).
cnf(u1501,axiom,
product1(e_3,e_4,e_5) ).
cnf(u1504,axiom,
~ product1(e_3,e_4,e_4) ).
cnf(u1529,axiom,
~ product1(e_2,e_4,e_3) ).
cnf(u1533,axiom,
~ product1(e_2,e_4,e_2) ).
cnf(u1538,axiom,
product1(e_2,e_4,e_1) ).
cnf(u1542,axiom,
~ product1(e_1,e_4,e_5) ).
cnf(u1555,axiom,
product1(e_1,e_4,e_2) ).
cnf(u1728,axiom,
~ product1(e_4,e_5,e_5) ).
cnf(u1732,axiom,
~ product1(e_4,e_5,e_4) ).
cnf(u1745,axiom,
product1(e_4,e_5,e_1) ).
cnf(u1753,axiom,
~ product1(e_3,e_5,e_4) ).
cnf(u1762,axiom,
product1(e_3,e_5,e_2) ).
cnf(u1774,axiom,
~ product1(e_2,e_5,e_4) ).
cnf(u1779,axiom,
product1(e_2,e_5,e_3) ).
cnf(u1791,axiom,
~ product1(e_1,e_5,e_5) ).
cnf(u1796,axiom,
product1(e_1,e_5,e_4) ).
cnf(u1799,axiom,
~ product1(e_1,e_5,e_3) ).
cnf(u1803,axiom,
~ product1(e_1,e_5,e_2) ).
cnf(u1807,axiom,
~ product1(e_1,e_5,e_1) ).
cnf(u1977,axiom,
product2(e_5,e_1,e_4) ).
cnf(u1988,axiom,
~ product2(e_5,e_1,e_1) ).
cnf(u1994,axiom,
product2(e_3,e_1,e_5) ).
cnf(u2009,axiom,
~ product2(e_3,e_1,e_1) ).
cnf(u2171,axiom,
product2(e_1,e_2,e_5) ).
cnf(u2178,axiom,
~ product2(e_1,e_2,e_3) ).
cnf(u702,axiom,
( ~ group_element(X0)
| product1(X0,e_3,e_1)
| product1(X0,e_3,e_2)
| product1(X0,e_3,e_3)
| product1(X0,e_3,e_4)
| product1(X0,e_3,e_5) ) ).
cnf(product1_left_cancellation,axiom,
( ~ product1(X3,X1,X2)
| ~ product1(X0,X1,X2)
| equalish(X0,X3) ) ).
cnf(u701,axiom,
( ~ group_element(X0)
| product1(X0,e_2,e_1)
| product1(X0,e_2,e_2)
| product1(X0,e_2,e_3)
| product1(X0,e_2,e_4)
| product1(X0,e_2,e_5) ) ).
cnf(qg2a,negated_conjecture,
( ~ product1(X2,X0,X3)
| ~ product1(X0,X1,X2)
| product2(X3,X1,X0) ) ).
cnf(e_5_is_not_e_2,axiom,
~ equalish(e_5,e_2) ).
cnf(u2027,axiom,
( ~ product1(X0,e_3,e_4)
| equalish(X0,e_2) ) ).
cnf(u1596,axiom,
( ~ product1(e_4,X0,e_5)
| equalish(X0,e_2) ) ).
cnf(u1887,axiom,
( ~ product1(X0,e_2,e_4)
| equalish(X0,e_5) ) ).
cnf(u2138,negated_conjecture,
( ~ product2(X0,e_3,e_4)
| equalish(X0,e_1) ) ).
cnf(u1959,axiom,
( ~ product1(e_5,e_1,X0)
| equalish(X0,e_2) ) ).
cnf(u2211,axiom,
( ~ product1(e_4,e_5,X0)
| equalish(X0,e_1) ) ).
cnf(u2096,axiom,
( ~ product1(X0,e_3,e_1)
| equalish(X0,e_5) ) ).
cnf(u1086,axiom,
( ~ group_element(X0)
| product2(X0,e_3,e_1)
| product2(X0,e_3,e_2)
| product2(X0,e_3,e_3)
| product2(X0,e_3,e_4)
| product2(X0,e_3,e_5) ) ).
cnf(u2140,negated_conjecture,
( ~ product2(e_1,e_3,X0)
| equalish(X0,e_4) ) ).
cnf(u1167,negated_conjecture,
product2(e_4,e_2,e_1) ).
cnf(u1085,axiom,
( ~ group_element(X0)
| product2(X0,e_2,e_1)
| product2(X0,e_2,e_2)
| product2(X0,e_2,e_3)
| product2(X0,e_2,e_4)
| product2(X0,e_2,e_5) ) ).
cnf(u2272,negated_conjecture,
( ~ product2(X0,e_5,e_2)
| equalish(X0,e_1) ) ).
cnf(u703,axiom,
( ~ group_element(X0)
| product1(X0,e_4,e_1)
| product1(X0,e_4,e_2)
| product1(X0,e_4,e_3)
| product1(X0,e_4,e_4)
| product1(X0,e_4,e_5) ) ).
cnf(u2240,negated_conjecture,
( ~ product2(X0,e_5,e_3)
| equalish(X0,e_4) ) ).
cnf(u2021,negated_conjecture,
( ~ product2(e_5,X0,e_2)
| equalish(X0,e_3) ) ).
cnf(u1088,axiom,
( ~ group_element(X0)
| product2(X0,e_5,e_1)
| product2(X0,e_5,e_2)
| product2(X0,e_5,e_3)
| product2(X0,e_5,e_4)
| product2(X0,e_5,e_5) ) ).
cnf(u2127,axiom,
( ~ product1(X0,e_4,e_1)
| equalish(X0,e_2) ) ).
cnf(u2084,axiom,
( ~ product1(X0,e_4,e_5)
| equalish(X0,e_3) ) ).
cnf(u520,axiom,
( ~ cycle(X0,X1)
| ~ next(X0,e_1)
| ~ greater(X1,e_0)
| ~ next(e_0,X2)
| equalish(X1,X2) ) ).
cnf(u1889,axiom,
( ~ product1(e_5,e_2,X0)
| equalish(X0,e_4) ) ).
cnf(u835,axiom,
~ next(e_5,e_2) ).
cnf(u2318,negated_conjecture,
product2(e_3,e_5,e_1) ).
cnf(u2155,negated_conjecture,
product2(e_5,e_4,e_1) ).
cnf(u2126,negated_conjecture,
product2(e_3,e_4,e_2) ).
cnf(cycle5,axiom,
( ~ cycle(X3,X4)
| ~ cycle(X2,e_0)
| ~ cycle(X0,X1)
| ~ next(X2,X3)
| ~ greater(X2,X0)
| ~ greater(X1,X4) ) ).
cnf(u2157,axiom,
( ~ product1(e_1,X0,e_2)
| equalish(X0,e_4) ) ).
cnf(u2348,axiom,
( ~ product2(X0,e_1,e_5)
| equalish(X0,e_3) ) ).
cnf(u2071,negated_conjecture,
( ~ product2(e_3,e_2,X0)
| equalish(X0,e_4) ) ).
cnf(e_5_is_not_e_1,axiom,
~ equalish(e_5,e_1) ).
cnf(u464,axiom,
( ~ cycle(X1,X2)
| ~ cycle(X0,e_0)
| ~ next(X0,e_4)
| ~ greater(X0,X1)
| ~ greater(X2,e_1) ) ).
cnf(u1657,negated_conjecture,
( ~ product2(e_2,X0,e_3)
| equalish(X0,e_1) ) ).
cnf(e_5_is_not_e_4,axiom,
~ equalish(e_5,e_4) ).
cnf(u74,axiom,
( ~ product2(X0,X0,X1)
| equalish(X1,X0) ) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4) ).
cnf(e_4_is_not_e_2,axiom,
~ equalish(e_4,e_2) ).
cnf(u2241,negated_conjecture,
( ~ product2(e_4,X0,e_3)
| equalish(X0,e_5) ) ).
cnf(u76,axiom,
( ~ product2(X0,X1,X0)
| equalish(X1,X0) ) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1) ).
cnf(u67,axiom,
equalish(e_0,e_0) ).
cnf(element_5,axiom,
group_element(e_5) ).
cnf(u2159,negated_conjecture,
( ~ product1(e_4,X0,e_1)
| product2(e_2,X0,e_4) ) ).
cnf(u1595,axiom,
( ~ product1(X0,e_2,e_5)
| equalish(X0,e_4) ) ).
cnf(u70,axiom,
( ~ product1(X0,X1,X0)
| equalish(X1,X0) ) ).
cnf(e_2_is_not_e_4,axiom,
~ equalish(e_2,e_4) ).
cnf(u69,axiom,
equalish(X0,X0) ).
cnf(u2044,negated_conjecture,
( ~ product2(e_5,X0,e_3)
| equalish(X0,e_2) ) ).
cnf(cycle1,axiom,
( ~ cycle(X0,X2)
| ~ cycle(X0,X1)
| equalish(X1,X2) ) ).
cnf(u658,axiom,
~ next(e_5,e_1) ).
cnf(u1651,axiom,
( ~ product1(X0,e_3,e_2)
| equalish(X0,e_4) ) ).
cnf(element_1,axiom,
group_element(e_1) ).
cnf(e_5_greater_e_3,axiom,
greater(e_5,e_3) ).
cnf(cycle2,axiom,
( ~ group_element(X0)
| cycle(X0,e_0)
| cycle(X0,e_1)
| cycle(X0,e_2)
| cycle(X0,e_3)
| cycle(X0,e_4) ) ).
cnf(u2212,negated_conjecture,
( ~ product1(e_5,X0,e_4)
| product2(e_1,X0,e_5) ) ).
cnf(u2086,axiom,
( ~ product1(e_3,e_4,X0)
| equalish(X0,e_5) ) ).
cnf(u1656,negated_conjecture,
( ~ product2(X0,e_1,e_3)
| equalish(X0,e_2) ) ).
cnf(e_3_greater_e_0,axiom,
greater(e_3,e_0) ).
cnf(u653,axiom,
( ~ cycle(X0,e_0)
| ~ next(X0,e_1)
| ~ greater(X0,e_4) ) ).
cnf(e_3_greater_e_2,axiom,
greater(e_3,e_2) ).
cnf(u2162,negated_conjecture,
( ~ product2(e_5,e_4,X0)
| equalish(X0,e_1) ) ).
cnf(e_1_then_e_2,axiom,
next(e_1,e_2) ).
cnf(u2319,axiom,
( ~ product1(X0,e_5,e_4)
| equalish(X0,e_1) ) ).
cnf(e_0_then_e_1,axiom,
next(e_0,e_1) ).
cnf(u2158,axiom,
( ~ product1(e_1,e_4,X0)
| equalish(X0,e_2) ) ).
cnf(u761,axiom,
( ~ next(e_1,X0)
| equalish(e_2,X0) ) ).
cnf(u1655,negated_conjecture,
product2(e_2,e_1,e_3) ).
cnf(u2213,negated_conjecture,
( ~ product2(X0,e_5,e_4)
| equalish(X0,e_2) ) ).
cnf(u1907,axiom,
( ~ product1(X0,e_2,e_1)
| equalish(X0,e_3) ) ).
cnf(u2030,negated_conjecture,
( ~ product1(e_3,X0,e_2)
| product2(e_4,X0,e_3) ) ).
cnf(u1375,negated_conjecture,
( ~ product2(e_4,e_2,X0)
| equalish(X0,e_1) ) ).
cnf(u1898,negated_conjecture,
( ~ product2(e_4,e_1,X0)
| equalish(X0,e_2) ) ).
cnf(u2360,axiom,
( ~ product2(X0,e_2,e_5)
| equalish(X0,e_1) ) ).
cnf(u1380,axiom,
( ~ product1(e_3,X0,e_4)
| equalish(X0,e_1) ) ).
cnf(u1883,axiom,
( ~ product1(X0,e_1,e_5)
| equalish(X0,e_2) ) ).
cnf(u1374,negated_conjecture,
( ~ product2(e_4,X0,e_1)
| equalish(X0,e_2) ) ).
cnf(u1884,axiom,
( ~ product1(e_2,X0,e_5)
| equalish(X0,e_1) ) ).
cnf(u1960,negated_conjecture,
( ~ product1(e_1,X0,e_5)
| product2(e_2,X0,e_1) ) ).
cnf(u2247,negated_conjecture,
( ~ product2(X0,e_4,e_5)
| equalish(X0,e_2) ) ).
cnf(u2350,axiom,
( ~ product2(e_3,e_1,X0)
| equalish(X0,e_5) ) ).
cnf(u759,axiom,
( ~ cycle(X0,e_0)
| ~ next(X0,e_4)
| ~ greater(X0,e_3) ) ).
cnf(u2235,negated_conjecture,
product2(e_4,e_5,e_3) ).
cnf(u1892,negated_conjecture,
product2(e_4,e_1,e_2) ).
cnf(u2237,axiom,
( ~ product1(e_3,X0,e_2)
| equalish(X0,e_5) ) ).
cnf(u748,axiom,
( ~ cycle(e_3,X0)
| equalish(X0,e_2) ) ).
cnf(e_3_then_e_4,axiom,
next(e_3,e_4) ).
cnf(u2065,axiom,
( ~ product1(e_5,X0,e_3)
| equalish(X0,e_4) ) ).
cnf(u1910,negated_conjecture,
( ~ product1(e_2,X0,e_3)
| product2(e_1,X0,e_2) ) ).
cnf(u1922,negated_conjecture,
product2(e_5,e_3,e_2) ).
cnf(u2020,negated_conjecture,
( ~ product2(X0,e_3,e_2)
| equalish(X0,e_5) ) ).
cnf(u757,axiom,
( ~ cycle(X0,e_0)
| ~ next(X0,e_1)
| ~ greater(X0,e_3) ) ).
cnf(u2214,negated_conjecture,
( ~ product2(e_2,X0,e_4)
| equalish(X0,e_5) ) ).
cnf(u2029,axiom,
( ~ product1(e_2,e_3,X0)
| equalish(X0,e_4) ) ).
cnf(u2137,negated_conjecture,
product2(e_1,e_3,e_4) ).
cnf(u2131,negated_conjecture,
( ~ product2(X0,e_4,e_2)
| equalish(X0,e_3) ) ).
cnf(u2322,negated_conjecture,
( ~ product1(e_5,X0,e_1)
| product2(e_4,X0,e_5) ) ).
cnf(u2321,axiom,
( ~ product1(e_1,e_5,X0)
| equalish(X0,e_4) ) ).
cnf(u2103,negated_conjecture,
( ~ product2(e_1,e_4,X0)
| equalish(X0,e_3) ) ).
cnf(u2133,negated_conjecture,
( ~ product2(e_3,e_4,X0)
| equalish(X0,e_2) ) ).
cnf(u2324,negated_conjecture,
( ~ product2(e_3,X0,e_1)
| equalish(X0,e_5) ) ).
cnf(product2_total_function1,axiom,
( ~ group_element(X1)
| ~ group_element(X0)
| product2(X0,X1,e_1)
| product2(X0,X1,e_2)
| product2(X0,X1,e_3)
| product2(X0,X1,e_4)
| product2(X0,X1,e_5) ) ).
cnf(u2239,negated_conjecture,
( ~ product1(e_5,X0,e_3)
| product2(e_2,X0,e_5) ) ).
cnf(u2035,negated_conjecture,
( ~ product1(e_3,X0,e_1)
| product2(e_5,X0,e_3) ) ).
cnf(product1_idempotence,axiom,
product1(X0,X0,X0) ).
cnf(product2_right_cancellation,axiom,
( ~ product2(X0,X3,X2)
| ~ product2(X0,X1,X2)
| equalish(X1,X3) ) ).
cnf(e_5_is_not_e_3,axiom,
~ equalish(e_5,e_3) ).
cnf(product1_total_function2,axiom,
( ~ product1(X0,X1,X3)
| ~ product1(X0,X1,X2)
| equalish(X2,X3) ) ).
cnf(u2085,axiom,
( ~ product1(e_3,X0,e_5)
| equalish(X0,e_4) ) ).
cnf(product1_total_function1,axiom,
( ~ group_element(X1)
| ~ group_element(X0)
| product1(X0,X1,e_1)
| product1(X0,X1,e_2)
| product1(X0,X1,e_3)
| product1(X0,X1,e_4)
| product1(X0,X1,e_5) ) ).
cnf(e_2_is_not_e_5,axiom,
~ equalish(e_2,e_5) ).
cnf(u1168,axiom,
( ~ product1(X0,e_2,e_3)
| equalish(X0,e_1) ) ).
cnf(e_4_is_not_e_3,axiom,
~ equalish(e_4,e_3) ).
cnf(u2066,axiom,
( ~ product1(e_5,e_4,X0)
| equalish(X0,e_3) ) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3) ).
cnf(u2128,axiom,
( ~ product1(e_2,X0,e_1)
| equalish(X0,e_4) ) ).
cnf(u700,axiom,
( ~ group_element(X0)
| product1(X0,e_1,e_1)
| product1(X0,e_1,e_2)
| product1(X0,e_1,e_3)
| product1(X0,e_1,e_4)
| product1(X0,e_1,e_5) ) ).
cnf(u1897,negated_conjecture,
( ~ product2(e_4,X0,e_2)
| equalish(X0,e_1) ) ).
cnf(u2267,negated_conjecture,
product2(e_1,e_5,e_2) ).
cnf(u2269,axiom,
( ~ product1(e_2,X0,e_3)
| equalish(X0,e_5) ) ).
cnf(u1958,axiom,
( ~ product1(e_5,X0,e_2)
| equalish(X0,e_1) ) ).
cnf(u1886,negated_conjecture,
( ~ product1(e_1,X0,e_2)
| product2(e_5,X0,e_1) ) ).
cnf(u1373,negated_conjecture,
( ~ product2(X0,e_2,e_1)
| equalish(X0,e_4) ) ).
cnf(u704,axiom,
( ~ group_element(X0)
| product1(X0,e_5,e_1)
| product1(X0,e_5,e_2)
| product1(X0,e_5,e_3)
| product1(X0,e_5,e_4)
| product1(X0,e_5,e_5) ) ).
cnf(u1654,negated_conjecture,
( ~ product1(e_3,X0,e_4)
| product2(e_2,X0,e_3) ) ).
cnf(u2038,negated_conjecture,
( ~ product2(e_2,e_3,X0)
| equalish(X0,e_1) ) ).
cnf(u1653,axiom,
( ~ product1(e_4,e_3,X0)
| equalish(X0,e_2) ) ).
cnf(u2271,negated_conjecture,
( ~ product1(e_5,X0,e_2)
| product2(e_3,X0,e_5) ) ).
cnf(u466,axiom,
( ~ cycle(X0,X1)
| ~ next(X0,e_4)
| ~ greater(X1,e_0)
| ~ next(e_1,X2)
| equalish(X1,X2) ) ).
cnf(u2336,axiom,
( ~ product2(X0,e_1,e_4)
| equalish(X0,e_5) ) ).
cnf(u1957,axiom,
( ~ product1(X0,e_1,e_2)
| equalish(X0,e_5) ) ).
cnf(u2139,negated_conjecture,
( ~ product2(e_1,X0,e_4)
| equalish(X0,e_3) ) ).
cnf(u2238,axiom,
( ~ product1(e_3,e_5,X0)
| equalish(X0,e_2) ) ).
cnf(u2330,negated_conjecture,
( ~ product2(X0,e_3,e_5)
| equalish(X0,e_4) ) ).
cnf(u78,axiom,
( ~ product2(X0,X1,X1)
| equalish(X0,X1) ) ).
cnf(u2210,axiom,
( ~ product1(e_4,X0,e_1)
| equalish(X0,e_5) ) ).
cnf(u1087,axiom,
( ~ group_element(X0)
| product2(X0,e_4,e_1)
| product2(X0,e_4,e_2)
| product2(X0,e_4,e_3)
| product2(X0,e_4,e_4)
| product2(X0,e_4,e_5) ) ).
cnf(u2332,negated_conjecture,
( ~ product2(e_4,e_3,X0)
| equalish(X0,e_5) ) ).
cnf(u64,negated_conjecture,
( ~ product1(X0,X1,X0)
| product2(X0,X1,X0) ) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2) ).
cnf(u2097,axiom,
( ~ product1(e_5,X0,e_1)
| equalish(X0,e_3) ) ).
cnf(u2068,negated_conjecture,
product2(e_3,e_2,e_4) ).
cnf(e_1_is_not_e_5,axiom,
~ equalish(e_1,e_5) ).
cnf(u1909,axiom,
( ~ product1(e_3,e_2,X0)
| equalish(X0,e_1) ) ).
cnf(u2248,negated_conjecture,
( ~ product2(e_2,X0,e_5)
| equalish(X0,e_4) ) ).
cnf(u1896,negated_conjecture,
( ~ product2(X0,e_1,e_2)
| equalish(X0,e_4) ) ).
cnf(element_3,axiom,
group_element(e_3) ).
cnf(u2329,negated_conjecture,
product2(e_4,e_3,e_5) ).
cnf(u2242,negated_conjecture,
( ~ product2(e_4,e_5,X0)
| equalish(X0,e_3) ) ).
cnf(element_2,axiom,
group_element(e_2) ).
cnf(e_4_greater_e_2,axiom,
greater(e_4,e_2) ).
cnf(u2273,negated_conjecture,
( ~ product2(e_1,X0,e_2)
| equalish(X0,e_5) ) ).
cnf(cycle3,axiom,
cycle(e_5,e_0) ).
cnf(u181,axiom,
( ~ cycle(X0,X1)
| ~ next(X0,e_5)
| ~ greater(X1,e_0)
| ~ next(e_0,X2)
| equalish(X1,X2) ) ).
cnf(e_5_greater_e_0,axiom,
greater(e_5,e_0) ).
cnf(e_4_greater_e_0,axiom,
greater(e_4,e_0) ).
cnf(u2028,axiom,
( ~ product1(e_2,X0,e_4)
| equalish(X0,e_3) ) ).
cnf(e_3_greater_e_1,axiom,
greater(e_3,e_1) ).
cnf(e_2_then_e_3,axiom,
next(e_2,e_3) ).
cnf(u1652,axiom,
( ~ product1(e_4,X0,e_2)
| equalish(X0,e_3) ) ).
cnf(e_1_greater_e_0,axiom,
greater(e_1,e_0) ).
cnf(u2070,negated_conjecture,
( ~ product2(e_3,X0,e_4)
| equalish(X0,e_2) ) ).
cnf(e_4_then_e_5,axiom,
next(e_4,e_5) ).
cnf(u1598,negated_conjecture,
( ~ product1(e_2,X0,e_4)
| product2(e_5,X0,e_2) ) ).
cnf(u765,axiom,
( ~ cycle(X0,X1)
| ~ next(X0,e_2)
| ~ greater(X1,e_0)
| ~ next(e_0,X2)
| equalish(X1,X2) ) ).
cnf(u1597,axiom,
( ~ product1(e_4,e_2,X0)
| equalish(X0,e_5) ) ).
cnf(u2349,axiom,
( ~ product2(e_3,X0,e_5)
| equalish(X0,e_1) ) ).
cnf(u2034,axiom,
( ~ product1(e_1,e_3,X0)
| equalish(X0,e_5) ) ).
cnf(u2129,axiom,
( ~ product1(e_2,e_4,X0)
| equalish(X0,e_1) ) ).
cnf(u1382,negated_conjecture,
( ~ product1(e_1,X0,e_3)
| product2(e_4,X0,e_1) ) ).
cnf(u2098,axiom,
( ~ product1(e_5,e_3,X0)
| equalish(X0,e_1) ) ).
cnf(u2320,axiom,
( ~ product1(e_1,X0,e_4)
| equalish(X0,e_5) ) ).
cnf(u2043,negated_conjecture,
( ~ product2(X0,e_2,e_3)
| equalish(X0,e_5) ) ).
cnf(u1171,negated_conjecture,
( ~ product1(e_2,X0,e_1)
| product2(e_3,X0,e_2) ) ).
cnf(u2156,axiom,
( ~ product1(X0,e_4,e_2)
| equalish(X0,e_1) ) ).
cnf(u760,axiom,
( ~ cycle(X0,e_0)
| ~ next(X0,e_5)
| ~ greater(X0,e_3) ) ).
cnf(u521,axiom,
( ~ cycle(e_1,X0)
| equalish(X0,e_0) ) ).
cnf(u1170,axiom,
( ~ product1(e_1,e_2,X0)
| equalish(X0,e_3) ) ).
cnf(u1169,axiom,
( ~ product1(e_1,X0,e_3)
| equalish(X0,e_2) ) ).
cnf(u2087,negated_conjecture,
( ~ product1(e_4,X0,e_3)
| product2(e_5,X0,e_4) ) ).
cnf(u1963,axiom,
( ~ product1(e_4,e_1,X0)
| equalish(X0,e_3) ) ).
cnf(u2100,negated_conjecture,
product2(e_1,e_4,e_3) ).
cnf(u1084,axiom,
( ~ group_element(X0)
| product2(X0,e_1,e_1)
| product2(X0,e_1,e_2)
| product2(X0,e_1,e_3)
| product2(X0,e_1,e_4)
| product2(X0,e_1,e_5) ) ).
cnf(product2_idempotence,axiom,
product2(X0,X0,X0) ).
cnf(u2037,negated_conjecture,
( ~ product2(e_2,X0,e_1)
| equalish(X0,e_3) ) ).
cnf(u2249,negated_conjecture,
( ~ product2(e_2,e_4,X0)
| equalish(X0,e_5) ) ).
cnf(u2208,negated_conjecture,
product2(e_2,e_5,e_4) ).
cnf(u2246,negated_conjecture,
product2(e_2,e_4,e_5) ).
cnf(e_4_is_not_e_5,axiom,
~ equalish(e_4,e_5) ).
cnf(u1379,axiom,
( ~ product1(X0,e_1,e_4)
| equalish(X0,e_3) ) ).
cnf(u66,axiom,
( ~ cycle(e_5,X0)
| equalish(X0,e_0) ) ).
cnf(u2361,axiom,
( ~ product2(e_1,X0,e_5)
| equalish(X0,e_2) ) ).
cnf(u2362,axiom,
( ~ product2(e_1,e_2,X0)
| equalish(X0,e_5) ) ).
cnf(u1381,axiom,
( ~ product1(e_3,e_1,X0)
| equalish(X0,e_4) ) ).
cnf(u1885,axiom,
( ~ product1(e_2,e_1,X0)
| equalish(X0,e_5) ) ).
cnf(u2033,axiom,
( ~ product1(e_1,X0,e_5)
| equalish(X0,e_3) ) ).
cnf(u2160,negated_conjecture,
( ~ product2(X0,e_4,e_1)
| equalish(X0,e_5) ) ).
cnf(u2069,negated_conjecture,
( ~ product2(X0,e_2,e_4)
| equalish(X0,e_3) ) ).
cnf(product2_total_function2,axiom,
( ~ product2(X0,X1,X3)
| ~ product2(X0,X1,X2)
| equalish(X2,X3) ) ).
cnf(u2236,axiom,
( ~ product1(X0,e_5,e_2)
| equalish(X0,e_3) ) ).
cnf(u1658,negated_conjecture,
( ~ product2(e_2,e_1,X0)
| equalish(X0,e_3) ) ).
cnf(u2215,negated_conjecture,
( ~ product2(e_2,e_5,X0)
| equalish(X0,e_4) ) ).
cnf(u2274,negated_conjecture,
( ~ product2(e_1,e_5,X0)
| equalish(X0,e_2) ) ).
cnf(product2_left_cancellation,axiom,
( ~ product2(X3,X1,X2)
| ~ product2(X0,X1,X2)
| equalish(X0,X3) ) ).
cnf(u2067,negated_conjecture,
( ~ product1(e_4,X0,e_5)
| product2(e_3,X0,e_4) ) ).
cnf(u432,axiom,
( ~ cycle(X1,X2)
| ~ cycle(X0,e_0)
| ~ next(X0,e_5)
| ~ greater(X0,X1)
| ~ greater(X2,e_0) ) ).
cnf(product1_right_cancellation,axiom,
( ~ product1(X0,X3,X2)
| ~ product1(X0,X1,X2)
| equalish(X1,X3) ) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2) ).
cnf(u72,axiom,
( ~ product1(X0,X1,X1)
| equalish(X0,X1) ) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1) ).
cnf(e_3_is_not_e_5,axiom,
~ equalish(e_3,e_5) ).
cnf(u518,axiom,
( ~ cycle(X1,X2)
| ~ cycle(X0,e_0)
| ~ next(X0,e_1)
| ~ greater(X0,X1)
| ~ greater(X2,e_0) ) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3) ).
cnf(u2102,negated_conjecture,
( ~ product2(e_1,X0,e_3)
| equalish(X0,e_4) ) ).
cnf(u68,axiom,
( ~ product1(X0,X0,X1)
| equalish(X1,X0) ) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1) ).
cnf(u2031,negated_conjecture,
product2(e_2,e_3,e_1) ).
cnf(cycle4,axiom,
( ~ cycle(X2,X3)
| ~ cycle(X0,X1)
| ~ next(X0,X2)
| ~ greater(X1,e_0)
| ~ next(X3,X4)
| equalish(X1,X4) ) ).
cnf(u626,axiom,
~ next(e_5,e_4) ).
cnf(element_4,axiom,
group_element(e_4) ).
cnf(e_4_greater_e_3,axiom,
greater(e_4,e_3) ).
cnf(e_5_greater_e_2,axiom,
greater(e_5,e_2) ).
cnf(u2130,negated_conjecture,
( ~ product1(e_4,X0,e_2)
| product2(e_1,X0,e_4) ) ).
cnf(u2132,negated_conjecture,
( ~ product2(e_3,X0,e_2)
| equalish(X0,e_4) ) ).
cnf(u2323,negated_conjecture,
( ~ product2(X0,e_5,e_1)
| equalish(X0,e_3) ) ).
cnf(u766,axiom,
( ~ cycle(X1,X2)
| ~ cycle(X0,e_0)
| ~ next(X0,e_2)
| ~ greater(X0,X1)
| ~ greater(X2,e_0) ) ).
cnf(u2325,negated_conjecture,
( ~ product2(e_3,e_5,X0)
| equalish(X0,e_1) ) ).
cnf(u1890,negated_conjecture,
( ~ product1(e_2,X0,e_5)
| product2(e_4,X0,e_2) ) ).
cnf(u2042,negated_conjecture,
product2(e_5,e_2,e_3) ).
cnf(u2268,axiom,
( ~ product1(X0,e_5,e_3)
| equalish(X0,e_2) ) ).
cnf(u470,axiom,
( ~ next(e_0,X0)
| equalish(e_1,X0) ) ).
cnf(u2022,negated_conjecture,
( ~ product2(e_5,e_3,X0)
| equalish(X0,e_2) ) ).
cnf(u2270,axiom,
( ~ product1(e_2,e_5,X0)
| equalish(X0,e_3) ) ).
cnf(u1961,axiom,
( ~ product1(X0,e_1,e_3)
| equalish(X0,e_4) ) ).
cnf(u2101,negated_conjecture,
( ~ product2(X0,e_4,e_3)
| equalish(X0,e_1) ) ).
cnf(u1908,axiom,
( ~ product1(e_3,X0,e_1)
| equalish(X0,e_2) ) ).
cnf(u1962,axiom,
( ~ product1(e_4,X0,e_3)
| equalish(X0,e_1) ) ).
cnf(u764,axiom,
( ~ cycle(e_2,X0)
| equalish(X0,e_0) ) ).
cnf(u2036,negated_conjecture,
( ~ product2(X0,e_3,e_1)
| equalish(X0,e_2) ) ).
cnf(e_5_greater_e_4,axiom,
greater(e_5,e_4) ).
cnf(e_2_greater_e_1,axiom,
greater(e_2,e_1) ).
cnf(u1888,axiom,
( ~ product1(e_5,X0,e_4)
| equalish(X0,e_2) ) ).
cnf(e_5_greater_e_1,axiom,
greater(e_5,e_1) ).
cnf(u2099,negated_conjecture,
( ~ product1(e_3,X0,e_5)
| product2(e_1,X0,e_3) ) ).
cnf(e_4_greater_e_1,axiom,
greater(e_4,e_1) ).
cnf(u2045,negated_conjecture,
( ~ product2(e_5,e_2,X0)
| equalish(X0,e_3) ) ).
cnf(u2032,axiom,
( ~ product1(X0,e_3,e_5)
| equalish(X0,e_1) ) ).
cnf(u2064,axiom,
( ~ product1(X0,e_4,e_3)
| equalish(X0,e_5) ) ).
cnf(e_2_greater_e_0,axiom,
greater(e_2,e_0) ).
cnf(u467,axiom,
( ~ cycle(e_4,X0)
| equalish(X0,e_1) ) ).
cnf(u2338,axiom,
( ~ product2(e_5,e_1,X0)
| equalish(X0,e_4) ) ).
cnf(u2337,axiom,
( ~ product2(e_5,X0,e_4)
| equalish(X0,e_1) ) ).
cnf(u2209,axiom,
( ~ product1(X0,e_5,e_1)
| equalish(X0,e_4) ) ).
cnf(u469,axiom,
( ~ cycle(X0,e_0)
| ~ next(X0,e_5)
| ~ greater(X0,e_4) ) ).
cnf(u750,axiom,
( ~ cycle(X1,X2)
| ~ cycle(X0,e_0)
| ~ next(X0,e_3)
| ~ greater(X0,X1)
| ~ greater(X2,e_2) ) ).
cnf(u2331,negated_conjecture,
( ~ product2(e_4,X0,e_5)
| equalish(X0,e_3) ) ).
cnf(u749,axiom,
( ~ cycle(X0,X1)
| ~ next(X0,e_3)
| ~ greater(X1,e_0)
| ~ next(e_2,X2)
| equalish(X1,X2) ) ).
cnf(u1964,negated_conjecture,
( ~ product1(e_1,X0,e_4)
| product2(e_3,X0,e_1) ) ).
cnf(u2161,negated_conjecture,
( ~ product2(e_5,X0,e_1)
| equalish(X0,e_4) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP124-8.005 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.39 % Computer : n008.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Sun Sep 27 09:21:56 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.12/1.54 % (965774)Input is clausal, will run a generic CNF schedule.
% 4.12/1.54 % (965780)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3011139784:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.12/1.54 % (965784)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1150376734:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.12/1.54 % (965783)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1484124906:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.12/1.54 % (965782)lrs+10_1_sil=8000:sp=occurrence:random_seed=1506090755:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.12/1.54 % (965779)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=2586887515:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.12/1.54 % (965781)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4152105610:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.12/1.54 % (965785)dis-21_1_sil=8000:lcm=predicate:random_seed=3278869489: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.12/1.54 % (965782)Instruction limit reached!
% 4.12/1.54 % (965782)------------------------------
% 4.12/1.54 % (965782)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.12/1.54 % (965782)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.54 % (965782)CaDiCaL version: 2.1.3
% 4.12/1.54 % (965782)Termination reason: Instruction limit
% 4.12/1.54 % (965782)Termination phase: Saturation
% 4.12/1.54 % (965782)Time elapsed: 0.059 s
% 4.12/1.54 % (965782)Peak memory usage: 88 MB
% 4.12/1.54 % (965782)Instructions burned: 108 (million)
% 4.12/1.54 % (965783)Instruction limit reached!
% 4.12/1.54 % (965783)------------------------------
% 4.12/1.54 % (965783)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.12/1.54 % (965783)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.54 % (965783)CaDiCaL version: 2.1.3
% 4.12/1.54 % (965783)Termination reason: Instruction limit
% 4.12/1.54 % (965783)Termination phase: Saturation
% 4.12/1.54 % (965783)Time elapsed: 0.062 s
% 4.12/1.54 % (965783)Peak memory usage: 88 MB
% 4.12/1.54 % (965783)Instructions burned: 114 (million)
% 4.12/1.54 % (965785)Instruction limit reached!
% 4.12/1.54 % (965785)------------------------------
% 4.12/1.54 % (965785)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.12/1.54 % (965785)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.54 % (965785)CaDiCaL version: 2.1.3
% 4.12/1.54 % (965785)Termination reason: Instruction limit
% 4.12/1.54 % (965785)Termination phase: Saturation
% 4.12/1.54 % (965785)Time elapsed: 0.070 s
% 4.12/1.54 % (965785)Peak memory usage: 89 MB
% 4.12/1.54 % (965785)Instructions burned: 118 (million)
% 4.12/1.54 % (965784)Instruction limit reached!
% 4.12/1.54 % (965784)------------------------------
% 4.12/1.54 % (965784)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.12/1.54 % (965784)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.54 % (965784)CaDiCaL version: 2.1.3
% 4.12/1.54 % (965784)Termination reason: Instruction limit
% 4.12/1.54 % (965784)Termination phase: Saturation
% 4.12/1.54 % (965784)Time elapsed: 0.107 s
% 4.12/1.54 % (965784)Peak memory usage: 89 MB
% 4.12/1.54 % (965784)Instructions burned: 180 (million)
% 4.12/1.54 % (965794)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2911962739: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.12/1.54 % (965794)Refutation not found, incomplete strategy
% 4.12/1.54 % (965794)------------------------------
% 4.12/1.54 % (965794)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.12/1.54 % (965794)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.54 % (965794)CaDiCaL version: 2.1.3
% 4.12/1.54 % (965794)Termination reason: Refutation not found, incomplete strategy
% 4.12/1.54 % (965794)Time elapsed: 0.002 s
% 4.12/1.54 % (965794)Peak memory usage: 87 MB
% 4.12/1.54 % (965794)Instructions burned: 2 (million)
% 4.12/1.54 % (965793)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=3617264070:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 4.12/1.54 % (965795)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=3377604882:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 4.12/1.54 % (965796)lrs+10_64_to=lpo:sil=8000:random_seed=1945446522:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 4.12/1.54 % (965796)First to succeed.
% 4.12/1.54 % (965796)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-965774"
% 4.12/1.54 % (965793)Instruction limit reached!
% 4.12/1.54 % (965793)------------------------------
% 4.12/1.54 % (965793)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.12/1.54 % (965793)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.54 % (965793)CaDiCaL version: 2.1.3
% 4.12/1.54 % (965793)Termination reason: Instruction limit
% 4.12/1.54 % (965793)Termination phase: Saturation
% 4.12/1.54 % (965793)Time elapsed: 0.085 s
% 4.12/1.54 % (965793)Peak memory usage: 89 MB
% 4.12/1.54 % (965793)Instructions burned: 143 (million)
% 4.12/1.54 % (965795)Instruction limit reached!
% 4.12/1.54 % (965795)------------------------------
% 4.12/1.54 % (965795)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.12/1.54 % (965795)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.54 % (965795)CaDiCaL version: 2.1.3
% 4.12/1.54 % (965795)Termination reason: Instruction limit
% 4.12/1.54 % (965795)Termination phase: Saturation
% 4.12/1.54 % (965795)Time elapsed: 0.120 s
% 4.12/1.54 % (965795)Peak memory usage: 88 MB
% 4.12/1.54 % (965795)Instructions burned: 219 (million)
% 4.12/1.54 % (965780)Refutation not found, incomplete strategy
% 4.12/1.54 % (965780)------------------------------
% 4.12/1.54 % (965780)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.12/1.54 % (965780)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.54 % (965780)CaDiCaL version: 2.1.3
% 4.12/1.54 % (965780)Termination reason: Refutation not found, incomplete strategy
% 4.12/1.54 % (965780)Time elapsed: 0.392 s
% 4.12/1.54 % (965780)Peak memory usage: 128 MB
% 4.12/1.54 % (965780)Instructions burned: 947 (million)
% 4.12/1.54 % (965801)lrs+1011_16_to=lpo:sil=8000:drc=off:sp=reverse_frequency:spb=goal_then_units:random_seed=2185634416:avsq=on:i=194:fgj=on:bd=preordered_2995 on theBenchmark for (2995ds/194Mi)
% 4.12/1.54 % (965794)------------------------------
% 4.12/1.54 % (965794)------------------------------
% 4.12/1.54 % (965802)lrs+10_1_sil=8000:tgt=full:acc=on:random_seed=3081696212:i=157:gtg=all_2995 on theBenchmark for (2995ds/157Mi)
% 4.12/1.54 % (965801)Instruction limit reached!
% 4.12/1.54 % (965801)------------------------------
% 4.12/1.54 % (965801)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.12/1.54 % (965801)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.12/1.54 % (965801)CaDiCaL version: 2.1.3
% 4.12/1.54 % (965801)Termination reason: Instruction limit
% 4.12/1.54 % (965801)Termination phase: Saturation
% 4.12/1.54 % (965801)Time elapsed: 0.105 s
% 4.12/1.54 % (965801)Peak memory usage: 89 MB
% 4.12/1.54 % (965801)Instructions burned: 194 (million)
% 4.12/1.54 % (965780)------------------------------
% 4.12/1.54 % (965780)------------------------------
% 4.12/1.54 % SZS status Satisfiable for theBenchmark
% 4.12/1.54 % SZS output start Saturation.
% See solution above
% 5.37/1.74 % SZS output start Definitions and Model Updates.
% 5.37/1.74 for all inputs,
% 5.37/1.74 define product(X0,X1,X2) := $false
% 5.37/1.74 % SZS output end Definitions and Model Updates.
% 5.37/1.74 % (965796)------------------------------
% 5.37/1.74 % (965796)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.37/1.74 % (965796)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.37/1.74 % (965796)CaDiCaL version: 2.1.3
% 5.37/1.74 % (965796)Termination reason: Satisfiable
% 5.37/1.74 % (965796)Time elapsed: 0.034 s
% 5.37/1.74 % (965796)Peak memory usage: 89 MB
% 5.37/1.74 % (965796)Instructions burned: 53 (million)
% 5.37/1.74 % (965796)------------------------------
% 5.37/1.74 % (965796)------------------------------
% 5.37/1.74 % (965774)Success in time 0.679 s
% 5.37/1.74 % Vampire exiting
%------------------------------------------------------------------------------