%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR217+1 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:17:46 PM UTC 2026
% Result : Theorem 2.71s 1.87s
% Output : CNFRefutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 47 ( 18 unt; 0 def)
% Number of atoms : 293 ( 5 equ)
% Maximal formula atoms : 110 ( 6 avg)
% Number of connectives : 370 ( 124 ~; 116 |; 109 &)
% ( 12 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 81 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 22 ( 20 usr; 1 prp; 0-7 aty)
% Number of functors : 14 ( 14 usr; 12 con; 0-2 aty)
% Number of variables : 153 ( 3 sgn 129 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(antonymPattern10059,conjecture,
! [X1,X2] :
( p__d__instance(X2,c__Object)
=> ( ( p__attribute(X2,c__Unemployed)
& p__d__instance(X1,c__Hiring) )
=> X1 != X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antonymPattern10059) ).
fof(predefinitionsA12,axiom,
! [X1,X2,X3] :
( ( p__d__subclass(X2,X3)
& p__d__instance(X1,X2) )
=> p__d__instance(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',predefinitionsA12) ).
fof(mergeA2378,axiom,
p__d__subclass(c__Hiring,c__JoiningAnOrganization),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2378) ).
fof(predefinitionsA24,axiom,
( ! [X7,X8,X9,X10,X11,X12,X13] :
( p__d__disjointDecomposition7(X7,X8,X9,X10,X11,X12,X13)
<=> ( p__d__disjoint(X12,X13)
& p__d__disjoint(X11,X13)
& p__d__disjoint(X11,X12)
& p__d__disjoint(X10,X13)
& p__d__disjoint(X10,X12)
& p__d__disjoint(X10,X11)
& p__d__disjoint(X9,X13)
& p__d__disjoint(X9,X12)
& p__d__disjoint(X9,X11)
& p__d__disjoint(X9,X10)
& p__d__disjoint(X8,X13)
& p__d__disjoint(X8,X12)
& p__d__disjoint(X8,X11)
& p__d__disjoint(X8,X10)
& p__d__disjoint(X8,X9) ) )
& ! [X7,X8,X9,X10,X11,X12] :
( p__d__disjointDecomposition6(X7,X8,X9,X10,X11,X12)
<=> ( p__d__disjoint(X11,X12)
& p__d__disjoint(X10,X12)
& p__d__disjoint(X10,X11)
& p__d__disjoint(X9,X12)
& p__d__disjoint(X9,X11)
& p__d__disjoint(X9,X10)
& p__d__disjoint(X8,X12)
& p__d__disjoint(X8,X11)
& p__d__disjoint(X8,X10)
& p__d__disjoint(X8,X9) ) )
& ! [X7,X8,X9,X10,X11] :
( p__d__disjointDecomposition5(X7,X8,X9,X10,X11)
<=> ( p__d__disjoint(X10,X11)
& p__d__disjoint(X9,X11)
& p__d__disjoint(X9,X10)
& p__d__disjoint(X8,X11)
& p__d__disjoint(X8,X10)
& p__d__disjoint(X8,X9) ) )
& ! [X7,X8,X9,X10] :
( p__d__disjointDecomposition4(X7,X8,X9,X10)
<=> ( p__d__disjoint(X9,X10)
& p__d__disjoint(X8,X10)
& p__d__disjoint(X8,X9) ) )
& ! [X7,X8,X9] :
( p__d__disjointDecomposition3(X7,X8,X9)
<=> p__d__disjoint(X8,X9) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',predefinitionsA24) ).
fof(predefinitionsA18,axiom,
( ! [X7,X8,X9,X10,X11,X12,X13] :
( p__d__partition7(X7,X8,X9,X10,X11,X12,X13)
<=> ( p__d__disjointDecomposition7(X7,X8,X9,X10,X11,X12,X13)
& p__d__exhaustiveDecomposition7(X7,X8,X9,X10,X11,X12,X13) ) )
& ! [X7,X8,X9,X10,X11,X12] :
( p__d__partition6(X7,X8,X9,X10,X11,X12)
<=> ( p__d__disjointDecomposition6(X7,X8,X9,X10,X11,X12)
& p__d__exhaustiveDecomposition6(X7,X8,X9,X10,X11,X12) ) )
& ! [X7,X8,X9,X10,X11] :
( p__d__partition5(X7,X8,X9,X10,X11)
<=> ( p__d__disjointDecomposition5(X7,X8,X9,X10,X11)
& p__d__exhaustiveDecomposition5(X7,X8,X9,X10,X11) ) )
& ! [X7,X8,X9,X10] :
( p__d__partition4(X7,X8,X9,X10)
<=> ( p__d__disjointDecomposition4(X7,X8,X9,X10)
& p__d__exhaustiveDecomposition4(X7,X8,X9,X10) ) )
& ! [X7,X8,X9] :
( p__d__partition3(X7,X8,X9)
<=> ( p__d__disjointDecomposition3(X7,X8,X9)
& p__d__exhaustiveDecomposition3(X7,X8,X9) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',predefinitionsA18) ).
fof(mergeA2369,axiom,
p__d__subclass(c__JoiningAnOrganization,c__OrganizationalProcess),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2369) ).
fof(predefinitionsA15,axiom,
! [X4,X5] :
( p__d__disjoint(X4,X5)
<=> ! [X6] :
( ~ p__d__instance(X6,X5)
| ~ p__d__instance(X6,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',predefinitionsA15) ).
fof(typeA30,axiom,
! [X1038,X1039] :
( p__agent(X1038,X1039)
=> ( p__d__instance(X1038,c__Process)
& p__d__instance(X1039,c__Agent) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',typeA30) ).
fof(mergeA2359,axiom,
! [X64] :
( p__d__instance(X64,c__IntentionalProcess)
=> ? [X66] :
( p__agent(X64,X66)
& p__d__instance(X66,c__CognitiveAgent) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2359) ).
fof(mergeA2364,axiom,
p__d__subclass(c__OrganizationalProcess,c__IntentionalProcess),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA2364) ).
fof(mergeA179,axiom,
p__d__partition3(c__Physical,c__Object,c__Process),
file('/export/starexec/sandbox/benchmark/Axioms/CSR006+0.ax',mergeA179) ).
fof(c_0_11,negated_conjecture,
~ ! [X1,X2] :
( p__d__instance(X2,c__Object)
=> ( ( p__attribute(X2,c__Unemployed)
& p__d__instance(X1,c__Hiring) )
=> X1 != X2 ) ),
inference(assume_negation,[status(cth)],[antonymPattern10059]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X2] :
( p__d__instance(X2,c__Object)
=> ( ( p__attribute(X2,c__Unemployed)
& p__d__instance(X1,c__Hiring) )
=> X1 != X2 ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_13,plain,
! [X1054,X1055,X1056] :
( p__d__instance(X1054,X1056)
| ~ p__d__subclass(X1055,X1056)
| ~ p__d__instance(X1054,X1055) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[predefinitionsA12])])]) ).
fof(c_0_14,negated_conjecture,
( esk1_0 = esk2_0
& p__attribute(esk2_0,c__Unemployed)
& p__d__instance(esk1_0,c__Hiring)
& p__d__instance(esk2_0,c__Object) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_15,plain,
( ~ p__d__subclass(X2,X3)
| ~ p__d__instance(X1,X2)
| p__d__instance(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
p__d__subclass(c__Hiring,c__JoiningAnOrganization),
inference(split_conjunct,[status(thm)],[mergeA2378]) ).
cnf(c_0_17,negated_conjecture,
p__d__instance(esk1_0,c__Hiring),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
esk1_0 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,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__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382)
| ~ p__d__disjoint(X1381,X1382)
| ~ p__d__disjoint(X1380,X1382)
| ~ p__d__disjoint(X1380,X1381)
| ~ p__d__disjoint(X1379,X1382)
| ~ p__d__disjoint(X1379,X1381)
| ~ p__d__disjoint(X1379,X1380)
| ~ p__d__disjoint(X1378,X1382)
| ~ p__d__disjoint(X1378,X1381)
| ~ p__d__disjoint(X1378,X1380)
| ~ p__d__disjoint(X1378,X1379)
| ~ p__d__disjoint(X1377,X1382)
| ~ p__d__disjoint(X1377,X1381)
| ~ p__d__disjoint(X1377,X1380)
| ~ p__d__disjoint(X1377,X1379)
| ~ p__d__disjoint(X1377,X1378) )
& ( ~ 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(X1380,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(X1379,X1382) )
& ( ~ 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,X1380) )
& ( ~ 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(X1378,X1381) )
& ( ~ 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,X1379) )
& ( ~ 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(X1377,X1381) )
& ( ~ 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,X1379) )
& ( ~ p__d__disjointDecomposition7(X1376,X1377,X1378,X1379,X1380,X1381,X1382)
| p__d__disjoint(X1377,X1378) )
& ( p__d__disjointDecomposition6(X1370,X1371,X1372,X1373,X1374,X1375)
| ~ p__d__disjoint(X1374,X1375)
| ~ p__d__disjoint(X1373,X1375)
| ~ p__d__disjoint(X1373,X1374)
| ~ p__d__disjoint(X1372,X1375)
| ~ p__d__disjoint(X1372,X1374)
| ~ p__d__disjoint(X1372,X1373)
| ~ p__d__disjoint(X1371,X1375)
| ~ p__d__disjoint(X1371,X1374)
| ~ p__d__disjoint(X1371,X1373)
| ~ p__d__disjoint(X1371,X1372) )
& ( ~ 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(X1373,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(X1372,X1375) )
& ( ~ 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,X1373) )
& ( ~ 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(X1371,X1374) )
& ( ~ 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,X1372) )
& ( p__d__disjointDecomposition5(X1365,X1366,X1367,X1368,X1369)
| ~ p__d__disjoint(X1368,X1369)
| ~ p__d__disjoint(X1367,X1369)
| ~ p__d__disjoint(X1367,X1368)
| ~ p__d__disjoint(X1366,X1369)
| ~ p__d__disjoint(X1366,X1368)
| ~ p__d__disjoint(X1366,X1367) )
& ( ~ p__d__disjointDecomposition5(X1365,X1366,X1367,X1368,X1369)
| p__d__disjoint(X1368,X1369) )
& ( ~ p__d__disjointDecomposition5(X1365,X1366,X1367,X1368,X1369)
| p__d__disjoint(X1367,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(X1366,X1369) )
& ( ~ 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,X1367) )
& ( p__d__disjointDecomposition4(X1361,X1362,X1363,X1364)
| ~ p__d__disjoint(X1363,X1364)
| ~ p__d__disjoint(X1362,X1364)
| ~ p__d__disjoint(X1362,X1363) )
& ( ~ p__d__disjointDecomposition4(X1361,X1362,X1363,X1364)
| p__d__disjoint(X1363,X1364) )
& ( ~ p__d__disjointDecomposition4(X1361,X1362,X1363,X1364)
| p__d__disjoint(X1362,X1364) )
& ( ~ p__d__disjointDecomposition4(X1361,X1362,X1363,X1364)
| p__d__disjoint(X1362,X1363) )
& ( p__d__disjointDecomposition3(X1358,X1359,X1360)
| ~ p__d__disjoint(X1359,X1360) )
& ( p__d__disjoint(X1359,X1360)
| ~ p__d__disjointDecomposition3(X1358,X1359,X1360) ) ),
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_20,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__partition7(X1351,X1352,X1353,X1354,X1355,X1356,X1357)
| ~ p__d__disjointDecomposition7(X1351,X1352,X1353,X1354,X1355,X1356,X1357)
| ~ 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__partition6(X1345,X1346,X1347,X1348,X1349,X1350)
| ~ p__d__disjointDecomposition6(X1345,X1346,X1347,X1348,X1349,X1350)
| ~ 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__partition5(X1340,X1341,X1342,X1343,X1344)
| ~ p__d__disjointDecomposition5(X1340,X1341,X1342,X1343,X1344)
| ~ 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__partition4(X1336,X1337,X1338,X1339)
| ~ p__d__disjointDecomposition4(X1336,X1337,X1338,X1339)
| ~ 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__partition3(X1333,X1334,X1335)
| ~ p__d__disjointDecomposition3(X1333,X1334,X1335)
| ~ 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) ) ),
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_21,plain,
p__d__subclass(c__JoiningAnOrganization,c__OrganizationalProcess),
inference(split_conjunct,[status(thm)],[mergeA2369]) ).
cnf(c_0_22,plain,
( ~ p__d__instance(X1,c__Hiring)
| p__d__instance(X1,c__JoiningAnOrganization) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
p__d__instance(esk2_0,c__Hiring),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_24,plain,
! [X4,X5] :
( p__d__disjoint(X4,X5)
<=> ! [X6] :
( ~ p__d__instance(X6,X5)
| ~ p__d__instance(X6,X4) ) ),
inference(fof_simplification,[status(thm)],[predefinitionsA15]) ).
cnf(c_0_25,plain,
( ~ p__d__disjointDecomposition3(X1,X2,X3)
| p__d__disjoint(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ~ p__d__partition3(X1,X2,X3)
| p__d__disjointDecomposition3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_27,plain,
! [X1111,X1112] :
( ( ~ p__agent(X1111,X1112)
| p__d__instance(X1111,c__Process) )
& ( ~ p__agent(X1111,X1112)
| p__d__instance(X1112,c__Agent) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[typeA30])])])]) ).
fof(c_0_28,plain,
! [X1095] :
( ( ~ p__d__instance(X1095,c__IntentionalProcess)
| p__agent(X1095,esk5_1(X1095)) )
& ( ~ p__d__instance(X1095,c__IntentionalProcess)
| p__d__instance(esk5_1(X1095),c__CognitiveAgent) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mergeA2359])])])])]) ).
cnf(c_0_29,plain,
p__d__subclass(c__OrganizationalProcess,c__IntentionalProcess),
inference(split_conjunct,[status(thm)],[mergeA2364]) ).
cnf(c_0_30,plain,
( ~ p__d__instance(X1,c__JoiningAnOrganization)
| p__d__instance(X1,c__OrganizationalProcess) ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_31,negated_conjecture,
p__d__instance(esk2_0,c__JoiningAnOrganization),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_32,plain,
! [X1229,X1230,X1231,X1232,X1233] :
( ( p__d__disjoint(X1232,X1233)
| p__d__instance(esk24_2(X1232,X1233),X1233) )
& ( p__d__disjoint(X1232,X1233)
| p__d__instance(esk24_2(X1232,X1233),X1232) )
& ( ~ p__d__instance(X1231,X1230)
| ~ p__d__instance(X1231,X1229)
| ~ p__d__disjoint(X1229,X1230) ) ),
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_24])])])])])])]) ).
cnf(c_0_33,plain,
( ~ p__d__partition3(X3,X1,X2)
| p__d__disjoint(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
p__d__partition3(c__Physical,c__Object,c__Process),
inference(split_conjunct,[status(thm)],[mergeA179]) ).
cnf(c_0_35,plain,
( ~ p__agent(X1,X2)
| p__d__instance(X1,c__Process) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
( ~ p__d__instance(X1,c__IntentionalProcess)
| p__agent(X1,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,plain,
( ~ p__d__instance(X1,c__OrganizationalProcess)
| p__d__instance(X1,c__IntentionalProcess) ),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_38,negated_conjecture,
p__d__instance(esk2_0,c__OrganizationalProcess),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
( ~ p__d__instance(X3,X2)
| ~ p__d__instance(X3,X1)
| ~ p__d__disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
p__d__disjoint(c__Object,c__Process),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( ~ p__d__instance(X1,c__IntentionalProcess)
| p__d__instance(X1,c__Process) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
p__d__instance(esk2_0,c__IntentionalProcess),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
( ~ p__d__instance(X1,c__Object)
| ~ p__d__instance(X1,c__Process) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
p__d__instance(esk2_0,c__Process),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
p__d__instance(esk2_0,c__Object),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR217+1 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 % Computer : n020.cluster.edu
% 0.12/0.41 % Model : x86_64 x86_64
% 0.12/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.41 % Memory : 8046.5625MB
% 0.12/0.41 % OS : Linux 6.8.0-71-generic
% 0.12/0.41 % CPULimit : 300
% 0.12/0.41 % WCLimit : 300
% 0.12/0.41 % DateTime : Mon Sep 21 15:18:33 UTC 2026
% 0.12/0.41 % CPUTime :
% 0.12/0.41 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.46 Running first-order theorem proving
% 0.12/0.46 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/benchmark/theBenchmark.p
% 2.71/1.87 % Version: 3.5.1
% 2.71/1.87 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.71/1.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.71/1.87 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.71/1.87 % Starting new_bool_3 with 300s (1) cores
% 2.71/1.87 % Starting new_bool_1 with 300s (1) cores
% 2.71/1.87 % Starting sh5l with 300s (1) cores
% 2.71/1.87 % sh5l with pid 3239302 completed with status 0
% 2.71/1.87 % Result found by sh5l
% 2.71/1.87 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.71/1.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.71/1.87 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.71/1.87 % Starting new_bool_3 with 300s (1) cores
% 2.71/1.87 % Starting new_bool_1 with 300s (1) cores
% 2.71/1.87 % Starting sh5l with 300s (1) cores
% 2.71/1.87 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 2.71/1.87 % SinE strategy is gf500_gu_R04_F100_L20000
% 2.71/1.87 % Search class: FGHSS-SSLM31-SFFFFFNN
% 2.71/1.87 % partial match(2): FGHSS-SMLM31-MFFFFFNN
% 2.71/1.87 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2.71/1.87 % Starting SubtermCWHack with 28s (1) cores
% 2.71/1.87 % SubtermCWHack with pid 3239306 completed with status 0
% 2.71/1.87 % Result found by SubtermCWHack
% 2.71/1.87 % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.71/1.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.71/1.87 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.71/1.87 % Starting new_bool_3 with 300s (1) cores
% 2.71/1.87 % Starting new_bool_1 with 300s (1) cores
% 2.71/1.87 % Starting sh5l with 300s (1) cores
% 2.71/1.87 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 2.71/1.87 % SinE strategy is gf500_gu_R04_F100_L20000
% 2.71/1.87 % Search class: FGHSS-SSLM31-SFFFFFNN
% 2.71/1.87 % partial match(2): FGHSS-SMLM31-MFFFFFNN
% 2.71/1.87 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2.71/1.87 % Starting SubtermCWHack with 28s (1) cores
% 2.71/1.87 % Preprocessing time : 0.033 s
% 2.71/1.87
% 2.71/1.87 % Proof found!
% 2.71/1.87 % SZS status Theorem
% 2.71/1.87 % SZS output start CNFRefutation
% See solution above
% 2.71/1.87 % Parsed axioms : 7433
% 2.71/1.87 % Removed by relevancy pruning/SinE : 6603
% 2.71/1.87 % Initial clauses : 1318
% 2.71/1.87 % Removed in clause preprocessing : 1
% 2.71/1.87 % Initial clauses in saturation : 1317
% 2.71/1.87 % Processed clauses : 3501
% 2.71/1.87 % ...of these trivial : 15
% 2.71/1.87 % ...subsumed : 91
% 2.71/1.87 % ...remaining for further processing : 3395
% 2.71/1.87 % Other redundant clauses eliminated : 8
% 2.71/1.87 % Clauses deleted for lack of memory : 0
% 2.71/1.87 % Backward-subsumed : 4
% 2.71/1.87 % Backward-rewritten : 21
% 2.71/1.87 % Generated clauses : 10344
% 2.71/1.87 % ...of the previous two non-redundant : 9657
% 2.71/1.87 % ...aggressively subsumed : 0
% 2.71/1.87 % Contextual simplify-reflections : 68
% 2.71/1.87 % Paramodulations : 10335
% 2.71/1.87 % Factorizations : 0
% 2.71/1.87 % NegExts : 0
% 2.71/1.87 % Equation resolutions : 9
% 2.71/1.87 % Disequality decompositions : 0
% 2.71/1.87 % Total rewrite steps : 679
% 2.71/1.87 % ...of those cached : 200
% 2.71/1.87 % Propositional unsat checks : 0
% 2.71/1.87 % Propositional check models : 0
% 2.71/1.87 % Propositional check unsatisfiable : 0
% 2.71/1.87 % Propositional clauses : 0
% 2.71/1.87 % Propositional clauses after purity: 0
% 2.71/1.87 % Propositional unsat core size : 0
% 2.71/1.87 % Propositional preprocessing time : 0.000
% 2.71/1.87 % Propositional encoding time : 0.000
% 2.71/1.87 % Propositional solver time : 0.000
% 2.71/1.87 % Success case prop preproc time : 0.000
% 2.71/1.87 % Success case prop encoding time : 0.000
% 2.71/1.87 % Success case prop solver time : 0.000
% 2.71/1.87 % Current number of processed clauses : 3362
% 2.71/1.87 % Positive orientable unit clauses : 994
% 2.71/1.87 % Positive unorientable unit clauses: 0
% 2.71/1.87 % Negative unit clauses : 105
% 2.71/1.87 % Non-unit-clauses : 2263
% 2.71/1.87 % Current number of unprocessed clauses: 7413
% 2.71/1.87 % ...number of literals in the above : 16635
% 2.71/1.87 % Current number of archived formulas : 0
% 2.71/1.87 % Current number of archived clauses : 25
% 2.71/1.87 % Clause-clause subsumption calls (NU) : 946575
% 2.71/1.87 % Rec. Clause-clause subsumption calls : 741389
% 2.71/1.87 % Non-unit clause-clause subsumptions : 123
% 2.71/1.87 % Unit Clause-clause subsumption calls : 268070
% 2.71/1.87 % Rewrite failures with RHS unbound : 0
% 2.71/1.87 % BW rewrite match attempts : 310
% 2.71/1.87 % BW rewrite match successes : 10
% 2.71/1.87 % Condensation attempts : 0
% 2.71/1.87 % Condensation successes : 0
% 2.71/1.87 % Termbank termtop insertions : 224965
% 2.71/1.87 % Search garbage collected termcells : 50478
% 2.71/1.87
% 2.71/1.87 % -------------------------------------------------
% 2.71/1.87 % User time : 0.975 s
% 2.71/1.87 % System time : 0.067 s
% 2.71/1.87 % Total time : 1.042 s
% 2.71/1.87 % Maximum resident set size: 20952 pages
% 2.71/1.87
% 2.71/1.87 % -------------------------------------------------
% 2.71/1.87 % User time : 1.137 s
% 2.71/1.87 % System time : 0.094 s
% 2.71/1.87 % Total time : 1.230 s
% 2.71/1.87 % Maximum resident set size: 12800 pages
% 2.71/1.87 % E exiting
%------------------------------------------------------------------------------