TSTP Solution File: RNG004-10 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG004-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 19:15:17 EDT 2023
% Result : Unsatisfiable 669.53s 88.13s
% Output : CNFRefutation 669.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 17
% Syntax : Number of clauses : 86 ( 86 unt; 0 nHn; 20 RR)
% Number of literals : 86 ( 85 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-4 aty)
% Number of variables : 190 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_addition2,axiom,
ifeq(sum(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X1,X6),true,sum(X6,X2,X5),true),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',associativity_of_addition2) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity) = true,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',left_inverse) ).
cnf(ifeq_axiom_001,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',ifeq_axiom_001) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)) = true,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',closure_of_addition) ).
cnf(addition_is_well_defined,axiom,
ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3) = X3,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',addition_is_well_defined) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1) = true,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',additive_identity1) ).
cnf(ifeq_axiom,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',ifeq_axiom) ).
cnf(distributivity3,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X2,X7),true,ifeq(sum(X6,X4,X1),true,sum(X7,X5,X3),true),true),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',distributivity3) ).
cnf(multiplication_is_well_defined,axiom,
ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3) = X3,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',multiplication_is_well_defined) ).
cnf(a_inverse_times_b_inverse,hypothesis,
product(additive_inverse(a),additive_inverse(b),d) = true,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',a_inverse_times_b_inverse) ).
cnf(commutativity_of_addition,axiom,
ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',commutativity_of_addition) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)) = true,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',closure_of_multiplication) ).
cnf(additive_identity2,axiom,
sum(X1,additive_identity,X1) = true,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',additive_identity2) ).
cnf(distributivity2,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',distributivity2) ).
cnf(distributivity1,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true) = true,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',distributivity1) ).
cnf(a_times_b,hypothesis,
product(a,b,c) = true,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',a_times_b) ).
cnf(prove_c_equals_d,negated_conjecture,
c != d,
file('/export/starexec/sandbox2/tmp/tmp.msanmNjqd8/E---3.1_18780.p',prove_c_equals_d) ).
cnf(c_0_17,axiom,
ifeq(sum(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X1,X6),true,sum(X6,X2,X5),true),true),true) = true,
associativity_of_addition2 ).
cnf(c_0_18,axiom,
sum(additive_inverse(X1),X1,additive_identity) = true,
left_inverse ).
cnf(c_0_19,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_20,plain,
ifeq(sum(X1,X2,X3),true,ifeq(sum(additive_inverse(X1),X3,X4),true,sum(additive_identity,X2,X4),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_21,axiom,
sum(X1,X2,add(X1,X2)) = true,
closure_of_addition ).
cnf(c_0_22,axiom,
ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3) = X3,
addition_is_well_defined ).
cnf(c_0_23,axiom,
sum(additive_identity,X1,X1) = true,
additive_identity1 ).
cnf(c_0_24,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_25,plain,
ifeq(sum(X1,X2,X3),true,sum(additive_identity,X2,add(additive_inverse(X1),X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19]) ).
cnf(c_0_26,plain,
ifeq2(sum(additive_identity,X1,X2),true,X1,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_27,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X2,X7),true,ifeq(sum(X6,X4,X1),true,sum(X7,X5,X3),true),true),true),true) = true,
distributivity3 ).
cnf(c_0_28,axiom,
ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3) = X3,
multiplication_is_well_defined ).
cnf(c_0_29,hypothesis,
product(additive_inverse(a),additive_inverse(b),d) = true,
a_inverse_times_b_inverse ).
cnf(c_0_30,axiom,
ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true) = true,
commutativity_of_addition ).
cnf(c_0_31,plain,
ifeq2(sum(X1,X2,X3),true,add(X1,X2),X3) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_24]) ).
cnf(c_0_32,plain,
sum(additive_identity,X1,add(additive_inverse(X2),add(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21]),c_0_19]) ).
cnf(c_0_33,plain,
add(additive_identity,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_21]),c_0_24]) ).
cnf(c_0_34,plain,
ifeq(product(X1,X2,X3),true,ifeq(product(X1,X2,X4),true,ifeq(product(additive_identity,X2,X5),true,sum(X5,X4,X3),true),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_23]),c_0_19]) ).
cnf(c_0_35,hypothesis,
ifeq2(product(additive_inverse(a),additive_inverse(b),X1),true,X1,d) = d,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_24]) ).
cnf(c_0_36,axiom,
product(X1,X2,multiply(X1,X2)) = true,
closure_of_multiplication ).
cnf(c_0_37,axiom,
sum(X1,additive_identity,X1) = true,
additive_identity2 ).
cnf(c_0_38,plain,
sum(X1,X2,add(X2,X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_21]),c_0_19]) ).
cnf(c_0_39,plain,
add(additive_inverse(X1),add(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_24]) ).
cnf(c_0_40,hypothesis,
ifeq(product(additive_inverse(a),additive_inverse(b),X1),true,ifeq(product(additive_identity,additive_inverse(b),X2),true,sum(X2,d,X1),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_29]),c_0_19]) ).
cnf(c_0_41,hypothesis,
multiply(additive_inverse(a),additive_inverse(b)) = d,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_24]) ).
cnf(c_0_42,plain,
ifeq(sum(X1,X2,additive_identity),true,ifeq(sum(X3,X1,X4),true,sum(X4,X2,X3),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_37]),c_0_19]) ).
cnf(c_0_43,plain,
sum(add(X1,X2),additive_inverse(X1),X2) = true,
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
add(X1,additive_identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_38]),c_0_24]) ).
cnf(c_0_45,hypothesis,
ifeq(product(additive_identity,additive_inverse(b),X1),true,sum(X1,d,d),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_36]),c_0_41]),c_0_19]) ).
cnf(c_0_46,plain,
ifeq(sum(X1,X2,X3),true,sum(X3,additive_inverse(X2),X1),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_19]) ).
cnf(c_0_47,hypothesis,
sum(multiply(additive_identity,additive_inverse(b)),d,d) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_36]),c_0_19]) ).
cnf(c_0_48,plain,
ifeq2(sum(additive_inverse(X1),X1,X2),true,additive_identity,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_18]),c_0_24]) ).
cnf(c_0_49,hypothesis,
sum(d,additive_inverse(d),multiply(additive_identity,additive_inverse(b))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_19]) ).
cnf(c_0_50,plain,
add(X1,additive_inverse(X1)) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_38]),c_0_24]) ).
cnf(c_0_51,plain,
ifeq(product(additive_identity,X1,X2),true,ifeq(product(X3,X1,X4),true,ifeq(product(additive_inverse(X3),X1,X5),true,sum(X5,X4,X2),true),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_18]),c_0_19]) ).
cnf(c_0_52,hypothesis,
multiply(additive_identity,additive_inverse(b)) = additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_49]),c_0_50]),c_0_24]) ).
cnf(c_0_53,hypothesis,
ifeq(product(additive_identity,additive_inverse(b),X1),true,ifeq(product(a,additive_inverse(b),X2),true,sum(d,X2,X1),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_29]),c_0_19]) ).
cnf(c_0_54,hypothesis,
product(additive_identity,additive_inverse(b),additive_identity) = true,
inference(spm,[status(thm)],[c_0_36,c_0_52]) ).
cnf(c_0_55,hypothesis,
ifeq(product(a,additive_inverse(b),X1),true,sum(d,X1,additive_identity),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_19]) ).
cnf(c_0_56,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true) = true,
distributivity2 ).
cnf(c_0_57,plain,
ifeq(sum(X1,X2,X3),true,sum(additive_identity,X2,add(X3,additive_inverse(X1))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_38]),c_0_19]) ).
cnf(c_0_58,hypothesis,
sum(d,multiply(a,additive_inverse(b)),additive_identity) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_36]),c_0_19]) ).
cnf(c_0_59,plain,
ifeq(product(X1,X2,X3),true,ifeq(product(X1,additive_inverse(X2),X4),true,ifeq(sum(X4,X3,X5),true,product(X1,additive_identity,X5),true),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_18]),c_0_19]) ).
cnf(c_0_60,hypothesis,
sum(additive_identity,multiply(a,additive_inverse(b)),additive_inverse(d)) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_33]),c_0_19]) ).
cnf(c_0_61,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true) = true,
distributivity1 ).
cnf(c_0_62,hypothesis,
product(a,b,c) = true,
a_times_b ).
cnf(c_0_63,plain,
ifeq(product(X1,X2,X3),true,ifeq(sum(multiply(X1,additive_inverse(X2)),X3,X4),true,product(X1,additive_identity,X4),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_36]),c_0_19]) ).
cnf(c_0_64,hypothesis,
multiply(a,additive_inverse(b)) = additive_inverse(d),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_60]),c_0_33]),c_0_24]) ).
cnf(c_0_65,plain,
ifeq(product(X1,X2,X3),true,ifeq(product(X1,X2,X4),true,ifeq(product(X1,additive_identity,X5),true,sum(X5,X4,X3),true),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_23]),c_0_19]) ).
cnf(c_0_66,hypothesis,
ifeq2(product(a,b,X1),true,X1,c) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_62]),c_0_24]) ).
cnf(c_0_67,hypothesis,
ifeq(sum(additive_inverse(d),c,X1),true,product(a,additive_identity,X1),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_62]),c_0_64]),c_0_19]) ).
cnf(c_0_68,plain,
add(X1,X2) = add(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_38]),c_0_24]) ).
cnf(c_0_69,plain,
ifeq(sum(X1,X2,additive_identity),true,sum(additive_identity,X2,additive_inverse(X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_37]),c_0_19]) ).
cnf(c_0_70,hypothesis,
ifeq(product(a,b,X1),true,ifeq(product(a,additive_identity,X2),true,sum(X2,c,X1),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_62]),c_0_19]) ).
cnf(c_0_71,hypothesis,
multiply(a,b) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_36]),c_0_24]) ).
cnf(c_0_72,plain,
ifeq2(product(X1,X2,X3),true,multiply(X1,X2),X3) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_36]),c_0_24]) ).
cnf(c_0_73,hypothesis,
product(a,additive_identity,add(c,additive_inverse(d))) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_21]),c_0_19]),c_0_68]) ).
cnf(c_0_74,plain,
add(additive_inverse(X1),add(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_39,c_0_68]) ).
cnf(c_0_75,plain,
sum(additive_identity,X1,additive_inverse(additive_inverse(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_18]),c_0_19]) ).
cnf(c_0_76,hypothesis,
ifeq(product(a,additive_identity,X1),true,sum(X1,c,c),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_36]),c_0_71]),c_0_19]) ).
cnf(c_0_77,hypothesis,
multiply(a,additive_identity) = add(c,additive_inverse(d)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_24]) ).
cnf(c_0_78,plain,
add(X1,additive_inverse(add(X1,X2))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_74]),c_0_68]) ).
cnf(c_0_79,plain,
additive_inverse(additive_inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_75]),c_0_33]),c_0_24]) ).
cnf(c_0_80,hypothesis,
sum(add(c,additive_inverse(d)),c,c) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_36]),c_0_77]),c_0_19]) ).
cnf(c_0_81,plain,
additive_inverse(add(X1,X2)) = add(additive_inverse(X1),additive_inverse(X2)),
inference(spm,[status(thm)],[c_0_39,c_0_78]) ).
cnf(c_0_82,plain,
add(X1,add(X2,additive_inverse(X1))) = X2,
inference(spm,[status(thm)],[c_0_74,c_0_79]) ).
cnf(c_0_83,hypothesis,
sum(additive_identity,c,d) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_80]),c_0_81]),c_0_79]),c_0_68]),c_0_82]),c_0_19]) ).
cnf(c_0_84,negated_conjecture,
c != d,
prove_c_equals_d ).
cnf(c_0_85,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_83]),c_0_33]),c_0_24]),c_0_84]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : RNG004-10 : TPTP v8.1.2. Released v7.5.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n011.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 19:40:23 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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/tmp/tmp.msanmNjqd8/E---3.1_18780.p
% 669.53/88.13 # Version: 3.1pre001
% 669.53/88.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 669.53/88.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 669.53/88.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 669.53/88.13 # Starting new_bool_3 with 300s (1) cores
% 669.53/88.13 # Starting new_bool_1 with 300s (1) cores
% 669.53/88.13 # Starting sh5l with 300s (1) cores
% 669.53/88.13 # sh5l with pid 18861 completed with status 8
% 669.53/88.13 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18858 completed with status 0
% 669.53/88.13 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 669.53/88.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 669.53/88.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 669.53/88.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 669.53/88.13 # No SInE strategy applied
% 669.53/88.13 # Search class: FUUPM-FFMF32-MFFFFFNN
% 669.53/88.13 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 669.53/88.13 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 583s (1) cores
% 669.53/88.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 669.53/88.13 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 669.53/88.13 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 669.53/88.13 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 669.53/88.13 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 18862 completed with status 0
% 669.53/88.13 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 669.53/88.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 669.53/88.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 669.53/88.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 669.53/88.13 # No SInE strategy applied
% 669.53/88.13 # Search class: FUUPM-FFMF32-MFFFFFNN
% 669.53/88.13 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 669.53/88.13 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 583s (1) cores
% 669.53/88.13 # Preprocessing time : 0.001 s
% 669.53/88.13
% 669.53/88.13 # Proof found!
% 669.53/88.13 # SZS status Unsatisfiable
% 669.53/88.13 # SZS output start CNFRefutation
% See solution above
% 669.53/88.13 # Parsed axioms : 22
% 669.53/88.13 # Removed by relevancy pruning/SinE : 0
% 669.53/88.13 # Initial clauses : 22
% 669.53/88.13 # Removed in clause preprocessing : 0
% 669.53/88.13 # Initial clauses in saturation : 22
% 669.53/88.13 # Processed clauses : 82509
% 669.53/88.13 # ...of these trivial : 65223
% 669.53/88.13 # ...subsumed : 8621
% 669.53/88.13 # ...remaining for further processing : 8665
% 669.53/88.13 # Other redundant clauses eliminated : 0
% 669.53/88.13 # Clauses deleted for lack of memory : 57800
% 669.53/88.13 # Backward-subsumed : 0
% 669.53/88.13 # Backward-rewritten : 555
% 669.53/88.13 # Generated clauses : 3784186
% 669.53/88.13 # ...of the previous two non-redundant : 1834880
% 669.53/88.13 # ...aggressively subsumed : 0
% 669.53/88.13 # Contextual simplify-reflections : 0
% 669.53/88.13 # Paramodulations : 3784186
% 669.53/88.13 # Factorizations : 0
% 669.53/88.13 # NegExts : 0
% 669.53/88.13 # Equation resolutions : 0
% 669.53/88.13 # Total rewrite steps : 9984064
% 669.53/88.13 # Propositional unsat checks : 1
% 669.53/88.13 # Propositional check models : 1
% 669.53/88.13 # Propositional check unsatisfiable : 0
% 669.53/88.13 # Propositional clauses : 0
% 669.53/88.13 # Propositional clauses after purity: 0
% 669.53/88.13 # Propositional unsat core size : 0
% 669.53/88.13 # Propositional preprocessing time : 0.000
% 669.53/88.13 # Propositional encoding time : 2.297
% 669.53/88.13 # Propositional solver time : 0.035
% 669.53/88.13 # Success case prop preproc time : 0.000
% 669.53/88.13 # Success case prop encoding time : 0.000
% 669.53/88.13 # Success case prop solver time : 0.000
% 669.53/88.13 # Current number of processed clauses : 8110
% 669.53/88.13 # Positive orientable unit clauses : 8105
% 669.53/88.13 # Positive unorientable unit clauses: 4
% 669.53/88.13 # Negative unit clauses : 1
% 669.53/88.13 # Non-unit-clauses : 0
% 669.53/88.13 # Current number of unprocessed clauses: 987362
% 669.53/88.13 # ...number of literals in the above : 987362
% 669.53/88.13 # Current number of archived formulas : 0
% 669.53/88.13 # Current number of archived clauses : 555
% 669.53/88.13 # Clause-clause subsumption calls (NU) : 0
% 669.53/88.13 # Rec. Clause-clause subsumption calls : 0
% 669.53/88.13 # Non-unit clause-clause subsumptions : 0
% 669.53/88.13 # Unit Clause-clause subsumption calls : 23
% 669.53/88.13 # Rewrite failures with RHS unbound : 0
% 669.53/88.13 # BW rewrite match attempts : 5143511
% 669.53/88.13 # BW rewrite match successes : 680
% 669.53/88.13 # Condensation attempts : 0
% 669.53/88.13 # Condensation successes : 0
% 669.53/88.13 # Termbank termtop insertions : 83172983
% 669.53/88.13
% 669.53/88.13 # -------------------------------------------------
% 669.53/88.13 # User time : 84.485 s
% 669.53/88.13 # System time : 1.923 s
% 669.53/88.13 # Total time : 86.407 s
% 669.53/88.13 # Maximum resident set size: 1544 pages
% 669.53/88.13
% 669.53/88.13 # -------------------------------------------------
% 669.53/88.13 # User time : 484.599 s
% 669.53/88.13 # System time : 10.090 s
% 669.53/88.13 # Total time : 494.690 s
% 669.53/88.13 # Maximum resident set size: 1688 pages
% 669.53/88.13 % E---3.1 exiting
%------------------------------------------------------------------------------