%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP357-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 : n020.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:23 PM UTC 2026
% Result : Unsatisfiable 2.29s 0.70s
% Output : CNFRefutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 19
% Syntax : Number of clauses : 93 ( 25 unt; 61 nHn; 74 RR)
% Number of literals : 195 ( 194 equ; 46 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 : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 45 ( 2 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_24,negated_conjecture,
( inverse(sk_c4) = sk_c8
| inverse(sk_c1) = sk_c2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_23,negated_conjecture,
( multiply(sk_c4,sk_c8) = sk_c5
| inverse(sk_c1) = sk_c2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_18,negated_conjecture,
( inverse(sk_c4) = sk_c8
| multiply(sk_c1,sk_c2) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_22,negated_conjecture,
( multiply(sk_c8,sk_c5) = sk_c7
| inverse(sk_c1) = sk_c2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_17,negated_conjecture,
( multiply(sk_c4,sk_c8) = sk_c5
| multiply(sk_c1,sk_c2) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c3) = sk_c8
| inverse(sk_c1) = sk_c2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c8,sk_c5) = sk_c7
| multiply(sk_c1,sk_c2) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_15,negated_conjecture,
( inverse(sk_c3) = sk_c8
| multiply(sk_c1,sk_c2) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_20,negated_conjecture,
( multiply(sk_c3,sk_c8) = sk_c7
| inverse(sk_c1) = sk_c2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_14,negated_conjecture,
( multiply(sk_c3,sk_c8) = sk_c7
| multiply(sk_c1,sk_c2) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_14) ).
cnf(prove_this_9,negated_conjecture,
( inverse(sk_c3) = sk_c8
| inverse(sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_8,negated_conjecture,
( multiply(sk_c3,sk_c8) = sk_c7
| inverse(sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c6
| inverse(sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_3,negated_conjecture,
( inverse(sk_c3) = sk_c8
| multiply(sk_c7,sk_c6) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_31,negated_conjecture,
( inverse(X5) != sk_c8
| multiply(X5,sk_c8) != X4
| multiply(sk_c8,X4) != sk_c7
| inverse(X3) != sk_c8
| multiply(X3,sk_c8) != sk_c7
| multiply(sk_c8,sk_c7) != sk_c6
| multiply(X2,sk_c7) != sk_c8
| inverse(X1) != X2
| multiply(X1,X2) != sk_c8
| inverse(sk_c8) != sk_c6
| multiply(sk_c7,sk_c6) != sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_31) ).
cnf(prove_this_2,negated_conjecture,
( multiply(sk_c3,sk_c8) = sk_c7
| multiply(sk_c7,sk_c6) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_2) ).
cnf(c_0_19,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_20,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_21,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_22,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_23,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_24,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_24]),c_0_23]) ).
cnf(c_0_26,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( inverse(sk_c4) = sk_c8
| inverse(sk_c1) = sk_c2 ),
prove_this_24 ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c4,sk_c8) = sk_c5
| inverse(sk_c1) = sk_c2 ),
prove_this_23 ).
cnf(c_0_29,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c4,sk_c8) = identity ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c2,sk_c1) = identity
| multiply(sk_c4,sk_c8) = sk_c5 ),
inference(spm,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c2,sk_c1) = identity
| multiply(sk_c4,sk_c8) = identity ),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( inverse(sk_c4) = sk_c8
| multiply(sk_c1,sk_c2) = sk_c8 ),
prove_this_18 ).
cnf(c_0_33,negated_conjecture,
( identity = sk_c5
| multiply(sk_c2,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c8,sk_c5) = sk_c7
| inverse(sk_c1) = sk_c2 ),
prove_this_22 ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c4,sk_c8) = sk_c5
| multiply(sk_c1,sk_c2) = sk_c8 ),
prove_this_17 ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c4,sk_c8) = identity
| multiply(sk_c1,sk_c2) = sk_c8 ),
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( identity = sk_c5
| inverse(sk_c2) = sk_c1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_33]),c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( inverse(sk_c3) = sk_c8
| inverse(sk_c1) = sk_c2 ),
prove_this_21 ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c8,sk_c5) = sk_c7
| multiply(sk_c1,sk_c2) = sk_c8 ),
prove_this_16 ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c1,sk_c2) = identity
| multiply(sk_c8,sk_c5) = sk_c7 ),
inference(spm,[status(thm)],[c_0_26,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
( identity = sk_c5
| multiply(sk_c1,sk_c2) = sk_c8 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( identity = sk_c5
| multiply(sk_c1,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_20,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( inverse(sk_c3) = sk_c8
| multiply(sk_c1,sk_c2) = sk_c8 ),
prove_this_15 ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c3,sk_c8) = sk_c7
| inverse(sk_c1) = sk_c2 ),
prove_this_20 ).
cnf(c_0_46,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c3,sk_c8) = identity ),
inference(spm,[status(thm)],[c_0_26,c_0_39]) ).
cnf(c_0_47,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_48,negated_conjecture,
( identity = sk_c8
| multiply(sk_c8,sk_c5) = sk_c7 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,negated_conjecture,
( identity = sk_c8
| identity = sk_c5 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c3,sk_c8) = sk_c7
| multiply(sk_c1,sk_c2) = sk_c8 ),
prove_this_14 ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c3,sk_c8) = identity
| multiply(sk_c1,sk_c2) = sk_c8 ),
inference(spm,[status(thm)],[c_0_26,c_0_44]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c1,sk_c2) = identity
| multiply(sk_c3,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_26,c_0_45]) ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c1,sk_c2) = identity
| multiply(sk_c3,sk_c8) = identity ),
inference(spm,[status(thm)],[c_0_26,c_0_46]) ).
cnf(c_0_54,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_47]),c_0_34]) ).
cnf(c_0_55,negated_conjecture,
( identity = sk_c8
| multiply(inverse(sk_c8),sk_c7) = sk_c5 ),
inference(spm,[status(thm)],[c_0_22,c_0_48]) ).
cnf(c_0_56,negated_conjecture,
( identity = sk_c8
| multiply(sk_c5,X1) = X1 ),
inference(spm,[status(thm)],[c_0_21,c_0_49]) ).
cnf(c_0_57,negated_conjecture,
( identity = sk_c7
| multiply(sk_c1,sk_c2) = sk_c8 ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
( identity = sk_c7
| multiply(sk_c1,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
( identity = sk_c8
| multiply(sk_c7,inverse(sk_c5)) = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_25]) ).
cnf(c_0_60,negated_conjecture,
( identity = sk_c8
| inverse(sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_26,c_0_56]) ).
cnf(c_0_61,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_62,negated_conjecture,
( identity = sk_c8
| identity = sk_c7 ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,negated_conjecture,
( sk_c7 = sk_c8
| identity = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_34]) ).
cnf(c_0_64,negated_conjecture,
( inverse(sk_c3) = sk_c8
| inverse(sk_c8) = sk_c6 ),
prove_this_9 ).
cnf(c_0_65,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( multiply(sk_c3,sk_c8) = sk_c7
| inverse(sk_c8) = sk_c6 ),
prove_this_8 ).
cnf(c_0_67,negated_conjecture,
identity = sk_c8,
inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_62]),c_0_63]) ).
cnf(c_0_68,negated_conjecture,
( inverse(sk_c8) = sk_c3
| inverse(sk_c8) = sk_c6 ),
inference(spm,[status(thm)],[c_0_25,c_0_64]) ).
cnf(c_0_69,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_20,c_0_65]) ).
cnf(c_0_70,negated_conjecture,
( inverse(sk_c6) = sk_c8
| multiply(sk_c3,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_25,c_0_66]) ).
cnf(c_0_71,plain,
multiply(X1,sk_c8) = X1,
inference(rw,[status(thm)],[c_0_34,c_0_67]) ).
cnf(c_0_72,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c6
| inverse(sk_c8) = sk_c6 ),
prove_this_7 ).
cnf(c_0_73,negated_conjecture,
( sk_c3 != sk_c6
| inverse(sk_c8) = sk_c6 ),
inference(ef,[status(thm)],[c_0_68]) ).
cnf(c_0_74,plain,
inverse(sk_c8) = sk_c8,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_67]),c_0_67]) ).
cnf(c_0_75,negated_conjecture,
( sk_c3 = sk_c7
| inverse(sk_c6) = sk_c8 ),
inference(rw,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_76,negated_conjecture,
( inverse(sk_c3) = sk_c8
| multiply(sk_c7,sk_c6) = sk_c8 ),
prove_this_3 ).
cnf(c_0_77,negated_conjecture,
( inverse(sk_c6) = sk_c8
| multiply(sk_c8,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_25,c_0_72]) ).
cnf(c_0_78,plain,
multiply(sk_c8,X1) = X1,
inference(rw,[status(thm)],[c_0_21,c_0_67]) ).
cnf(c_0_79,negated_conjecture,
( sk_c3 != sk_c6
| sk_c6 = sk_c8 ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_80,negated_conjecture,
( sk_c6 = sk_c8
| sk_c3 = sk_c7 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_75]),c_0_74]) ).
cnf(c_0_81,negated_conjecture,
( inverse(X5) != sk_c8
| multiply(X5,sk_c8) != X4
| multiply(sk_c8,X4) != sk_c7
| inverse(X3) != sk_c8
| multiply(X3,sk_c8) != sk_c7
| multiply(sk_c8,sk_c7) != sk_c6
| multiply(X2,sk_c7) != sk_c8
| inverse(X1) != X2
| multiply(X1,X2) != sk_c8
| inverse(sk_c8) != sk_c6
| multiply(sk_c7,sk_c6) != sk_c8 ),
inference(fof_simplification,[status(thm)],[prove_this_31]) ).
cnf(c_0_82,negated_conjecture,
( multiply(sk_c3,sk_c8) = sk_c7
| multiply(sk_c7,sk_c6) = sk_c8 ),
prove_this_2 ).
cnf(c_0_83,negated_conjecture,
( multiply(sk_c3,sk_c8) = identity
| multiply(sk_c7,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_26,c_0_76]) ).
cnf(c_0_84,negated_conjecture,
( sk_c6 = sk_c7
| inverse(sk_c6) = sk_c8 ),
inference(rw,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_85,negated_conjecture,
( sk_c6 != sk_c7
| sk_c6 = sk_c8 ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_86,negated_conjecture,
( inverse(X5) != sk_c8
| multiply(X5,sk_c8) != X4
| multiply(sk_c8,X4) != sk_c7
| inverse(X3) != sk_c8
| multiply(X3,sk_c8) != sk_c7
| multiply(sk_c8,sk_c7) != sk_c6
| multiply(X2,sk_c7) != sk_c8
| inverse(X1) != X2
| multiply(X1,X2) != sk_c8
| inverse(sk_c8) != sk_c6
| multiply(sk_c7,sk_c6) != sk_c8 ),
c_0_81 ).
cnf(c_0_87,negated_conjecture,
( identity = sk_c7
| multiply(sk_c7,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_88,negated_conjecture,
sk_c6 = sk_c8,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_84]),c_0_74]),c_0_85]) ).
cnf(c_0_89,negated_conjecture,
( identity != sk_c8
| inverse(X3) != sk_c8
| inverse(X1) != sk_c8
| inverse(sk_c8) != sk_c6
| multiply(X3,sk_c8) != sk_c7
| multiply(sk_c8,sk_c7) != sk_c6
| multiply(sk_c7,sk_c6) != sk_c8
| multiply(inverse(X2),sk_c7) != sk_c8
| multiply(sk_c8,multiply(X1,sk_c8)) != sk_c7 ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_86])]),c_0_26]) ).
cnf(c_0_90,negated_conjecture,
sk_c7 = sk_c8,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_67]),c_0_88]),c_0_71])]) ).
cnf(c_0_91,negated_conjecture,
inverse(X1) != sk_c8,
inference(cn,[status(thm)],[inference(rw,[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(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_67])]),c_0_71]),c_0_78]),c_0_90]),c_0_90]),c_0_71]),c_0_90]),c_0_88]),c_0_71]),c_0_78]),c_0_90]),c_0_88]),c_0_71]),c_0_90]),c_0_74]),c_0_88])])])]),c_0_74])]) ).
cnf(c_0_92,plain,
$false,
inference(sr,[status(thm)],[c_0_74,c_0_91]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP357-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n020.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 20:11:17 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/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
% 2.29/0.70 % Version: 3.5.1
% 2.29/0.70 % Preprocessing class: FSMSSMSMSSSNFFN.
% 2.29/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.29/0.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.29/0.70 % Starting new_bool_3 with 300s (1) cores
% 2.29/0.70 % Starting new_bool_1 with 300s (1) cores
% 2.29/0.70 % Starting sh5l with 300s (1) cores
% 2.29/0.70 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1121941 completed with status 0
% 2.29/0.70 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 2.29/0.70 % Preprocessing class: FSMSSMSMSSSNFFN.
% 2.29/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.29/0.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.29/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.29/0.70 % No SInE strategy applied
% 2.29/0.70 % Search class: FGHPS-FFMM21-SFFFFFNN
% 2.29/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.29/0.70 % Starting SubtermCWHack with 136s (1) cores
% 2.29/0.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 2.29/0.70 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.29/0.70 % Starting new_bool_3 with 136s (1) cores
% 2.29/0.70 % Starting new_bool_1 with 136s (1) cores
% 2.29/0.70 % SubtermCWHack with pid 1121945 completed with status 0
% 2.29/0.70 % Result found by SubtermCWHack
% 2.29/0.70 % Preprocessing class: FSMSSMSMSSSNFFN.
% 2.29/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.29/0.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.29/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.29/0.70 % No SInE strategy applied
% 2.29/0.70 % Search class: FGHPS-FFMM21-SFFFFFNN
% 2.29/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.29/0.70 % Starting SubtermCWHack with 136s (1) cores
% 2.29/0.70 % Preprocessing time : 0.001 s
% 2.29/0.70
% 2.29/0.70 % Proof found!
% 2.29/0.70 % SZS status Unsatisfiable
% 2.29/0.70 % SZS output start CNFRefutation
% See solution above
% 2.29/0.70 % Parsed axioms : 34
% 2.29/0.70 % Removed by relevancy pruning/SinE : 0
% 2.29/0.70 % Initial clauses : 34
% 2.29/0.70 % Removed in clause preprocessing : 0
% 2.29/0.70 % Initial clauses in saturation : 34
% 2.29/0.70 % Processed clauses : 7019
% 2.29/0.70 % ...of these trivial : 167
% 2.29/0.70 % ...subsumed : 5823
% 2.29/0.70 % ...remaining for further processing : 1029
% 2.29/0.70 % Other redundant clauses eliminated : 4
% 2.29/0.70 % Clauses deleted for lack of memory : 0
% 2.29/0.70 % Backward-subsumed : 40
% 2.29/0.70 % Backward-rewritten : 705
% 2.29/0.70 % Generated clauses : 31817
% 2.29/0.70 % ...of the previous two non-redundant : 30458
% 2.29/0.70 % ...aggressively subsumed : 0
% 2.29/0.70 % Contextual simplify-reflections : 6
% 2.29/0.70 % Paramodulations : 31771
% 2.29/0.70 % Factorizations : 9
% 2.29/0.70 % NegExts : 0
% 2.29/0.70 % Equation resolutions : 4
% 2.29/0.70 % Disequality decompositions : 0
% 2.29/0.70 % Total rewrite steps : 15715
% 2.29/0.70 % ...of those cached : 14647
% 2.29/0.70 % Propositional unsat checks : 0
% 2.29/0.70 % Propositional check models : 0
% 2.29/0.70 % Propositional check unsatisfiable : 0
% 2.29/0.70 % Propositional clauses : 0
% 2.29/0.70 % Propositional clauses after purity: 0
% 2.29/0.70 % Propositional unsat core size : 0
% 2.29/0.70 % Propositional preprocessing time : 0.000
% 2.29/0.70 % Propositional encoding time : 0.000
% 2.29/0.70 % Propositional solver time : 0.000
% 2.29/0.70 % Success case prop preproc time : 0.000
% 2.29/0.70 % Success case prop encoding time : 0.000
% 2.29/0.70 % Success case prop solver time : 0.000
% 2.29/0.70 % Current number of processed clauses : 247
% 2.29/0.70 % Positive orientable unit clauses : 20
% 2.29/0.70 % Positive unorientable unit clauses: 0
% 2.29/0.70 % Negative unit clauses : 1
% 2.29/0.70 % Non-unit-clauses : 226
% 2.29/0.70 % Current number of unprocessed clauses: 6566
% 2.29/0.70 % ...number of literals in the above : 15964
% 2.29/0.70 % Current number of archived formulas : 0
% 2.29/0.70 % Current number of archived clauses : 780
% 2.29/0.70 % Clause-clause subsumption calls (NU) : 51722
% 2.29/0.70 % Rec. Clause-clause subsumption calls : 48591
% 2.29/0.70 % Non-unit clause-clause subsumptions : 5847
% 2.29/0.70 % Unit Clause-clause subsumption calls : 778
% 2.29/0.70 % Rewrite failures with RHS unbound : 0
% 2.29/0.70 % BW rewrite match attempts : 100
% 2.29/0.70 % BW rewrite match successes : 50
% 2.29/0.70 % Condensation attempts : 0
% 2.29/0.70 % Condensation successes : 0
% 2.29/0.70 % Termbank termtop insertions : 241092
% 2.29/0.70 % Search garbage collected termcells : 29
% 2.29/0.70
% 2.29/0.70 % -------------------------------------------------
% 2.29/0.70 % User time : 0.251 s
% 2.29/0.70 % System time : 0.018 s
% 2.29/0.70 % Total time : 0.269 s
% 2.29/0.70 % Maximum resident set size: 3392 pages
% 2.29/0.70
% 2.29/0.70 % -------------------------------------------------
% 2.29/0.70 % User time : 1.286 s
% 2.29/0.70 % System time : 0.062 s
% 2.29/0.70 % Total time : 1.348 s
% 2.29/0.70 % Maximum resident set size: 4608 pages
% 2.29/0.70 % E exiting
%------------------------------------------------------------------------------