TSTP Solution File: GRP243-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP243-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:06 EDT 2024
% Result : Unsatisfiable 2.68s 0.82s
% Output : CNFRefutation 2.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 16
% Syntax : Number of clauses : 81 ( 22 unt; 50 nHn; 66 RR)
% Number of literals : 221 ( 220 equ; 97 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 : 14 ( 14 usr; 12 con; 0-2 aty)
% Number of variables : 73 ( 3 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_47,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c11
| multiply(sk_c8,sk_c9) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_47) ).
cnf(prove_this_54,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c8,sk_c9) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_54) ).
cnf(prove_this_55,negated_conjecture,
( inverse(sk_c4) = sk_c5
| inverse(sk_c8) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_55) ).
cnf(prove_this_48,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c11
| inverse(sk_c8) = sk_c9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_48) ).
cnf(prove_this_24,negated_conjecture,
( inverse(sk_c2) = sk_c11
| inverse(sk_c7) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_24) ).
cnf(prove_this_37,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c12
| multiply(sk_c6,sk_c11) = sk_c12 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_37) ).
cnf(prove_this_30,negated_conjecture,
( inverse(sk_c3) = sk_c12
| multiply(sk_c6,sk_c11) = sk_c12 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_30) ).
cnf(prove_this_17,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c10
| inverse(sk_c7) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_36,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c12
| inverse(sk_c6) = sk_c12 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_36) ).
cnf(prove_this_18,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c10
| multiply(sk_c7,sk_c10) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_64,negated_conjecture,
( multiply(X1,sk_c12) != sk_c11
| inverse(X1) != sk_c12
| multiply(X2,sk_c11) != sk_c10
| inverse(X2) != sk_c11
| inverse(X3) != sk_c12
| multiply(X3,sk_c11) != sk_c12
| multiply(X4,X5) != sk_c11
| inverse(X4) != X5
| multiply(X5,sk_c10) != sk_c11
| inverse(X6) != sk_c12
| multiply(X6,sk_c11) != sk_c12
| inverse(X7) != sk_c11
| multiply(X7,sk_c10) != sk_c11
| multiply(X8,X9) != sk_c11
| inverse(X8) != X9
| multiply(X9,sk_c10) != sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_64) ).
cnf(prove_this_25,negated_conjecture,
( inverse(sk_c2) = sk_c11
| multiply(sk_c7,sk_c10) = sk_c11 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_29,negated_conjecture,
( inverse(sk_c3) = sk_c12
| inverse(sk_c6) = sk_c12 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_29) ).
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_c4,sk_c5) = sk_c11
| multiply(sk_c8,sk_c9) = sk_c11 ),
prove_this_47 ).
cnf(c_0_21,negated_conjecture,
( multiply(inverse(sk_c4),sk_c11) = sk_c5
| multiply(sk_c8,sk_c9) = sk_c11 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( inverse(sk_c4) = sk_c5
| multiply(sk_c8,sk_c9) = sk_c11 ),
prove_this_54 ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c8,sk_c9) = sk_c11
| multiply(sk_c5,sk_c11) = sk_c5 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( inverse(sk_c4) = sk_c5
| inverse(sk_c8) = sk_c9 ),
prove_this_55 ).
cnf(c_0_26,negated_conjecture,
( multiply(inverse(sk_c8),sk_c11) = sk_c9
| multiply(sk_c5,sk_c11) = sk_c5 ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c11
| inverse(sk_c8) = sk_c9 ),
prove_this_48 ).
cnf(c_0_28,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c5,multiply(sk_c4,X1)) = X1
| inverse(sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c4,sk_c5) = sk_c11
| multiply(sk_c5,sk_c11) = sk_c5
| multiply(sk_c9,sk_c11) = sk_c9 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_28]),c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( inverse(sk_c2) = sk_c11
| inverse(sk_c7) = sk_c11 ),
prove_this_24 ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c9,sk_c11) = sk_c9
| multiply(sk_c5,sk_c11) = sk_c5
| inverse(sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( inverse(sk_c7) = sk_c11
| inverse(sk_c11) = sk_c2 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c12
| multiply(sk_c6,sk_c11) = sk_c12 ),
prove_this_37 ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c5,sk_c11) = sk_c5
| multiply(sk_c9,sk_c11) = sk_c9 ),
inference(spm,[status(thm)],[c_0_26,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( inverse(sk_c11) = sk_c2
| inverse(sk_c11) = sk_c7 ),
inference(spm,[status(thm)],[c_0_31,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( multiply(inverse(sk_c3),sk_c12) = sk_c11
| multiply(sk_c6,sk_c11) = sk_c12 ),
inference(spm,[status(thm)],[c_0_19,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( inverse(sk_c3) = sk_c12
| multiply(sk_c6,sk_c11) = sk_c12 ),
prove_this_30 ).
cnf(c_0_40,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c9,sk_c11) = sk_c9
| identity = sk_c11 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_36]),c_0_17]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c2,sk_c11) = identity
| inverse(sk_c11) = sk_c7 ),
inference(spm,[status(thm)],[c_0_17,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c6,sk_c11) = sk_c12
| multiply(sk_c12,sk_c12) = sk_c11 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c10
| inverse(sk_c7) = sk_c11 ),
prove_this_17 ).
cnf(c_0_45,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_40,c_0_28]) ).
cnf(c_0_46,negated_conjecture,
identity = sk_c11,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_41]),c_0_17])]) ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c2,sk_c11) = identity
| inverse(sk_c7) = sk_c11 ),
inference(spm,[status(thm)],[c_0_31,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( multiply(inverse(sk_c6),sk_c12) = sk_c11
| multiply(sk_c12,sk_c12) = sk_c11 ),
inference(spm,[status(thm)],[c_0_19,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c12
| inverse(sk_c6) = sk_c12 ),
prove_this_36 ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c10
| multiply(sk_c7,sk_c10) = sk_c11 ),
prove_this_18 ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c10
| inverse(sk_c11) = sk_c7 ),
inference(spm,[status(thm)],[c_0_31,c_0_44]) ).
cnf(c_0_52,plain,
inverse(sk_c11) = sk_c11,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c11
| inverse(sk_c7) = sk_c11 ),
inference(rw,[status(thm)],[c_0_47,c_0_46]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c12
| multiply(sk_c12,sk_c12) = sk_c11 ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( multiply(X1,sk_c12) != sk_c11
| inverse(X1) != sk_c12
| multiply(X2,sk_c11) != sk_c10
| inverse(X2) != sk_c11
| inverse(X3) != sk_c12
| multiply(X3,sk_c11) != sk_c12
| multiply(X4,X5) != sk_c11
| inverse(X4) != X5
| multiply(X5,sk_c10) != sk_c11
| inverse(X6) != sk_c12
| multiply(X6,sk_c11) != sk_c12
| inverse(X7) != sk_c11
| multiply(X7,sk_c10) != sk_c11
| multiply(X8,X9) != sk_c11
| inverse(X8) != X9
| multiply(X9,sk_c10) != sk_c11 ),
inference(fof_simplification,[status(thm)],[prove_this_64]) ).
cnf(c_0_56,negated_conjecture,
( multiply(inverse(sk_c2),sk_c10) = sk_c11
| multiply(sk_c7,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_19,c_0_50]) ).
cnf(c_0_57,negated_conjecture,
( inverse(sk_c2) = sk_c11
| multiply(sk_c7,sk_c10) = sk_c11 ),
prove_this_25 ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c10
| sk_c7 = sk_c11 ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,negated_conjecture,
( multiply(sk_c2,sk_c11) = sk_c11
| sk_c7 = sk_c11 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_53]),c_0_52]) ).
cnf(c_0_60,negated_conjecture,
( multiply(inverse(sk_c3),sk_c12) = sk_c11
| multiply(sk_c12,sk_c12) = sk_c11 ),
inference(spm,[status(thm)],[c_0_19,c_0_54]) ).
cnf(c_0_61,negated_conjecture,
( inverse(sk_c3) = sk_c12
| inverse(sk_c6) = sk_c12 ),
prove_this_29 ).
cnf(c_0_62,negated_conjecture,
( multiply(X1,sk_c12) != sk_c11
| inverse(X1) != sk_c12
| multiply(X2,sk_c11) != sk_c10
| inverse(X2) != sk_c11
| inverse(X3) != sk_c12
| multiply(X3,sk_c11) != sk_c12
| multiply(X4,X5) != sk_c11
| inverse(X4) != X5
| multiply(X5,sk_c10) != sk_c11
| inverse(X6) != sk_c12
| multiply(X6,sk_c11) != sk_c12
| inverse(X7) != sk_c11
| multiply(X7,sk_c10) != sk_c11
| multiply(X8,X9) != sk_c11
| inverse(X8) != X9
| multiply(X9,sk_c10) != sk_c11 ),
c_0_55 ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c7,sk_c10) = sk_c11
| multiply(sk_c11,sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,negated_conjecture,
( sk_c7 = sk_c11
| sk_c10 = sk_c11 ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
( multiply(sk_c12,sk_c12) = sk_c11
| inverse(sk_c6) = sk_c12 ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( multiply(inverse(X1),sk_c10) != sk_c11
| multiply(inverse(X2),sk_c10) != sk_c11
| multiply(X1,inverse(X1)) != sk_c11
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X3,sk_c10) != sk_c11
| multiply(X4,sk_c11) != sk_c12
| multiply(X5,sk_c11) != sk_c12
| multiply(X6,sk_c11) != sk_c10
| multiply(X7,sk_c12) != sk_c11
| inverse(X3) != sk_c11
| inverse(X4) != sk_c12
| inverse(X5) != sk_c12
| inverse(X6) != sk_c11
| inverse(X7) != sk_c12 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_62])]) ).
cnf(c_0_67,negated_conjecture,
( multiply(sk_c11,sk_c10) = sk_c11
| sk_c10 = sk_c11 ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,negated_conjecture,
multiply(sk_c12,sk_c12) = sk_c11,
inference(spm,[status(thm)],[c_0_48,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
( multiply(inverse(X1),sk_c10) != sk_c11
| multiply(inverse(X2),sk_c10) != sk_c11
| multiply(X1,inverse(X1)) != sk_c11
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X3,sk_c11) != sk_c12
| multiply(X4,sk_c11) != sk_c12
| multiply(X5,sk_c11) != sk_c10
| multiply(X6,sk_c12) != sk_c11
| inverse(X3) != sk_c12
| inverse(X4) != sk_c12
| inverse(X5) != sk_c11
| inverse(X6) != sk_c12
| sk_c10 != sk_c11
| identity != sk_c11 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_45]),c_0_18]) ).
cnf(c_0_70,negated_conjecture,
sk_c10 = sk_c11,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_67]),c_0_17]),c_0_46])]) ).
cnf(c_0_71,plain,
multiply(inverse(X1),X1) = sk_c11,
inference(rw,[status(thm)],[c_0_17,c_0_46]) ).
cnf(c_0_72,negated_conjecture,
multiply(inverse(sk_c12),sk_c11) = sk_c12,
inference(spm,[status(thm)],[c_0_19,c_0_68]) ).
cnf(c_0_73,plain,
multiply(X1,sk_c11) = X1,
inference(rw,[status(thm)],[c_0_28,c_0_46]) ).
cnf(c_0_74,negated_conjecture,
( multiply(inverse(X1),sk_c11) != sk_c11
| multiply(inverse(X2),sk_c11) != sk_c11
| multiply(X1,inverse(X1)) != sk_c11
| multiply(X2,inverse(X2)) != sk_c11
| multiply(X3,sk_c11) != sk_c12
| multiply(X4,sk_c11) != sk_c12
| multiply(X5,sk_c11) != sk_c11
| multiply(X6,sk_c12) != sk_c11
| inverse(X3) != sk_c12
| inverse(X4) != sk_c12
| inverse(X5) != sk_c11
| inverse(X6) != sk_c12 ),
inference(cn,[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_69,c_0_46])]),c_0_70]),c_0_70]),c_0_70]),c_0_70])]) ).
cnf(c_0_75,plain,
multiply(X1,inverse(X1)) = sk_c11,
inference(spm,[status(thm)],[c_0_71,c_0_31]) ).
cnf(c_0_76,negated_conjecture,
inverse(sk_c12) = sk_c12,
inference(rw,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_77,negated_conjecture,
( multiply(X1,sk_c12) != sk_c11
| inverse(X2) != sk_c11
| inverse(X3) != sk_c11
| inverse(X1) != sk_c12 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[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_74,c_0_73]),c_0_73]),c_0_73]),c_0_73]),c_0_73])])])]),c_0_52])]),c_0_75]),c_0_75]),c_0_76])]) ).
cnf(c_0_78,negated_conjecture,
( multiply(X1,sk_c12) != sk_c11
| inverse(X2) != sk_c11
| inverse(X1) != sk_c12 ),
inference(spm,[status(thm)],[c_0_77,c_0_52]) ).
cnf(c_0_79,negated_conjecture,
( multiply(X1,sk_c12) != sk_c11
| inverse(X1) != sk_c12 ),
inference(spm,[status(thm)],[c_0_78,c_0_52]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_76]),c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP243-1 : TPTP v8.2.0. Released v2.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 05:13:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.68/0.82 # Version: 3.1.0
% 2.68/0.82 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.68/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.68/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.68/0.82 # Starting new_bool_3 with 300s (1) cores
% 2.68/0.82 # Starting new_bool_1 with 300s (1) cores
% 2.68/0.82 # Starting sh5l with 300s (1) cores
% 2.68/0.82 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 8083 completed with status 0
% 2.68/0.82 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 2.68/0.82 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.68/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.68/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.68/0.82 # No SInE strategy applied
% 2.68/0.82 # Search class: FGHPS-FFMM21-SFFFFFNN
% 2.68/0.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.68/0.82 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.68/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 2.68/0.82 # Starting new_bool_3 with 136s (1) cores
% 2.68/0.82 # Starting new_bool_1 with 136s (1) cores
% 2.68/0.82 # Starting sh5l with 136s (1) cores
% 2.68/0.82 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 8089 completed with status 0
% 2.68/0.82 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 2.68/0.82 # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.68/0.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.68/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.68/0.82 # No SInE strategy applied
% 2.68/0.82 # Search class: FGHPS-FFMM21-SFFFFFNN
% 2.68/0.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.68/0.82 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.68/0.82 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 2.68/0.82 # Preprocessing time : 0.002 s
% 2.68/0.82 # Presaturation interreduction done
% 2.68/0.82
% 2.68/0.82 # Proof found!
% 2.68/0.82 # SZS status Unsatisfiable
% 2.68/0.82 # SZS output start CNFRefutation
% See solution above
% 2.68/0.82 # Parsed axioms : 67
% 2.68/0.82 # Removed by relevancy pruning/SinE : 0
% 2.68/0.82 # Initial clauses : 67
% 2.68/0.82 # Removed in clause preprocessing : 0
% 2.68/0.82 # Initial clauses in saturation : 67
% 2.68/0.82 # Processed clauses : 4705
% 2.68/0.82 # ...of these trivial : 284
% 2.68/0.82 # ...subsumed : 2907
% 2.68/0.82 # ...remaining for further processing : 1514
% 2.68/0.82 # Other redundant clauses eliminated : 46
% 2.68/0.82 # Clauses deleted for lack of memory : 0
% 2.68/0.82 # Backward-subsumed : 226
% 2.68/0.82 # Backward-rewritten : 1163
% 2.68/0.82 # Generated clauses : 25048
% 2.68/0.82 # ...of the previous two non-redundant : 24041
% 2.68/0.82 # ...aggressively subsumed : 0
% 2.68/0.82 # Contextual simplify-reflections : 35
% 2.68/0.82 # Paramodulations : 24999
% 2.68/0.82 # Factorizations : 6
% 2.68/0.82 # NegExts : 0
% 2.68/0.82 # Equation resolutions : 46
% 2.68/0.82 # Disequality decompositions : 0
% 2.68/0.82 # Total rewrite steps : 7434
% 2.68/0.82 # ...of those cached : 7211
% 2.68/0.82 # Propositional unsat checks : 0
% 2.68/0.82 # Propositional check models : 0
% 2.68/0.82 # Propositional check unsatisfiable : 0
% 2.68/0.82 # Propositional clauses : 0
% 2.68/0.82 # Propositional clauses after purity: 0
% 2.68/0.82 # Propositional unsat core size : 0
% 2.68/0.82 # Propositional preprocessing time : 0.000
% 2.68/0.82 # Propositional encoding time : 0.000
% 2.68/0.82 # Propositional solver time : 0.000
% 2.68/0.82 # Success case prop preproc time : 0.000
% 2.68/0.82 # Success case prop encoding time : 0.000
% 2.68/0.82 # Success case prop solver time : 0.000
% 2.68/0.82 # Current number of processed clauses : 56
% 2.68/0.82 # Positive orientable unit clauses : 19
% 2.68/0.82 # Positive unorientable unit clauses: 0
% 2.68/0.82 # Negative unit clauses : 0
% 2.68/0.82 # Non-unit-clauses : 37
% 2.68/0.82 # Current number of unprocessed clauses: 14262
% 2.68/0.82 # ...number of literals in the above : 72161
% 2.68/0.82 # Current number of archived formulas : 0
% 2.68/0.82 # Current number of archived clauses : 1456
% 2.68/0.82 # Clause-clause subsumption calls (NU) : 76461
% 2.68/0.82 # Rec. Clause-clause subsumption calls : 34151
% 2.68/0.82 # Non-unit clause-clause subsumptions : 3144
% 2.68/0.82 # Unit Clause-clause subsumption calls : 1699
% 2.68/0.82 # Rewrite failures with RHS unbound : 0
% 2.68/0.82 # BW rewrite match attempts : 70
% 2.68/0.82 # BW rewrite match successes : 57
% 2.68/0.82 # Condensation attempts : 0
% 2.68/0.82 # Condensation successes : 0
% 2.68/0.82 # Termbank termtop insertions : 374714
% 2.68/0.82 # Search garbage collected termcells : 47
% 2.68/0.82
% 2.68/0.82 # -------------------------------------------------
% 2.68/0.82 # User time : 0.332 s
% 2.68/0.82 # System time : 0.007 s
% 2.68/0.82 # Total time : 0.339 s
% 2.68/0.82 # Maximum resident set size: 1676 pages
% 2.68/0.82
% 2.68/0.82 # -------------------------------------------------
% 2.68/0.82 # User time : 1.668 s
% 2.68/0.82 # System time : 0.017 s
% 2.68/0.82 # Total time : 1.685 s
% 2.68/0.82 # Maximum resident set size: 1764 pages
% 2.68/0.82 % E---3.1 exiting
% 2.68/0.82 % E exiting
%------------------------------------------------------------------------------