TSTP Solution File: GRP373-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP373-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:47:45 EDT 2024
% Result : Unsatisfiable 1.19s 0.63s
% Output : CNFRefutation 1.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 15
% Syntax : Number of clauses : 74 ( 19 unt; 48 nHn; 61 RR)
% Number of literals : 197 ( 196 equ; 81 neg)
% Maximal clause size : 16 ( 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 : 58 ( 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_11,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| multiply(sk_c3,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| inverse(sk_c3) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c3,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_33,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_33) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c1) = sk_c11
| inverse(sk_c3) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_34,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_34) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c11) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_23,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_35,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c5,sk_c8) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_35) ).
cnf(prove_this_36,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_36) ).
cnf(prove_this_3,negated_conjecture,
( inverse(sk_c11) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_61,negated_conjecture,
( inverse(sk_c11) != sk_c10
| multiply(X1,sk_c11) != sk_c10
| inverse(X1) != sk_c11
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(X2,sk_c9) != sk_c10
| inverse(X2) != sk_c9
| multiply(X3,sk_c11) != sk_c10
| inverse(X3) != sk_c11
| multiply(X4,sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X5,X6) != sk_c11
| inverse(X5) != X6
| multiply(X6,sk_c10) != sk_c11
| inverse(X7) != X8
| inverse(X8) != X6
| multiply(X7,X6) != X8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_61) ).
cnf(c_0_15,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_16,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_17,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_18,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| multiply(sk_c3,sk_c11) = sk_c10 ),
prove_this_11 ).
cnf(c_0_20,negated_conjecture,
( multiply(inverse(sk_c3),sk_c10) = sk_c11
| multiply(sk_c1,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| inverse(sk_c3) = sk_c11 ),
prove_this_12 ).
cnf(c_0_22,negated_conjecture,
( multiply(sk_c1,sk_c11) = sk_c10
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( multiply(inverse(sk_c1),sk_c10) = sk_c11
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c3,sk_c11) = sk_c10 ),
prove_this_21 ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_33 ).
cnf(c_0_27,negated_conjecture,
( multiply(inverse(sk_c3),sk_c10) = sk_c11
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( inverse(sk_c1) = sk_c11
| inverse(sk_c3) = sk_c11 ),
prove_this_22 ).
cnf(c_0_29,negated_conjecture,
( multiply(inverse(sk_c4),sk_c9) = sk_c10
| multiply(sk_c11,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_34 ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| inverse(sk_c1) = sk_c11 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( inverse(sk_c11) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_4 ).
cnf(c_0_34,negated_conjecture,
multiply(sk_c11,sk_c10) = sk_c11,
inference(spm,[status(thm)],[c_0_23,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| identity = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_32]),c_0_16]) ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c10,sk_c4) = identity
| inverse(sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_16,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
identity = sk_c10,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_34]),c_0_16]) ).
cnf(c_0_38,negated_conjecture,
( inverse(sk_c1) = sk_c11
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_23 ).
cnf(c_0_39,negated_conjecture,
( multiply(inverse(sk_c11),sk_c10) = sk_c9
| identity = sk_c9 ),
inference(spm,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c10,sk_c4) = sk_c10
| inverse(sk_c11) = sk_c10 ),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
multiply(sk_c10,X1) = X1,
inference(rw,[status(thm)],[c_0_17,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c11,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_16,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( multiply(inverse(sk_c11),sk_c10) = sk_c9
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[c_0_39,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( inverse(sk_c11) = sk_c10
| sk_c4 = sk_c10 ),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c11,sk_c1) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
inference(rw,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_46,negated_conjecture,
( sk_c4 = sk_c10
| sk_c9 = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_41])]) ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c5,sk_c8) = sk_c11 ),
prove_this_35 ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c11,sk_c1) = sk_c10
| sk_c9 = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_41])]) ).
cnf(c_0_49,negated_conjecture,
( multiply(inverse(sk_c5),sk_c11) = sk_c8
| multiply(sk_c11,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| inverse(sk_c5) = sk_c8 ),
prove_this_36 ).
cnf(c_0_51,negated_conjecture,
( multiply(inverse(sk_c11),sk_c10) = sk_c1
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
( inverse(sk_c11) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_3 ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c8,sk_c11) = sk_c8 ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| sk_c9 = sk_c10
| sk_c1 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_41]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| identity = sk_c11 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_53]),c_0_16]) ).
cnf(c_0_56,negated_conjecture,
( sk_c9 = sk_c10
| sk_c1 = sk_c9 ),
inference(spm,[status(thm)],[c_0_43,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( sk_c1 = sk_c10
| sk_c9 = sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_46]),c_0_41])]) ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| sk_c10 = sk_c11 ),
inference(rw,[status(thm)],[c_0_55,c_0_37]) ).
cnf(c_0_59,negated_conjecture,
sk_c9 = sk_c10,
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( inverse(sk_c11) != sk_c10
| multiply(X1,sk_c11) != sk_c10
| inverse(X1) != sk_c11
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(X2,sk_c9) != sk_c10
| inverse(X2) != sk_c9
| multiply(X3,sk_c11) != sk_c10
| inverse(X3) != sk_c11
| multiply(X4,sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X5,X6) != sk_c11
| inverse(X5) != X6
| multiply(X6,sk_c10) != sk_c11
| inverse(X7) != X8
| inverse(X8) != X6
| multiply(X7,X6) != X8 ),
inference(fof_simplification,[status(thm)],[prove_this_61]) ).
cnf(c_0_61,negated_conjecture,
sk_c10 = sk_c11,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_34])]) ).
cnf(c_0_62,negated_conjecture,
( inverse(sk_c11) != sk_c10
| multiply(X1,sk_c11) != sk_c10
| inverse(X1) != sk_c11
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(X2,sk_c9) != sk_c10
| inverse(X2) != sk_c9
| multiply(X3,sk_c11) != sk_c10
| inverse(X3) != sk_c11
| multiply(X4,sk_c10) != sk_c9
| inverse(X4) != sk_c10
| multiply(X5,X6) != sk_c11
| inverse(X5) != X6
| multiply(X6,sk_c10) != sk_c11
| inverse(X7) != X8
| inverse(X8) != X6
| multiply(X7,X6) != X8 ),
c_0_60 ).
cnf(c_0_63,plain,
multiply(sk_c11,X1) = X1,
inference(rw,[status(thm)],[c_0_41,c_0_61]) ).
cnf(c_0_64,plain,
multiply(inverse(X1),X1) = sk_c11,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_37]),c_0_61]) ).
cnf(c_0_65,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_18]) ).
cnf(c_0_66,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c10) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X3,sk_c10) != sk_c9
| multiply(X4,sk_c11) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| multiply(X6,sk_c11) != sk_c10
| inverse(sk_c11) != sk_c10
| inverse(X3) != sk_c10
| inverse(X4) != sk_c11
| inverse(X5) != sk_c9
| inverse(X6) != sk_c11 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_62])]) ).
cnf(c_0_67,plain,
multiply(inverse(sk_c11),X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_63]) ).
cnf(c_0_68,plain,
multiply(X1,sk_c11) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_64]),c_0_65]) ).
cnf(c_0_69,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c11) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X3,sk_c11) != sk_c11
| multiply(X4,sk_c11) != sk_c11
| multiply(X5,sk_c11) != sk_c11
| multiply(X6,sk_c11) != sk_c11
| inverse(sk_c11) != sk_c11
| inverse(X3) != sk_c11
| inverse(X4) != sk_c11
| inverse(X5) != sk_c11
| inverse(X6) != sk_c11 ),
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)],[c_0_66,c_0_59]),c_0_34]),c_0_59]),c_0_59]),c_0_59]),c_0_61]),c_0_61]),c_0_61]),c_0_61]),c_0_61]),c_0_61]),c_0_61]),c_0_61]),c_0_61]),c_0_61]),c_0_61])]) ).
cnf(c_0_70,plain,
inverse(sk_c11) = sk_c11,
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(X2,inverse(X2)) != sk_c11
| inverse(X2) != sk_c11 ),
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_69,c_0_68]),c_0_68]),c_0_68]),c_0_68]),c_0_68])])])])]),c_0_70])]) ).
cnf(c_0_72,negated_conjecture,
( inverse(X1) != sk_c11
| inverse(X1) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_70]),c_0_68]),c_0_68]),c_0_63])]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_72,c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP373-1 : TPTP v8.2.0. Released v2.5.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 05:50:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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
% 1.19/0.63 # Version: 3.1.0
% 1.19/0.63 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.19/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.19/0.63 # Starting new_bool_3 with 300s (1) cores
% 1.19/0.63 # Starting new_bool_1 with 300s (1) cores
% 1.19/0.63 # Starting sh5l with 300s (1) cores
% 1.19/0.63 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 6419 completed with status 0
% 1.19/0.63 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.19/0.63 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.19/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.19/0.63 # No SInE strategy applied
% 1.19/0.63 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.19/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.19/0.63 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.19/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.19/0.63 # Starting new_bool_3 with 136s (1) cores
% 1.19/0.63 # Starting new_bool_1 with 136s (1) cores
% 1.19/0.63 # Starting sh5l with 136s (1) cores
% 1.19/0.63 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 6423 completed with status 0
% 1.19/0.63 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.19/0.63 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.19/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.19/0.63 # No SInE strategy applied
% 1.19/0.63 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.19/0.63 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.19/0.63 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.19/0.63 # Preprocessing time : 0.001 s
% 1.19/0.63 # Presaturation interreduction done
% 1.19/0.63
% 1.19/0.63 # Proof found!
% 1.19/0.63 # SZS status Unsatisfiable
% 1.19/0.63 # SZS output start CNFRefutation
% See solution above
% 1.19/0.63 # Parsed axioms : 64
% 1.19/0.63 # Removed by relevancy pruning/SinE : 0
% 1.19/0.63 # Initial clauses : 64
% 1.19/0.63 # Removed in clause preprocessing : 0
% 1.19/0.63 # Initial clauses in saturation : 64
% 1.19/0.63 # Processed clauses : 2685
% 1.19/0.63 # ...of these trivial : 71
% 1.19/0.63 # ...subsumed : 1839
% 1.19/0.63 # ...remaining for further processing : 775
% 1.19/0.63 # Other redundant clauses eliminated : 62
% 1.19/0.63 # Clauses deleted for lack of memory : 0
% 1.19/0.63 # Backward-subsumed : 93
% 1.19/0.63 # Backward-rewritten : 467
% 1.19/0.63 # Generated clauses : 8684
% 1.19/0.63 # ...of the previous two non-redundant : 8122
% 1.19/0.63 # ...aggressively subsumed : 0
% 1.19/0.63 # Contextual simplify-reflections : 5
% 1.19/0.63 # Paramodulations : 8623
% 1.19/0.63 # Factorizations : 0
% 1.19/0.63 # NegExts : 0
% 1.19/0.63 # Equation resolutions : 62
% 1.19/0.63 # Disequality decompositions : 0
% 1.19/0.63 # Total rewrite steps : 4358
% 1.19/0.63 # ...of those cached : 4163
% 1.19/0.63 # Propositional unsat checks : 0
% 1.19/0.63 # Propositional check models : 0
% 1.19/0.63 # Propositional check unsatisfiable : 0
% 1.19/0.63 # Propositional clauses : 0
% 1.19/0.63 # Propositional clauses after purity: 0
% 1.19/0.63 # Propositional unsat core size : 0
% 1.19/0.63 # Propositional preprocessing time : 0.000
% 1.19/0.63 # Propositional encoding time : 0.000
% 1.19/0.63 # Propositional solver time : 0.000
% 1.19/0.63 # Success case prop preproc time : 0.000
% 1.19/0.63 # Success case prop encoding time : 0.000
% 1.19/0.63 # Success case prop solver time : 0.000
% 1.19/0.63 # Current number of processed clauses : 150
% 1.19/0.63 # Positive orientable unit clauses : 13
% 1.19/0.63 # Positive unorientable unit clauses: 0
% 1.19/0.63 # Negative unit clauses : 0
% 1.19/0.63 # Non-unit-clauses : 137
% 1.19/0.63 # Current number of unprocessed clauses: 4332
% 1.19/0.63 # ...number of literals in the above : 26726
% 1.19/0.63 # Current number of archived formulas : 0
% 1.19/0.63 # Current number of archived clauses : 624
% 1.19/0.63 # Clause-clause subsumption calls (NU) : 23531
% 1.19/0.63 # Rec. Clause-clause subsumption calls : 14207
% 1.19/0.63 # Non-unit clause-clause subsumptions : 1921
% 1.19/0.63 # Unit Clause-clause subsumption calls : 803
% 1.19/0.63 # Rewrite failures with RHS unbound : 0
% 1.19/0.63 # BW rewrite match attempts : 66
% 1.19/0.63 # BW rewrite match successes : 55
% 1.19/0.63 # Condensation attempts : 0
% 1.19/0.63 # Condensation successes : 0
% 1.19/0.63 # Termbank termtop insertions : 136569
% 1.19/0.63 # Search garbage collected termcells : 45
% 1.19/0.63
% 1.19/0.63 # -------------------------------------------------
% 1.19/0.63 # User time : 0.129 s
% 1.19/0.63 # System time : 0.004 s
% 1.19/0.63 # Total time : 0.133 s
% 1.19/0.63 # Maximum resident set size: 1668 pages
% 1.19/0.63
% 1.19/0.63 # -------------------------------------------------
% 1.19/0.63 # User time : 0.618 s
% 1.19/0.63 # System time : 0.013 s
% 1.19/0.63 # Total time : 0.631 s
% 1.19/0.63 # Maximum resident set size: 1760 pages
% 1.19/0.63 % E---3.1 exiting
% 1.19/0.63 % E exiting
%------------------------------------------------------------------------------