%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP338-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:39:20 PM UTC 2026
% Result : Unsatisfiable 2.83s 0.84s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 14
% Syntax : Number of clauses : 75 ( 19 unt; 49 nHn; 61 RR)
% Number of literals : 195 ( 194 equ; 76 neg)
% Maximal clause size : 15 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(prove_this_35,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| multiply(sk_c2,sk_c10) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_35) ).
cnf(prove_this_36,negated_conjecture,
( inverse(sk_c5) = sk_c8
| multiply(sk_c2,sk_c10) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_36) ).
cnf(prove_this_45,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| inverse(sk_c2) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_45) ).
cnf(prove_this_21,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| multiply(sk_c1,sk_c10) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_46,negated_conjecture,
( inverse(sk_c5) = sk_c8
| inverse(sk_c2) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_46) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c3) = sk_c11
| multiply(sk_c1,sk_c10) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c3) = sk_c11
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c10,sk_c11) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c4) = sk_c10
| multiply(sk_c10,sk_c11) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| inverse(sk_c1) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_51,negated_conjecture,
( multiply(X7,X6) != X8
| inverse(X8) != X6
| inverse(X7) != X8
| multiply(X6,sk_c10) != sk_c11
| inverse(X5) != X6
| multiply(X5,X6) != sk_c11
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| inverse(X3) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| inverse(X2) != sk_c10
| multiply(X2,sk_c10) != sk_c11
| multiply(X1,sk_c10) != sk_c11
| inverse(X1) != sk_c11
| multiply(sk_c10,sk_c11) != sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_51) ).
cnf(c_0_14,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_15,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| multiply(sk_c2,sk_c10) = sk_c11 ),
prove_this_35 ).
cnf(c_0_19,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c11
| multiply(inverse(sk_c5),sk_c11) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c11
| multiply(inverse(inverse(sk_c5)),sk_c8) = sk_c11 ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
( inverse(sk_c5) = sk_c8
| multiply(sk_c2,sk_c10) = sk_c11 ),
prove_this_36 ).
cnf(c_0_22,negated_conjecture,
( identity = sk_c11
| multiply(sk_c2,sk_c10) = sk_c11 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( identity = sk_c11
| multiply(inverse(sk_c2),sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( identity = sk_c11
| multiply(inverse(inverse(sk_c2)),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| inverse(sk_c2) = sk_c10 ),
prove_this_45 ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c8,sk_c11) = sk_c8
| multiply(sk_c2,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( identity = sk_c11
| multiply(sk_c5,sk_c8) = sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15])]) ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| multiply(sk_c1,sk_c10) = sk_c11 ),
prove_this_21 ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c8,sk_c11) = sk_c8
| multiply(inverse(sk_c2),sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( identity = sk_c11
| multiply(inverse(sk_c5),sk_c11) = sk_c8 ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c5) = sk_c8
| inverse(sk_c2) = sk_c10 ),
prove_this_46 ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(inverse(sk_c3),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c8,sk_c11) = sk_c8
| multiply(inverse(inverse(sk_c2)),sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_17,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( identity = sk_c11
| inverse(sk_c2) = sk_c10
| multiply(sk_c8,sk_c11) = sk_c8 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( inverse(sk_c3) = sk_c11
| multiply(sk_c1,sk_c10) = sk_c11 ),
prove_this_22 ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c11
| multiply(inverse(inverse(sk_c3)),sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( inverse(sk_c3) = sk_c11
| inverse(sk_c1) = sk_c11 ),
prove_this_12 ).
cnf(c_0_38,negated_conjecture,
( identity = sk_c11
| multiply(sk_c8,sk_c11) = sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_15])]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c10,sk_c11) = sk_c9 ),
prove_this_3 ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(sk_c1,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_32,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( identity = sk_c10
| multiply(sk_c1,sk_c10) = sk_c11 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_35]),c_0_15]) ).
cnf(c_0_42,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c11,sk_c3) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
identity = sk_c11,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_38]),c_0_15])]) ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c10,sk_c11) = sk_c9
| multiply(inverse(sk_c4),sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( inverse(sk_c4) = sk_c10
| multiply(sk_c10,sk_c11) = sk_c9 ),
prove_this_4 ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| multiply(inverse(sk_c1),sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| inverse(sk_c1) = sk_c11 ),
prove_this_11 ).
cnf(c_0_48,negated_conjecture,
( identity = sk_c10
| multiply(inverse(sk_c1),sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_41]) ).
cnf(c_0_49,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c11,sk_c3) = sk_c11 ),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
multiply(sk_c11,X1) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c10
| multiply(sk_c10,sk_c11) = sk_c9 ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c11,sk_c11) = sk_c10
| multiply(sk_c11,sk_c10) = sk_c11
| multiply(sk_c3,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( sk_c10 = sk_c11
| multiply(inverse(sk_c1),sk_c11) = sk_c10 ),
inference(rw,[status(thm)],[c_0_48,c_0_43]) ).
cnf(c_0_54,negated_conjecture,
( sk_c3 = sk_c11
| inverse(sk_c1) = sk_c11 ),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
( multiply(X7,X6) != X8
| inverse(X8) != X6
| inverse(X7) != X8
| multiply(X6,sk_c10) != sk_c11
| inverse(X5) != X6
| multiply(X5,X6) != sk_c11
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| inverse(X3) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| inverse(X2) != sk_c10
| multiply(X2,sk_c10) != sk_c11
| multiply(X1,sk_c10) != sk_c11
| inverse(X1) != sk_c11
| multiply(sk_c10,sk_c11) != sk_c9 ),
inference(fof_simplification,[status(thm)],[prove_this_51]) ).
cnf(c_0_56,negated_conjecture,
( identity = sk_c9
| multiply(sk_c10,sk_c11) = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_51]),c_0_15]) ).
cnf(c_0_57,negated_conjecture,
( sk_c10 = sk_c11
| multiply(sk_c3,sk_c11) = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_50]),c_0_50])]) ).
cnf(c_0_58,negated_conjecture,
( sk_c10 = sk_c11
| sk_c3 = sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_50])]) ).
cnf(c_0_59,plain,
multiply(inverse(X1),X1) = sk_c11,
inference(rw,[status(thm)],[c_0_15,c_0_43]) ).
cnf(c_0_60,negated_conjecture,
( multiply(X7,X6) != X8
| inverse(X8) != X6
| inverse(X7) != X8
| multiply(X6,sk_c10) != sk_c11
| inverse(X5) != X6
| multiply(X5,X6) != sk_c11
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| inverse(X3) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| inverse(X2) != sk_c10
| multiply(X2,sk_c10) != sk_c11
| multiply(X1,sk_c10) != sk_c11
| inverse(X1) != sk_c11
| multiply(sk_c10,sk_c11) != sk_c9 ),
c_0_55 ).
cnf(c_0_61,negated_conjecture,
( sk_c9 = sk_c11
| multiply(sk_c10,sk_c11) = sk_c9 ),
inference(rw,[status(thm)],[c_0_56,c_0_43]) ).
cnf(c_0_62,negated_conjecture,
sk_c10 = sk_c11,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_50])]) ).
cnf(c_0_63,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_64,plain,
multiply(inverse(inverse(X1)),sk_c11) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_59]) ).
cnf(c_0_65,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_66,negated_conjecture,
( inverse(X6) != sk_c11
| inverse(X5) != sk_c10
| inverse(X4) != sk_c11
| inverse(X3) != sk_c10
| multiply(X6,sk_c10) != sk_c11
| multiply(X5,sk_c10) != sk_c11
| multiply(X4,sk_c11) != sk_c10
| multiply(X3,sk_c10) != sk_c9
| multiply(X2,inverse(X2)) != sk_c11
| multiply(sk_c10,sk_c11) != sk_c9
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c10) != sk_c11
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_60])]) ).
cnf(c_0_67,negated_conjecture,
sk_c9 = sk_c11,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_50])]) ).
cnf(c_0_68,negated_conjecture,
multiply(inverse(sk_c11),X1) = X1,
inference(spm,[status(thm)],[c_0_63,c_0_43]) ).
cnf(c_0_69,plain,
multiply(X1,sk_c11) = X1,
inference(rw,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,negated_conjecture,
( inverse(X6) != sk_c11
| inverse(X5) != sk_c11
| inverse(X4) != sk_c11
| inverse(X3) != sk_c11
| multiply(X6,sk_c11) != sk_c11
| multiply(X5,sk_c11) != sk_c11
| multiply(X4,sk_c11) != sk_c11
| multiply(X3,sk_c11) != sk_c11
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(inverse(X2),sk_c11) != sk_c11
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
inference(cn,[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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_62]),c_0_62]),c_0_50]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_62]),c_0_67]),c_0_67])]) ).
cnf(c_0_71,negated_conjecture,
inverse(sk_c11) = sk_c11,
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_72,negated_conjecture,
( inverse(X2) != sk_c11
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_69]),c_0_69]),c_0_69]),c_0_69]),c_0_69])])])])]),c_0_71])]) ).
cnf(c_0_73,negated_conjecture,
( inverse(X1) != X1
| inverse(X1) != sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_71]),c_0_69]),c_0_69]),c_0_50])]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_73,c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP338-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 20:09:25 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 2.83/0.84 % Version: 3.5.1
% 2.83/0.84 % Preprocessing class: FSMSSMSMSSSNFFN.
% 2.83/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.83/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.83/0.84 % Starting new_bool_3 with 300s (1) cores
% 2.83/0.84 % Starting new_bool_1 with 300s (1) cores
% 2.83/0.84 % Starting sh5l with 300s (1) cores
% 2.83/0.84 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 66471 completed with status 0
% 2.83/0.84 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 2.83/0.84 % Preprocessing class: FSMSSMSMSSSNFFN.
% 2.83/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.83/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.83/0.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.83/0.84 % No SInE strategy applied
% 2.83/0.84 % Search class: FGHPS-FFMM21-SFFFFFNN
% 2.83/0.84 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.83/0.84 % Starting SubtermCWHack with 136s (1) cores
% 2.83/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 2.83/0.84 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.83/0.84 % Starting new_bool_3 with 136s (1) cores
% 2.83/0.84 % Starting new_bool_1 with 136s (1) cores
% 2.83/0.84 % new_bool_3 with pid 66479 completed with status 0
% 2.83/0.84 % Result found by new_bool_3
% 2.83/0.84 % Preprocessing class: FSMSSMSMSSSNFFN.
% 2.83/0.84 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.83/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.83/0.84 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.83/0.84 % No SInE strategy applied
% 2.83/0.84 % Search class: FGHPS-FFMM21-SFFFFFNN
% 2.83/0.84 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.83/0.84 % Starting SubtermCWHack with 136s (1) cores
% 2.83/0.84 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 2.83/0.84 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.83/0.84 % Starting new_bool_3 with 136s (1) cores
% 2.83/0.84 % Preprocessing time : 0.001 s
% 2.83/0.84 % Presaturation interreduction done
% 2.83/0.84
% 2.83/0.84 % Proof found!
% 2.83/0.84 % SZS status Unsatisfiable
% 2.83/0.84 % SZS output start CNFRefutation
% See solution above
% 2.83/0.85 % Parsed axioms : 54
% 2.83/0.85 % Removed by relevancy pruning/SinE : 0
% 2.83/0.85 % Initial clauses : 54
% 2.83/0.85 % Removed in clause preprocessing : 0
% 2.83/0.85 % Initial clauses in saturation : 54
% 2.83/0.85 % Processed clauses : 4423
% 2.83/0.85 % ...of these trivial : 371
% 2.83/0.85 % ...subsumed : 2787
% 2.83/0.85 % ...remaining for further processing : 1265
% 2.83/0.85 % Other redundant clauses eliminated : 39
% 2.83/0.85 % Clauses deleted for lack of memory : 0
% 2.83/0.85 % Backward-subsumed : 131
% 2.83/0.85 % Backward-rewritten : 973
% 2.83/0.85 % Generated clauses : 12124
% 2.83/0.85 % ...of the previous two non-redundant : 11629
% 2.83/0.85 % ...aggressively subsumed : 0
% 2.83/0.85 % Contextual simplify-reflections : 133
% 2.83/0.85 % Paramodulations : 12073
% 2.83/0.85 % Factorizations : 3
% 2.83/0.85 % NegExts : 0
% 2.83/0.85 % Equation resolutions : 49
% 2.83/0.85 % Disequality decompositions : 0
% 2.83/0.85 % Total rewrite steps : 6554
% 2.83/0.85 % ...of those cached : 6411
% 2.83/0.85 % Propositional unsat checks : 0
% 2.83/0.85 % Propositional check models : 0
% 2.83/0.85 % Propositional check unsatisfiable : 0
% 2.83/0.85 % Propositional clauses : 0
% 2.83/0.85 % Propositional clauses after purity: 0
% 2.83/0.85 % Propositional unsat core size : 0
% 2.83/0.85 % Propositional preprocessing time : 0.000
% 2.83/0.85 % Propositional encoding time : 0.000
% 2.83/0.85 % Propositional solver time : 0.000
% 2.83/0.85 % Success case prop preproc time : 0.000
% 2.83/0.85 % Success case prop encoding time : 0.000
% 2.83/0.85 % Success case prop solver time : 0.000
% 2.83/0.85 % Current number of processed clauses : 106
% 2.83/0.85 % Positive orientable unit clauses : 12
% 2.83/0.85 % Positive unorientable unit clauses: 0
% 2.83/0.85 % Negative unit clauses : 0
% 2.83/0.85 % Non-unit-clauses : 94
% 2.83/0.85 % Current number of unprocessed clauses: 6668
% 2.83/0.85 % ...number of literals in the above : 48658
% 2.83/0.85 % Current number of archived formulas : 0
% 2.83/0.85 % Current number of archived clauses : 1158
% 2.83/0.85 % Clause-clause subsumption calls (NU) : 79990
% 2.83/0.85 % Rec. Clause-clause subsumption calls : 29982
% 2.83/0.85 % Non-unit clause-clause subsumptions : 3031
% 2.83/0.85 % Unit Clause-clause subsumption calls : 1089
% 2.83/0.85 % Rewrite failures with RHS unbound : 0
% 2.83/0.85 % BW rewrite match attempts : 98
% 2.83/0.85 % BW rewrite match successes : 78
% 2.83/0.85 % Condensation attempts : 0
% 2.83/0.85 % Condensation successes : 0
% 2.83/0.85 % Termbank termtop insertions : 231814
% 2.83/0.85 % Search garbage collected termcells : 43
% 2.83/0.85
% 2.83/0.85 % -------------------------------------------------
% 2.83/0.85 % User time : 0.388 s
% 2.83/0.85 % System time : 0.017 s
% 2.83/0.85 % Total time : 0.405 s
% 2.83/0.85 % Maximum resident set size: 3404 pages
% 2.83/0.85
% 2.83/0.85 % -------------------------------------------------
% 2.83/0.85 % User time : 1.827 s
% 2.83/0.85 % System time : 0.073 s
% 2.83/0.85 % Total time : 1.900 s
% 2.83/0.85 % Maximum resident set size: 4608 pages
% 2.83/0.85 % E exiting
%------------------------------------------------------------------------------