TSTP Solution File: GRP245-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP245-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:46:45 EDT 2023
% Result : Unsatisfiable 0.36s 0.79s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 16
% Syntax : Number of clauses : 80 ( 21 unt; 52 nHn; 69 RR)
% Number of literals : 193 ( 192 equ; 66 neg)
% Maximal clause size : 13 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',left_identity) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c6,sk_c7) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',prove_this_5) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| inverse(sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',prove_this_6) ).
cnf(prove_this_37,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c10
| multiply(sk_c4,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',prove_this_37) ).
cnf(prove_this_36,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',prove_this_36) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c6,sk_c7) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',prove_this_12) ).
cnf(prove_this_30,negated_conjecture,
( inverse(sk_c3) = sk_c10
| multiply(sk_c4,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',prove_this_30) ).
cnf(prove_this_18,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',prove_this_18) ).
cnf(prove_this_17,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| inverse(sk_c5) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',prove_this_17) ).
cnf(prove_this_13,negated_conjecture,
( inverse(sk_c1) = sk_c10
| inverse(sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',prove_this_13) ).
cnf(prove_this_29,negated_conjecture,
( inverse(sk_c3) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',prove_this_29) ).
cnf(prove_this_24,negated_conjecture,
( inverse(sk_c2) = sk_c9
| inverse(sk_c5) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',prove_this_24) ).
cnf(prove_this_25,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',prove_this_25) ).
cnf(prove_this_43,negated_conjecture,
( multiply(X1,sk_c10) != sk_c9
| inverse(X1) != sk_c10
| multiply(X2,sk_c9) != sk_c8
| inverse(X2) != sk_c9
| inverse(X3) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| inverse(X4) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| inverse(X5) != sk_c9
| multiply(X5,sk_c8) != sk_c9
| multiply(X6,X7) != sk_c9
| inverse(X6) != X7
| multiply(X7,sk_c8) != sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p',prove_this_43) ).
cnf(c_0_16,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_17,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_18,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_19,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c6,sk_c7) = sk_c9 ),
prove_this_5 ).
cnf(c_0_21,negated_conjecture,
( multiply(inverse(sk_c6),sk_c9) = sk_c7
| multiply(sk_c1,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( multiply(inverse(inverse(sk_c6)),sk_c7) = sk_c9
| multiply(sk_c1,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| inverse(sk_c6) = sk_c7 ),
prove_this_6 ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c10
| multiply(sk_c4,sk_c9) = sk_c10 ),
prove_this_37 ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| sk_c9 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( multiply(inverse(sk_c4),sk_c10) = sk_c9
| multiply(sk_c3,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_36 ).
cnf(c_0_28,negated_conjecture,
( multiply(inverse(sk_c1),sk_c9) = sk_c10
| sk_c9 = identity ),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c3,sk_c9) = sk_c10
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( multiply(inverse(inverse(sk_c1)),sk_c10) = sk_c9
| sk_c9 = identity ),
inference(spm,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c6,sk_c7) = sk_c9 ),
prove_this_12 ).
cnf(c_0_32,negated_conjecture,
( multiply(inverse(sk_c3),sk_c10) = sk_c9
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( inverse(sk_c3) = sk_c10
| multiply(sk_c4,sk_c9) = sk_c10 ),
prove_this_30 ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(sk_c5,sk_c8) = sk_c9 ),
prove_this_18 ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c9
| multiply(sk_c7,sk_c9) = sk_c7 ),
inference(spm,[status(thm)],[c_0_21,c_0_23]) ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c9
| sk_c9 = identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_17])]) ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c4,sk_c9) = sk_c10
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( multiply(inverse(sk_c5),sk_c9) = sk_c8
| multiply(sk_c2,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_19,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| inverse(sk_c5) = sk_c9 ),
prove_this_17 ).
cnf(c_0_40,negated_conjecture,
( multiply(inverse(sk_c1),sk_c9) = sk_c10
| multiply(sk_c7,sk_c9) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( multiply(inverse(sk_c6),sk_c9) = sk_c7
| sk_c9 = identity ),
inference(spm,[status(thm)],[c_0_19,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( inverse(sk_c1) = sk_c10
| inverse(sk_c6) = sk_c7 ),
prove_this_13 ).
cnf(c_0_43,negated_conjecture,
( multiply(inverse(sk_c4),sk_c10) = sk_c9
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( inverse(sk_c3) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_29 ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c2,sk_c9) = sk_c8
| multiply(sk_c9,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( multiply(inverse(inverse(sk_c1)),sk_c10) = sk_c9
| multiply(sk_c7,sk_c9) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c7,sk_c9) = sk_c7
| inverse(sk_c1) = sk_c10
| sk_c9 = identity ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( inverse(sk_c2) = sk_c9
| inverse(sk_c5) = sk_c9 ),
prove_this_24 ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c10,sk_c10) = sk_c9
| inverse(sk_c3) = sk_c10 ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,negated_conjecture,
( multiply(inverse(sk_c2),sk_c8) = sk_c9
| multiply(sk_c9,sk_c9) = sk_c8 ),
inference(spm,[status(thm)],[c_0_19,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( inverse(sk_c2) = sk_c9
| multiply(sk_c5,sk_c8) = sk_c9 ),
prove_this_25 ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c7,sk_c9) = sk_c7
| sk_c9 = identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_17])]) ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c9,sk_c5) = identity
| inverse(sk_c2) = sk_c9 ),
inference(spm,[status(thm)],[c_0_17,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
multiply(sk_c10,sk_c10) = sk_c9,
inference(spm,[status(thm)],[c_0_32,c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c9
| multiply(sk_c9,sk_c9) = sk_c8
| multiply(sk_c9,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
sk_c9 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_52]),c_0_17])]) ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c9,sk_c5) = identity
| multiply(sk_c9,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_17,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
multiply(inverse(sk_c10),sk_c9) = sk_c10,
inference(spm,[status(thm)],[c_0_19,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
( multiply(X1,sk_c10) != sk_c9
| inverse(X1) != sk_c10
| multiply(X2,sk_c9) != sk_c8
| inverse(X2) != sk_c9
| inverse(X3) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| inverse(X4) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| inverse(X5) != sk_c9
| multiply(X5,sk_c8) != sk_c9
| multiply(X6,X7) != sk_c9
| inverse(X6) != X7
| multiply(X7,sk_c8) != sk_c9 ),
prove_this_43 ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c5,sk_c8) = identity
| sk_c8 = identity ),
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)],[c_0_55,c_0_56]),c_0_56]),c_0_56]),c_0_18]),c_0_56]),c_0_18]),c_0_56])]) ).
cnf(c_0_61,negated_conjecture,
( sk_c2 = identity
| sk_c5 = identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_56]),c_0_18]),c_0_56]),c_0_18]) ).
cnf(c_0_62,negated_conjecture,
multiply(inverse(inverse(sk_c10)),sk_c10) = sk_c9,
inference(spm,[status(thm)],[c_0_19,c_0_58]) ).
cnf(c_0_63,negated_conjecture,
( multiply(inverse(X1),sk_c8) != sk_c9
| multiply(X1,inverse(X1)) != sk_c9
| multiply(X2,sk_c8) != sk_c9
| multiply(X3,sk_c9) != sk_c10
| multiply(X4,sk_c9) != sk_c10
| multiply(X5,sk_c9) != sk_c8
| multiply(X6,sk_c10) != sk_c9
| inverse(X2) != sk_c9
| inverse(X3) != sk_c10
| inverse(X4) != sk_c10
| inverse(X5) != sk_c9
| inverse(X6) != sk_c10 ),
inference(er,[status(thm)],[c_0_59]) ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c2,identity) = sk_c8
| sk_c8 = identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_56]),c_0_56]),c_0_56]),c_0_18]) ).
cnf(c_0_65,negated_conjecture,
( sk_c2 = identity
| sk_c8 = identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_18])]) ).
cnf(c_0_66,negated_conjecture,
multiply(inverse(inverse(inverse(sk_c10))),sk_c9) = sk_c10,
inference(spm,[status(thm)],[c_0_19,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c8,inverse(sk_c8)) != sk_c9
| multiply(X1,sk_c8) != sk_c9
| multiply(X2,sk_c9) != sk_c10
| multiply(X3,sk_c9) != sk_c10
| multiply(X4,sk_c9) != sk_c8
| multiply(X5,sk_c10) != sk_c9
| inverse(X1) != sk_c9
| inverse(X2) != sk_c10
| inverse(X3) != sk_c10
| inverse(X4) != sk_c9
| inverse(X5) != sk_c10
| sk_c9 != identity ),
inference(spm,[status(thm)],[c_0_63,c_0_17]) ).
cnf(c_0_68,negated_conjecture,
sk_c8 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_18])]) ).
cnf(c_0_69,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_70,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_71,negated_conjecture,
multiply(inverse(inverse(inverse(sk_c10))),identity) = sk_c10,
inference(rw,[status(thm)],[c_0_66,c_0_56]) ).
cnf(c_0_72,negated_conjecture,
( multiply(X1,identity) != identity
| multiply(X2,identity) != sk_c10
| multiply(X3,identity) != sk_c10
| multiply(X4,identity) != identity
| multiply(X5,sk_c10) != identity
| inverse(identity) != identity
| inverse(X1) != identity
| inverse(X2) != sk_c10
| inverse(X3) != sk_c10
| inverse(X4) != identity
| inverse(X5) != sk_c10 ),
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)],[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_67,c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56])]),c_0_68]),c_0_68]),c_0_18]),c_0_68]),c_0_68]) ).
cnf(c_0_73,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
inverse(sk_c10) = sk_c10,
inference(rw,[status(thm)],[c_0_71,c_0_69]) ).
cnf(c_0_75,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_76,negated_conjecture,
( multiply(X1,sk_c10) != identity
| inverse(identity) != identity
| inverse(X1) != sk_c10 ),
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)],[c_0_72,c_0_73]),c_0_73]),c_0_73]),c_0_73])])])])]),c_0_74])]) ).
cnf(c_0_77,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_75,c_0_73]) ).
cnf(c_0_78,negated_conjecture,
( multiply(X1,sk_c10) != identity
| inverse(X1) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77])]) ).
cnf(c_0_79,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_74]),c_0_54]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP245-1 : TPTP v8.1.2. Released v2.5.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 02:30:31 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order model finding
% 0.22/0.51 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.euKTD36Zhu/E---3.1_11299.p
% 0.36/0.79 # Version: 3.1pre001
% 0.36/0.79 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.36/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.79 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.36/0.79 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.79 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.79 # Starting sh5l with 300s (1) cores
% 0.36/0.79 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 11376 completed with status 0
% 0.36/0.79 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.36/0.79 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.36/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.79 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.36/0.79 # No SInE strategy applied
% 0.36/0.79 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.36/0.79 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/0.79 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.36/0.79 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.36/0.79 # Starting new_bool_3 with 136s (1) cores
% 0.36/0.79 # Starting new_bool_1 with 136s (1) cores
% 0.36/0.79 # Starting sh5l with 136s (1) cores
% 0.36/0.79 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 11380 completed with status 0
% 0.36/0.79 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.36/0.79 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.36/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.79 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.36/0.79 # No SInE strategy applied
% 0.36/0.79 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.36/0.79 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/0.79 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.36/0.79 # Preprocessing time : 0.001 s
% 0.36/0.79 # Presaturation interreduction done
% 0.36/0.79
% 0.36/0.79 # Proof found!
% 0.36/0.79 # SZS status Unsatisfiable
% 0.36/0.79 # SZS output start CNFRefutation
% See solution above
% 0.36/0.79 # Parsed axioms : 46
% 0.36/0.79 # Removed by relevancy pruning/SinE : 0
% 0.36/0.79 # Initial clauses : 46
% 0.36/0.79 # Removed in clause preprocessing : 0
% 0.36/0.79 # Initial clauses in saturation : 46
% 0.36/0.79 # Processed clauses : 2637
% 0.36/0.79 # ...of these trivial : 112
% 0.36/0.79 # ...subsumed : 1472
% 0.36/0.79 # ...remaining for further processing : 1053
% 0.36/0.79 # Other redundant clauses eliminated : 63
% 0.36/0.79 # Clauses deleted for lack of memory : 0
% 0.36/0.79 # Backward-subsumed : 215
% 0.36/0.79 # Backward-rewritten : 772
% 0.36/0.79 # Generated clauses : 10499
% 0.36/0.79 # ...of the previous two non-redundant : 8762
% 0.36/0.79 # ...aggressively subsumed : 0
% 0.36/0.79 # Contextual simplify-reflections : 37
% 0.36/0.79 # Paramodulations : 10436
% 0.36/0.79 # Factorizations : 0
% 0.36/0.79 # NegExts : 0
% 0.36/0.79 # Equation resolutions : 63
% 0.36/0.79 # Total rewrite steps : 6990
% 0.36/0.79 # Propositional unsat checks : 0
% 0.36/0.79 # Propositional check models : 0
% 0.36/0.79 # Propositional check unsatisfiable : 0
% 0.36/0.79 # Propositional clauses : 0
% 0.36/0.79 # Propositional clauses after purity: 0
% 0.36/0.79 # Propositional unsat core size : 0
% 0.36/0.79 # Propositional preprocessing time : 0.000
% 0.36/0.79 # Propositional encoding time : 0.000
% 0.36/0.79 # Propositional solver time : 0.000
% 0.36/0.79 # Success case prop preproc time : 0.000
% 0.36/0.79 # Success case prop encoding time : 0.000
% 0.36/0.79 # Success case prop solver time : 0.000
% 0.36/0.79 # Current number of processed clauses : 19
% 0.36/0.79 # Positive orientable unit clauses : 17
% 0.36/0.79 # Positive unorientable unit clauses: 0
% 0.36/0.79 # Negative unit clauses : 0
% 0.36/0.79 # Non-unit-clauses : 2
% 0.36/0.79 # Current number of unprocessed clauses: 4257
% 0.36/0.79 # ...number of literals in the above : 34293
% 0.36/0.79 # Current number of archived formulas : 0
% 0.36/0.79 # Current number of archived clauses : 1033
% 0.36/0.79 # Clause-clause subsumption calls (NU) : 41601
% 0.36/0.79 # Rec. Clause-clause subsumption calls : 15919
% 0.36/0.79 # Non-unit clause-clause subsumptions : 1704
% 0.36/0.79 # Unit Clause-clause subsumption calls : 513
% 0.36/0.79 # Rewrite failures with RHS unbound : 0
% 0.36/0.79 # BW rewrite match attempts : 119
% 0.36/0.79 # BW rewrite match successes : 70
% 0.36/0.79 # Condensation attempts : 0
% 0.36/0.79 # Condensation successes : 0
% 0.36/0.79 # Termbank termtop insertions : 179660
% 0.36/0.79
% 0.36/0.79 # -------------------------------------------------
% 0.36/0.79 # User time : 0.198 s
% 0.36/0.79 # System time : 0.005 s
% 0.36/0.79 # Total time : 0.203 s
% 0.36/0.79 # Maximum resident set size: 1664 pages
% 0.36/0.79
% 0.36/0.79 # -------------------------------------------------
% 0.36/0.79 # User time : 1.268 s
% 0.36/0.79 # System time : 0.016 s
% 0.36/0.79 # Total time : 1.285 s
% 0.36/0.79 # Maximum resident set size: 1692 pages
% 0.36/0.79 % E---3.1 exiting
%------------------------------------------------------------------------------