TSTP Solution File: GRP125-3.004 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP125-3.004 : TPTP v8.2.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 21:15:13 EDT 2024
% Result : Satisfiable 0.14s 0.39s
% Output : Saturation 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u58,axiom,
( ~ cycle(e_1,X1)
| ~ greater(X1,e_0) ) ).
cnf(u71,axiom,
~ greater(e_0,e_0) ).
cnf(u83,axiom,
~ cycle(e_1,e_1) ).
cnf(u87,axiom,
~ cycle(e_1,e_2) ).
cnf(u92,axiom,
cycle(e_1,e_0) ).
cnf(u119,axiom,
~ product(e_2,e_1,e_1) ).
cnf(u123,axiom,
~ product(e_2,e_1,e_2) ).
cnf(u128,axiom,
product(e_2,e_1,e_3) ).
cnf(u131,axiom,
~ product(e_2,e_1,e_4) ).
cnf(u136,axiom,
~ product(e_3,e_1,e_1) ).
cnf(u140,axiom,
~ product(e_3,e_1,e_2) ).
cnf(u144,axiom,
~ product(e_3,e_1,e_3) ).
cnf(u149,axiom,
product(e_3,e_1,e_4) ).
cnf(u153,axiom,
~ product(e_4,e_1,e_1) ).
cnf(u158,axiom,
product(e_4,e_1,e_2) ).
cnf(u161,axiom,
~ product(e_4,e_1,e_3) ).
cnf(u165,axiom,
~ product(e_4,e_1,e_4) ).
cnf(u180,axiom,
~ product(e_1,e_2,e_1) ).
cnf(u184,axiom,
~ product(e_1,e_2,e_2) ).
cnf(u188,axiom,
~ product(e_1,e_2,e_3) ).
cnf(u193,axiom,
product(e_1,e_2,e_4) ).
cnf(u198,axiom,
product(e_3,e_2,e_1) ).
cnf(u201,axiom,
~ product(e_3,e_2,e_2) ).
cnf(u205,axiom,
~ product(e_3,e_2,e_3) ).
cnf(u209,axiom,
~ product(e_3,e_2,e_4) ).
cnf(u214,axiom,
~ product(e_4,e_2,e_1) ).
cnf(u218,axiom,
~ product(e_4,e_2,e_2) ).
cnf(u223,axiom,
product(e_4,e_2,e_3) ).
cnf(u226,axiom,
~ product(e_4,e_2,e_4) ).
cnf(u250,axiom,
~ product(e_1,e_3,e_1) ).
cnf(u255,axiom,
product(e_1,e_3,e_2) ).
cnf(u258,axiom,
~ product(e_1,e_3,e_3) ).
cnf(u262,axiom,
~ product(e_1,e_3,e_4) ).
cnf(u267,axiom,
~ product(e_2,e_3,e_1) ).
cnf(u271,axiom,
~ product(e_2,e_3,e_2) ).
cnf(u275,axiom,
~ product(e_2,e_3,e_3) ).
cnf(u280,axiom,
product(e_2,e_3,e_4) ).
cnf(u285,axiom,
product(e_4,e_3,e_1) ).
cnf(u288,axiom,
~ product(e_4,e_3,e_2) ).
cnf(u292,axiom,
~ product(e_4,e_3,e_3) ).
cnf(u296,axiom,
~ product(e_4,e_3,e_4) ).
cnf(u317,axiom,
~ product(e_1,e_4,e_1) ).
cnf(u321,axiom,
~ product(e_1,e_4,e_2) ).
cnf(u326,axiom,
product(e_1,e_4,e_3) ).
cnf(u335,axiom,
product(e_2,e_4,e_1) ).
cnf(u338,axiom,
~ product(e_2,e_4,e_2) ).
cnf(u342,axiom,
~ product(e_2,e_4,e_3) ).
cnf(u346,axiom,
~ product(e_2,e_4,e_4) ).
cnf(u351,axiom,
~ product(e_3,e_4,e_1) ).
cnf(u356,axiom,
product(e_3,e_4,e_2) ).
cnf(u359,axiom,
~ product(e_3,e_4,e_3) ).
cnf(u363,axiom,
~ product(e_3,e_4,e_4) ).
cnf(u376,axiom,
( ~ next(e_2,X0)
| equalish(e_3,X0) ) ).
cnf(u421,axiom,
( ~ next(e_3,X0)
| equalish(e_4,X0) ) ).
cnf(u438,axiom,
( ~ cycle(e_4,X1)
| ~ greater(X1,e_0) ) ).
cnf(u525,axiom,
~ cycle(e_2,e_1) ).
cnf(u530,axiom,
cycle(e_2,e_2) ).
cnf(u533,axiom,
~ cycle(e_2,e_0) ).
cnf(u550,axiom,
cycle(e_3,e_1) ).
cnf(u553,axiom,
~ cycle(e_3,e_2) ).
cnf(u557,axiom,
~ cycle(e_3,e_0) ).
cnf(u991,axiom,
~ group_element(e_0) ).
cnf(u1033,axiom,
( ~ next(X0,e_3)
| cycle(X0,e_0)
| cycle(X0,e_1)
| cycle(X0,e_2)
| ~ group_element(X0) ) ).
cnf(u95,axiom,
( ~ group_element(X0)
| product(X0,e_2,e_4)
| product(X0,e_2,e_3)
| product(X0,e_2,e_2)
| product(X0,e_2,e_1) ) ).
cnf(e_3_greater_e_0,axiom,
greater(e_3,e_0) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1) ).
cnf(e_2_then_e_3,axiom,
next(e_2,e_3) ).
cnf(u821,axiom,
( ~ product(e_2,X0,e_3)
| equalish(e_1,X0) ) ).
cnf(u822,axiom,
( ~ product(e_2,e_1,X0)
| equalish(e_3,X0) ) ).
cnf(qg3,negated_conjecture,
( ~ product(X1,X0,X5)
| ~ product(X0,X1,X4)
| product(X4,X5,X0) ) ).
cnf(element_4,axiom,
group_element(e_4) ).
cnf(cycle1,axiom,
( ~ cycle(X0,X2)
| ~ cycle(X0,X1)
| equalish(X1,X2) ) ).
cnf(e_4_is_not_e_3,axiom,
~ equalish(e_4,e_3) ).
cnf(u977,axiom,
( ~ next(X0,e_1)
| cycle(X0,e_0)
| ~ group_element(X0)
| cycle(X0,e_2)
| cycle(X0,e_1) ) ).
cnf(u96,axiom,
( ~ group_element(X0)
| product(X0,e_3,e_4)
| product(X0,e_3,e_3)
| product(X0,e_3,e_2)
| product(X0,e_3,e_1) ) ).
cnf(u897,axiom,
( ~ product(X0,e_4,e_1)
| equalish(e_2,X0) ) ).
cnf(cycle6,axiom,
( ~ cycle(X0,e_0)
| ~ greater(X1,X0)
| ~ product(X0,e_1,X1) ) ).
cnf(u519,axiom,
( ~ cycle(X0,e_0)
| ~ next(X1,X0)
| cycle(X1,e_0)
| ~ group_element(X1)
| cycle(X1,e_2)
| cycle(X1,e_1) ) ).
cnf(u888,negated_conjecture,
( ~ product(e_3,e_4,X0)
| product(X0,e_1,e_3) ) ).
cnf(cycle2,axiom,
( cycle(X0,e_3)
| cycle(X0,e_0)
| ~ group_element(X0)
| cycle(X0,e_2)
| cycle(X0,e_1) ) ).
cnf(e_2_greater_e_0,axiom,
greater(e_2,e_0) ).
cnf(u863,axiom,
( ~ product(X0,e_2,e_1)
| equalish(e_3,X0) ) ).
cnf(u46,axiom,
( ~ product(X0,X0,X1)
| equalish(X0,X1) ) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4) ).
cnf(e_1_then_e_2,axiom,
next(e_1,e_2) ).
cnf(u862,negated_conjecture,
( ~ product(e_2,e_3,X0)
| product(X0,e_1,e_2) ) ).
cnf(u859,axiom,
( ~ product(e_1,e_2,X0)
| equalish(e_4,X0) ) ).
cnf(product_idempotence,axiom,
product(X0,X0,X0) ).
cnf(u857,axiom,
( ~ product(X0,e_2,e_4)
| equalish(e_1,X0) ) ).
cnf(element_3,axiom,
group_element(e_3) ).
cnf(u858,axiom,
( ~ product(e_1,X0,e_4)
| equalish(e_2,X0) ) ).
cnf(u77,axiom,
( ~ next(e_4,X0)
| ~ cycle(X0,X1)
| ~ cycle(X2,X3)
| ~ greater(e_4,X2)
| ~ greater(X3,X1) ) ).
cnf(u869,axiom,
( ~ product(e_4,e_2,X0)
| equalish(e_3,X0) ) ).
cnf(u820,axiom,
( ~ product(X0,e_1,e_3)
| equalish(e_2,X0) ) ).
cnf(u1076,axiom,
( ~ next(e_2,X2)
| ~ next(X0,X1)
| ~ cycle(X2,X0)
| equalish(e_2,X1) ) ).
cnf(u50,negated_conjecture,
( ~ product(X0,X0,X1)
| product(X1,X0,X0) ) ).
cnf(u865,axiom,
( ~ product(e_3,e_2,X0)
| equalish(e_1,X0) ) ).
cnf(u819,negated_conjecture,
( ~ product(e_1,e_2,X0)
| product(X0,e_3,e_1) ) ).
cnf(u877,negated_conjecture,
( ~ product(e_3,e_2,X0)
| product(X0,e_4,e_3) ) ).
cnf(u976,axiom,
( ~ cycle(e_0,X2)
| ~ cycle(X0,X1)
| ~ next(e_1,X0)
| ~ greater(X2,X1) ) ).
cnf(e_4_greater_e_1,axiom,
greater(e_4,e_1) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2) ).
cnf(u978,axiom,
( ~ next(X0,e_4)
| cycle(X0,e_0)
| ~ group_element(X0)
| cycle(X0,e_2)
| cycle(X0,e_1) ) ).
cnf(element_2,axiom,
group_element(e_2) ).
cnf(e_1_greater_e_0,axiom,
greater(e_1,e_0) ).
cnf(u45,axiom,
( ~ product(e_4,e_1,X0)
| ~ greater(X0,e_4) ) ).
cnf(u896,negated_conjecture,
( ~ product(e_4,e_2,X0)
| product(X0,e_1,e_4) ) ).
cnf(cycle5,axiom,
( ~ cycle(X1,e_0)
| ~ next(X1,X3)
| ~ cycle(X3,X5)
| ~ cycle(X0,X4)
| ~ greater(X1,X0)
| ~ greater(X4,X5) ) ).
cnf(u367,axiom,
( ~ next(X2,e_2)
| ~ cycle(X1,X2)
| ~ next(X0,X1)
| cycle(X0,e_0)
| ~ group_element(X0)
| cycle(X0,e_2)
| cycle(X0,e_1) ) ).
cnf(e_0_then_e_1,axiom,
next(e_0,e_1) ).
cnf(u170,axiom,
( ~ product(e_1,e_1,X0)
| ~ greater(X0,e_1) ) ).
cnf(u899,axiom,
( ~ product(e_2,e_4,X0)
| equalish(e_1,X0) ) ).
cnf(product_left_cancellation,axiom,
( ~ product(X3,X1,X0)
| ~ product(X2,X1,X0)
| equalish(X3,X2) ) ).
cnf(e_2_is_not_e_4,axiom,
~ equalish(e_2,e_4) ).
cnf(u898,axiom,
( ~ product(e_2,X0,e_1)
| equalish(e_4,X0) ) ).
cnf(u94,axiom,
( ~ group_element(X0)
| product(X0,e_1,e_4)
| product(X0,e_1,e_3)
| product(X0,e_1,e_2)
| product(X0,e_1,e_1) ) ).
cnf(u76,axiom,
( equalish(e_3,X1)
| ~ next(X2,X3)
| ~ cycle(X3,X0)
| ~ next(X0,X1)
| cycle(X2,e_0)
| ~ group_element(X2)
| cycle(X2,e_2)
| cycle(X2,e_1) ) ).
cnf(u856,negated_conjecture,
( ~ product(e_2,e_1,X0)
| product(X0,e_4,e_2) ) ).
cnf(u1075,axiom,
( ~ cycle(e_2,X0)
| equalish(X0,e_2) ) ).
cnf(u917,axiom,
( ~ product(e_3,e_4,X0)
| equalish(e_2,X0) ) ).
cnf(u868,axiom,
( ~ product(e_4,X0,e_3)
| equalish(e_2,X0) ) ).
cnf(e_4_greater_e_3,axiom,
greater(e_4,e_3) ).
cnf(u871,negated_conjecture,
( ~ product(e_3,e_1,X0)
| product(X0,e_2,e_3) ) ).
cnf(u864,axiom,
( ~ product(e_3,X0,e_1)
| equalish(e_2,X0) ) ).
cnf(e_4_is_not_e_2,axiom,
~ equalish(e_4,e_2) ).
cnf(e_3_greater_e_1,axiom,
greater(e_3,e_1) ).
cnf(u867,axiom,
( ~ product(X0,e_2,e_3)
| equalish(e_4,X0) ) ).
cnf(u173,axiom,
( equalish(X0,e_0)
| ~ cycle(e_1,X0) ) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1) ).
cnf(element_1,axiom,
group_element(e_1) ).
cnf(u866,negated_conjecture,
( ~ product(e_2,e_4,X0)
| product(X0,e_3,e_2) ) ).
cnf(u1080,axiom,
( ~ next(e_1,X0)
| equalish(e_2,X0) ) ).
cnf(u879,axiom,
( ~ product(e_2,X0,e_4)
| equalish(e_3,X0) ) ).
cnf(u169,axiom,
( ~ greater(e_1,X2)
| ~ cycle(X0,X1)
| ~ cycle(X2,X3)
| ~ next(e_1,X0)
| ~ greater(X3,X1) ) ).
cnf(u44,axiom,
( equalish(X0,e_0)
| ~ cycle(e_4,X0) ) ).
cnf(cycle4,axiom,
( ~ cycle(X0,X1)
| ~ next(X2,X4)
| ~ next(X0,X3)
| ~ cycle(X3,X2)
| ~ greater(X1,e_0)
| equalish(X1,X4) ) ).
cnf(u878,axiom,
( ~ product(X0,e_3,e_4)
| equalish(e_2,X0) ) ).
cnf(u833,negated_conjecture,
( ~ product(e_1,e_3,X0)
| product(X0,e_4,e_1) ) ).
cnf(u576,axiom,
~ greater(e_1,e_1) ).
cnf(u873,axiom,
( ~ product(e_1,X0,e_2)
| equalish(e_3,X0) ) ).
cnf(product_right_cancellation,axiom,
( ~ product(X0,X3,X1)
| ~ product(X0,X2,X1)
| equalish(X3,X2) ) ).
cnf(u874,axiom,
( ~ product(e_1,e_3,X0)
| equalish(e_2,X0) ) ).
cnf(u845,axiom,
( ~ product(e_4,e_1,X0)
| equalish(e_2,X0) ) ).
cnf(u1079,axiom,
( ~ cycle(e_3,X0)
| ~ next(X0,X1)
| equalish(e_2,X1) ) ).
cnf(u536,axiom,
( ~ cycle(X0,e_1)
| ~ next(X1,X0)
| cycle(X1,e_0)
| ~ group_element(X1)
| cycle(X1,e_2)
| cycle(X1,e_1) ) ).
cnf(u893,axiom,
( ~ product(X0,e_4,e_3)
| equalish(e_1,X0) ) ).
cnf(e_4_greater_e_2,axiom,
greater(e_4,e_2) ).
cnf(u97,axiom,
( ~ group_element(X0)
| product(X0,e_4,e_4)
| product(X0,e_4,e_3)
| product(X0,e_4,e_2)
| product(X0,e_4,e_1) ) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3) ).
cnf(e_2_greater_e_1,axiom,
greater(e_2,e_1) ).
cnf(u368,axiom,
( ~ next(X2,e_4)
| ~ cycle(X1,X2)
| ~ next(X0,X1)
| cycle(X0,e_0)
| ~ group_element(X0)
| cycle(X0,e_2)
| cycle(X0,e_1) ) ).
cnf(u49,axiom,
( ~ product(X0,X1,X1)
| equalish(X1,X0) ) ).
cnf(product_total_function2,axiom,
( ~ product(X0,X1,X3)
| ~ product(X0,X1,X2)
| equalish(X3,X2) ) ).
cnf(u916,axiom,
( ~ product(e_3,X0,e_2)
| equalish(e_4,X0) ) ).
cnf(cycle7,axiom,
( ~ product(X0,e_1,X2)
| ~ next(X0,X6)
| ~ cycle(X0,X1)
| equalish(X2,X6)
| ~ greater(X1,e_0) ) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1) ).
cnf(cycle3,axiom,
cycle(e_4,e_0) ).
cnf(u366,axiom,
( ~ next(X2,e_1)
| ~ cycle(X1,X2)
| ~ next(X0,X1)
| cycle(X0,e_0)
| ~ group_element(X0)
| cycle(X0,e_2)
| cycle(X0,e_1) ) ).
cnf(u1002,axiom,
( ~ group_element(X1)
| cycle(X0,e_0)
| ~ group_element(X0)
| cycle(X0,e_2)
| cycle(X0,e_1)
| ~ next(X0,X1)
| cycle(X1,e_2) ) ).
cnf(u915,axiom,
( ~ product(X0,e_4,e_2)
| equalish(e_3,X0) ) ).
cnf(u47,axiom,
( ~ product(X0,X1,X0)
| equalish(X0,X1) ) ).
cnf(u1043,axiom,
( ~ cycle(e_4,X0)
| ~ next(X0,X1)
| equalish(e_1,X1) ) ).
cnf(u914,negated_conjecture,
( ~ product(e_4,e_3,X0)
| product(X0,e_2,e_4) ) ).
cnf(u836,axiom,
( ~ product(e_3,e_1,X0)
| equalish(e_4,X0) ) ).
cnf(u1040,axiom,
( ~ next(e_3,X2)
| ~ next(X0,X1)
| ~ cycle(X2,X0)
| equalish(e_1,X1) ) ).
cnf(u839,axiom,
~ greater(e_2,e_4) ).
cnf(e_3_then_e_4,axiom,
next(e_3,e_4) ).
cnf(u872,axiom,
( ~ product(X0,e_3,e_2)
| equalish(e_1,X0) ) ).
cnf(u835,axiom,
( ~ product(e_3,X0,e_4)
| equalish(e_1,X0) ) ).
cnf(u844,axiom,
( ~ product(e_4,X0,e_2)
| equalish(e_1,X0) ) ).
cnf(u543,axiom,
( ~ cycle(X0,e_3)
| ~ next(X1,X0)
| cycle(X1,e_0)
| ~ group_element(X1)
| cycle(X1,e_2)
| cycle(X1,e_1) ) ).
cnf(u834,axiom,
( ~ product(X0,e_1,e_4)
| equalish(e_3,X0) ) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3) ).
cnf(e_3_greater_e_2,axiom,
greater(e_3,e_2) ).
cnf(u880,axiom,
( ~ product(e_2,e_3,X0)
| equalish(e_4,X0) ) ).
cnf(u843,axiom,
( ~ product(X0,e_1,e_2)
| equalish(e_4,X0) ) ).
cnf(u52,axiom,
( ~ cycle(X0,X1)
| ~ group_element(X0)
| cycle(X0,e_2)
| cycle(X0,e_1)
| cycle(X0,e_0)
| equalish(X1,e_3) ) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2) ).
cnf(e_4_greater_e_0,axiom,
greater(e_4,e_0) ).
cnf(u842,negated_conjecture,
( ~ product(e_1,e_4,X0)
| product(X0,e_2,e_1) ) ).
cnf(u892,negated_conjecture,
( ~ product(e_4,e_1,X0)
| product(X0,e_3,e_4) ) ).
cnf(u1038,axiom,
( ~ cycle(e_3,X0)
| equalish(X0,e_1) ) ).
cnf(u48,axiom,
equalish(X0,X0) ).
cnf(product_total_function1,axiom,
( ~ group_element(X1)
| ~ group_element(X0)
| product(X0,X1,e_4)
| product(X0,X1,e_3)
| product(X0,X1,e_2)
| product(X0,X1,e_1) ) ).
cnf(u895,axiom,
( ~ product(e_1,e_4,X0)
| equalish(e_3,X0) ) ).
cnf(u1060,axiom,
( ~ next(e_0,X0)
| equalish(e_1,X0) ) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4) ).
cnf(u894,axiom,
( ~ product(e_1,X0,e_3)
| equalish(e_4,X0) ) ).
cnf(u891,axiom,
( ~ product(e_4,e_3,X0)
| equalish(e_1,X0) ) ).
cnf(u889,axiom,
( ~ product(X0,e_3,e_1)
| equalish(e_4,X0) ) ).
cnf(u890,axiom,
( ~ product(e_4,X0,e_1)
| equalish(e_3,X0) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP125-3.004 : TPTP v8.2.0. Released v1.2.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 05:01:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (14482)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (14489)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.37 % (14487)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.37 % (14488)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.37 % (14486)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.14/0.37 % (14490)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37 % (14484)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37 % (14483)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37 Detected minimum model sizes of [1]
% 0.14/0.37 Detected minimum model sizes of [1]
% 0.14/0.37 Detected maximum model sizes of [5]
% 0.14/0.37 Detected maximum model sizes of [5]
% 0.14/0.37 TRYING [1]
% 0.14/0.37 TRYING [1]
% 0.14/0.37 TRYING [2]
% 0.14/0.37 TRYING [2]
% 0.14/0.37 Detected minimum model sizes of [1]
% 0.14/0.37 Detected minimum model sizes of [1]
% 0.14/0.37 Detected maximum model sizes of [5]
% 0.14/0.37 Detected maximum model sizes of [5]
% 0.14/0.37 TRYING [1]
% 0.14/0.37 TRYING [1]
% 0.14/0.37 TRYING [2]
% 0.14/0.37 TRYING [2]
% 0.14/0.37 TRYING [3]
% 0.14/0.37 TRYING [3]
% 0.14/0.37 TRYING [3]
% 0.14/0.37 TRYING [3]
% 0.14/0.38 TRYING [4]
% 0.14/0.38 TRYING [4]
% 0.14/0.38 TRYING [4]
% 0.14/0.38 TRYING [4]
% 0.14/0.38 TRYING [5]
% 0.14/0.38 TRYING [5]
% 0.14/0.38 TRYING [5]
% 0.14/0.38 TRYING [5]
% 0.14/0.39 % (14489)First to succeed.
% 0.14/0.39 % (14489)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-14482"
% 0.14/0.39 % SZS status Satisfiable for theBenchmark
% 0.14/0.39 % (14489)# SZS output start Saturation.
% See solution above
% 0.14/0.39 % (14489)------------------------------
% 0.14/0.39 % (14489)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.39 % (14489)Termination reason: Satisfiable
% 0.14/0.39
% 0.14/0.39 % (14489)Memory used [KB]: 1069
% 0.14/0.39 % (14489)Time elapsed: 0.024 s
% 0.14/0.39 % (14489)Instructions burned: 39 (million)
% 0.14/0.39 % (14482)Success in time 0.03 s
%------------------------------------------------------------------------------