TSTP Solution File: GRP385-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP385-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:55:48 EDT 2024
% Result : Unsatisfiable 3.16s 0.86s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 16
% Syntax : Number of clauses : 77 ( 25 unt; 44 nHn; 62 RR)
% Number of literals : 186 ( 185 equ; 73 neg)
% Maximal clause size : 14 ( 2 avg)
% Maximal term depth : 4 ( 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 : 56 ( 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_1,negated_conjecture,
inverse(sk_c10) = sk_c9,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_9,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c10
| multiply(sk_c7,sk_c8) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_8,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c10
| inverse(sk_c7) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_30,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c2
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_30) ).
cnf(prove_this_31,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c2
| multiply(sk_c6,sk_c9) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_31) ).
cnf(prove_this_29,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c2
| multiply(sk_c5,sk_c6) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_29) ).
cnf(prove_this_35,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c3,sk_c10) = sk_c4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_35) ).
cnf(prove_this_36,negated_conjecture,
( inverse(sk_c1) = sk_c10
| inverse(sk_c3) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_36) ).
cnf(prove_this_19,negated_conjecture,
( multiply(sk_c10,sk_c2) = sk_c9
| multiply(sk_c3,sk_c10) = sk_c4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_34,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c10,sk_c4) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_34) ).
cnf(prove_this_20,negated_conjecture,
( multiply(sk_c10,sk_c2) = sk_c9
| inverse(sk_c3) = sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_18,negated_conjecture,
( multiply(sk_c10,sk_c2) = sk_c9
| multiply(sk_c10,sk_c4) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_42,negated_conjecture,
( inverse(sk_c10) != sk_c9
| multiply(sk_c9,sk_c8) != sk_c10
| multiply(sk_c10,sk_c8) != sk_c9
| multiply(sk_c10,X1) != sk_c9
| multiply(X2,sk_c10) != X1
| inverse(X2) != sk_c10
| multiply(sk_c10,X3) != sk_c9
| multiply(X4,sk_c10) != X3
| inverse(X4) != sk_c10
| multiply(X5,X6) != sk_c8
| inverse(X5) != X6
| multiply(X6,sk_c9) != sk_c8
| inverse(X7) != sk_c10
| multiply(X7,sk_c8) != sk_c10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_42) ).
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,negated_conjecture,
inverse(sk_c10) = sk_c9,
prove_this_1 ).
cnf(c_0_20,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_21,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c10
| multiply(sk_c7,sk_c8) = sk_c10 ),
prove_this_9 ).
cnf(c_0_22,negated_conjecture,
multiply(sk_c9,sk_c10) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( multiply(inverse(sk_c7),sk_c10) = sk_c8
| multiply(sk_c9,sk_c8) = sk_c10 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c10
| inverse(sk_c7) = sk_c10 ),
prove_this_8 ).
cnf(c_0_25,negated_conjecture,
multiply(sk_c9,multiply(sk_c10,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_22]),c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c2
| inverse(sk_c5) = sk_c6 ),
prove_this_30 ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c9,sk_c8) = sk_c10
| multiply(sk_c10,sk_c10) = sk_c8 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
multiply(inverse(sk_c9),X1) = multiply(sk_c10,X1),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_29,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c2
| multiply(sk_c6,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
multiply(sk_c10,sk_c10) = sk_c8,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_27]),c_0_28])]) ).
cnf(c_0_32,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c2
| multiply(sk_c6,sk_c9) = sk_c8 ),
prove_this_31 ).
cnf(c_0_34,negated_conjecture,
( multiply(inverse(sk_c6),identity) = sk_c5
| multiply(sk_c1,sk_c10) = sk_c2 ),
inference(spm,[status(thm)],[c_0_20,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c2
| multiply(sk_c5,sk_c6) = sk_c8 ),
prove_this_29 ).
cnf(c_0_36,negated_conjecture,
multiply(sk_c10,multiply(sk_c10,X1)) = multiply(sk_c8,X1),
inference(spm,[status(thm)],[c_0_16,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
multiply(sk_c10,sk_c9) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_38,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_32]),c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c3,sk_c10) = sk_c4 ),
prove_this_35 ).
cnf(c_0_40,negated_conjecture,
( inverse(sk_c1) = sk_c10
| inverse(sk_c3) = sk_c10 ),
prove_this_36 ).
cnf(c_0_41,negated_conjecture,
( multiply(inverse(sk_c6),sk_c8) = sk_c9
| multiply(sk_c1,sk_c10) = sk_c2 ),
inference(spm,[status(thm)],[c_0_20,c_0_33]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c2
| inverse(sk_c6) = sk_c5 ),
inference(rw,[status(thm)],[c_0_34,c_0_32]) ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c5,multiply(sk_c6,X1)) = multiply(sk_c8,X1)
| multiply(sk_c1,sk_c10) = sk_c2 ),
inference(spm,[status(thm)],[c_0_16,c_0_35]) ).
cnf(c_0_44,negated_conjecture,
multiply(sk_c8,sk_c9) = sk_c10,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_32]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c3,sk_c10) = sk_c4
| sk_c1 = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_19]) ).
cnf(c_0_46,negated_conjecture,
( inverse(sk_c1) = sk_c10
| sk_c3 = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_40]),c_0_19]) ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c10,sk_c2) = sk_c9
| multiply(sk_c3,sk_c10) = sk_c4 ),
prove_this_19 ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c2
| multiply(sk_c5,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c2
| multiply(sk_c5,sk_c8) = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_33]),c_0_44]) ).
cnf(c_0_50,negated_conjecture,
( inverse(sk_c1) = sk_c10
| multiply(sk_c10,sk_c4) = sk_c9 ),
prove_this_34 ).
cnf(c_0_51,negated_conjecture,
( multiply(inverse(sk_c3),sk_c4) = sk_c10
| sk_c1 = sk_c9 ),
inference(spm,[status(thm)],[c_0_20,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( sk_c3 = sk_c9
| sk_c1 = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_46]),c_0_19]) ).
cnf(c_0_53,negated_conjecture,
( multiply(inverse(sk_c3),sk_c4) = sk_c10
| multiply(sk_c10,sk_c2) = sk_c9 ),
inference(spm,[status(thm)],[c_0_20,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c10,sk_c2) = sk_c9
| inverse(sk_c3) = sk_c10 ),
prove_this_20 ).
cnf(c_0_55,negated_conjecture,
( multiply(sk_c1,sk_c10) = sk_c2
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c10,sk_c4) = sk_c9
| sk_c1 = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_50]),c_0_19]) ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c10,sk_c4) = sk_c10
| sk_c1 = sk_c9 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_28]) ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c10,sk_c2) = sk_c9
| multiply(sk_c10,sk_c4) = sk_c9 ),
prove_this_18 ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c10,sk_c2) = sk_c9
| multiply(sk_c10,sk_c4) = sk_c10 ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( multiply(inverse(sk_c1),sk_c2) = sk_c10
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_20,c_0_55]) ).
cnf(c_0_61,negated_conjecture,
( sk_c1 = sk_c9
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
( inverse(sk_c10) != sk_c9
| multiply(sk_c9,sk_c8) != sk_c10
| multiply(sk_c10,sk_c8) != sk_c9
| multiply(sk_c10,X1) != sk_c9
| multiply(X2,sk_c10) != X1
| inverse(X2) != sk_c10
| multiply(sk_c10,X3) != sk_c9
| multiply(X4,sk_c10) != X3
| inverse(X4) != sk_c10
| multiply(X5,X6) != sk_c8
| inverse(X5) != X6
| multiply(X6,sk_c9) != sk_c8
| inverse(X7) != sk_c10
| multiply(X7,sk_c8) != sk_c10 ),
inference(fof_simplification,[status(thm)],[prove_this_42]) ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c10,sk_c2) = sk_c9
| sk_c9 = sk_c10 ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
( multiply(sk_c10,sk_c2) = sk_c10
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_28]) ).
cnf(c_0_65,negated_conjecture,
( inverse(sk_c10) != sk_c9
| multiply(sk_c9,sk_c8) != sk_c10
| multiply(sk_c10,sk_c8) != sk_c9
| multiply(sk_c10,X1) != sk_c9
| multiply(X2,sk_c10) != X1
| inverse(X2) != sk_c10
| multiply(sk_c10,X3) != sk_c9
| multiply(X4,sk_c10) != X3
| inverse(X4) != sk_c10
| multiply(X5,X6) != sk_c8
| inverse(X5) != X6
| multiply(X6,sk_c9) != sk_c8
| inverse(X7) != sk_c10
| multiply(X7,sk_c8) != sk_c10 ),
c_0_62 ).
cnf(c_0_66,negated_conjecture,
sk_c9 = sk_c10,
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c10,multiply(X1,sk_c10)) != sk_c9
| multiply(sk_c10,multiply(X2,sk_c10)) != sk_c9
| multiply(inverse(X3),sk_c9) != sk_c8
| multiply(sk_c10,sk_c8) != sk_c9
| multiply(sk_c9,sk_c8) != sk_c10
| multiply(X3,inverse(X3)) != sk_c8
| multiply(X4,sk_c8) != sk_c10
| inverse(X4) != sk_c10
| inverse(X1) != sk_c10
| inverse(X2) != sk_c10 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_19])])])])]) ).
cnf(c_0_68,negated_conjecture,
multiply(sk_c9,sk_c8) = sk_c10,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_31]),c_0_19]) ).
cnf(c_0_69,negated_conjecture,
identity = sk_c8,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_66]),c_0_31]) ).
cnf(c_0_70,negated_conjecture,
( multiply(sk_c10,multiply(X1,sk_c10)) != sk_c9
| multiply(sk_c10,multiply(X2,sk_c10)) != sk_c9
| multiply(inverse(X3),sk_c9) != sk_c8
| multiply(sk_c10,sk_c8) != sk_c9
| multiply(X3,inverse(X3)) != sk_c8
| multiply(X4,sk_c8) != sk_c10
| inverse(X4) != sk_c10
| inverse(X1) != sk_c10
| inverse(X2) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_71,plain,
multiply(X1,sk_c8) = X1,
inference(rw,[status(thm)],[c_0_32,c_0_69]) ).
cnf(c_0_72,negated_conjecture,
( multiply(sk_c10,multiply(X1,sk_c10)) != sk_c10
| multiply(sk_c10,multiply(X2,sk_c10)) != sk_c10
| multiply(inverse(X3),sk_c10) != sk_c8
| multiply(X3,inverse(X3)) != sk_c8
| inverse(X1) != sk_c10
| inverse(X2) != sk_c10 ),
inference(cn,[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)],[c_0_70,c_0_66]),c_0_66]),c_0_66]),c_0_66]),c_0_71]),c_0_71])])]),c_0_19]),c_0_66])]) ).
cnf(c_0_73,negated_conjecture,
inverse(sk_c10) = sk_c10,
inference(rw,[status(thm)],[c_0_19,c_0_66]) ).
cnf(c_0_74,negated_conjecture,
( multiply(sk_c10,multiply(X1,sk_c10)) != sk_c10
| multiply(inverse(X2),sk_c10) != sk_c8
| multiply(X2,inverse(X2)) != sk_c8
| inverse(X1) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_31]),c_0_71])]) ).
cnf(c_0_75,negated_conjecture,
( multiply(inverse(X1),sk_c10) != sk_c8
| multiply(X1,inverse(X1)) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_73]),c_0_31]),c_0_71])]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_73]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : GRP385-1 : TPTP v8.2.0. Released v2.5.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 05:28:08 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order model finding
% 0.18/0.45 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 3.16/0.86 # Version: 3.1.0
% 3.16/0.86 # Preprocessing class: FSMSSMSMSSSNFFN.
% 3.16/0.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.16/0.86 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 3.16/0.86 # Starting new_bool_3 with 300s (1) cores
% 3.16/0.86 # Starting new_bool_1 with 300s (1) cores
% 3.16/0.86 # Starting sh5l with 300s (1) cores
% 3.16/0.86 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 6332 completed with status 0
% 3.16/0.86 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 3.16/0.86 # Preprocessing class: FSMSSMSMSSSNFFN.
% 3.16/0.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.16/0.86 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 3.16/0.86 # No SInE strategy applied
% 3.16/0.86 # Search class: FGHPS-FFMM21-SFFFFFNN
% 3.16/0.86 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.16/0.86 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.16/0.86 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 3.16/0.86 # Starting new_bool_3 with 136s (1) cores
% 3.16/0.86 # Starting new_bool_1 with 136s (1) cores
% 3.16/0.86 # Starting sh5l with 136s (1) cores
% 3.16/0.86 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 6337 completed with status 0
% 3.16/0.86 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 3.16/0.86 # Preprocessing class: FSMSSMSMSSSNFFN.
% 3.16/0.86 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.16/0.86 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 3.16/0.86 # No SInE strategy applied
% 3.16/0.86 # Search class: FGHPS-FFMM21-SFFFFFNN
% 3.16/0.86 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.16/0.86 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.16/0.86 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 3.16/0.86 # Preprocessing time : 0.001 s
% 3.16/0.86 # Presaturation interreduction done
% 3.16/0.86
% 3.16/0.86 # Proof found!
% 3.16/0.86 # SZS status Unsatisfiable
% 3.16/0.86 # SZS output start CNFRefutation
% See solution above
% 3.16/0.86 # Parsed axioms : 45
% 3.16/0.86 # Removed by relevancy pruning/SinE : 0
% 3.16/0.86 # Initial clauses : 45
% 3.16/0.86 # Removed in clause preprocessing : 0
% 3.16/0.86 # Initial clauses in saturation : 45
% 3.16/0.86 # Processed clauses : 6081
% 3.16/0.86 # ...of these trivial : 114
% 3.16/0.86 # ...subsumed : 4730
% 3.16/0.86 # ...remaining for further processing : 1237
% 3.16/0.86 # Other redundant clauses eliminated : 11
% 3.16/0.86 # Clauses deleted for lack of memory : 0
% 3.16/0.86 # Backward-subsumed : 208
% 3.16/0.86 # Backward-rewritten : 635
% 3.16/0.86 # Generated clauses : 20546
% 3.16/0.86 # ...of the previous two non-redundant : 19901
% 3.16/0.86 # ...aggressively subsumed : 0
% 3.16/0.86 # Contextual simplify-reflections : 11
% 3.16/0.86 # Paramodulations : 20534
% 3.16/0.86 # Factorizations : 3
% 3.16/0.86 # NegExts : 0
% 3.16/0.86 # Equation resolutions : 11
% 3.16/0.86 # Disequality decompositions : 0
% 3.16/0.86 # Total rewrite steps : 9660
% 3.16/0.86 # ...of those cached : 9240
% 3.16/0.86 # Propositional unsat checks : 0
% 3.16/0.86 # Propositional check models : 0
% 3.16/0.86 # Propositional check unsatisfiable : 0
% 3.16/0.86 # Propositional clauses : 0
% 3.16/0.86 # Propositional clauses after purity: 0
% 3.16/0.86 # Propositional unsat core size : 0
% 3.16/0.86 # Propositional preprocessing time : 0.000
% 3.16/0.86 # Propositional encoding time : 0.000
% 3.16/0.86 # Propositional solver time : 0.000
% 3.16/0.86 # Success case prop preproc time : 0.000
% 3.16/0.86 # Success case prop encoding time : 0.000
% 3.16/0.86 # Success case prop solver time : 0.000
% 3.16/0.86 # Current number of processed clauses : 347
% 3.16/0.86 # Positive orientable unit clauses : 14
% 3.16/0.86 # Positive unorientable unit clauses: 0
% 3.16/0.86 # Negative unit clauses : 0
% 3.16/0.86 # Non-unit-clauses : 333
% 3.16/0.86 # Current number of unprocessed clauses: 11874
% 3.16/0.86 # ...number of literals in the above : 41846
% 3.16/0.86 # Current number of archived formulas : 0
% 3.16/0.86 # Current number of archived clauses : 888
% 3.16/0.86 # Clause-clause subsumption calls (NU) : 56413
% 3.16/0.86 # Rec. Clause-clause subsumption calls : 19749
% 3.16/0.86 # Non-unit clause-clause subsumptions : 4923
% 3.16/0.86 # Unit Clause-clause subsumption calls : 1108
% 3.16/0.86 # Rewrite failures with RHS unbound : 0
% 3.16/0.86 # BW rewrite match attempts : 68
% 3.16/0.86 # BW rewrite match successes : 46
% 3.16/0.86 # Condensation attempts : 0
% 3.16/0.86 # Condensation successes : 0
% 3.16/0.86 # Termbank termtop insertions : 207151
% 3.16/0.86 # Search garbage collected termcells : 38
% 3.16/0.86
% 3.16/0.86 # -------------------------------------------------
% 3.16/0.86 # User time : 0.373 s
% 3.16/0.86 # System time : 0.017 s
% 3.16/0.86 # Total time : 0.390 s
% 3.16/0.86 # Maximum resident set size: 1660 pages
% 3.16/0.86
% 3.16/0.86 # -------------------------------------------------
% 3.16/0.86 # User time : 1.921 s
% 3.16/0.86 # System time : 0.030 s
% 3.16/0.86 # Total time : 1.951 s
% 3.16/0.86 # Maximum resident set size: 1716 pages
% 3.16/0.86 % E---3.1 exiting
%------------------------------------------------------------------------------