%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP376-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 : n002.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:43:25 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.51s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 18
% Syntax : Number of clauses : 87 ( 24 unt; 60 nHn; 69 RR)
% Number of literals : 177 ( 176 equ; 33 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 38 ( 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_29,negated_conjecture,
( inverse(sk_c4) = sk_c6
| inverse(sk_c2) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_29) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c5
| inverse(sk_c2) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_24,negated_conjecture,
( inverse(sk_c4) = sk_c6
| multiply(sk_c2,sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_21,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c5
| multiply(sk_c2,sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_27,negated_conjecture,
( inverse(sk_c3) = sk_c7
| inverse(sk_c2) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_27) ).
cnf(prove_this_30,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c6
| inverse(sk_c2) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_30) ).
cnf(prove_this_28,negated_conjecture,
( multiply(sk_c3,sk_c6) = sk_c7
| inverse(sk_c2) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_28) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c3) = sk_c7
| multiply(sk_c2,sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c6
| multiply(sk_c2,sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_23,negated_conjecture,
( multiply(sk_c3,sk_c6) = sk_c7
| multiply(sk_c2,sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_13,negated_conjecture,
( multiply(sk_c3,sk_c6) = sk_c7
| inverse(sk_c1) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_13) ).
cnf(prove_this_8,negated_conjecture,
( multiply(sk_c3,sk_c6) = sk_c7
| multiply(sk_c1,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c3) = sk_c7
| inverse(sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c5
| multiply(sk_c5,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_31,negated_conjecture,
( multiply(X4,sk_c5) != sk_c6
| inverse(X4) != sk_c6
| multiply(X3,sk_c6) != sk_c7
| inverse(X3) != sk_c7
| multiply(sk_c6,sk_c7) != sk_c5
| inverse(X2) != sk_c5
| multiply(X2,sk_c5) != sk_c7
| multiply(sk_c5,sk_c6) != sk_c7
| inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6
| inverse(sk_c7) != sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_31) ).
cnf(c_0_18,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_19,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_20,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_21,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_22,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_23,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_23]),c_0_22]) ).
cnf(c_0_25,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( inverse(sk_c4) = sk_c6
| inverse(sk_c2) = sk_c5 ),
prove_this_29 ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c5
| inverse(sk_c2) = sk_c5 ),
prove_this_26 ).
cnf(c_0_28,negated_conjecture,
( inverse(sk_c4) = sk_c6
| multiply(sk_c2,sk_c5) = sk_c7 ),
prove_this_24 ).
cnf(c_0_29,negated_conjecture,
( inverse(sk_c4) = sk_c6
| multiply(sk_c2,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c5
| multiply(sk_c2,sk_c5) = sk_c7 ),
prove_this_21 ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c2,sk_c5) = identity
| multiply(sk_c6,sk_c7) = sk_c5 ),
inference(spm,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c6,sk_c4) = identity
| multiply(sk_c2,sk_c5) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c6,sk_c4) = identity
| multiply(sk_c2,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( inverse(sk_c3) = sk_c7
| inverse(sk_c2) = sk_c5 ),
prove_this_27 ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c6
| inverse(sk_c2) = sk_c5 ),
prove_this_30 ).
cnf(c_0_36,negated_conjecture,
( identity = sk_c7
| multiply(sk_c6,sk_c7) = sk_c5 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( identity = sk_c7
| multiply(sk_c6,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_22,c_0_24]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c3,sk_c6) = sk_c7
| inverse(sk_c2) = sk_c5 ),
prove_this_28 ).
cnf(c_0_40,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_41,negated_conjecture,
( inverse(sk_c3) = sk_c7
| multiply(sk_c2,sk_c5) = sk_c7 ),
prove_this_22 ).
cnf(c_0_42,negated_conjecture,
( inverse(sk_c3) = sk_c7
| multiply(sk_c2,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_25,c_0_34]) ).
cnf(c_0_43,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c6
| multiply(sk_c2,sk_c5) = sk_c7 ),
prove_this_25 ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c2,sk_c5) = identity
| multiply(sk_c4,sk_c5) = sk_c6 ),
inference(spm,[status(thm)],[c_0_25,c_0_35]) ).
cnf(c_0_46,negated_conjecture,
( identity = sk_c7
| multiply(inverse(sk_c6),sk_c5) = sk_c7 ),
inference(spm,[status(thm)],[c_0_21,c_0_36]) ).
cnf(c_0_47,negated_conjecture,
( identity = sk_c7
| inverse(sk_c6) = sk_c4 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_37]),c_0_38]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c3,sk_c6) = sk_c7
| multiply(sk_c2,sk_c5) = sk_c7 ),
prove_this_23 ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c2,sk_c5) = identity
| multiply(sk_c3,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_25,c_0_39]) ).
cnf(c_0_50,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_40]),c_0_38]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c7,sk_c3) = identity
| multiply(sk_c2,sk_c5) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_41]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c7,sk_c3) = identity
| multiply(sk_c2,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_19,c_0_42]) ).
cnf(c_0_53,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_43]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c3,sk_c6) = sk_c7
| inverse(sk_c1) = sk_c7 ),
prove_this_13 ).
cnf(c_0_55,negated_conjecture,
( identity = sk_c7
| multiply(sk_c4,sk_c5) = sk_c6 ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_56,negated_conjecture,
( identity = sk_c7
| multiply(sk_c4,sk_c5) = sk_c7 ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_57,negated_conjecture,
( identity = sk_c7
| multiply(sk_c3,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_58,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_50]),c_0_24]) ).
cnf(c_0_59,negated_conjecture,
( identity = sk_c7
| multiply(sk_c7,sk_c3) = identity ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_60,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_19,c_0_53]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c3,sk_c6) = sk_c7
| multiply(sk_c1,sk_c7) = sk_c6 ),
prove_this_8 ).
cnf(c_0_62,negated_conjecture,
( multiply(sk_c1,sk_c7) = identity
| multiply(sk_c3,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_25,c_0_54]) ).
cnf(c_0_63,negated_conjecture,
( inverse(sk_c3) = sk_c7
| inverse(sk_c7) = sk_c6 ),
prove_this_2 ).
cnf(c_0_64,negated_conjecture,
( sk_c6 = sk_c7
| identity = sk_c7 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_65,negated_conjecture,
( identity = sk_c7
| multiply(inverse(sk_c3),sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_21,c_0_57]) ).
cnf(c_0_66,negated_conjecture,
( identity = sk_c7
| inverse(sk_c3) = sk_c7 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_20]) ).
cnf(c_0_67,negated_conjecture,
( identity = sk_c6
| multiply(sk_c3,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
( inverse(sk_c7) = sk_c3
| inverse(sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_24,c_0_63]) ).
cnf(c_0_69,negated_conjecture,
( sk_c6 = sk_c7
| inverse(sk_c7) = sk_c7 ),
inference(spm,[status(thm)],[c_0_60,c_0_64]) ).
cnf(c_0_70,negated_conjecture,
( identity = sk_c7
| multiply(sk_c7,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,negated_conjecture,
( identity = sk_c6
| multiply(inverse(sk_c3),sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_21,c_0_67]) ).
cnf(c_0_72,negated_conjecture,
( sk_c6 = sk_c7
| sk_c3 = sk_c7 ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,negated_conjecture,
( identity = sk_c7
| multiply(inverse(sk_c7),sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_21,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
( identity = sk_c6
| sk_c6 = sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_19])]) ).
cnf(c_0_75,negated_conjecture,
( identity = sk_c7
| multiply(sk_c6,inverse(sk_c7)) = sk_c7 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_73]),c_0_24]) ).
cnf(c_0_76,negated_conjecture,
sk_c6 = sk_c7,
inference(spm,[status(thm)],[c_0_64,c_0_74]) ).
cnf(c_0_77,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c5
| multiply(sk_c5,sk_c6) = sk_c7 ),
prove_this_16 ).
cnf(c_0_78,negated_conjecture,
identity = sk_c7,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76]),c_0_25])]) ).
cnf(c_0_79,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c5
| multiply(inverse(sk_c5),sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_21,c_0_77]) ).
cnf(c_0_80,plain,
multiply(X1,sk_c7) = X1,
inference(rw,[status(thm)],[c_0_38,c_0_78]) ).
cnf(c_0_81,negated_conjecture,
( multiply(X4,sk_c5) != sk_c6
| inverse(X4) != sk_c6
| multiply(X3,sk_c6) != sk_c7
| inverse(X3) != sk_c7
| multiply(sk_c6,sk_c7) != sk_c5
| inverse(X2) != sk_c5
| multiply(X2,sk_c5) != sk_c7
| multiply(sk_c5,sk_c6) != sk_c7
| inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6
| inverse(sk_c7) != sk_c6 ),
inference(fof_simplification,[status(thm)],[prove_this_31]) ).
cnf(c_0_82,negated_conjecture,
( sk_c5 = sk_c7
| multiply(inverse(sk_c5),sk_c7) = sk_c7 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_76]),c_0_76]),c_0_80]) ).
cnf(c_0_83,negated_conjecture,
( multiply(X4,sk_c5) != sk_c6
| inverse(X4) != sk_c6
| multiply(X3,sk_c6) != sk_c7
| inverse(X3) != sk_c7
| multiply(sk_c6,sk_c7) != sk_c5
| inverse(X2) != sk_c5
| multiply(X2,sk_c5) != sk_c7
| multiply(sk_c5,sk_c6) != sk_c7
| inverse(X1) != sk_c7
| multiply(X1,sk_c7) != sk_c6
| inverse(sk_c7) != sk_c6 ),
c_0_81 ).
cnf(c_0_84,negated_conjecture,
sk_c5 = sk_c7,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_82]),c_0_24]),c_0_80])]) ).
cnf(c_0_85,plain,
inverse(sk_c7) = sk_c7,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_78]),c_0_78]) ).
cnf(c_0_86,negated_conjecture,
$false,
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(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)],[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_83,c_0_76]),c_0_76]),c_0_76]),c_0_76]),c_0_76]),c_0_76]),c_0_76]),c_0_80]),c_0_84]),c_0_80]),c_0_84]),c_0_84]),c_0_80]),c_0_80]),c_0_84]),c_0_80]),c_0_80]),c_0_85]),c_0_84])])])])])]),c_0_85])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP376-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n002.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 20 20:13:32 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.17/0.51 % Version: 3.5.1
% 0.17/0.51 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.51 % Starting sh5l with 300s (1) cores
% 0.17/0.51 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1607711 completed with status 0
% 0.17/0.51 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.17/0.51 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.51 % No SInE strategy applied
% 0.17/0.51 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.17/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.51 % Starting new_bool_3 with 136s (1) cores
% 0.17/0.51 % Starting new_bool_1 with 136s (1) cores
% 0.17/0.51 % SubtermCWHack with pid 1607716 completed with status 0
% 0.17/0.51 % Result found by SubtermCWHack
% 0.17/0.51 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.51 % No SInE strategy applied
% 0.17/0.51 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.17/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.51 % Preprocessing time : 0.001 s
% 0.17/0.51
% 0.17/0.51 % Proof found!
% 0.17/0.51 % SZS status Unsatisfiable
% 0.17/0.51 % SZS output start CNFRefutation
% See solution above
% 0.17/0.52 % Parsed axioms : 34
% 0.17/0.52 % Removed by relevancy pruning/SinE : 0
% 0.17/0.52 % Initial clauses : 34
% 0.17/0.52 % Removed in clause preprocessing : 0
% 0.17/0.52 % Initial clauses in saturation : 34
% 0.17/0.52 % Processed clauses : 2013
% 0.17/0.52 % ...of these trivial : 102
% 0.17/0.52 % ...subsumed : 1396
% 0.17/0.52 % ...remaining for further processing : 515
% 0.17/0.52 % Other redundant clauses eliminated : 4
% 0.17/0.52 % Clauses deleted for lack of memory : 0
% 0.17/0.52 % Backward-subsumed : 9
% 0.17/0.52 % Backward-rewritten : 383
% 0.17/0.52 % Generated clauses : 8205
% 0.17/0.52 % ...of the previous two non-redundant : 7701
% 0.17/0.52 % ...aggressively subsumed : 0
% 0.17/0.52 % Contextual simplify-reflections : 2
% 0.17/0.52 % Paramodulations : 8199
% 0.17/0.52 % Factorizations : 5
% 0.17/0.52 % NegExts : 0
% 0.17/0.52 % Equation resolutions : 4
% 0.17/0.52 % Disequality decompositions : 0
% 0.17/0.52 % Total rewrite steps : 5385
% 0.17/0.52 % ...of those cached : 4898
% 0.17/0.52 % Propositional unsat checks : 0
% 0.17/0.52 % Propositional check models : 0
% 0.17/0.52 % Propositional check unsatisfiable : 0
% 0.17/0.52 % Propositional clauses : 0
% 0.17/0.52 % Propositional clauses after purity: 0
% 0.17/0.52 % Propositional unsat core size : 0
% 0.17/0.52 % Propositional preprocessing time : 0.000
% 0.17/0.52 % Propositional encoding time : 0.000
% 0.17/0.52 % Propositional solver time : 0.000
% 0.17/0.52 % Success case prop preproc time : 0.000
% 0.17/0.52 % Success case prop encoding time : 0.000
% 0.17/0.52 % Success case prop solver time : 0.000
% 0.17/0.52 % Current number of processed clauses : 122
% 0.17/0.52 % Positive orientable unit clauses : 21
% 0.17/0.52 % Positive unorientable unit clauses: 0
% 0.17/0.52 % Negative unit clauses : 0
% 0.17/0.52 % Non-unit-clauses : 101
% 0.17/0.52 % Current number of unprocessed clauses: 1898
% 0.17/0.52 % ...number of literals in the above : 4248
% 0.17/0.52 % Current number of archived formulas : 0
% 0.17/0.52 % Current number of archived clauses : 392
% 0.17/0.52 % Clause-clause subsumption calls (NU) : 6297
% 0.17/0.52 % Rec. Clause-clause subsumption calls : 6286
% 0.17/0.52 % Non-unit clause-clause subsumptions : 1406
% 0.17/0.52 % Unit Clause-clause subsumption calls : 75
% 0.17/0.52 % Rewrite failures with RHS unbound : 0
% 0.17/0.52 % BW rewrite match attempts : 29
% 0.17/0.52 % BW rewrite match successes : 17
% 0.17/0.52 % Condensation attempts : 0
% 0.17/0.52 % Condensation successes : 0
% 0.17/0.52 % Termbank termtop insertions : 62921
% 0.17/0.52 % Search garbage collected termcells : 29
% 0.17/0.52
% 0.17/0.52 % -------------------------------------------------
% 0.17/0.52 % User time : 0.072 s
% 0.17/0.52 % System time : 0.005 s
% 0.17/0.52 % Total time : 0.077 s
% 0.17/0.52 % Maximum resident set size: 3648 pages
% 0.17/0.52
% 0.17/0.52 % -------------------------------------------------
% 0.17/0.52 % User time : 0.332 s
% 0.17/0.52 % System time : 0.015 s
% 0.17/0.52 % Total time : 0.347 s
% 0.17/0.52 % Maximum resident set size: 4608 pages
% 0.17/0.52 % E exiting
%------------------------------------------------------------------------------