TSTP Solution File: CSR217+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR217+1 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:52 EDT 2024
% Result : Theorem 1.57s 2.19s
% Output : CNFRefutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 20 unt; 0 def)
% Number of atoms : 273 ( 4 equ)
% Maximal formula atoms : 110 ( 6 avg)
% Number of connectives : 347 ( 116 ~; 110 |; 104 &)
% ( 12 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 81 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-7 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-2 aty)
% Number of variables : 141 ( 2 sgn 121 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(antonymPattern10059,conjecture,
! [X1,X2] :
( p__d__instance(X2,c__Object)
=> ( ( p__d__instance(X1,c__Hiring)
& p__attribute(X2,c__Unemployed) )
=> X1 != X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.cVW8sKzojD/E---3.1_26140.p',antonymPattern10059) ).
fof(predefinitionsA12,axiom,
! [X1,X2,X3] :
( ( p__d__instance(X1,X2)
& p__d__subclass(X2,X3) )
=> p__d__instance(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.cVW8sKzojD/E---3.1_26140.p',predefinitionsA12) ).
fof(mergeA2378,axiom,
p__d__subclass(c__Hiring,c__JoiningAnOrganization),
file('/export/starexec/sandbox/tmp/tmp.cVW8sKzojD/E---3.1_26140.p',mergeA2378) ).
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.cVW8sKzojD/E---3.1_26140.p',predefinitionsA24) ).
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.cVW8sKzojD/E---3.1_26140.p',predefinitionsA18) ).
fof(mergeA2369,axiom,
p__d__subclass(c__JoiningAnOrganization,c__OrganizationalProcess),
file('/export/starexec/sandbox/tmp/tmp.cVW8sKzojD/E---3.1_26140.p',mergeA2369) ).
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.cVW8sKzojD/E---3.1_26140.p',predefinitionsA15) ).
fof(mergeA2364,axiom,
p__d__subclass(c__OrganizationalProcess,c__IntentionalProcess),
file('/export/starexec/sandbox/tmp/tmp.cVW8sKzojD/E---3.1_26140.p',mergeA2364) ).
fof(mergeA179,axiom,
p__d__partition3(c__Physical,c__Object,c__Process),
file('/export/starexec/sandbox/tmp/tmp.cVW8sKzojD/E---3.1_26140.p',mergeA179) ).
fof(mergeA2357,axiom,
p__d__subclass(c__IntentionalProcess,c__Process),
file('/export/starexec/sandbox/tmp/tmp.cVW8sKzojD/E---3.1_26140.p',mergeA2357) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2] :
( p__d__instance(X2,c__Object)
=> ( ( p__d__instance(X1,c__Hiring)
& p__attribute(X2,c__Unemployed) )
=> X1 != X2 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[antonymPattern10059])]) ).
fof(c_0_11,plain,
! [X1054,X1055,X1056] :
( ~ p__d__instance(X1054,X1055)
| ~ p__d__subclass(X1055,X1056)
| p__d__instance(X1054,X1056) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[predefinitionsA12])])]) ).
fof(c_0_12,negated_conjecture,
( p__d__instance(esk2_0,c__Object)
& p__d__instance(esk1_0,c__Hiring)
& p__attribute(esk2_0,c__Unemployed)
& esk1_0 = esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_13,plain,
( p__d__instance(X1,X3)
| ~ p__d__instance(X1,X2)
| ~ p__d__subclass(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
p__d__subclass(c__Hiring,c__JoiningAnOrganization),
inference(split_conjunct,[status(thm)],[mergeA2378]) ).
cnf(c_0_15,negated_conjecture,
p__d__instance(esk1_0,c__Hiring),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
esk1_0 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X1358,X1359,X1360,X1361,X1362,X1363,X1364,X1365,X1366,X1367,X1368,X1369,X1370,X1371,X1372,X1373,X1374,X1375,X1376,X1377,X1378,X1379,X1380,X1381,X1382] :
( ( ~ p__d__disjointDecomposition3(X1358,X1359,X1360)
| p__d__disjoint(X1359,X1360) )
& ( ~ p__d__disjoint(X1359,X1360)
| p__d__disjointDecomposition3(X1358,X1359,X1360) )
& ( p__d__disjoint(X1362,X1363)
| ~ p__d__disjointDecomposition4(X1361,X1362,X1363,X1364) )
& ( p__d__disjoint(X1362,X1364)
| ~ p__d__disjointDecomposition4(X1361,X1362,X1363,X1364) )
& ( p__d__disjoint(X1363,X1364)
| ~ p__d__disjointDecomposition4(X1361,X1362,X1363,X1364) )
& ( ~ p__d__disjoint(X1362,X1363)
| ~ p__d__disjoint(X1362,X1364)
| ~ p__d__disjoint(X1363,X1364)
| p__d__disjointDecomposition4(X1361,X1362,X1363,X1364) )
& ( p__d__disjoint(X1366,X1367)
| ~ p__d__disjointDecomposition5(X1365,X1366,X1367,X1368,X1369) )
& ( p__d__disjoint(X1366,X1368)
| ~ p__d__disjointDecomposition5(X1365,X1366,X1367,X1368,X1369) )
& ( p__d__disjoint(X1366,X1369)
| ~ p__d__disjointDecomposition5(X1365,X1366,X1367,X1368,X1369) )
& ( p__d__disjoint(X1367,X1368)
| ~ p__d__disjointDecomposition5(X1365,X1366,X1367,X1368,X1369) )
& ( p__d__disjoint(X1367,X1369)
| ~ p__d__disjointDecomposition5(X1365,X1366,X1367,X1368,X1369) )
& ( p__d__disjoint(X1368,X1369)
| ~ p__d__disjointDecomposition5(X1365,X1366,X1367,X1368,X1369) )
& ( ~ p__d__disjoint(X1366,X1367)
| ~ p__d__disjoint(X1366,X1368)
| ~ p__d__disjoint(X1366,X1369)
| ~ p__d__disjoint(X1367,X1368)
| ~ p__d__disjoint(X1367,X1369)
| ~ p__d__disjoint(X1368,X1369)
| p__d__disjointDecomposition5(X1365,X1366,X1367,X1368,X1369) )
& ( p__d__disjoint(X1371,X1372)
| ~ p__d__disjointDecomposition6(X1370,X1371,X1372,X1373,X1374,X1375) )
& ( p__d__disjoint(X1371,X1373)
| ~ p__d__disjointDecomposition6(X1370,X1371,X1372,X1373,X1374,X1375) )
& ( p__d__disjoint(X1371,X1374)
| ~ p__d__disjointDecomposition6(X1370,X1371,X1372,X1373,X1374,X1375) )
& ( p__d__disjoint(X1371,X1375)
| ~ p__d__disjointDecomposition6(X1370,X1371,X1372,X1373,X1374,X1375) )
& ( p__d__disjoint(X1372,X1373)
| ~ p__d__disjointDecomposition6(X1370,X1371,X1372,X1373,X1374,X1375) )
& ( p__d__disjoint(X1372,X1374)
| ~ p__d__disjointDecomposition6(X1370,X1371,X1372,X1373,X1374,X1375) )
& ( p__d__disjoint(X1372,X1375)
| ~ p__d__disjointDecomposition6(X1370,X1371,X1372,X1373,X1374,X1375) )
& ( p__d__disjoint(X1373,X1374)
| ~ p__d__disjointDecomposition6(X1370,X1371,X1372,X1373,X1374,X1375) )
& ( p__d__disjoint(X1373,X1375)
| ~ p__d__disjointDecomposition6(X1370,X1371,X1372,X1373,X1374,X1375) )
& ( p__d__disjoint(X1374,X1375)
| ~ p__d__disjointDecomposition6(X1370,X1371,X1372,X1373,X1374,X1375) )
& ( ~ p__d__disjoint(X1371,X1372)
| ~ p__d__disjoint(X1371,X1373)
| ~ p__d__disjoint(X1371,X1374)
| ~ p__d__disjoint(X1371,X1375)
| ~ p__d__disjoint(X1372,X1373)
| ~ p__d__disjoint(X1372,X1374)
| ~ p__d__disjoint(X1372,X1375)
| ~ p__d__disjoint(X1373,X1374)
| ~ p__d__disjoint(X1373,X1375)
| ~ p__d__disjoint(X1374,X1375)
| p__d__disjointDecomposition6(X1370,X1371,X1372,X1373,X1374,X1375) )
& ( p__d__disjoint(X1377,X1378)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( p__d__disjoint(X1377,X1379)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( p__d__disjoint(X1377,X1380)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( p__d__disjoint(X1377,X1381)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( p__d__disjoint(X1377,X1382)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( p__d__disjoint(X1378,X1379)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( p__d__disjoint(X1378,X1380)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( p__d__disjoint(X1378,X1381)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( p__d__disjoint(X1378,X1382)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( p__d__disjoint(X1379,X1380)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( p__d__disjoint(X1379,X1381)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( p__d__disjoint(X1379,X1382)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( p__d__disjoint(X1380,X1381)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( p__d__disjoint(X1380,X1382)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( p__d__disjoint(X1381,X1382)
| ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) )
& ( ~ p__d__disjoint(X1377,X1378)
| ~ p__d__disjoint(X1377,X1379)
| ~ p__d__disjoint(X1377,X1380)
| ~ p__d__disjoint(X1377,X1381)
| ~ p__d__disjoint(X1377,X1382)
| ~ p__d__disjoint(X1378,X1379)
| ~ p__d__disjoint(X1378,X1380)
| ~ p__d__disjoint(X1378,X1381)
| ~ p__d__disjoint(X1378,X1382)
| ~ p__d__disjoint(X1379,X1380)
| ~ p__d__disjoint(X1379,X1381)
| ~ p__d__disjoint(X1379,X1382)
| ~ p__d__disjoint(X1380,X1381)
| ~ p__d__disjoint(X1380,X1382)
| ~ p__d__disjoint(X1381,X1382)
| p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382) ) ),
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])])])])]) ).
fof(c_0_18,plain,
! [X1333,X1334,X1335,X1336,X1337,X1338,X1339,X1340,X1341,X1342,X1343,X1344,X1345,X1346,X1347,X1348,X1349,X1350,X1351,X1352,X1353,X1354,X1355,X1356,X1357] :
( ( p__d__exhaustiveDecomposition3(X1333,X1334,X1335)
| ~ p__d__partition3(X1333,X1334,X1335) )
& ( p__d__disjointDecomposition3(X1333,X1334,X1335)
| ~ p__d__partition3(X1333,X1334,X1335) )
& ( ~ p__d__exhaustiveDecomposition3(X1333,X1334,X1335)
| ~ p__d__disjointDecomposition3(X1333,X1334,X1335)
| p__d__partition3(X1333,X1334,X1335) )
& ( p__d__exhaustiveDecomposition4(X1336,X1337,X1338,X1339)
| ~ p__d__partition4(X1336,X1337,X1338,X1339) )
& ( p__d__disjointDecomposition4(X1336,X1337,X1338,X1339)
| ~ p__d__partition4(X1336,X1337,X1338,X1339) )
& ( ~ p__d__exhaustiveDecomposition4(X1336,X1337,X1338,X1339)
| ~ p__d__disjointDecomposition4(X1336,X1337,X1338,X1339)
| p__d__partition4(X1336,X1337,X1338,X1339) )
& ( p__d__exhaustiveDecomposition5(X1340,X1341,X1342,X1343,X1344)
| ~ p__d__partition5(X1340,X1341,X1342,X1343,X1344) )
& ( p__d__disjointDecomposition5(X1340,X1341,X1342,X1343,X1344)
| ~ p__d__partition5(X1340,X1341,X1342,X1343,X1344) )
& ( ~ p__d__exhaustiveDecomposition5(X1340,X1341,X1342,X1343,X1344)
| ~ p__d__disjointDecomposition5(X1340,X1341,X1342,X1343,X1344)
| p__d__partition5(X1340,X1341,X1342,X1343,X1344) )
& ( p__d__exhaustiveDecomposition6(X1345,X1346,X1347,X1348,X1349,X1350)
| ~ p__d__partition6(X1345,X1346,X1347,X1348,X1349,X1350) )
& ( p__d__disjointDecomposition6(X1345,X1346,X1347,X1348,X1349,X1350)
| ~ p__d__partition6(X1345,X1346,X1347,X1348,X1349,X1350) )
& ( ~ p__d__exhaustiveDecomposition6(X1345,X1346,X1347,X1348,X1349,X1350)
| ~ p__d__disjointDecomposition6(X1345,X1346,X1347,X1348,X1349,X1350)
| p__d__partition6(X1345,X1346,X1347,X1348,X1349,X1350) )
& ( p__d__exhaustiveDecomposition7(X1351,X1352,X1353,X1354,X1355,X1356,X1357)
| ~ p__d__partition7(X1351,X1352,X1353,X1354,X1355,X1356,X1357) )
& ( p__d__disjointDecomposition7(X1351,X1352,X1353,X1354,X1355,X1356,X1357)
| ~ p__d__partition7(X1351,X1352,X1353,X1354,X1355,X1356,X1357) )
& ( ~ p__d__exhaustiveDecomposition7(X1351,X1352,X1353,X1354,X1355,X1356,X1357)
| ~ p__d__disjointDecomposition7(X1351,X1352,X1353,X1354,X1355,X1356,X1357)
| p__d__partition7(X1351,X1352,X1353,X1354,X1355,X1356,X1357) ) ),
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])])])])]) ).
cnf(c_0_19,plain,
p__d__subclass(c__JoiningAnOrganization,c__OrganizationalProcess),
inference(split_conjunct,[status(thm)],[mergeA2369]) ).
cnf(c_0_20,plain,
( p__d__instance(X1,c__JoiningAnOrganization)
| ~ p__d__instance(X1,c__Hiring) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
p__d__instance(esk2_0,c__Hiring),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_22,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]) ).
cnf(c_0_23,plain,
( p__d__disjoint(X2,X3)
| ~ p__d__disjointDecomposition3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( p__d__disjointDecomposition3(X1,X2,X3)
| ~ p__d__partition3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
p__d__subclass(c__OrganizationalProcess,c__IntentionalProcess),
inference(split_conjunct,[status(thm)],[mergeA2364]) ).
cnf(c_0_26,plain,
( p__d__instance(X1,c__OrganizationalProcess)
| ~ p__d__instance(X1,c__JoiningAnOrganization) ),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
p__d__instance(esk2_0,c__JoiningAnOrganization),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_28,plain,
! [X1229,X1230,X1231,X1232,X1233] :
( ( ~ p__d__disjoint(X1229,X1230)
| ~ p__d__instance(X1231,X1229)
| ~ p__d__instance(X1231,X1230) )
& ( p__d__instance(esk24_2(X1232,X1233),X1232)
| p__d__disjoint(X1232,X1233) )
& ( p__d__instance(esk24_2(X1232,X1233),X1233)
| p__d__disjoint(X1232,X1233) ) ),
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_22])])])])])])]) ).
cnf(c_0_29,plain,
( p__d__disjoint(X1,X2)
| ~ p__d__partition3(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
p__d__partition3(c__Physical,c__Object,c__Process),
inference(split_conjunct,[status(thm)],[mergeA179]) ).
cnf(c_0_31,plain,
p__d__subclass(c__IntentionalProcess,c__Process),
inference(split_conjunct,[status(thm)],[mergeA2357]) ).
cnf(c_0_32,plain,
( p__d__instance(X1,c__IntentionalProcess)
| ~ p__d__instance(X1,c__OrganizationalProcess) ),
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
p__d__instance(esk2_0,c__OrganizationalProcess),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( ~ p__d__disjoint(X1,X2)
| ~ p__d__instance(X3,X1)
| ~ p__d__instance(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
p__d__disjoint(c__Object,c__Process),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( p__d__instance(X1,c__Process)
| ~ p__d__instance(X1,c__IntentionalProcess) ),
inference(spm,[status(thm)],[c_0_13,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
p__d__instance(esk2_0,c__IntentionalProcess),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( ~ p__d__instance(X1,c__Process)
| ~ p__d__instance(X1,c__Object) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
p__d__instance(esk2_0,c__Process),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
p__d__instance(esk2_0,c__Object),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.71/0.74 % Problem : CSR217+1 : TPTP v8.1.2. Released v7.3.0.
% 0.71/0.75 % Command : run_E %s %d THM
% 0.75/0.96 % Computer : n020.cluster.edu
% 0.75/0.96 % Model : x86_64 x86_64
% 0.75/0.96 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.75/0.96 % Memory : 8042.1875MB
% 0.75/0.96 % OS : Linux 3.10.0-693.el7.x86_64
% 0.75/0.96 % CPULimit : 300
% 0.75/0.96 % WCLimit : 300
% 0.75/0.96 % DateTime : Fri May 3 15:13:38 EDT 2024
% 0.75/0.96 % CPUTime :
% 1.53/1.70 Running first-order theorem proving
% 1.53/1.70 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.cVW8sKzojD/E---3.1_26140.p
% 1.57/2.19 # Version: 3.1.0
% 1.57/2.19 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.57/2.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/2.19 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.57/2.19 # Starting new_bool_3 with 300s (1) cores
% 1.57/2.19 # Starting new_bool_1 with 300s (1) cores
% 1.57/2.19 # Starting sh5l with 300s (1) cores
% 1.57/2.19 # sh5l with pid 26221 completed with status 0
% 1.57/2.19 # Result found by sh5l
% 1.57/2.19 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.57/2.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/2.19 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.57/2.19 # Starting new_bool_3 with 300s (1) cores
% 1.57/2.19 # Starting new_bool_1 with 300s (1) cores
% 1.57/2.19 # Starting sh5l with 300s (1) cores
% 1.57/2.19 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.57/2.19 # Search class: FGHSS-SSLM31-SFFFFFNN
% 1.57/2.19 # partial match(2): FGHSS-SMLM31-MFFFFFNN
% 1.57/2.19 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.57/2.19 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1.57/2.19 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 26224 completed with status 0
% 1.57/2.19 # Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 1.57/2.19 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.57/2.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.57/2.19 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.57/2.19 # Starting new_bool_3 with 300s (1) cores
% 1.57/2.19 # Starting new_bool_1 with 300s (1) cores
% 1.57/2.19 # Starting sh5l with 300s (1) cores
% 1.57/2.19 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.57/2.19 # Search class: FGHSS-SSLM31-SFFFFFNN
% 1.57/2.19 # partial match(2): FGHSS-SMLM31-MFFFFFNN
% 1.57/2.19 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.57/2.19 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 23s (1) cores
% 1.57/2.19 # Preprocessing time : 0.034 s
% 1.57/2.19
% 1.57/2.19 # Proof found!
% 1.57/2.19 # SZS status Theorem
% 1.57/2.19 # SZS output start CNFRefutation
% See solution above
% 1.57/2.20 # Parsed axioms : 7433
% 1.57/2.20 # Removed by relevancy pruning/SinE : 6603
% 1.57/2.20 # Initial clauses : 1318
% 1.57/2.20 # Removed in clause preprocessing : 1
% 1.57/2.20 # Initial clauses in saturation : 1317
% 1.57/2.20 # Processed clauses : 1611
% 1.57/2.20 # ...of these trivial : 25
% 1.57/2.20 # ...subsumed : 14
% 1.57/2.20 # ...remaining for further processing : 1572
% 1.57/2.20 # Other redundant clauses eliminated : 0
% 1.57/2.20 # Clauses deleted for lack of memory : 0
% 1.57/2.20 # Backward-subsumed : 0
% 1.57/2.20 # Backward-rewritten : 0
% 1.57/2.20 # Generated clauses : 3668
% 1.57/2.20 # ...of the previous two non-redundant : 3413
% 1.57/2.20 # ...aggressively subsumed : 0
% 1.57/2.20 # Contextual simplify-reflections : 302
% 1.57/2.20 # Paramodulations : 3654
% 1.57/2.20 # Factorizations : 0
% 1.57/2.20 # NegExts : 0
% 1.57/2.20 # Equation resolutions : 14
% 1.57/2.20 # Disequality decompositions : 0
% 1.57/2.20 # Total rewrite steps : 48
% 1.57/2.20 # ...of those cached : 26
% 1.57/2.20 # Propositional unsat checks : 0
% 1.57/2.20 # Propositional check models : 0
% 1.57/2.20 # Propositional check unsatisfiable : 0
% 1.57/2.20 # Propositional clauses : 0
% 1.57/2.20 # Propositional clauses after purity: 0
% 1.57/2.20 # Propositional unsat core size : 0
% 1.57/2.20 # Propositional preprocessing time : 0.000
% 1.57/2.20 # Propositional encoding time : 0.000
% 1.57/2.20 # Propositional solver time : 0.000
% 1.57/2.20 # Success case prop preproc time : 0.000
% 1.57/2.20 # Success case prop encoding time : 0.000
% 1.57/2.20 # Success case prop solver time : 0.000
% 1.57/2.20 # Current number of processed clauses : 1572
% 1.57/2.20 # Positive orientable unit clauses : 499
% 1.57/2.20 # Positive unorientable unit clauses: 0
% 1.57/2.20 # Negative unit clauses : 0
% 1.57/2.20 # Non-unit-clauses : 1073
% 1.57/2.20 # Current number of unprocessed clauses: 3111
% 1.57/2.20 # ...number of literals in the above : 9384
% 1.57/2.20 # Current number of archived formulas : 0
% 1.57/2.20 # Current number of archived clauses : 0
% 1.57/2.20 # Clause-clause subsumption calls (NU) : 366682
% 1.57/2.20 # Rec. Clause-clause subsumption calls : 148637
% 1.57/2.20 # Non-unit clause-clause subsumptions : 316
% 1.57/2.20 # Unit Clause-clause subsumption calls : 55471
% 1.57/2.20 # Rewrite failures with RHS unbound : 0
% 1.57/2.20 # BW rewrite match attempts : 1
% 1.57/2.20 # BW rewrite match successes : 0
% 1.57/2.20 # Condensation attempts : 0
% 1.57/2.20 # Condensation successes : 0
% 1.57/2.20 # Termbank termtop insertions : 174004
% 1.57/2.20 # Search garbage collected termcells : 50478
% 1.57/2.20
% 1.57/2.20 # -------------------------------------------------
% 1.57/2.20 # User time : 0.281 s
% 1.57/2.20 # System time : 0.036 s
% 1.57/2.20 # Total time : 0.317 s
% 1.57/2.20 # Maximum resident set size: 19072 pages
% 1.57/2.20
% 1.57/2.20 # -------------------------------------------------
% 1.57/2.20 # User time : 0.429 s
% 1.57/2.20 # System time : 0.047 s
% 1.57/2.20 # Total time : 0.476 s
% 1.57/2.20 # Maximum resident set size: 9768 pages
% 1.57/2.20 % E---3.1 exiting
% 3.03/2.20 % E exiting
%------------------------------------------------------------------------------