%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP124-2.004 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 : Thu Sep 24 12:37:58 PM UTC 2026
% Result : Unsatisfiable 0.44s 0.62s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 18
% Syntax : Number of clauses : 112 ( 45 unt; 37 nHn; 110 RR)
% Number of literals : 257 ( 0 equ; 113 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 93 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_4)
| product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_total_function1) ).
cnf(no_redundancy,axiom,
( ~ greater(X2,X3)
| ~ next(X1,X3)
| ~ product(X1,e_1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_redundancy) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_1) ).
cnf(e_4_greater_e_3,axiom,
greater(e_4,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_4_greater_e_3) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_is_not_e_2) ).
cnf(product_left_cancellation,axiom,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_left_cancellation) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_2) ).
cnf(e_2_then_e_3,axiom,
next(e_2,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_2_then_e_3) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_is_not_e_4) ).
cnf(product_right_cancellation,axiom,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_right_cancellation) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_idempotence) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_4) ).
cnf(e_2_is_not_e_4,axiom,
~ equalish(e_2,e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_2_is_not_e_4) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_is_not_e_3) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_4) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_3) ).
cnf(qg2_2,negated_conjecture,
( ~ product(X6,X4,X5)
| ~ product(X6,X1,X2)
| ~ product(X4,X5,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qg2_2) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_2_is_not_e_3) ).
cnf(c_0_18,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_4)
| product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
inference(fof_simplification,[status(thm)],[product_total_function1]) ).
cnf(c_0_19,plain,
( ~ greater(X2,X3)
| ~ next(X1,X3)
| ~ product(X1,e_1,X2) ),
inference(fof_simplification,[status(thm)],[no_redundancy]) ).
cnf(c_0_20,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_4)
| product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
c_0_18 ).
cnf(c_0_21,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_22,plain,
( ~ greater(X2,X3)
| ~ next(X1,X3)
| ~ product(X1,e_1,X2) ),
c_0_19 ).
cnf(c_0_23,axiom,
greater(e_4,e_3),
e_4_greater_e_3 ).
cnf(c_0_24,plain,
~ equalish(e_1,e_2),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_2]) ).
cnf(c_0_25,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_26,plain,
( ~ group_element(X1)
| product(X1,e_1,e_1)
| product(X1,e_1,e_2)
| product(X1,e_1,e_3)
| product(X1,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_28,plain,
( ~ next(X1,e_3)
| ~ product(X1,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,axiom,
next(e_2,e_3),
e_2_then_e_3 ).
cnf(c_0_30,plain,
~ equalish(e_1,e_2),
c_0_24 ).
cnf(c_0_31,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
c_0_25 ).
cnf(c_0_32,plain,
~ equalish(e_1,e_4),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_4]) ).
cnf(c_0_33,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_34,plain,
( product(e_2,e_1,e_4)
| product(e_2,e_1,e_3)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
~ product(e_2,e_1,e_4),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
( ~ product(e_1,X1,X2)
| ~ product(e_2,X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,axiom,
product(X1,X1,X1),
product_idempotence ).
cnf(c_0_38,plain,
~ equalish(e_1,e_4),
c_0_32 ).
cnf(c_0_39,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
c_0_33 ).
cnf(c_0_40,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_3) ),
inference(sr,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
~ product(e_2,e_1,e_1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_43,plain,
( ~ product(X1,e_1,X2)
| ~ product(X1,e_4,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
( product(e_2,e_1,e_3)
| product(e_2,e_1,e_2) ),
inference(sr,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
~ equalish(e_2,e_4),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_4]) ).
cnf(c_0_46,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_47,plain,
( ~ group_element(X1)
| product(X1,e_4,e_1)
| product(X1,e_4,e_2)
| product(X1,e_4,e_3)
| product(X1,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_20,c_0_42]) ).
cnf(c_0_48,plain,
( ~ product(X1,e_1,X2)
| ~ product(X1,e_2,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_39]) ).
cnf(c_0_49,plain,
( ~ product(e_2,e_4,e_3)
| product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
~ equalish(e_2,e_4),
c_0_45 ).
cnf(c_0_51,plain,
~ equalish(e_1,e_3),
c_0_46 ).
cnf(c_0_52,plain,
~ equalish(e_3,e_4),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_4]) ).
cnf(c_0_53,plain,
( product(e_2,e_4,e_4)
| product(e_2,e_4,e_3)
| product(e_2,e_4,e_2)
| product(e_2,e_4,e_1) ),
inference(spm,[status(thm)],[c_0_47,c_0_27]) ).
cnf(c_0_54,plain,
~ product(e_2,e_4,e_3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_37])]) ).
cnf(c_0_55,plain,
( ~ product(e_2,X1,X2)
| ~ product(e_4,X1,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_31]) ).
cnf(c_0_56,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_57,plain,
( ~ product(X1,e_1,X2)
| ~ product(X1,e_3,X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_39]) ).
cnf(c_0_58,plain,
~ equalish(e_3,e_4),
c_0_52 ).
cnf(c_0_59,plain,
( product(e_2,e_4,e_1)
| product(e_2,e_4,e_2)
| product(e_2,e_4,e_4) ),
inference(sr,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
~ product(e_2,e_4,e_4),
inference(spm,[status(thm)],[c_0_55,c_0_37]) ).
cnf(c_0_61,plain,
( ~ group_element(X1)
| product(X1,e_3,e_1)
| product(X1,e_3,e_2)
| product(X1,e_3,e_3)
| product(X1,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_20,c_0_56]) ).
cnf(c_0_62,plain,
( ~ product(e_2,e_3,e_3)
| product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_57,c_0_44]) ).
cnf(c_0_63,plain,
( ~ product(X1,e_3,X2)
| ~ product(X1,e_4,X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_39]) ).
cnf(c_0_64,plain,
( product(e_2,e_4,e_2)
| product(e_2,e_4,e_1) ),
inference(sr,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,negated_conjecture,
( ~ product(X6,X4,X5)
| ~ product(X6,X1,X2)
| ~ product(X4,X5,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X5) ),
inference(fof_simplification,[status(thm)],[qg2_2]) ).
cnf(c_0_66,plain,
( product(e_1,e_3,e_4)
| product(e_1,e_3,e_3)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_61,c_0_21]) ).
cnf(c_0_67,plain,
~ product(e_1,e_3,e_1),
inference(spm,[status(thm)],[c_0_57,c_0_37]) ).
cnf(c_0_68,plain,
( product(e_2,e_3,e_4)
| product(e_2,e_3,e_3)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_61,c_0_27]) ).
cnf(c_0_69,plain,
~ product(e_2,e_3,e_3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_62]),c_0_37])]) ).
cnf(c_0_70,plain,
( ~ product(X1,e_2,X2)
| ~ product(X1,e_4,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_39]) ).
cnf(c_0_71,plain,
( ~ product(e_2,e_3,e_1)
| product(e_2,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_72,plain,
~ equalish(e_2,e_3),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_3]) ).
cnf(c_0_73,negated_conjecture,
( ~ product(X6,X4,X5)
| ~ product(X6,X1,X2)
| ~ product(X4,X5,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X5) ),
c_0_65 ).
cnf(c_0_74,plain,
( product(e_1,e_3,e_2)
| product(e_1,e_3,e_3)
| product(e_1,e_3,e_4) ),
inference(sr,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_75,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_4) ),
inference(sr,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_76,plain,
~ product(e_2,e_3,e_1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_37])]) ).
cnf(c_0_77,plain,
( ~ product(e_1,X1,X2)
| ~ product(e_4,X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_31]) ).
cnf(c_0_78,plain,
~ equalish(e_2,e_3),
c_0_72 ).
cnf(c_0_79,plain,
( product(e_4,e_3,e_4)
| product(e_4,e_3,e_3)
| product(e_4,e_3,e_2)
| product(e_4,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_61,c_0_42]) ).
cnf(c_0_80,plain,
~ product(e_4,e_3,e_4),
inference(spm,[status(thm)],[c_0_63,c_0_37]) ).
cnf(c_0_81,plain,
( ~ group_element(X1)
| product(X1,e_2,e_1)
| product(X1,e_2,e_2)
| product(X1,e_2,e_3)
| product(X1,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_82,negated_conjecture,
( ~ product(X3,e_1,X4)
| ~ product(X2,e_3,X4)
| ~ product(X1,X3,e_1)
| ~ product(X1,X2,e_3) ),
inference(spm,[status(thm)],[c_0_51,c_0_73]) ).
cnf(c_0_83,plain,
( ~ product(e_2,e_3,e_4)
| product(e_1,e_3,e_3)
| product(e_1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_36,c_0_74]) ).
cnf(c_0_84,plain,
( product(e_2,e_3,e_4)
| product(e_2,e_3,e_2) ),
inference(sr,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_85,plain,
( product(e_4,e_1,e_4)
| product(e_4,e_1,e_3)
| product(e_4,e_1,e_2)
| product(e_4,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_26,c_0_42]) ).
cnf(c_0_86,plain,
~ product(e_4,e_1,e_1),
inference(spm,[status(thm)],[c_0_77,c_0_37]) ).
cnf(c_0_87,plain,
( ~ product(X1,e_2,X2)
| ~ product(X1,e_3,X2) ),
inference(spm,[status(thm)],[c_0_78,c_0_39]) ).
cnf(c_0_88,plain,
( product(e_4,e_3,e_1)
| product(e_4,e_3,e_2)
| product(e_4,e_3,e_3) ),
inference(sr,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_89,plain,
( product(e_4,e_2,e_4)
| product(e_4,e_2,e_3)
| product(e_4,e_2,e_2)
| product(e_4,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_81,c_0_42]) ).
cnf(c_0_90,plain,
~ product(e_4,e_2,e_4),
inference(spm,[status(thm)],[c_0_70,c_0_37]) ).
cnf(c_0_91,negated_conjecture,
( ~ product(X1,e_1,X2)
| ~ product(e_1,e_3,X2)
| ~ product(e_2,X1,e_1)
| product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_82,c_0_44]) ).
cnf(c_0_92,plain,
( ~ product(e_1,X1,X2)
| ~ product(e_3,X1,X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_31]) ).
cnf(c_0_93,plain,
( product(e_1,e_3,e_2)
| product(e_1,e_3,e_3)
| product(e_2,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_94,plain,
( product(e_4,e_1,e_2)
| product(e_4,e_1,e_3)
| product(e_4,e_1,e_4) ),
inference(sr,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_95,plain,
( ~ product(e_4,e_2,e_1)
| product(e_4,e_3,e_3)
| product(e_4,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_96,plain,
( product(e_4,e_2,e_1)
| product(e_4,e_2,e_2)
| product(e_4,e_2,e_3) ),
inference(sr,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_97,negated_conjecture,
( ~ product(e_4,e_1,X1)
| ~ product(e_1,e_3,X1)
| product(e_2,e_1,e_2)
| product(e_2,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_91,c_0_64]) ).
cnf(c_0_98,plain,
( product(e_2,e_3,e_2)
| product(e_1,e_3,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_37])]) ).
cnf(c_0_99,plain,
( product(e_4,e_1,e_3)
| product(e_4,e_1,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_94]),c_0_37])]) ).
cnf(c_0_100,plain,
( ~ product(e_3,X1,X2)
| ~ product(e_4,X1,X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_31]) ).
cnf(c_0_101,plain,
( product(e_4,e_3,e_2)
| product(e_4,e_3,e_3)
| product(e_4,e_2,e_3)
| product(e_4,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_102,negated_conjecture,
( ~ product(e_4,e_1,e_2)
| product(e_2,e_4,e_2)
| product(e_2,e_3,e_2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_55]) ).
cnf(c_0_103,plain,
( ~ product(e_4,e_2,e_3)
| product(e_4,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_48,c_0_99]) ).
cnf(c_0_104,plain,
( product(e_4,e_2,e_2)
| product(e_4,e_2,e_3)
| product(e_4,e_3,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_37])]) ).
cnf(c_0_105,plain,
~ product(e_4,e_3,e_2),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_98]),c_0_55]) ).
cnf(c_0_106,negated_conjecture,
( ~ product(e_4,e_2,e_3)
| product(e_2,e_3,e_2)
| product(e_2,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_107,plain,
( product(e_4,e_2,e_3)
| product(e_4,e_2,e_2) ),
inference(sr,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_108,negated_conjecture,
( product(e_2,e_4,e_2)
| product(e_2,e_3,e_2)
| product(e_4,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_109,negated_conjecture,
( product(e_2,e_3,e_2)
| product(e_2,e_4,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_108]),c_0_37])]) ).
cnf(c_0_110,negated_conjecture,
product(e_2,e_3,e_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_109]),c_0_37])]) ).
cnf(c_0_111,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_110]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP124-2.004 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.47 % Computer : n017.cluster.edu
% 0.16/0.47 % Model : x86_64 x86_64
% 0.16/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.47 % Memory : 8046.5625MB
% 0.16/0.47 % OS : Linux 6.8.0-71-generic
% 0.16/0.47 % CPULimit : 300
% 0.16/0.47 % WCLimit : 300
% 0.16/0.47 % DateTime : Sun Sep 20 19:53:56 UTC 2026
% 0.16/0.48 % CPUTime :
% 0.16/0.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.53 Running first-order theorem proving
% 0.20/0.53 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.44/0.62 % Version: 3.5.1
% 0.44/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.44/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.44/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.44/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.44/0.62 % Starting sh5l with 300s (1) cores
% 0.44/0.62 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 491349 completed with status 0
% 0.44/0.62 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.44/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.44/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.44/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.44/0.62 % No SInE strategy applied
% 0.44/0.62 % Search class: FGHNF-FFSM00-SFFFFFNN
% 0.44/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.44/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.44/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.44/0.62 % Starting G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.44/0.62 % Starting new_bool_3 with 136s (1) cores
% 0.44/0.62 % Starting new_bool_1 with 136s (1) cores
% 0.44/0.62 % G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI with pid 491359 completed with status 0
% 0.44/0.62 % Result found by G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI
% 0.44/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.44/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.44/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.44/0.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.44/0.62 % No SInE strategy applied
% 0.44/0.62 % Search class: FGHNF-FFSM00-SFFFFFNN
% 0.44/0.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.44/0.62 % Starting SubtermCWHack with 136s (1) cores
% 0.44/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.44/0.62 % Starting G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.44/0.62 % Preprocessing time : 0.002 s
% 0.44/0.62 % Presaturation interreduction done
% 0.44/0.62
% 0.44/0.62 % Proof found!
% 0.44/0.62 % SZS status Unsatisfiable
% 0.44/0.62 % SZS output start CNFRefutation
% See solution above
% 0.44/0.62 % Parsed axioms : 33
% 0.44/0.62 % Removed by relevancy pruning/SinE : 0
% 0.44/0.62 % Initial clauses : 33
% 0.44/0.62 % Removed in clause preprocessing : 0
% 0.44/0.62 % Initial clauses in saturation : 33
% 0.44/0.62 % Processed clauses : 332
% 0.44/0.62 % ...of these trivial : 0
% 0.44/0.62 % ...subsumed : 61
% 0.44/0.62 % ...remaining for further processing : 271
% 0.44/0.62 % Other redundant clauses eliminated : 0
% 0.44/0.62 % Clauses deleted for lack of memory : 0
% 0.44/0.62 % Backward-subsumed : 62
% 0.44/0.62 % Backward-rewritten : 11
% 0.44/0.62 % Generated clauses : 560
% 0.44/0.62 % ...of the previous two non-redundant : 475
% 0.44/0.62 % ...aggressively subsumed : 0
% 0.44/0.62 % Contextual simplify-reflections : 2
% 0.44/0.62 % Paramodulations : 542
% 0.44/0.62 % Factorizations : 0
% 0.44/0.62 % NegExts : 0
% 0.44/0.62 % Equation resolutions : 0
% 0.44/0.62 % Disequality decompositions : 0
% 0.44/0.62 % Total rewrite steps : 37
% 0.44/0.62 % ...of those cached : 32
% 0.44/0.62 % Propositional unsat checks : 0
% 0.44/0.62 % Propositional check models : 0
% 0.44/0.62 % Propositional check unsatisfiable : 0
% 0.44/0.62 % Propositional clauses : 0
% 0.44/0.62 % Propositional clauses after purity: 0
% 0.44/0.62 % Propositional unsat core size : 0
% 0.44/0.62 % Propositional preprocessing time : 0.000
% 0.44/0.62 % Propositional encoding time : 0.000
% 0.44/0.62 % Propositional solver time : 0.000
% 0.44/0.62 % Success case prop preproc time : 0.000
% 0.44/0.62 % Success case prop encoding time : 0.000
% 0.44/0.62 % Success case prop solver time : 0.000
% 0.44/0.62 % Current number of processed clauses : 147
% 0.44/0.62 % Positive orientable unit clauses : 15
% 0.44/0.62 % Positive unorientable unit clauses: 0
% 0.44/0.62 % Negative unit clauses : 39
% 0.44/0.62 % Non-unit-clauses : 93
% 0.44/0.62 % Current number of unprocessed clauses: 164
% 0.44/0.62 % ...number of literals in the above : 658
% 0.44/0.62 % Current number of archived formulas : 0
% 0.44/0.62 % Current number of archived clauses : 124
% 0.44/0.62 % Clause-clause subsumption calls (NU) : 3819
% 0.44/0.62 % Rec. Clause-clause subsumption calls : 2855
% 0.44/0.62 % Non-unit clause-clause subsumptions : 66
% 0.44/0.62 % Unit Clause-clause subsumption calls : 88
% 0.44/0.62 % Rewrite failures with RHS unbound : 0
% 0.44/0.62 % BW rewrite match attempts : 4
% 0.44/0.62 % BW rewrite match successes : 1
% 0.44/0.62 % Condensation attempts : 0
% 0.44/0.62 % Condensation successes : 0
% 0.44/0.62 % Termbank termtop insertions : 6498
% 0.44/0.62 % Search garbage collected termcells : 65
% 0.44/0.62
% 0.44/0.62 % -------------------------------------------------
% 0.44/0.62 % User time : 0.037 s
% 0.44/0.62 % System time : 0.005 s
% 0.44/0.62 % Total time : 0.042 s
% 0.44/0.62 % Maximum resident set size: 3648 pages
% 0.44/0.62
% 0.44/0.62 % -------------------------------------------------
% 0.44/0.62 % User time : 0.153 s
% 0.44/0.62 % System time : 0.017 s
% 0.44/0.62 % Total time : 0.170 s
% 0.44/0.62 % Maximum resident set size: 4864 pages
% 0.44/0.62 % E exiting
%------------------------------------------------------------------------------