%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP133-2.003 : 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 : n016.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:38:42 PM UTC 2026
% Result : Unsatisfiable 0.33s 0.46s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 14
% Syntax : Number of clauses : 96 ( 26 unt; 35 nHn; 96 RR)
% Number of literals : 222 ( 0 equ; 97 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 88 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( ~ group_element(X2)
| ~ group_element(X1)
| 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_3_greater_e_2,axiom,
greater(e_3,e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_greater_e_2) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_1) ).
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(e_1_then_e_2,axiom,
next(e_1,e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_then_e_2) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_2_is_not_e_1) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_2) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_3) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_2) ).
cnf(qg3,negated_conjecture,
( ~ product(X2,X1,X4)
| ~ product(X1,X2,X3)
| product(X3,X4,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qg3) ).
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(product_total_function2,axiom,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_total_function2) ).
cnf(c_0_14,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| 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_15,plain,
( ~ greater(X2,X3)
| ~ next(X1,X3)
| ~ product(X1,e_1,X2) ),
inference(fof_simplification,[status(thm)],[no_redundancy]) ).
cnf(c_0_16,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
c_0_14 ).
cnf(c_0_17,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_18,plain,
( ~ greater(X2,X3)
| ~ next(X1,X3)
| ~ product(X1,e_1,X2) ),
c_0_15 ).
cnf(c_0_19,axiom,
greater(e_3,e_2),
e_3_greater_e_2 ).
cnf(c_0_20,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
cnf(c_0_21,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_22,plain,
( ~ group_element(X1)
| product(X1,e_1,e_1)
| product(X1,e_1,e_2)
| product(X1,e_1,e_3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( ~ next(X1,e_2)
| ~ product(X1,e_1,e_3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,axiom,
next(e_1,e_2),
e_1_then_e_2 ).
cnf(c_0_25,plain,
~ equalish(e_2,e_1),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_1]) ).
cnf(c_0_26,plain,
~ equalish(e_3,e_1),
c_0_20 ).
cnf(c_0_27,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
c_0_21 ).
cnf(c_0_28,plain,
( product(e_1,e_1,e_3)
| product(e_1,e_1,e_2)
| product(e_1,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_29,plain,
~ product(e_1,e_1,e_3),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
~ equalish(e_3,e_2),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_2]) ).
cnf(c_0_31,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_32,plain,
~ equalish(e_2,e_1),
c_0_25 ).
cnf(c_0_33,plain,
( ~ product(X1,e_3,X2)
| ~ product(X1,e_1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( product(e_1,e_1,e_1)
| product(e_1,e_1,e_2) ),
inference(sr,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
~ equalish(e_3,e_2),
c_0_30 ).
cnf(c_0_36,plain,
( ~ group_element(X1)
| product(X1,e_3,e_1)
| product(X1,e_3,e_2)
| product(X1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_16,c_0_31]) ).
cnf(c_0_37,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_38,plain,
( ~ product(X1,e_2,X2)
| ~ product(X1,e_1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_27]) ).
cnf(c_0_39,plain,
( ~ product(e_1,e_3,e_1)
| product(e_1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( ~ product(X2,X1,X4)
| ~ product(X1,X2,X3)
| product(X3,X4,X1) ),
inference(fof_simplification,[status(thm)],[qg3]) ).
cnf(c_0_41,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_42,plain,
( ~ product(X1,e_3,X2)
| ~ product(X1,e_2,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_27]) ).
cnf(c_0_43,plain,
( 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_36,c_0_17]) ).
cnf(c_0_44,plain,
( ~ group_element(X1)
| product(X1,e_2,e_1)
| product(X1,e_2,e_2)
| product(X1,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_16,c_0_37]) ).
cnf(c_0_45,plain,
( ~ product(e_1,e_3,e_1)
| ~ product(e_1,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( ~ product(X2,X1,X4)
| ~ product(X1,X2,X3)
| product(X3,X4,X1) ),
c_0_40 ).
cnf(c_0_47,plain,
( product(e_3,e_3,e_3)
| product(e_3,e_3,e_2)
| product(e_3,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_48,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
c_0_41 ).
cnf(c_0_49,plain,
( ~ product(e_1,e_2,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( product(e_1,e_2,e_3)
| product(e_1,e_2,e_2)
| product(e_1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_44,c_0_17]) ).
cnf(c_0_51,plain,
( ~ product(e_1,e_2,e_2)
| product(e_1,e_3,e_3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_43]),c_0_42]) ).
cnf(c_0_52,negated_conjecture,
( ~ product(e_3,e_3,X1)
| product(X1,e_1,e_3)
| product(e_3,e_3,e_2)
| product(e_3,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,plain,
( ~ product(e_3,X1,X2)
| ~ product(e_1,X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_48]) ).
cnf(c_0_54,plain,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2)
| product(e_1,e_2,e_3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_55,negated_conjecture,
( product(e_3,e_3,e_3)
| product(e_3,e_3,e_2)
| product(e_1,e_1,e_3) ),
inference(spm,[status(thm)],[c_0_52,c_0_47]) ).
cnf(c_0_56,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
inference(fof_simplification,[status(thm)],[product_total_function2]) ).
cnf(c_0_57,plain,
( product(e_2,e_2,e_3)
| product(e_2,e_2,e_2)
| product(e_2,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_44,c_0_37]) ).
cnf(c_0_58,plain,
( ~ product(e_1,e_3,e_1)
| ~ product(e_3,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_53,c_0_39]) ).
cnf(c_0_59,plain,
( ~ product(e_1,e_2,e_1)
| product(e_1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_38,c_0_34]) ).
cnf(c_0_60,plain,
( ~ product(e_3,e_3,e_3)
| product(e_1,e_2,e_3)
| product(e_1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_61,negated_conjecture,
( product(e_3,e_3,e_2)
| product(e_3,e_3,e_3) ),
inference(sr,[status(thm)],[c_0_55,c_0_29]) ).
cnf(c_0_62,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
c_0_56 ).
cnf(c_0_63,negated_conjecture,
( ~ product(e_2,e_2,X1)
| product(X1,e_1,e_2)
| product(e_2,e_2,e_2)
| product(e_2,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_46,c_0_57]) ).
cnf(c_0_64,negated_conjecture,
( ~ product(e_3,e_1,X1)
| product(X1,e_1,e_3)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_46,c_0_43]) ).
cnf(c_0_65,plain,
( product(e_3,e_1,e_3)
| product(e_3,e_1,e_2)
| product(e_3,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_22,c_0_31]) ).
cnf(c_0_66,plain,
( ~ product(e_3,e_1,e_2)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_58,c_0_43]) ).
cnf(c_0_67,plain,
( ~ product(e_1,e_2,e_1)
| ~ product(e_1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_33,c_0_59]) ).
cnf(c_0_68,negated_conjecture,
( product(e_1,e_3,e_2)
| product(e_1,e_2,e_3)
| product(e_3,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_69,plain,
( ~ product(X1,X2,e_3)
| ~ product(X1,X2,e_1) ),
inference(spm,[status(thm)],[c_0_26,c_0_62]) ).
cnf(c_0_70,plain,
( ~ product(X1,X2,e_3)
| ~ product(X1,X2,e_2) ),
inference(spm,[status(thm)],[c_0_35,c_0_62]) ).
cnf(c_0_71,negated_conjecture,
( product(e_2,e_2,e_3)
| product(e_2,e_2,e_2)
| product(e_1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_63,c_0_57]) ).
cnf(c_0_72,negated_conjecture,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2)
| product(e_3,e_1,e_3) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_29]),c_0_66]) ).
cnf(c_0_73,negated_conjecture,
( ~ product(e_1,e_2,e_1)
| product(e_3,e_3,e_2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]) ).
cnf(c_0_74,negated_conjecture,
( ~ product(e_1,e_2,e_2)
| product(e_3,e_3,e_2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_68]),c_0_70]) ).
cnf(c_0_75,negated_conjecture,
( ~ product(e_1,e_3,e_2)
| product(e_2,e_2,e_2)
| product(e_2,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_33,c_0_71]) ).
cnf(c_0_76,negated_conjecture,
( ~ product(e_3,e_3,e_3)
| product(e_1,e_3,e_2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_72]),c_0_33]) ).
cnf(c_0_77,plain,
( ~ product(e_2,X1,X2)
| ~ product(e_1,X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_48]) ).
cnf(c_0_78,negated_conjecture,
( product(e_3,e_3,e_2)
| product(e_1,e_2,e_3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_50]),c_0_74]) ).
cnf(c_0_79,negated_conjecture,
( ~ product(e_3,e_3,e_3)
| product(e_2,e_2,e_3)
| product(e_2,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_80,negated_conjecture,
( ~ product(e_2,e_2,e_3)
| product(e_3,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,negated_conjecture,
( product(e_2,e_2,e_2)
| product(e_3,e_3,e_2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_61]),c_0_80]) ).
cnf(c_0_82,plain,
( ~ product(e_3,X1,X2)
| ~ product(e_2,X1,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_48]) ).
cnf(c_0_83,plain,
( 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_36,c_0_37]) ).
cnf(c_0_84,plain,
( product(e_3,e_2,e_3)
| product(e_3,e_2,e_2)
| product(e_3,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_44,c_0_31]) ).
cnf(c_0_85,negated_conjecture,
~ product(e_3,e_2,e_2),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_81]),c_0_82]) ).
cnf(c_0_86,negated_conjecture,
( ~ product(e_3,e_2,X1)
| product(X1,e_1,e_3)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_46,c_0_83]) ).
cnf(c_0_87,plain,
( product(e_3,e_2,e_1)
| product(e_3,e_2,e_3) ),
inference(sr,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_88,negated_conjecture,
~ product(e_2,e_3,e_2),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_81]),c_0_42]) ).
cnf(c_0_89,negated_conjecture,
( product(e_2,e_3,e_3)
| product(e_3,e_2,e_3) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]),c_0_29]) ).
cnf(c_0_90,negated_conjecture,
( product(e_2,e_3,e_3)
| product(e_3,e_1,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_89]),c_0_88]) ).
cnf(c_0_91,negated_conjecture,
~ product(e_3,e_3,e_3),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_90]),c_0_82]) ).
cnf(c_0_92,negated_conjecture,
product(e_3,e_3,e_2),
inference(sr,[status(thm)],[c_0_61,c_0_91]) ).
cnf(c_0_93,negated_conjecture,
( ~ product(e_3,e_3,X1)
| product(X1,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_46,c_0_92]) ).
cnf(c_0_94,negated_conjecture,
~ product(e_2,e_2,e_3),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_89]),c_0_42]) ).
cnf(c_0_95,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_92]),c_0_94]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP133-2.003 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n016.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 20 20:06:08 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.33/0.46 % Version: 3.5.1
% 0.33/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.33/0.46 % Starting sh5l with 300s (1) cores
% 0.33/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 676050 completed with status 0
% 0.33/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.33/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.46 % No SInE strategy applied
% 0.33/0.46 % Search class: FGHNF-FFSM00-SFFFFFNN
% 0.33/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.33/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.33/0.46 % Starting G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.33/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.33/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.33/0.46 % G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI with pid 676058 completed with status 0
% 0.33/0.46 % Result found by G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI
% 0.33/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.46 % No SInE strategy applied
% 0.33/0.46 % Search class: FGHNF-FFSM00-SFFFFFNN
% 0.33/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.33/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.33/0.46 % Starting G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.33/0.46 % Preprocessing time : 0.001 s
% 0.33/0.46 % Presaturation interreduction done
% 0.33/0.46
% 0.33/0.46 % Proof found!
% 0.33/0.46 % SZS status Unsatisfiable
% 0.33/0.46 % SZS output start CNFRefutation
% See solution above
% 0.33/0.46 % Parsed axioms : 20
% 0.33/0.46 % Removed by relevancy pruning/SinE : 0
% 0.33/0.46 % Initial clauses : 20
% 0.33/0.46 % Removed in clause preprocessing : 0
% 0.33/0.46 % Initial clauses in saturation : 20
% 0.33/0.46 % Processed clauses : 235
% 0.33/0.46 % ...of these trivial : 0
% 0.33/0.46 % ...subsumed : 45
% 0.33/0.46 % ...remaining for further processing : 190
% 0.33/0.46 % Other redundant clauses eliminated : 0
% 0.33/0.46 % Clauses deleted for lack of memory : 0
% 0.33/0.46 % Backward-subsumed : 48
% 0.33/0.46 % Backward-rewritten : 18
% 0.33/0.46 % Generated clauses : 352
% 0.33/0.46 % ...of the previous two non-redundant : 319
% 0.33/0.46 % ...aggressively subsumed : 0
% 0.33/0.46 % Contextual simplify-reflections : 22
% 0.33/0.46 % Paramodulations : 340
% 0.33/0.46 % Factorizations : 0
% 0.33/0.46 % NegExts : 0
% 0.33/0.46 % Equation resolutions : 0
% 0.33/0.46 % Disequality decompositions : 0
% 0.33/0.46 % Total rewrite steps : 18
% 0.33/0.46 % ...of those cached : 16
% 0.33/0.46 % Propositional unsat checks : 0
% 0.33/0.46 % Propositional check models : 0
% 0.33/0.46 % Propositional check unsatisfiable : 0
% 0.33/0.46 % Propositional clauses : 0
% 0.33/0.46 % Propositional clauses after purity: 0
% 0.33/0.46 % Propositional unsat core size : 0
% 0.33/0.46 % Propositional preprocessing time : 0.000
% 0.33/0.46 % Propositional encoding time : 0.000
% 0.33/0.46 % Propositional solver time : 0.000
% 0.33/0.46 % Success case prop preproc time : 0.000
% 0.33/0.46 % Success case prop encoding time : 0.000
% 0.33/0.46 % Success case prop solver time : 0.000
% 0.33/0.46 % Current number of processed clauses : 92
% 0.33/0.46 % Positive orientable unit clauses : 10
% 0.33/0.46 % Positive unorientable unit clauses: 0
% 0.33/0.46 % Negative unit clauses : 13
% 0.33/0.46 % Non-unit-clauses : 69
% 0.33/0.46 % Current number of unprocessed clauses: 107
% 0.33/0.46 % ...number of literals in the above : 369
% 0.33/0.46 % Current number of archived formulas : 0
% 0.33/0.46 % Current number of archived clauses : 98
% 0.33/0.46 % Clause-clause subsumption calls (NU) : 2085
% 0.33/0.46 % Rec. Clause-clause subsumption calls : 1800
% 0.33/0.46 % Non-unit clause-clause subsumptions : 68
% 0.33/0.46 % Unit Clause-clause subsumption calls : 174
% 0.33/0.46 % Rewrite failures with RHS unbound : 0
% 0.33/0.46 % BW rewrite match attempts : 8
% 0.33/0.46 % BW rewrite match successes : 2
% 0.33/0.46 % Condensation attempts : 0
% 0.33/0.46 % Condensation successes : 0
% 0.33/0.46 % Termbank termtop insertions : 4291
% 0.33/0.46 % Search garbage collected termcells : 44
% 0.33/0.46
% 0.33/0.46 % -------------------------------------------------
% 0.33/0.46 % User time : 0.013 s
% 0.33/0.46 % System time : 0.005 s
% 0.33/0.46 % Total time : 0.018 s
% 0.33/0.46 % Maximum resident set size: 3384 pages
% 0.33/0.46
% 0.33/0.46 % -------------------------------------------------
% 0.33/0.46 % User time : 0.062 s
% 0.33/0.46 % System time : 0.017 s
% 0.33/0.46 % Total time : 0.079 s
% 0.33/0.46 % Maximum resident set size: 4608 pages
% 0.33/0.46 % E exiting
%------------------------------------------------------------------------------