%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : RNG001-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 02:05:58 PM UTC 2026
% Result : Unsatisfiable 45.12s 8.79s
% Output : CNFRefutation 45.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 17
% Syntax : Number of clauses : 77 ( 77 unt; 0 nHn; 5 RR)
% Number of literals : 77 ( 76 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-4 aty)
% Number of variables : 214 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_addition2,axiom,
ifeq(sum(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X1,X6),true,sum(X6,X2,X5),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_addition2) ).
cnf(additive_identity2,axiom,
sum(X1,additive_identity,X1) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity2) ).
cnf(ifeq_axiom_001,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(distributivity4,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X2,X6),true),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity4) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity1) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
cnf(addition_is_well_defined,axiom,
ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addition_is_well_defined) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',closure_of_addition) ).
cnf(ifeq_axiom,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(commutativity_of_addition,axiom,
ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_addition) ).
cnf(associativity_of_multiplication2,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X4,X3,X5),true,ifeq(product(X4,X1,X6),true,product(X6,X2,X5),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_multiplication2) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',closure_of_multiplication) ).
cnf(cancellation2,axiom,
ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X4,X2,X3),true,X4,X1),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cancellation2) ).
cnf(multiplication_is_well_defined,axiom,
ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplication_is_well_defined) ).
cnf(distributivity2,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity2) ).
cnf(right_inverse,axiom,
sum(X1,additive_inverse(X1),additive_identity) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_inverse) ).
cnf(prove_a_times_additive_id_is_additive_id,negated_conjecture,
product(a,additive_identity,additive_identity) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_times_additive_id_is_additive_id) ).
cnf(c_0_17,axiom,
ifeq(sum(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X1,X6),true,sum(X6,X2,X5),true),true),true) = true,
associativity_of_addition2 ).
cnf(c_0_18,axiom,
sum(X1,additive_identity,X1) = true,
additive_identity2 ).
cnf(c_0_19,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_20,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X2,X6),true),true),true),true) = true,
distributivity4 ).
cnf(c_0_21,axiom,
sum(additive_identity,X1,X1) = true,
additive_identity1 ).
cnf(c_0_22,plain,
ifeq(sum(X1,X2,additive_identity),true,ifeq(sum(X3,X1,X4),true,sum(X4,X2,X3),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,axiom,
sum(additive_inverse(X1),X1,additive_identity) = true,
left_inverse ).
cnf(c_0_24,axiom,
ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3) = X3,
addition_is_well_defined ).
cnf(c_0_25,axiom,
sum(X1,X2,add(X1,X2)) = true,
closure_of_addition ).
cnf(c_0_26,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_27,axiom,
ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true) = true,
commutativity_of_addition ).
cnf(c_0_28,plain,
ifeq(product(X1,X2,X3),true,ifeq(product(additive_identity,X2,X4),true,ifeq(sum(X4,X3,X5),true,product(X1,X2,X5),true),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19]) ).
cnf(c_0_29,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X4,X3,X5),true,ifeq(product(X4,X1,X6),true,product(X6,X2,X5),true),true),true) = true,
associativity_of_multiplication2 ).
cnf(c_0_30,axiom,
product(X1,X2,multiply(X1,X2)) = true,
closure_of_multiplication ).
cnf(c_0_31,axiom,
ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X4,X2,X3),true,X4,X1),X1) = X1,
cancellation2 ).
cnf(c_0_32,plain,
ifeq(sum(X1,additive_inverse(X2),X3),true,sum(X3,X2,X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]) ).
cnf(c_0_33,plain,
ifeq2(sum(X1,X2,X3),true,add(X1,X2),X3) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_34,plain,
sum(X1,X2,add(X2,X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_19]) ).
cnf(c_0_35,plain,
ifeq(product(X1,X2,X3),true,ifeq(product(additive_identity,X2,X4),true,product(X1,X2,add(X4,X3)),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_19]) ).
cnf(c_0_36,plain,
ifeq(product(X1,X2,X3),true,ifeq(product(X4,X3,X5),true,product(multiply(X4,X1),X2,X5),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_19]) ).
cnf(c_0_37,plain,
ifeq2(sum(X1,X2,add(X3,X2)),true,X3,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_25]),c_0_26]) ).
cnf(c_0_38,plain,
sum(add(X1,additive_inverse(X2)),X2,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_19]) ).
cnf(c_0_39,plain,
add(X1,X2) = add(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_26]) ).
cnf(c_0_40,plain,
ifeq2(sum(X1,X2,add(X2,X3)),true,X3,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_34]),c_0_26]) ).
cnf(c_0_41,axiom,
ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3) = X3,
multiplication_is_well_defined ).
cnf(c_0_42,plain,
ifeq(product(X1,X2,X3),true,product(X1,X2,add(multiply(additive_identity,X2),X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_30]),c_0_19]) ).
cnf(c_0_43,plain,
ifeq(product(X1,X2,X3),true,product(multiply(X4,X1),X2,multiply(X4,X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_19]) ).
cnf(c_0_44,plain,
add(additive_inverse(X1),add(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_26]),c_0_39]) ).
cnf(c_0_45,plain,
add(additive_inverse(X1),add(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_38]),c_0_26]),c_0_39]) ).
cnf(c_0_46,plain,
ifeq2(product(X1,X2,X3),true,multiply(X1,X2),X3) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_30]),c_0_26]) ).
cnf(c_0_47,plain,
product(X1,X2,add(multiply(additive_identity,X2),multiply(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_30]),c_0_19]) ).
cnf(c_0_48,plain,
ifeq2(sum(additive_inverse(X1),X1,X2),true,additive_identity,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_26]) ).
cnf(c_0_49,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true) = true,
distributivity2 ).
cnf(c_0_50,plain,
product(multiply(X1,X2),X3,multiply(X1,multiply(X2,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_30]),c_0_19]) ).
cnf(c_0_51,plain,
ifeq2(sum(X1,X2,additive_identity),true,additive_inverse(X2),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_23]),c_0_26]) ).
cnf(c_0_52,axiom,
sum(X1,additive_inverse(X1),additive_identity) = true,
right_inverse ).
cnf(c_0_53,plain,
add(X1,additive_inverse(add(X2,X1))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_39]) ).
cnf(c_0_54,plain,
add(multiply(additive_identity,X1),multiply(X2,X1)) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_26]) ).
cnf(c_0_55,plain,
add(X1,additive_inverse(X1)) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_34]),c_0_26]) ).
cnf(c_0_56,plain,
ifeq2(sum(X1,X2,X2),true,additive_identity,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_21]),c_0_26]) ).
cnf(c_0_57,plain,
ifeq(product(X1,X2,X3),true,ifeq(product(X1,additive_identity,X4),true,ifeq(sum(X4,X3,X5),true,product(X1,X2,X5),true),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_21]),c_0_19]) ).
cnf(c_0_58,plain,
ifeq2(product(multiply(X1,X2),X3,X4),true,multiply(X1,multiply(X2,X3)),X4) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_50]),c_0_26]) ).
cnf(c_0_59,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_50]),c_0_26]) ).
cnf(c_0_60,plain,
additive_inverse(additive_inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_26]) ).
cnf(c_0_61,plain,
additive_inverse(multiply(additive_identity,X1)) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_62,plain,
additive_inverse(additive_identity) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_23]),c_0_26]) ).
cnf(c_0_63,plain,
ifeq(product(X1,X2,X3),true,ifeq(product(X1,additive_identity,X4),true,product(X1,X2,add(X4,X3)),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_25]),c_0_19]) ).
cnf(c_0_64,plain,
ifeq2(product(multiply(X1,multiply(X2,X3)),X4,X5),true,multiply(X1,multiply(X2,multiply(X3,X4))),X5) = X5,
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_65,plain,
multiply(additive_identity,X1) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]) ).
cnf(c_0_66,plain,
ifeq(product(X1,X2,X3),true,product(X1,X2,add(multiply(X1,additive_identity),X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_30]),c_0_19]) ).
cnf(c_0_67,plain,
ifeq2(product(multiply(X1,additive_identity),X2,X3),true,multiply(X1,additive_identity),X3) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_65]) ).
cnf(c_0_68,plain,
product(X1,X2,add(multiply(X1,additive_identity),multiply(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_30]),c_0_19]) ).
cnf(c_0_69,plain,
add(X1,additive_inverse(add(X1,X2))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_44]),c_0_39]) ).
cnf(c_0_70,plain,
add(multiply(X1,additive_identity),multiply(X1,additive_identity)) = multiply(X1,additive_identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_59]),c_0_65]),c_0_59]),c_0_65]),c_0_26]),c_0_59]),c_0_65]),c_0_59]),c_0_65]) ).
cnf(c_0_71,plain,
additive_inverse(multiply(X1,additive_identity)) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_55]) ).
cnf(c_0_72,negated_conjecture,
product(a,additive_identity,additive_identity) != true,
inference(fof_simplification,[status(thm)],[prove_a_times_additive_id_is_additive_id]) ).
cnf(c_0_73,plain,
multiply(X1,additive_identity) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_71]),c_0_62]) ).
cnf(c_0_74,negated_conjecture,
product(a,additive_identity,additive_identity) != true,
c_0_72 ).
cnf(c_0_75,plain,
product(X1,additive_identity,additive_identity) = true,
inference(spm,[status(thm)],[c_0_30,c_0_73]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG001-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n004.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 04:09:24 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.54 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 45.12/8.79 % Version: 3.5.1
% 45.12/8.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 45.12/8.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 45.12/8.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 45.12/8.79 % Starting new_bool_3 with 300s (1) cores
% 45.12/8.79 % Starting new_bool_1 with 300s (1) cores
% 45.12/8.79 % Starting sh5l with 300s (1) cores
% 45.12/8.79 % new_bool_1 with pid 2212449 completed with status 9
% 45.12/8.79 % new_bool_3 with pid 2212448 completed with status 9
% 45.12/8.79 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2212447 completed with status 0
% 45.12/8.79 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 45.12/8.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 45.12/8.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 45.12/8.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 45.12/8.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 45.12/8.79 % No SInE strategy applied
% 45.12/8.79 % Search class: FUUPM-FFMF32-MFFFFFNN
% 45.12/8.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 45.12/8.79 % Starting SubtermCWHack with 136s (1) cores
% 45.12/8.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 45.12/8.79 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 437s (1) cores
% 45.12/8.79 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 45.12/8.79 % Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 45.12/8.79 % G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 2212457 completed with status 0
% 45.12/8.79 % Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 45.12/8.79 % Preprocessing class: FSMSSMSSSSSNFFN.
% 45.12/8.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 45.12/8.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 45.12/8.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 45.12/8.79 % No SInE strategy applied
% 45.12/8.79 % Search class: FUUPM-FFMF32-MFFFFFNN
% 45.12/8.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 45.12/8.79 % Starting SubtermCWHack with 136s (1) cores
% 45.12/8.79 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 45.12/8.79 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 437s (1) cores
% 45.12/8.79 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 45.12/8.79 % Preprocessing time : 0.002 s
% 45.12/8.79 % Presaturation interreduction done
% 45.12/8.79
% 45.12/8.79 % Proof found!
% 45.12/8.79 % SZS status Unsatisfiable
% 45.12/8.79 % SZS output start CNFRefutation
% See solution above
% 45.12/8.79 % Parsed axioms : 22
% 45.12/8.79 % Removed by relevancy pruning/SinE : 0
% 45.12/8.79 % Initial clauses : 22
% 45.12/8.79 % Removed in clause preprocessing : 0
% 45.12/8.79 % Initial clauses in saturation : 22
% 45.12/8.79 % Processed clauses : 16447
% 45.12/8.79 % ...of these trivial : 10984
% 45.12/8.79 % ...subsumed : 3529
% 45.12/8.79 % ...remaining for further processing : 1934
% 45.12/8.79 % Other redundant clauses eliminated : 0
% 45.12/8.79 % Clauses deleted for lack of memory : 0
% 45.12/8.79 % Backward-subsumed : 0
% 45.12/8.79 % Backward-rewritten : 837
% 45.12/8.79 % Generated clauses : 417073
% 45.12/8.79 % ...of the previous two non-redundant : 256037
% 45.12/8.79 % ...aggressively subsumed : 0
% 45.12/8.79 % Contextual simplify-reflections : 0
% 45.12/8.79 % Paramodulations : 417073
% 45.12/8.79 % Factorizations : 0
% 45.12/8.79 % NegExts : 0
% 45.12/8.79 % Equation resolutions : 0
% 45.12/8.79 % Disequality decompositions : 0
% 45.12/8.79 % Total rewrite steps : 891722
% 45.12/8.79 % ...of those cached : 791133
% 45.12/8.79 % Propositional unsat checks : 0
% 45.12/8.79 % Propositional check models : 0
% 45.12/8.79 % Propositional check unsatisfiable : 0
% 45.12/8.79 % Propositional clauses : 0
% 45.12/8.79 % Propositional clauses after purity: 0
% 45.12/8.79 % Propositional unsat core size : 0
% 45.12/8.79 % Propositional preprocessing time : 0.000
% 45.12/8.79 % Propositional encoding time : 0.000
% 45.12/8.79 % Propositional solver time : 0.000
% 45.12/8.79 % Success case prop preproc time : 0.000
% 45.12/8.79 % Success case prop encoding time : 0.000
% 45.12/8.79 % Success case prop solver time : 0.000
% 45.12/8.79 % Current number of processed clauses : 1075
% 45.12/8.79 % Positive orientable unit clauses : 1071
% 45.12/8.79 % Positive unorientable unit clauses: 4
% 45.12/8.79 % Negative unit clauses : 0
% 45.12/8.79 % Non-unit-clauses : 0
% 45.12/8.79 % Current number of unprocessed clauses: 235143
% 45.12/8.79 % ...number of literals in the above : 235143
% 45.12/8.79 % Current number of archived formulas : 0
% 45.12/8.79 % Current number of archived clauses : 859
% 45.12/8.79 % Clause-clause subsumption calls (NU) : 0
% 45.12/8.79 % Rec. Clause-clause subsumption calls : 0
% 45.12/8.79 % Non-unit clause-clause subsumptions : 0
% 45.12/8.79 % Unit Clause-clause subsumption calls : 64
% 45.12/8.79 % Rewrite failures with RHS unbound : 0
% 45.12/8.79 % BW rewrite match attempts : 258325
% 45.12/8.79 % BW rewrite match successes : 810
% 45.12/8.79 % Condensation attempts : 0
% 45.12/8.79 % Condensation successes : 0
% 45.12/8.79 % Termbank termtop insertions : 6904429
% 45.12/8.79 % Search garbage collected termcells : 2
% 45.12/8.79
% 45.12/8.79 % -------------------------------------------------
% 45.12/8.79 % User time : 7.227 s
% 45.12/8.79 % System time : 0.317 s
% 45.12/8.79 % Total time : 7.545 s
% 45.12/8.79 % Maximum resident set size: 3596 pages
% 45.12/8.79
% 45.12/8.79 % -------------------------------------------------
% 45.12/8.79 % User time : 43.148 s
% 45.12/8.79 % System time : 1.829 s
% 45.12/8.79 % Total time : 44.977 s
% 45.12/8.79 % Maximum resident set size: 4864 pages
% 45.12/8.79 % E exiting
%------------------------------------------------------------------------------