TSTP Solution File: CSR158+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR158+1 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : Sat May 4 07:34:45 EDT 2024
% Result : Theorem 6.51s 3.00s
% Output : CNFRefutation 6.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 240 ( 4 equ)
% Maximal formula atoms : 110 ( 10 avg)
% Number of connectives : 324 ( 107 ~; 101 |; 102 &)
% ( 12 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 81 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 1 prp; 0-7 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 125 ( 1 sgn 115 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(predefinitionsA18,axiom,
( ! [X7,X8,X9] :
( p__d__partition3(X7,X8,X9)
<=> ( p__d__exhaustiveDecomposition3(X7,X8,X9)
& p__d__disjointDecomposition3(X7,X8,X9) ) )
& ! [X7,X8,X9,X10] :
( p__d__partition4(X7,X8,X9,X10)
<=> ( p__d__exhaustiveDecomposition4(X7,X8,X9,X10)
& p__d__disjointDecomposition4(X7,X8,X9,X10) ) )
& ! [X7,X8,X9,X10,X11] :
( p__d__partition5(X7,X8,X9,X10,X11)
<=> ( p__d__exhaustiveDecomposition5(X7,X8,X9,X10,X11)
& p__d__disjointDecomposition5(X7,X8,X9,X10,X11) ) )
& ! [X7,X8,X9,X10,X11,X12] :
( p__d__partition6(X7,X8,X9,X10,X11,X12)
<=> ( p__d__exhaustiveDecomposition6(X7,X8,X9,X10,X11,X12)
& p__d__disjointDecomposition6(X7,X8,X9,X10,X11,X12) ) )
& ! [X7,X8,X9,X10,X11,X12,X13] :
( p__d__partition7(X7,X8,X9,X10,X11,X12,X13)
<=> ( p__d__exhaustiveDecomposition7(X7,X8,X9,X10,X11,X12,X13)
& p__d__disjointDecomposition7(X7,X8,X9,X10,X11,X12,X13) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uSDvnimMzf/E---3.1_5437.p',predefinitionsA18) ).
fof(predefinitionsA15,axiom,
! [X4,X5] :
( p__d__disjoint(X4,X5)
<=> ! [X6] :
( ~ p__d__instance(X6,X4)
| ~ p__d__instance(X6,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.uSDvnimMzf/E---3.1_5437.p',predefinitionsA15) ).
fof(predefinitionsA24,axiom,
( ! [X7,X8,X9] :
( p__d__disjointDecomposition3(X7,X8,X9)
<=> p__d__disjoint(X8,X9) )
& ! [X7,X8,X9,X10] :
( p__d__disjointDecomposition4(X7,X8,X9,X10)
<=> ( p__d__disjoint(X8,X9)
& p__d__disjoint(X8,X10)
& p__d__disjoint(X9,X10) ) )
& ! [X7,X8,X9,X10,X11] :
( p__d__disjointDecomposition5(X7,X8,X9,X10,X11)
<=> ( p__d__disjoint(X8,X9)
& p__d__disjoint(X8,X10)
& p__d__disjoint(X8,X11)
& p__d__disjoint(X9,X10)
& p__d__disjoint(X9,X11)
& p__d__disjoint(X10,X11) ) )
& ! [X7,X8,X9,X10,X11,X12] :
( p__d__disjointDecomposition6(X7,X8,X9,X10,X11,X12)
<=> ( p__d__disjoint(X8,X9)
& p__d__disjoint(X8,X10)
& p__d__disjoint(X8,X11)
& p__d__disjoint(X8,X12)
& p__d__disjoint(X9,X10)
& p__d__disjoint(X9,X11)
& p__d__disjoint(X9,X12)
& p__d__disjoint(X10,X11)
& p__d__disjoint(X10,X12)
& p__d__disjoint(X11,X12) ) )
& ! [X7,X8,X9,X10,X11,X12,X13] :
( p__d__disjointDecomposition7(X7,X8,X9,X10,X11,X12,X13)
<=> ( p__d__disjoint(X8,X9)
& p__d__disjoint(X8,X10)
& p__d__disjoint(X8,X11)
& p__d__disjoint(X8,X12)
& p__d__disjoint(X8,X13)
& p__d__disjoint(X9,X10)
& p__d__disjoint(X9,X11)
& p__d__disjoint(X9,X12)
& p__d__disjoint(X9,X13)
& p__d__disjoint(X10,X11)
& p__d__disjoint(X10,X12)
& p__d__disjoint(X10,X13)
& p__d__disjoint(X11,X12)
& p__d__disjoint(X11,X13)
& p__d__disjoint(X12,X13) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.uSDvnimMzf/E---3.1_5437.p',predefinitionsA24) ).
fof(mergeA299,axiom,
p__d__partition3(c__HumanLanguage,c__NaturalLanguage,c__ConstructedLanguage),
file('/export/starexec/sandbox/tmp/tmp.uSDvnimMzf/E---3.1_5437.p',mergeA299) ).
fof(antonymPattern10010,conjecture,
! [X1,X2] :
( ( p__d__instance(X1,c__ConstructedLanguage)
& p__d__instance(X2,c__NaturalLanguage) )
=> X1 != X2 ),
file('/export/starexec/sandbox/tmp/tmp.uSDvnimMzf/E---3.1_5437.p',antonymPattern10010) ).
fof(c_0_5,plain,
! [X1059,X1060,X1061,X1062,X1063,X1064,X1065,X1066,X1067,X1068,X1069,X1070,X1071,X1072,X1073,X1074,X1075,X1076,X1077,X1078,X1079,X1080,X1081,X1082,X1083] :
( ( p__d__exhaustiveDecomposition3(X1059,X1060,X1061)
| ~ p__d__partition3(X1059,X1060,X1061) )
& ( p__d__disjointDecomposition3(X1059,X1060,X1061)
| ~ p__d__partition3(X1059,X1060,X1061) )
& ( ~ p__d__exhaustiveDecomposition3(X1059,X1060,X1061)
| ~ p__d__disjointDecomposition3(X1059,X1060,X1061)
| p__d__partition3(X1059,X1060,X1061) )
& ( p__d__exhaustiveDecomposition4(X1062,X1063,X1064,X1065)
| ~ p__d__partition4(X1062,X1063,X1064,X1065) )
& ( p__d__disjointDecomposition4(X1062,X1063,X1064,X1065)
| ~ p__d__partition4(X1062,X1063,X1064,X1065) )
& ( ~ p__d__exhaustiveDecomposition4(X1062,X1063,X1064,X1065)
| ~ p__d__disjointDecomposition4(X1062,X1063,X1064,X1065)
| p__d__partition4(X1062,X1063,X1064,X1065) )
& ( p__d__exhaustiveDecomposition5(X1066,X1067,X1068,X1069,X1070)
| ~ p__d__partition5(X1066,X1067,X1068,X1069,X1070) )
& ( p__d__disjointDecomposition5(X1066,X1067,X1068,X1069,X1070)
| ~ p__d__partition5(X1066,X1067,X1068,X1069,X1070) )
& ( ~ p__d__exhaustiveDecomposition5(X1066,X1067,X1068,X1069,X1070)
| ~ p__d__disjointDecomposition5(X1066,X1067,X1068,X1069,X1070)
| p__d__partition5(X1066,X1067,X1068,X1069,X1070) )
& ( p__d__exhaustiveDecomposition6(X1071,X1072,X1073,X1074,X1075,X1076)
| ~ p__d__partition6(X1071,X1072,X1073,X1074,X1075,X1076) )
& ( p__d__disjointDecomposition6(X1071,X1072,X1073,X1074,X1075,X1076)
| ~ p__d__partition6(X1071,X1072,X1073,X1074,X1075,X1076) )
& ( ~ p__d__exhaustiveDecomposition6(X1071,X1072,X1073,X1074,X1075,X1076)
| ~ p__d__disjointDecomposition6(X1071,X1072,X1073,X1074,X1075,X1076)
| p__d__partition6(X1071,X1072,X1073,X1074,X1075,X1076) )
& ( p__d__exhaustiveDecomposition7(X1077,X1078,X1079,X1080,X1081,X1082,X1083)
| ~ p__d__partition7(X1077,X1078,X1079,X1080,X1081,X1082,X1083) )
& ( p__d__disjointDecomposition7(X1077,X1078,X1079,X1080,X1081,X1082,X1083)
| ~ p__d__partition7(X1077,X1078,X1079,X1080,X1081,X1082,X1083) )
& ( ~ p__d__exhaustiveDecomposition7(X1077,X1078,X1079,X1080,X1081,X1082,X1083)
| ~ p__d__disjointDecomposition7(X1077,X1078,X1079,X1080,X1081,X1082,X1083)
| p__d__partition7(X1077,X1078,X1079,X1080,X1081,X1082,X1083) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[predefinitionsA18])])])])]) ).
fof(c_0_6,plain,
! [X4,X5] :
( p__d__disjoint(X4,X5)
<=> ! [X6] :
( ~ p__d__instance(X6,X4)
| ~ p__d__instance(X6,X5) ) ),
inference(fof_simplification,[status(thm)],[predefinitionsA15]) ).
fof(c_0_7,plain,
! [X1144,X1145,X1146,X1147,X1148,X1149,X1150,X1151,X1152,X1153,X1154,X1155,X1156,X1157,X1158,X1159,X1160,X1161,X1162,X1163,X1164,X1165,X1166,X1167,X1168] :
( ( ~ p__d__disjointDecomposition3(X1144,X1145,X1146)
| p__d__disjoint(X1145,X1146) )
& ( ~ p__d__disjoint(X1145,X1146)
| p__d__disjointDecomposition3(X1144,X1145,X1146) )
& ( p__d__disjoint(X1148,X1149)
| ~ p__d__disjointDecomposition4(X1147,X1148,X1149,X1150) )
& ( p__d__disjoint(X1148,X1150)
| ~ p__d__disjointDecomposition4(X1147,X1148,X1149,X1150) )
& ( p__d__disjoint(X1149,X1150)
| ~ p__d__disjointDecomposition4(X1147,X1148,X1149,X1150) )
& ( ~ p__d__disjoint(X1148,X1149)
| ~ p__d__disjoint(X1148,X1150)
| ~ p__d__disjoint(X1149,X1150)
| p__d__disjointDecomposition4(X1147,X1148,X1149,X1150) )
& ( p__d__disjoint(X1152,X1153)
| ~ p__d__disjointDecomposition5(X1151,X1152,X1153,X1154,X1155) )
& ( p__d__disjoint(X1152,X1154)
| ~ p__d__disjointDecomposition5(X1151,X1152,X1153,X1154,X1155) )
& ( p__d__disjoint(X1152,X1155)
| ~ p__d__disjointDecomposition5(X1151,X1152,X1153,X1154,X1155) )
& ( p__d__disjoint(X1153,X1154)
| ~ p__d__disjointDecomposition5(X1151,X1152,X1153,X1154,X1155) )
& ( p__d__disjoint(X1153,X1155)
| ~ p__d__disjointDecomposition5(X1151,X1152,X1153,X1154,X1155) )
& ( p__d__disjoint(X1154,X1155)
| ~ p__d__disjointDecomposition5(X1151,X1152,X1153,X1154,X1155) )
& ( ~ p__d__disjoint(X1152,X1153)
| ~ p__d__disjoint(X1152,X1154)
| ~ p__d__disjoint(X1152,X1155)
| ~ p__d__disjoint(X1153,X1154)
| ~ p__d__disjoint(X1153,X1155)
| ~ p__d__disjoint(X1154,X1155)
| p__d__disjointDecomposition5(X1151,X1152,X1153,X1154,X1155) )
& ( p__d__disjoint(X1157,X1158)
| ~ p__d__disjointDecomposition6(X1156,X1157,X1158,X1159,X1160,X1161) )
& ( p__d__disjoint(X1157,X1159)
| ~ p__d__disjointDecomposition6(X1156,X1157,X1158,X1159,X1160,X1161) )
& ( p__d__disjoint(X1157,X1160)
| ~ p__d__disjointDecomposition6(X1156,X1157,X1158,X1159,X1160,X1161) )
& ( p__d__disjoint(X1157,X1161)
| ~ p__d__disjointDecomposition6(X1156,X1157,X1158,X1159,X1160,X1161) )
& ( p__d__disjoint(X1158,X1159)
| ~ p__d__disjointDecomposition6(X1156,X1157,X1158,X1159,X1160,X1161) )
& ( p__d__disjoint(X1158,X1160)
| ~ p__d__disjointDecomposition6(X1156,X1157,X1158,X1159,X1160,X1161) )
& ( p__d__disjoint(X1158,X1161)
| ~ p__d__disjointDecomposition6(X1156,X1157,X1158,X1159,X1160,X1161) )
& ( p__d__disjoint(X1159,X1160)
| ~ p__d__disjointDecomposition6(X1156,X1157,X1158,X1159,X1160,X1161) )
& ( p__d__disjoint(X1159,X1161)
| ~ p__d__disjointDecomposition6(X1156,X1157,X1158,X1159,X1160,X1161) )
& ( p__d__disjoint(X1160,X1161)
| ~ p__d__disjointDecomposition6(X1156,X1157,X1158,X1159,X1160,X1161) )
& ( ~ p__d__disjoint(X1157,X1158)
| ~ p__d__disjoint(X1157,X1159)
| ~ p__d__disjoint(X1157,X1160)
| ~ p__d__disjoint(X1157,X1161)
| ~ p__d__disjoint(X1158,X1159)
| ~ p__d__disjoint(X1158,X1160)
| ~ p__d__disjoint(X1158,X1161)
| ~ p__d__disjoint(X1159,X1160)
| ~ p__d__disjoint(X1159,X1161)
| ~ p__d__disjoint(X1160,X1161)
| p__d__disjointDecomposition6(X1156,X1157,X1158,X1159,X1160,X1161) )
& ( p__d__disjoint(X1163,X1164)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( p__d__disjoint(X1163,X1165)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( p__d__disjoint(X1163,X1166)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( p__d__disjoint(X1163,X1167)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( p__d__disjoint(X1163,X1168)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( p__d__disjoint(X1164,X1165)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( p__d__disjoint(X1164,X1166)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( p__d__disjoint(X1164,X1167)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( p__d__disjoint(X1164,X1168)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( p__d__disjoint(X1165,X1166)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( p__d__disjoint(X1165,X1167)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( p__d__disjoint(X1165,X1168)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( p__d__disjoint(X1166,X1167)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( p__d__disjoint(X1166,X1168)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( p__d__disjoint(X1167,X1168)
| ~ p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) )
& ( ~ p__d__disjoint(X1163,X1164)
| ~ p__d__disjoint(X1163,X1165)
| ~ p__d__disjoint(X1163,X1166)
| ~ p__d__disjoint(X1163,X1167)
| ~ p__d__disjoint(X1163,X1168)
| ~ p__d__disjoint(X1164,X1165)
| ~ p__d__disjoint(X1164,X1166)
| ~ p__d__disjoint(X1164,X1167)
| ~ p__d__disjoint(X1164,X1168)
| ~ p__d__disjoint(X1165,X1166)
| ~ p__d__disjoint(X1165,X1167)
| ~ p__d__disjoint(X1165,X1168)
| ~ p__d__disjoint(X1166,X1167)
| ~ p__d__disjoint(X1166,X1168)
| ~ p__d__disjoint(X1167,X1168)
| p__d__disjointDecomposition7(X1162,X1163,X1164,X1165,X1166,X1167,X1168) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[predefinitionsA24])])])])]) ).
cnf(c_0_8,plain,
( p__d__disjointDecomposition3(X1,X2,X3)
| ~ p__d__partition3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
p__d__partition3(c__HumanLanguage,c__NaturalLanguage,c__ConstructedLanguage),
inference(split_conjunct,[status(thm)],[mergeA299]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2] :
( ( p__d__instance(X1,c__ConstructedLanguage)
& p__d__instance(X2,c__NaturalLanguage) )
=> X1 != X2 ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[antonymPattern10010])]) ).
fof(c_0_11,plain,
! [X1053,X1054,X1055,X1056,X1057] :
( ( ~ p__d__disjoint(X1053,X1054)
| ~ p__d__instance(X1055,X1053)
| ~ p__d__instance(X1055,X1054) )
& ( p__d__instance(esk1_2(X1056,X1057),X1056)
| p__d__disjoint(X1056,X1057) )
& ( p__d__instance(esk1_2(X1056,X1057),X1057)
| p__d__disjoint(X1056,X1057) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])])]) ).
cnf(c_0_12,plain,
( p__d__disjoint(X2,X3)
| ~ p__d__disjointDecomposition3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
p__d__disjointDecomposition3(c__HumanLanguage,c__NaturalLanguage,c__ConstructedLanguage),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
fof(c_0_14,negated_conjecture,
( p__d__instance(esk1216_0,c__ConstructedLanguage)
& p__d__instance(esk1217_0,c__NaturalLanguage)
& esk1216_0 = esk1217_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_15,plain,
( ~ p__d__disjoint(X1,X2)
| ~ p__d__instance(X3,X1)
| ~ p__d__instance(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
p__d__disjoint(c__NaturalLanguage,c__ConstructedLanguage),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
p__d__instance(esk1217_0,c__NaturalLanguage),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
esk1216_0 = esk1217_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ~ p__d__instance(X1,c__ConstructedLanguage)
| ~ p__d__instance(X1,c__NaturalLanguage) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
p__d__instance(esk1216_0,c__ConstructedLanguage),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
p__d__instance(esk1216_0,c__NaturalLanguage),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.73/0.76 % Problem : CSR158+1 : TPTP v8.1.2. Released v7.3.0.
% 0.73/0.77 % Command : run_E %s %d THM
% 0.76/0.98 % Computer : n007.cluster.edu
% 0.76/0.98 % Model : x86_64 x86_64
% 0.76/0.98 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.76/0.98 % Memory : 8042.1875MB
% 0.76/0.98 % OS : Linux 3.10.0-693.el7.x86_64
% 0.76/0.98 % CPULimit : 300
% 0.76/0.98 % WCLimit : 300
% 0.76/0.98 % DateTime : Fri May 3 14:53:53 EDT 2024
% 0.76/0.98 % CPUTime :
% 1.74/1.93 Running first-order theorem proving
% 1.74/1.93 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.uSDvnimMzf/E---3.1_5437.p
% 6.51/3.00 # Version: 3.1.0
% 6.51/3.00 # Preprocessing class: FMLLSMSLSSSNFFN.
% 6.51/3.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.51/3.00 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 6.51/3.00 # Starting new_bool_3 with 300s (1) cores
% 6.51/3.00 # Starting new_bool_1 with 300s (1) cores
% 6.51/3.00 # Starting sh5l with 300s (1) cores
% 6.51/3.00 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 5632 completed with status 0
% 6.51/3.00 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 6.51/3.00 # Preprocessing class: FMLLSMSLSSSNFFN.
% 6.51/3.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.51/3.00 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 6.51/3.00 # No SInE strategy applied
% 6.51/3.00 # Search class: FGHSS-SMLM31-MFFFFFNN
% 6.51/3.00 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 6.51/3.00 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 6.51/3.00 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 6.51/3.00 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 113s (1) cores
% 6.51/3.00 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 113s (1) cores
% 6.51/3.00 # Starting G-E--_012_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 113s (1) cores
% 6.51/3.00 # G----_0021_C18_F1_SE_CS_SP_S4S with pid 5684 completed with status 0
% 6.51/3.00 # Result found by G----_0021_C18_F1_SE_CS_SP_S4S
% 6.51/3.00 # Preprocessing class: FMLLSMSLSSSNFFN.
% 6.51/3.00 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.51/3.00 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 6.51/3.00 # No SInE strategy applied
% 6.51/3.00 # Search class: FGHSS-SMLM31-MFFFFFNN
% 6.51/3.00 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 6.51/3.00 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 6.51/3.00 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 6.51/3.00 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 113s (1) cores
% 6.51/3.00 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 113s (1) cores
% 6.51/3.00 # Preprocessing time : 0.103 s
% 6.51/3.00
% 6.51/3.00 # Proof found!
% 6.51/3.00 # SZS status Theorem
% 6.51/3.00 # SZS output start CNFRefutation
% See solution above
% 6.51/3.00 # Parsed axioms : 7433
% 6.51/3.00 # Removed by relevancy pruning/SinE : 0
% 6.51/3.00 # Initial clauses : 10862
% 6.51/3.00 # Removed in clause preprocessing : 20
% 6.51/3.00 # Initial clauses in saturation : 10842
% 6.51/3.00 # Processed clauses : 2784
% 6.51/3.00 # ...of these trivial : 1
% 6.51/3.00 # ...subsumed : 0
% 6.51/3.00 # ...remaining for further processing : 2783
% 6.51/3.00 # Other redundant clauses eliminated : 1
% 6.51/3.00 # Clauses deleted for lack of memory : 0
% 6.51/3.00 # Backward-subsumed : 0
% 6.51/3.00 # Backward-rewritten : 0
% 6.51/3.00 # Generated clauses : 303
% 6.51/3.00 # ...of the previous two non-redundant : 276
% 6.51/3.00 # ...aggressively subsumed : 0
% 6.51/3.00 # Contextual simplify-reflections : 0
% 6.51/3.00 # Paramodulations : 302
% 6.51/3.00 # Factorizations : 0
% 6.51/3.00 # NegExts : 0
% 6.51/3.00 # Equation resolutions : 1
% 6.51/3.00 # Disequality decompositions : 0
% 6.51/3.00 # Total rewrite steps : 27
% 6.51/3.00 # ...of those cached : 1
% 6.51/3.00 # Propositional unsat checks : 0
% 6.51/3.00 # Propositional check models : 0
% 6.51/3.00 # Propositional check unsatisfiable : 0
% 6.51/3.00 # Propositional clauses : 0
% 6.51/3.00 # Propositional clauses after purity: 0
% 6.51/3.00 # Propositional unsat core size : 0
% 6.51/3.00 # Propositional preprocessing time : 0.000
% 6.51/3.00 # Propositional encoding time : 0.000
% 6.51/3.00 # Propositional solver time : 0.000
% 6.51/3.00 # Success case prop preproc time : 0.000
% 6.51/3.00 # Success case prop encoding time : 0.000
% 6.51/3.00 # Success case prop solver time : 0.000
% 6.51/3.00 # Current number of processed clauses : 2782
% 6.51/3.00 # Positive orientable unit clauses : 1754
% 6.51/3.00 # Positive unorientable unit clauses: 0
% 6.51/3.00 # Negative unit clauses : 1
% 6.51/3.00 # Non-unit-clauses : 1027
% 6.51/3.00 # Current number of unprocessed clauses: 8334
% 6.51/3.00 # ...number of literals in the above : 21301
% 6.51/3.00 # Current number of archived formulas : 0
% 6.51/3.00 # Current number of archived clauses : 0
% 6.51/3.00 # Clause-clause subsumption calls (NU) : 360597
% 6.51/3.00 # Rec. Clause-clause subsumption calls : 299577
% 6.51/3.00 # Non-unit clause-clause subsumptions : 0
% 6.51/3.00 # Unit Clause-clause subsumption calls : 64268
% 6.51/3.00 # Rewrite failures with RHS unbound : 0
% 6.51/3.00 # BW rewrite match attempts : 0
% 6.51/3.00 # BW rewrite match successes : 0
% 6.51/3.00 # Condensation attempts : 0
% 6.51/3.00 # Condensation successes : 0
% 6.51/3.00 # Termbank termtop insertions : 513307
% 6.51/3.00 # Search garbage collected termcells : 89358
% 6.51/3.00
% 6.51/3.00 # -------------------------------------------------
% 6.51/3.00 # User time : 0.769 s
% 6.51/3.00 # System time : 0.077 s
% 6.51/3.00 # Total time : 0.846 s
% 6.51/3.00 # Maximum resident set size: 31120 pages
% 6.51/3.00
% 6.51/3.00 # -------------------------------------------------
% 6.51/3.00 # User time : 1.851 s
% 6.51/3.00 # System time : 0.252 s
% 6.51/3.00 # Total time : 2.103 s
% 6.51/3.00 # Maximum resident set size: 9772 pages
% 6.51/3.00 % E---3.1 exiting
% 6.51/3.00 % E exiting
%------------------------------------------------------------------------------