TSTP Solution File: GRP384-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP384-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:39:57 EDT 2023
% Result : Unsatisfiable 16.02s 2.54s
% Output : CNFRefutation 16.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of clauses : 73 ( 17 unt; 50 nHn; 62 RR)
% Number of literals : 184 ( 183 equ; 65 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 : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 49 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p',left_identity) ).
cnf(prove_this_32,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| inverse(sk_c3) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p',prove_this_32) ).
cnf(prove_this_23,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p',prove_this_23) ).
cnf(prove_this_24,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p',prove_this_24) ).
cnf(prove_this_31,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c3,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p',prove_this_31) ).
cnf(prove_this_42,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c3) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p',prove_this_42) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c11) = sk_c10
| inverse(sk_c4) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p',prove_this_4) ).
cnf(prove_this_3,negated_conjecture,
( inverse(sk_c11) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p',prove_this_3) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c11
| multiply(sk_c5,sk_c8) = sk_c11 ),
file('/export/starexec/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p',prove_this_15) ).
cnf(prove_this_41,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c3,sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p',prove_this_41) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c11
| inverse(sk_c5) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p',prove_this_16) ).
cnf(prove_this_61,negated_conjecture,
( inverse(sk_c11) != sk_c10
| multiply(sk_c10,sk_c9) != sk_c11
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(X1,X2) != sk_c10
| inverse(X1) != X2
| multiply(X2,sk_c9) != sk_c10
| 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/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p',prove_this_61) ).
cnf(c_0_14,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_15,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| inverse(sk_c3) = sk_c11 ),
prove_this_32 ).
cnf(c_0_18,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_23 ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_24 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c3,sk_c11) = sk_c10 ),
prove_this_31 ).
cnf(c_0_22,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| multiply(sk_c11,sk_c3) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c3) = sk_c11 ),
prove_this_42 ).
cnf(c_0_24,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_19]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c10,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( inverse(sk_c11) = sk_c10
| inverse(sk_c4) = sk_c10 ),
prove_this_4 ).
cnf(c_0_27,negated_conjecture,
( multiply(inverse(sk_c3),sk_c10) = sk_c11
| multiply(sk_c1,sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( multiply(inverse(sk_c1),sk_c10) = sk_c2
| multiply(sk_c11,sk_c3) = identity ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c11,sk_c3) = identity
| inverse(sk_c1) = sk_c2 ),
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c11,sk_c9) = sk_c10
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_31,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_18]) ).
cnf(c_0_32,negated_conjecture,
( multiply(inverse(sk_c11),sk_c10) = sk_c9
| multiply(sk_c10,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c10,sk_c4) = identity
| inverse(sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_15,c_0_26]) ).
cnf(c_0_34,negated_conjecture,
( multiply(inverse(inverse(sk_c3)),sk_c11) = sk_c10
| multiply(sk_c1,sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c11,sk_c3) = identity
| multiply(sk_c2,sk_c10) = sk_c2 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( multiply(inverse(sk_c11),sk_c10) = sk_c9
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( inverse(sk_c11) = sk_c10
| multiply(sk_c4,sk_c10) = sk_c9 ),
prove_this_3 ).
cnf(c_0_38,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_31]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c10,sk_c4) = identity
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c10
| sk_c10 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_17]),c_0_15]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c11,sk_c3) = identity
| sk_c10 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_35]),c_0_15]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c11
| multiply(sk_c5,sk_c8) = sk_c11 ),
prove_this_15 ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c10,sk_c9) = sk_c10
| multiply(sk_c10,sk_c10) = sk_c9 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_38]),c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c10,sk_c10) = sk_c9
| inverse(sk_c10) = sk_c4 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_39]),c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( multiply(inverse(sk_c1),sk_c10) = sk_c2
| sk_c10 = identity ),
inference(spm,[status(thm)],[c_0_18,c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c3,sk_c11) = sk_c10 ),
prove_this_41 ).
cnf(c_0_48,negated_conjecture,
( inverse(sk_c11) = sk_c3
| sk_c10 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_41]),c_0_38]) ).
cnf(c_0_49,negated_conjecture,
( multiply(inverse(sk_c5),sk_c11) = sk_c8
| multiply(sk_c10,sk_c9) = sk_c11 ),
inference(spm,[status(thm)],[c_0_18,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c11
| inverse(sk_c5) = sk_c8 ),
prove_this_16 ).
cnf(c_0_51,negated_conjecture,
( multiply(inverse(sk_c4),sk_c9) = sk_c10
| multiply(sk_c10,sk_c10) = sk_c9
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_43]) ).
cnf(c_0_52,negated_conjecture,
( multiply(sk_c10,sk_c10) = sk_c9
| inverse(sk_c4) = sk_c10 ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| multiply(sk_c2,sk_c10) = sk_c2
| sk_c10 = identity ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c3,sk_c11) = identity
| sk_c10 = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_48]) ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c11
| multiply(sk_c8,sk_c11) = sk_c8 ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c10,sk_c10) = sk_c9
| multiply(sk_c10,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c2,sk_c10) = sk_c2
| sk_c10 = identity ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( inverse(sk_c11) != sk_c10
| multiply(sk_c10,sk_c9) != sk_c11
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(X1,X2) != sk_c10
| inverse(X1) != X2
| multiply(X2,sk_c9) != sk_c10
| 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 ),
prove_this_61 ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c10,sk_c9) = sk_c11
| sk_c11 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_55]),c_0_15]) ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c10,sk_c10) = sk_c9
| sk_c9 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_56]),c_0_15]) ).
cnf(c_0_61,negated_conjecture,
sk_c10 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_57]),c_0_15])]) ).
cnf(c_0_62,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c10) != sk_c11
| multiply(inverse(X3),sk_c9) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(sk_c10,sk_c9) != sk_c11
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X3,inverse(X3)) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| multiply(X5,sk_c11) != sk_c10
| inverse(sk_c11) != sk_c10
| inverse(X4) != sk_c10
| inverse(X5) != sk_c11 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_58])])]) ).
cnf(c_0_63,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_44]) ).
cnf(c_0_64,negated_conjecture,
( multiply(inverse(sk_c10),sk_c11) = sk_c9
| sk_c11 = identity ),
inference(spm,[status(thm)],[c_0_18,c_0_59]) ).
cnf(c_0_65,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_38]) ).
cnf(c_0_66,negated_conjecture,
sk_c9 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61]),c_0_61]),c_0_38])]) ).
cnf(c_0_67,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(inverse(X2),sk_c10) != sk_c11
| multiply(inverse(X3),sk_c9) != sk_c10
| multiply(X1,inverse(X2)) != inverse(X1)
| multiply(sk_c11,sk_c9) != sk_c10
| multiply(sk_c10,sk_c9) != sk_c11
| multiply(X4,sk_c10) != sk_c9
| multiply(X5,sk_c11) != sk_c10
| inverse(sk_c11) != sk_c10
| inverse(X4) != sk_c10
| inverse(X5) != sk_c11
| sk_c11 != identity
| sk_c10 != identity ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63]),c_0_63]) ).
cnf(c_0_68,negated_conjecture,
sk_c11 = identity,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_61]),c_0_65]),c_0_16]),c_0_66])]) ).
cnf(c_0_69,negated_conjecture,
( inverse(multiply(X1,inverse(X2))) != inverse(X2)
| multiply(X1,inverse(X2)) != inverse(X1)
| inverse(X2) != identity
| inverse(X3) != identity ),
inference(cn,[status(thm)],[inference(rw,[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(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)],[c_0_67,c_0_61]),c_0_38]),c_0_61]),c_0_61]),c_0_61]),c_0_16]),c_0_61]),c_0_38]),c_0_61]),c_0_61]),c_0_61]),c_0_61])])]),c_0_68]),c_0_66]),c_0_38]),c_0_68]),c_0_66]),c_0_38]),c_0_66]),c_0_68]),c_0_68]),c_0_38]),c_0_68]),c_0_65]),c_0_66]),c_0_65]),c_0_68]),c_0_68])])]),c_0_65])]) ).
cnf(c_0_70,negated_conjecture,
( inverse(X1) != identity
| inverse(X2) != identity ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_15]),c_0_65]),c_0_44])]) ).
cnf(c_0_71,negated_conjecture,
inverse(X1) != identity,
inference(spm,[status(thm)],[c_0_70,c_0_65]) ).
cnf(c_0_72,plain,
$false,
inference(sr,[status(thm)],[c_0_65,c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : GRP384-1 : TPTP v8.1.2. Released v2.5.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n001.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 02:52:07 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.t30HTUMWhb/E---3.1_1121.p
% 16.02/2.54 # Version: 3.1pre001
% 16.02/2.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 16.02/2.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.02/2.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 16.02/2.54 # Starting new_bool_3 with 300s (1) cores
% 16.02/2.54 # Starting new_bool_1 with 300s (1) cores
% 16.02/2.54 # Starting sh5l with 300s (1) cores
% 16.02/2.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1200 completed with status 0
% 16.02/2.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 16.02/2.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 16.02/2.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.02/2.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 16.02/2.54 # No SInE strategy applied
% 16.02/2.54 # Search class: FGHPS-FFMM21-SFFFFFNN
% 16.02/2.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 16.02/2.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 16.02/2.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 16.02/2.54 # Starting new_bool_3 with 136s (1) cores
% 16.02/2.54 # Starting new_bool_1 with 136s (1) cores
% 16.02/2.54 # Starting sh5l with 136s (1) cores
% 16.02/2.54 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1204 completed with status 0
% 16.02/2.54 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 16.02/2.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 16.02/2.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.02/2.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 16.02/2.54 # No SInE strategy applied
% 16.02/2.54 # Search class: FGHPS-FFMM21-SFFFFFNN
% 16.02/2.54 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 16.02/2.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 16.02/2.54 # Preprocessing time : 0.002 s
% 16.02/2.54 # Presaturation interreduction done
% 16.02/2.54
% 16.02/2.54 # Proof found!
% 16.02/2.54 # SZS status Unsatisfiable
% 16.02/2.54 # SZS output start CNFRefutation
% See solution above
% 16.02/2.54 # Parsed axioms : 64
% 16.02/2.54 # Removed by relevancy pruning/SinE : 0
% 16.02/2.54 # Initial clauses : 64
% 16.02/2.54 # Removed in clause preprocessing : 0
% 16.02/2.54 # Initial clauses in saturation : 64
% 16.02/2.54 # Processed clauses : 25320
% 16.02/2.54 # ...of these trivial : 1775
% 16.02/2.54 # ...subsumed : 19185
% 16.02/2.54 # ...remaining for further processing : 4360
% 16.02/2.54 # Other redundant clauses eliminated : 487
% 16.02/2.54 # Clauses deleted for lack of memory : 0
% 16.02/2.54 # Backward-subsumed : 516
% 16.02/2.54 # Backward-rewritten : 3703
% 16.02/2.54 # Generated clauses : 147606
% 16.02/2.54 # ...of the previous two non-redundant : 149360
% 16.02/2.54 # ...aggressively subsumed : 0
% 16.02/2.54 # Contextual simplify-reflections : 441
% 16.02/2.54 # Paramodulations : 147163
% 16.02/2.54 # Factorizations : 6
% 16.02/2.54 # NegExts : 0
% 16.02/2.54 # Equation resolutions : 487
% 16.02/2.54 # Total rewrite steps : 53112
% 16.02/2.54 # Propositional unsat checks : 0
% 16.02/2.54 # Propositional check models : 0
% 16.02/2.54 # Propositional check unsatisfiable : 0
% 16.02/2.54 # Propositional clauses : 0
% 16.02/2.54 # Propositional clauses after purity: 0
% 16.02/2.54 # Propositional unsat core size : 0
% 16.02/2.54 # Propositional preprocessing time : 0.000
% 16.02/2.54 # Propositional encoding time : 0.000
% 16.02/2.54 # Propositional solver time : 0.000
% 16.02/2.54 # Success case prop preproc time : 0.000
% 16.02/2.54 # Success case prop encoding time : 0.000
% 16.02/2.54 # Success case prop solver time : 0.000
% 16.02/2.54 # Current number of processed clauses : 23
% 16.02/2.54 # Positive orientable unit clauses : 17
% 16.02/2.54 # Positive unorientable unit clauses: 0
% 16.02/2.54 # Negative unit clauses : 1
% 16.02/2.54 # Non-unit-clauses : 5
% 16.02/2.54 # Current number of unprocessed clauses: 59881
% 16.02/2.54 # ...number of literals in the above : 435261
% 16.02/2.54 # Current number of archived formulas : 0
% 16.02/2.54 # Current number of archived clauses : 4284
% 16.02/2.54 # Clause-clause subsumption calls (NU) : 1011865
% 16.02/2.54 # Rec. Clause-clause subsumption calls : 394396
% 16.02/2.54 # Non-unit clause-clause subsumptions : 20131
% 16.02/2.54 # Unit Clause-clause subsumption calls : 1790
% 16.02/2.54 # Rewrite failures with RHS unbound : 0
% 16.02/2.54 # BW rewrite match attempts : 56
% 16.02/2.54 # BW rewrite match successes : 40
% 16.02/2.54 # Condensation attempts : 0
% 16.02/2.54 # Condensation successes : 0
% 16.02/2.54 # Termbank termtop insertions : 2396890
% 16.02/2.54
% 16.02/2.54 # -------------------------------------------------
% 16.02/2.54 # User time : 1.898 s
% 16.02/2.54 # System time : 0.067 s
% 16.02/2.54 # Total time : 1.965 s
% 16.02/2.54 # Maximum resident set size: 1668 pages
% 16.02/2.54
% 16.02/2.54 # -------------------------------------------------
% 16.02/2.54 # User time : 9.928 s
% 16.02/2.54 # System time : 0.151 s
% 16.02/2.54 # Total time : 10.080 s
% 16.02/2.54 # Maximum resident set size: 1728 pages
% 16.02/2.54 % E---3.1 exiting
% 16.02/2.55 % E---3.1 exiting
%------------------------------------------------------------------------------