%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP214-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 : n026.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:00 PM UTC 2026
% Result : Unsatisfiable 0.57s 0.67s
% Output : CNFRefutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 12
% Syntax : Number of clauses : 74 ( 27 unt; 33 nHn; 57 RR)
% Number of literals : 170 ( 169 equ; 67 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 59 ( 13 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_3,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c1,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_13,negated_conjecture,
( inverse(X5) != X4
| multiply(X5,X4) != sk_c6
| inverse(X3) != sk_c7
| multiply(X3,sk_c7) != X4
| multiply(sk_c7,X2) != sk_c6
| inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_13) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c6
| inverse(sk_c1) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_6,negated_conjecture,
( inverse(sk_c3) = sk_c7
| inverse(sk_c1) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_8,negated_conjecture,
( inverse(sk_c4) = sk_c5
| inverse(sk_c1) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c5
| multiply(sk_c1,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c5
| inverse(sk_c1) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c3) = sk_c7
| multiply(sk_c1,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_2) ).
cnf(c_0_12,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_13,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_14,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_15,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
prove_this_3 ).
cnf(c_0_17,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| multiply(inverse(sk_c4),sk_c6) = sk_c5 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c1,sk_c7) = sk_c6 ),
prove_this_4 ).
cnf(c_0_19,negated_conjecture,
( multiply(sk_c5,sk_c6) = sk_c5
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( inverse(X5) != X4
| multiply(X5,X4) != sk_c6
| inverse(X3) != sk_c7
| multiply(X3,sk_c7) != X4
| multiply(sk_c7,X2) != sk_c6
| inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6 ),
inference(fof_simplification,[status(thm)],[prove_this_13]) ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c5,sk_c6) = sk_c5
| multiply(inverse(sk_c1),sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c6
| inverse(sk_c1) = sk_c7 ),
prove_this_7 ).
cnf(c_0_23,negated_conjecture,
( inverse(X5) != X4
| multiply(X5,X4) != sk_c6
| inverse(X3) != sk_c7
| multiply(X3,sk_c7) != X4
| multiply(sk_c7,X2) != sk_c6
| inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6 ),
c_0_20 ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(sk_c5,sk_c6) = sk_c5
| multiply(sk_c4,sk_c5) = sk_c6 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( inverse(X3) != sk_c7
| inverse(X2) != sk_c7
| multiply(sk_c7,X4) != sk_c6
| multiply(X3,sk_c7) != sk_c6
| inverse(X1) != multiply(X2,sk_c7)
| multiply(X1,multiply(X2,sk_c7)) != sk_c6 ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( inverse(sk_c3) = sk_c7
| inverse(sk_c1) = sk_c7 ),
prove_this_6 ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c5,sk_c6) = sk_c5
| multiply(sk_c7,sk_c6) = sk_c7
| multiply(inverse(sk_c4),sk_c6) = sk_c5 ),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( inverse(sk_c4) = sk_c5
| inverse(sk_c1) = sk_c7 ),
prove_this_8 ).
cnf(c_0_29,negated_conjecture,
( inverse(X2) != sk_c7
| multiply(sk_c7,X3) != sk_c6
| multiply(X2,sk_c7) != sk_c6
| inverse(X1) != multiply(sk_c3,sk_c7)
| multiply(X1,multiply(sk_c3,sk_c7)) != sk_c6
| inverse(sk_c1) = sk_c7 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c5,sk_c6) = sk_c5
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c5
| multiply(sk_c1,sk_c7) = sk_c6 ),
prove_this_1 ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c7,X2) != sk_c6
| multiply(sk_c3,sk_c7) != sk_c6
| inverse(X1) != multiply(sk_c3,sk_c7)
| multiply(X1,multiply(sk_c3,sk_c7)) != sk_c6
| inverse(sk_c1) = sk_c7 ),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c3,sk_c7) = sk_c5
| inverse(sk_c1) = sk_c7 ),
prove_this_5 ).
cnf(c_0_34,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c7,sk_c3) = identity ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c7
| multiply(sk_c5,sk_c6) = sk_c5 ),
inference(spm,[status(thm)],[c_0_21,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| multiply(inverse(sk_c3),sk_c5) = sk_c7 ),
inference(spm,[status(thm)],[c_0_15,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c7,X1) != sk_c6
| multiply(sk_c3,sk_c7) != sk_c6
| multiply(sk_c4,multiply(sk_c3,sk_c7)) != sk_c6
| inverse(sk_c1) = sk_c7 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c7,sk_c1) = identity
| multiply(sk_c7,sk_c3) = identity ),
inference(spm,[status(thm)],[c_0_13,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( identity = sk_c6
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_35]),c_0_13]) ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| multiply(inverse(inverse(sk_c3)),sk_c7) = sk_c5 ),
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( inverse(sk_c3) = sk_c7
| multiply(sk_c1,sk_c7) = sk_c6 ),
prove_this_2 ).
cnf(c_0_42,negated_conjecture,
( identity != sk_c6
| multiply(sk_c3,sk_c7) != sk_c6
| multiply(sk_c4,multiply(sk_c3,sk_c7)) != sk_c6
| inverse(sk_c1) = sk_c7
| multiply(sk_c7,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
identity = sk_c6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_39]),c_0_13])]) ).
cnf(c_0_44,negated_conjecture,
( identity = sk_c5
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_13]) ).
cnf(c_0_45,negated_conjecture,
( inverse(X2) != sk_c7
| multiply(sk_c7,X3) != sk_c6
| multiply(X2,sk_c7) != sk_c6
| inverse(X1) != multiply(sk_c3,sk_c7)
| multiply(X1,multiply(sk_c3,sk_c7)) != sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_25,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c3,sk_c7) != sk_c6
| multiply(sk_c4,multiply(sk_c3,sk_c7)) != sk_c6
| inverse(sk_c1) = sk_c7 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_43])]),c_0_37]) ).
cnf(c_0_47,negated_conjecture,
( sk_c5 = sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(rw,[status(thm)],[c_0_44,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c7,X2) != sk_c6
| multiply(sk_c3,sk_c7) != sk_c6
| inverse(X1) != multiply(sk_c3,sk_c7)
| multiply(X1,multiply(sk_c3,sk_c7)) != sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_45,c_0_41]) ).
cnf(c_0_49,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_31]),c_0_47]),c_0_22]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c7,X1) != sk_c6
| multiply(sk_c3,sk_c7) != sk_c6
| multiply(sk_c4,multiply(sk_c3,sk_c7)) != sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_18]),c_0_31]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| multiply(sk_c7,multiply(sk_c1,X1)) = X1 ),
inference(spm,[status(thm)],[c_0_15,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c3,sk_c7) != sk_c6
| multiply(sk_c4,multiply(sk_c3,sk_c7)) != sk_c6
| multiply(sk_c1,sk_c7) = sk_c6 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_53,negated_conjecture,
multiply(sk_c1,sk_c7) = sk_c6,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_31]),c_0_47]),c_0_16]) ).
cnf(c_0_54,negated_conjecture,
multiply(inverse(sk_c1),sk_c6) = sk_c7,
inference(spm,[status(thm)],[c_0_15,c_0_53]) ).
cnf(c_0_55,plain,
multiply(sk_c6,X1) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_43]) ).
cnf(c_0_56,negated_conjecture,
multiply(inverse(inverse(sk_c1)),sk_c7) = sk_c6,
inference(spm,[status(thm)],[c_0_15,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
multiply(inverse(sk_c1),X1) = multiply(sk_c7,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_54]),c_0_55]) ).
cnf(c_0_58,negated_conjecture,
multiply(inverse(inverse(sk_c1)),multiply(sk_c7,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_56]),c_0_55]) ).
cnf(c_0_59,negated_conjecture,
multiply(sk_c7,multiply(sk_c1,X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_57]) ).
cnf(c_0_60,plain,
multiply(inverse(X1),X1) = sk_c6,
inference(rw,[status(thm)],[c_0_13,c_0_43]) ).
cnf(c_0_61,negated_conjecture,
multiply(inverse(inverse(sk_c1)),X1) = multiply(sk_c1,X1),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_63,negated_conjecture,
multiply(sk_c1,inverse(sk_c1)) = sk_c6,
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
multiply(sk_c7,sk_c6) = sk_c7,
inference(rw,[status(thm)],[c_0_54,c_0_57]) ).
cnf(c_0_65,negated_conjecture,
multiply(inverse(sk_c6),X1) = X1,
inference(spm,[status(thm)],[c_0_62,c_0_43]) ).
cnf(c_0_66,negated_conjecture,
inverse(sk_c1) = sk_c7,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_63]),c_0_57]),c_0_64]) ).
cnf(c_0_67,negated_conjecture,
multiply(inverse(inverse(sk_c6)),X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
( inverse(X2) != sk_c7
| inverse(X1) != sk_c6
| multiply(sk_c7,X3) != sk_c6
| multiply(X2,sk_c7) != sk_c6
| multiply(X1,sk_c6) != sk_c6 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_66]),c_0_53]),c_0_53]) ).
cnf(c_0_69,negated_conjecture,
inverse(sk_c6) = sk_c6,
inference(spm,[status(thm)],[c_0_60,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
( inverse(X1) != sk_c7
| multiply(sk_c7,X2) != sk_c6
| multiply(X1,sk_c7) != sk_c6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_55])]) ).
cnf(c_0_71,negated_conjecture,
multiply(sk_c7,sk_c1) = sk_c6,
inference(spm,[status(thm)],[c_0_57,c_0_60]) ).
cnf(c_0_72,negated_conjecture,
multiply(sk_c7,X1) != sk_c6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_66]),c_0_53])]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_71,c_0_72]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP214-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.46 % Computer : n026.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Sun Sep 20 20:09:07 UTC 2026
% 0.21/0.47 % CPUTime :
% 0.21/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.55 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
% 0.57/0.67 % Version: 3.5.1
% 0.57/0.67 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.57/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.57/0.67 % Starting new_bool_3 with 300s (1) cores
% 0.57/0.67 % Starting new_bool_1 with 300s (1) cores
% 0.57/0.67 % Starting sh5l with 300s (1) cores
% 0.57/0.67 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 486544 completed with status 0
% 0.57/0.67 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.57/0.67 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.57/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.57/0.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.57/0.67 % No SInE strategy applied
% 0.57/0.67 % Search class: FGHPS-FFSM21-SFFFFFNN
% 0.57/0.67 % partial match(1): FGHPS-FFMM21-SFFFFFNN
% 0.57/0.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.57/0.67 % Starting SubtermCWHack with 136s (1) cores
% 0.57/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.57/0.67 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.57/0.67 % Starting new_bool_3 with 136s (1) cores
% 0.57/0.67 % Starting new_bool_1 with 136s (1) cores
% 0.57/0.67 % new_bool_3 with pid 486553 completed with status 0
% 0.57/0.67 % Result found by new_bool_3
% 0.57/0.67 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.57/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.57/0.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.57/0.67 % No SInE strategy applied
% 0.57/0.67 % Search class: FGHPS-FFSM21-SFFFFFNN
% 0.57/0.67 % partial match(1): FGHPS-FFMM21-SFFFFFNN
% 0.57/0.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.57/0.67 % Starting SubtermCWHack with 136s (1) cores
% 0.57/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.57/0.67 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.57/0.67 % Starting new_bool_3 with 136s (1) cores
% 0.57/0.67 % Preprocessing time : 0.002 s
% 0.57/0.67 % Presaturation interreduction done
% 0.57/0.67
% 0.57/0.67 % Proof found!
% 0.57/0.67 % SZS status Unsatisfiable
% 0.57/0.67 % SZS output start CNFRefutation
% See solution above
% 0.57/0.67 % Parsed axioms : 16
% 0.57/0.67 % Removed by relevancy pruning/SinE : 0
% 0.57/0.67 % Initial clauses : 16
% 0.57/0.67 % Removed in clause preprocessing : 0
% 0.57/0.67 % Initial clauses in saturation : 16
% 0.57/0.67 % Processed clauses : 474
% 0.57/0.67 % ...of these trivial : 15
% 0.57/0.67 % ...subsumed : 138
% 0.57/0.67 % ...remaining for further processing : 321
% 0.57/0.67 % Other redundant clauses eliminated : 16
% 0.57/0.67 % Clauses deleted for lack of memory : 0
% 0.57/0.67 % Backward-subsumed : 71
% 0.57/0.67 % Backward-rewritten : 207
% 0.57/0.67 % Generated clauses : 1375
% 0.57/0.67 % ...of the previous two non-redundant : 1313
% 0.57/0.67 % ...aggressively subsumed : 0
% 0.57/0.67 % Contextual simplify-reflections : 26
% 0.57/0.67 % Paramodulations : 1357
% 0.57/0.67 % Factorizations : 1
% 0.57/0.67 % NegExts : 0
% 0.57/0.67 % Equation resolutions : 16
% 0.57/0.67 % Disequality decompositions : 0
% 0.57/0.67 % Total rewrite steps : 644
% 0.57/0.67 % ...of those cached : 571
% 0.57/0.67 % Propositional unsat checks : 0
% 0.57/0.67 % Propositional check models : 0
% 0.57/0.67 % Propositional check unsatisfiable : 0
% 0.57/0.67 % Propositional clauses : 0
% 0.57/0.67 % Propositional clauses after purity: 0
% 0.57/0.67 % Propositional unsat core size : 0
% 0.57/0.67 % Propositional preprocessing time : 0.000
% 0.57/0.67 % Propositional encoding time : 0.000
% 0.57/0.67 % Propositional solver time : 0.000
% 0.57/0.67 % Success case prop preproc time : 0.000
% 0.57/0.67 % Success case prop encoding time : 0.000
% 0.57/0.67 % Success case prop solver time : 0.000
% 0.57/0.67 % Current number of processed clauses : 25
% 0.57/0.67 % Positive orientable unit clauses : 24
% 0.57/0.67 % Positive unorientable unit clauses: 0
% 0.57/0.67 % Negative unit clauses : 1
% 0.57/0.67 % Non-unit-clauses : 0
% 0.57/0.67 % Current number of unprocessed clauses: 592
% 0.57/0.67 % ...number of literals in the above : 2394
% 0.57/0.67 % Current number of archived formulas : 0
% 0.57/0.67 % Current number of archived clauses : 295
% 0.57/0.67 % Clause-clause subsumption calls (NU) : 1234
% 0.57/0.67 % Rec. Clause-clause subsumption calls : 603
% 0.57/0.67 % Non-unit clause-clause subsumptions : 208
% 0.57/0.67 % Unit Clause-clause subsumption calls : 284
% 0.57/0.67 % Rewrite failures with RHS unbound : 0
% 0.57/0.67 % BW rewrite match attempts : 73
% 0.57/0.67 % BW rewrite match successes : 30
% 0.57/0.67 % Condensation attempts : 0
% 0.57/0.67 % Condensation successes : 0
% 0.57/0.67 % Termbank termtop insertions : 18695
% 0.57/0.67 % Search garbage collected termcells : 20
% 0.57/0.67
% 0.57/0.67 % -------------------------------------------------
% 0.57/0.67 % User time : 0.060 s
% 0.57/0.67 % System time : 0.004 s
% 0.57/0.67 % Total time : 0.064 s
% 0.57/0.67 % Maximum resident set size: 3384 pages
% 0.57/0.67
% 0.57/0.67 % -------------------------------------------------
% 0.57/0.67 % User time : 0.260 s
% 0.57/0.67 % System time : 0.026 s
% 0.57/0.67 % Total time : 0.286 s
% 0.57/0.67 % Maximum resident set size: 4608 pages
% 0.57/0.67 % E exiting
%------------------------------------------------------------------------------