%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP210-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:38:59 PM UTC 2026
% Result : Unsatisfiable 4.97s 1.16s
% Output : CNFRefutation 4.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 14
% Syntax : Number of clauses : 76 ( 18 unt; 49 nHn; 64 RR)
% Number of literals : 202 ( 201 equ; 84 neg)
% Maximal clause size : 13 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(prove_this_34,negated_conjecture,
( multiply(sk_c4,sk_c9) = sk_c10
| multiply(sk_c3,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_34) ).
cnf(prove_this_33,negated_conjecture,
( inverse(sk_c4) = sk_c10
| multiply(sk_c3,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_33) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c4,sk_c9) = sk_c10
| inverse(sk_c3) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c10,sk_c8) = sk_c9
| multiply(sk_c1,sk_c2) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_25,negated_conjecture,
( inverse(sk_c4) = sk_c10
| inverse(sk_c3) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_14,negated_conjecture,
( multiply(sk_c10,sk_c8) = sk_c9
| inverse(sk_c1) = sk_c2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_14) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c7,sk_c10) = sk_c8
| inverse(sk_c1) = sk_c2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_16,negated_conjecture,
( inverse(sk_c7) = sk_c10
| inverse(sk_c1) = sk_c2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c7,sk_c10) = sk_c8
| multiply(sk_c1,sk_c2) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_8,negated_conjecture,
( inverse(sk_c7) = sk_c10
| multiply(sk_c1,sk_c2) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_41,negated_conjecture,
( inverse(X8) != sk_c10
| multiply(X8,sk_c10) != X7
| multiply(sk_c10,X7) != sk_c9
| multiply(X6,sk_c10) != sk_c9
| inverse(X5) != X6
| multiply(X5,X6) != sk_c9
| multiply(X4,sk_c9) != sk_c10
| inverse(X4) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| inverse(X3) != sk_c10
| multiply(X2,sk_c9) != sk_c10
| inverse(X1) != X2
| multiply(X1,X2) != sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_41) ).
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_c4,sk_c9) = sk_c10
| multiply(sk_c3,sk_c9) = sk_c10 ),
prove_this_34 ).
cnf(c_0_19,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c10
| multiply(inverse(sk_c4),sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( inverse(sk_c4) = sk_c10
| multiply(sk_c3,sk_c9) = sk_c10 ),
prove_this_33 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c10,sk_c10) = sk_c9
| multiply(sk_c3,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( multiply(sk_c10,sk_c10) = sk_c9
| multiply(inverse(sk_c3),sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c4,sk_c9) = sk_c10
| inverse(sk_c3) = sk_c10 ),
prove_this_26 ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c10,sk_c10) = sk_c9
| multiply(sk_c4,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c10,sk_c8) = sk_c9
| multiply(sk_c1,sk_c2) = sk_c10 ),
prove_this_6 ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c10,sk_c10) = sk_c9
| multiply(inverse(sk_c4),sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( inverse(sk_c4) = sk_c10
| inverse(sk_c3) = sk_c10 ),
prove_this_25 ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c10,sk_c8) = sk_c9
| multiply(inverse(sk_c1),sk_c10) = sk_c2 ),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c10,sk_c8) = sk_c9
| inverse(sk_c1) = sk_c2 ),
prove_this_14 ).
cnf(c_0_30,negated_conjecture,
( inverse(sk_c3) = sk_c10
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c10,sk_c8) = sk_c9
| multiply(sk_c1,multiply(sk_c2,X1)) = multiply(sk_c10,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c2
| multiply(sk_c10,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
multiply(sk_c10,sk_c10) = sk_c9,
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_35,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c7,sk_c10) = sk_c8
| inverse(sk_c1) = sk_c2 ),
prove_this_15 ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c9
| multiply(sk_c10,sk_c8) = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_38,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_35]),c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( inverse(sk_c7) = sk_c10
| inverse(sk_c1) = sk_c2 ),
prove_this_16 ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c2,sk_c1) = identity
| multiply(sk_c7,sk_c10) = sk_c8 ),
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( sk_c9 = sk_c10
| multiply(sk_c10,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_25,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
multiply(inverse(sk_c10),sk_c9) = sk_c10,
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c10) = sk_c7
| inverse(sk_c1) = sk_c2 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c7,sk_c10) = sk_c8
| multiply(sk_c1,sk_c2) = sk_c10 ),
prove_this_7 ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c2,sk_c1) = identity
| multiply(inverse(sk_c7),sk_c8) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( sk_c8 = sk_c10
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_41]),c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( inverse(sk_c10) = sk_c7
| multiply(sk_c2,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(inverse(sk_c7),sk_c8) = sk_c10 ),
inference(spm,[status(thm)],[c_0_17,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( sk_c9 = sk_c10
| multiply(sk_c2,sk_c1) = identity
| multiply(inverse(sk_c7),sk_c10) = sk_c10 ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( inverse(sk_c7) = sk_c10
| multiply(sk_c2,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_38,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( sk_c9 = sk_c10
| multiply(sk_c1,sk_c2) = sk_c10
| multiply(inverse(sk_c7),sk_c10) = sk_c10 ),
inference(spm,[status(thm)],[c_0_48,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( inverse(sk_c7) = sk_c10
| multiply(sk_c1,sk_c2) = sk_c10 ),
prove_this_8 ).
cnf(c_0_53,negated_conjecture,
( sk_c9 = sk_c10
| multiply(sk_c2,sk_c1) = identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_34])]) ).
cnf(c_0_54,negated_conjecture,
( sk_c9 = sk_c10
| multiply(sk_c1,sk_c2) = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_34])]) ).
cnf(c_0_55,negated_conjecture,
( sk_c9 = sk_c10
| inverse(sk_c2) = sk_c1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_53]),c_0_35]) ).
cnf(c_0_56,negated_conjecture,
( sk_c9 = sk_c10
| multiply(inverse(sk_c1),sk_c10) = sk_c2 ),
inference(spm,[status(thm)],[c_0_17,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( sk_c9 = sk_c10
| inverse(sk_c1) = sk_c2 ),
inference(spm,[status(thm)],[c_0_38,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( sk_c9 = sk_c10
| multiply(sk_c2,sk_c10) = sk_c2 ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,negated_conjecture,
( inverse(X8) != sk_c10
| multiply(X8,sk_c10) != X7
| multiply(sk_c10,X7) != sk_c9
| multiply(X6,sk_c10) != sk_c9
| inverse(X5) != X6
| multiply(X5,X6) != sk_c9
| multiply(X4,sk_c9) != sk_c10
| inverse(X4) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| inverse(X3) != sk_c10
| multiply(X2,sk_c9) != sk_c10
| inverse(X1) != X2
| multiply(X1,X2) != sk_c10 ),
inference(fof_simplification,[status(thm)],[prove_this_41]) ).
cnf(c_0_60,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_35]) ).
cnf(c_0_61,negated_conjecture,
( identity = sk_c10
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_58]),c_0_15]) ).
cnf(c_0_62,negated_conjecture,
( inverse(X8) != sk_c10
| multiply(X8,sk_c10) != X7
| multiply(sk_c10,X7) != sk_c9
| multiply(X6,sk_c10) != sk_c9
| inverse(X5) != X6
| multiply(X5,X6) != sk_c9
| multiply(X4,sk_c9) != sk_c10
| inverse(X4) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| inverse(X3) != sk_c10
| multiply(X2,sk_c9) != sk_c10
| inverse(X1) != X2
| multiply(X1,X2) != sk_c10 ),
c_0_59 ).
cnf(c_0_63,negated_conjecture,
( sk_c9 = sk_c10
| inverse(sk_c10) = sk_c10 ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
( inverse(X5) != sk_c10
| inverse(X4) != sk_c10
| inverse(X1) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X3,inverse(X3)) != sk_c10
| multiply(X2,inverse(X2)) != sk_c9
| multiply(inverse(X3),sk_c9) != sk_c10
| multiply(inverse(X2),sk_c10) != sk_c9
| multiply(sk_c10,multiply(X1,sk_c10)) != sk_c9 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_62])])]) ).
cnf(c_0_65,negated_conjecture,
( identity = sk_c9
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_63]),c_0_34]) ).
cnf(c_0_66,negated_conjecture,
( inverse(X4) != sk_c10
| inverse(X3) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| inverse(inverse(sk_c10)) != sk_c10
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X1,inverse(X1)) != sk_c9
| multiply(sk_c10,identity) != sk_c9
| multiply(inverse(X2),sk_c9) != sk_c10
| multiply(inverse(X1),sk_c10) != sk_c9 ),
inference(spm,[status(thm)],[c_0_64,c_0_15]) ).
cnf(c_0_67,negated_conjecture,
sk_c9 = sk_c10,
inference(spm,[status(thm)],[c_0_61,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
( sk_c9 != sk_c10
| inverse(X4) != sk_c10
| inverse(X3) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| inverse(inverse(sk_c10)) != sk_c10
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X1,inverse(X1)) != sk_c9
| multiply(inverse(X2),sk_c9) != sk_c10
| multiply(inverse(X1),sk_c10) != sk_c9 ),
inference(rw,[status(thm)],[c_0_66,c_0_35]) ).
cnf(c_0_69,negated_conjecture,
identity = sk_c10,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_67]),c_0_15]) ).
cnf(c_0_70,negated_conjecture,
( sk_c9 != sk_c10
| inverse(X4) != sk_c10
| inverse(X3) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X1,inverse(X1)) != sk_c9
| multiply(inverse(X2),sk_c9) != sk_c10
| multiply(inverse(X1),sk_c10) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_38])]) ).
cnf(c_0_71,plain,
multiply(X1,sk_c10) = X1,
inference(rw,[status(thm)],[c_0_35,c_0_69]) ).
cnf(c_0_72,plain,
inverse(sk_c10) = sk_c10,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_69]),c_0_69]) ).
cnf(c_0_73,negated_conjecture,
( inverse(X2) != sk_c10
| inverse(X1) != sk_c10
| multiply(X2,inverse(X2)) != sk_c10
| multiply(X1,inverse(X1)) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[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(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)],[c_0_70,c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67]),c_0_67])]),c_0_71]),c_0_71]),c_0_71]),c_0_71])])]),c_0_72])]) ).
cnf(c_0_74,negated_conjecture,
( inverse(X1) != sk_c10
| multiply(X1,inverse(X1)) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_72]),c_0_71])]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_72]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP210-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n011.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 20:06:12 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 4.97/1.16 % Version: 3.5.1
% 4.97/1.16 % Preprocessing class: FSMSSMSMSSSNFFN.
% 4.97/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.97/1.16 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 4.97/1.16 % Starting new_bool_3 with 300s (1) cores
% 4.97/1.16 % Starting new_bool_1 with 300s (1) cores
% 4.97/1.16 % Starting sh5l with 300s (1) cores
% 4.97/1.16 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 56640 completed with status 0
% 4.97/1.16 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 4.97/1.16 % Preprocessing class: FSMSSMSMSSSNFFN.
% 4.97/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.97/1.16 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 4.97/1.16 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.97/1.16 % No SInE strategy applied
% 4.97/1.16 % Search class: FGHPS-FFMM21-SFFFFFNN
% 4.97/1.16 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.97/1.16 % Starting SubtermCWHack with 136s (1) cores
% 4.97/1.16 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 4.97/1.16 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.97/1.16 % Starting new_bool_3 with 136s (1) cores
% 4.97/1.16 % Starting new_bool_1 with 136s (1) cores
% 4.97/1.16 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 56651 completed with status 0
% 4.97/1.16 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.97/1.16 % Preprocessing class: FSMSSMSMSSSNFFN.
% 4.97/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.97/1.16 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 4.97/1.16 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.97/1.16 % No SInE strategy applied
% 4.97/1.16 % Search class: FGHPS-FFMM21-SFFFFFNN
% 4.97/1.16 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.97/1.16 % Starting SubtermCWHack with 136s (1) cores
% 4.97/1.16 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 4.97/1.16 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.97/1.16 % Preprocessing time : 0.001 s
% 4.97/1.16 % Presaturation interreduction done
% 4.97/1.16
% 4.97/1.16 % Proof found!
% 4.97/1.16 % SZS status Unsatisfiable
% 4.97/1.16 % SZS output start CNFRefutation
% See solution above
% 4.97/1.16 % Parsed axioms : 44
% 4.97/1.16 % Removed by relevancy pruning/SinE : 0
% 4.97/1.16 % Initial clauses : 44
% 4.97/1.16 % Removed in clause preprocessing : 0
% 4.97/1.16 % Initial clauses in saturation : 44
% 4.97/1.16 % Processed clauses : 16476
% 4.97/1.16 % ...of these trivial : 203
% 4.97/1.16 % ...subsumed : 14330
% 4.97/1.16 % ...remaining for further processing : 1943
% 4.97/1.16 % Other redundant clauses eliminated : 10
% 4.97/1.16 % Clauses deleted for lack of memory : 0
% 4.97/1.16 % Backward-subsumed : 180
% 4.97/1.16 % Backward-rewritten : 1629
% 4.97/1.16 % Generated clauses : 68988
% 4.97/1.16 % ...of the previous two non-redundant : 68597
% 4.97/1.16 % ...aggressively subsumed : 0
% 4.97/1.16 % Contextual simplify-reflections : 38
% 4.97/1.16 % Paramodulations : 68975
% 4.97/1.16 % Factorizations : 8
% 4.97/1.16 % NegExts : 0
% 4.97/1.16 % Equation resolutions : 10
% 4.97/1.16 % Disequality decompositions : 0
% 4.97/1.16 % Total rewrite steps : 22247
% 4.97/1.16 % ...of those cached : 21634
% 4.97/1.16 % Propositional unsat checks : 0
% 4.97/1.16 % Propositional check models : 0
% 4.97/1.16 % Propositional check unsatisfiable : 0
% 4.97/1.16 % Propositional clauses : 0
% 4.97/1.16 % Propositional clauses after purity: 0
% 4.97/1.16 % Propositional unsat core size : 0
% 4.97/1.16 % Propositional preprocessing time : 0.000
% 4.97/1.16 % Propositional encoding time : 0.000
% 4.97/1.16 % Propositional solver time : 0.000
% 4.97/1.16 % Success case prop preproc time : 0.000
% 4.97/1.16 % Success case prop encoding time : 0.000
% 4.97/1.16 % Success case prop solver time : 0.000
% 4.97/1.16 % Current number of processed clauses : 86
% 4.97/1.16 % Positive orientable unit clauses : 11
% 4.97/1.16 % Positive unorientable unit clauses: 0
% 4.97/1.16 % Negative unit clauses : 0
% 4.97/1.16 % Non-unit-clauses : 75
% 4.97/1.16 % Current number of unprocessed clauses: 49237
% 4.97/1.16 % ...number of literals in the above : 298940
% 4.97/1.16 % Current number of archived formulas : 0
% 4.97/1.16 % Current number of archived clauses : 1853
% 4.97/1.16 % Clause-clause subsumption calls (NU) : 386669
% 4.97/1.16 % Rec. Clause-clause subsumption calls : 252524
% 4.97/1.16 % Non-unit clause-clause subsumptions : 14540
% 4.97/1.16 % Unit Clause-clause subsumption calls : 1670
% 4.97/1.16 % Rewrite failures with RHS unbound : 0
% 4.97/1.16 % BW rewrite match attempts : 71
% 4.97/1.16 % BW rewrite match successes : 71
% 4.97/1.16 % Condensation attempts : 0
% 4.97/1.16 % Condensation successes : 0
% 4.97/1.16 % Termbank termtop insertions : 1167886
% 4.97/1.16 % Search garbage collected termcells : 38
% 4.97/1.16
% 4.97/1.16 % -------------------------------------------------
% 4.97/1.16 % User time : 0.687 s
% 4.97/1.16 % System time : 0.032 s
% 4.97/1.16 % Total time : 0.719 s
% 4.97/1.16 % Maximum resident set size: 3604 pages
% 4.97/1.16
% 4.97/1.16 % -------------------------------------------------
% 4.97/1.16 % User time : 2.917 s
% 4.97/1.16 % System time : 0.130 s
% 4.97/1.16 % Total time : 3.047 s
% 4.97/1.16 % Maximum resident set size: 4608 pages
% 4.97/1.16 % E exiting
%------------------------------------------------------------------------------