TSTP Solution File: CSR217+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR217+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Fri Jul 15 03:03:56 EDT 2022
% Result : Theorem 0.82s 6.01s
% Output : CNFRefutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 20 unt; 0 def)
% Number of atoms : 270 ( 4 equ)
% Maximal formula atoms : 110 ( 6 avg)
% Number of connectives : 343 ( 114 ~; 109 |; 104 &)
% ( 11 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 106 ( 8 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 : 188 ( 54 sgn 168 !; 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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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/sandbox2/benchmark/Axioms/CSR006+0.ax',predefinitionsA12) ).
fof(mergeA2378,axiom,
p__d__subclass(c__Hiring,c__JoiningAnOrganization),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR006+0.ax',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/sandbox2/benchmark/Axioms/CSR006+0.ax',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/sandbox2/benchmark/Axioms/CSR006+0.ax',predefinitionsA18) ).
fof(mergeA2369,axiom,
p__d__subclass(c__JoiningAnOrganization,c__OrganizationalProcess),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR006+0.ax',mergeA2369) ).
fof(mergeA2364,axiom,
p__d__subclass(c__OrganizationalProcess,c__IntentionalProcess),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR006+0.ax',mergeA2364) ).
fof(predefinitionsA15,axiom,
! [X4,X5] :
( p__d__disjoint(X4,X5)
<=> ! [X6] :
( ~ p__d__instance(X6,X4)
| ~ p__d__instance(X6,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR006+0.ax',predefinitionsA15) ).
fof(mergeA179,axiom,
p__d__partition3(c__Physical,c__Object,c__Process),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR006+0.ax',mergeA179) ).
fof(mergeA2357,axiom,
p__d__subclass(c__IntentionalProcess,c__Process),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR006+0.ax',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(assume_negation,[status(cth)],[antonymPattern10059]) ).
fof(c_0_11,plain,
! [X4,X5,X6] :
( ~ p__d__instance(X4,X5)
| ~ p__d__subclass(X5,X6)
| p__d__instance(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[predefinitionsA12])]) ).
fof(c_0_12,negated_conjecture,
( p__d__instance(esk1217_0,c__Object)
& p__d__instance(esk1216_0,c__Hiring)
& p__attribute(esk1217_0,c__Unemployed)
& esk1216_0 = esk1217_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,X2)
| ~ p__d__subclass(X3,X2)
| ~ p__d__instance(X1,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(esk1216_0,c__Hiring),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
esk1216_0 = esk1217_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X14,X15,X16,X14,X15,X16,X17,X18,X19,X20,X17,X18,X19,X20,X21,X22,X23,X24,X25,X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38,X32,X33,X34,X35,X36,X37,X38] :
( ( ~ p__d__disjointDecomposition3(X14,X15,X16)
| p__d__disjoint(X15,X16) )
& ( ~ p__d__disjoint(X15,X16)
| p__d__disjointDecomposition3(X14,X15,X16) )
& ( p__d__disjoint(X18,X19)
| ~ p__d__disjointDecomposition4(X17,X18,X19,X20) )
& ( p__d__disjoint(X18,X20)
| ~ p__d__disjointDecomposition4(X17,X18,X19,X20) )
& ( p__d__disjoint(X19,X20)
| ~ p__d__disjointDecomposition4(X17,X18,X19,X20) )
& ( ~ p__d__disjoint(X18,X19)
| ~ p__d__disjoint(X18,X20)
| ~ p__d__disjoint(X19,X20)
| p__d__disjointDecomposition4(X17,X18,X19,X20) )
& ( p__d__disjoint(X22,X23)
| ~ p__d__disjointDecomposition5(X21,X22,X23,X24,X25) )
& ( p__d__disjoint(X22,X24)
| ~ p__d__disjointDecomposition5(X21,X22,X23,X24,X25) )
& ( p__d__disjoint(X22,X25)
| ~ p__d__disjointDecomposition5(X21,X22,X23,X24,X25) )
& ( p__d__disjoint(X23,X24)
| ~ p__d__disjointDecomposition5(X21,X22,X23,X24,X25) )
& ( p__d__disjoint(X23,X25)
| ~ p__d__disjointDecomposition5(X21,X22,X23,X24,X25) )
& ( p__d__disjoint(X24,X25)
| ~ p__d__disjointDecomposition5(X21,X22,X23,X24,X25) )
& ( ~ p__d__disjoint(X22,X23)
| ~ p__d__disjoint(X22,X24)
| ~ p__d__disjoint(X22,X25)
| ~ p__d__disjoint(X23,X24)
| ~ p__d__disjoint(X23,X25)
| ~ p__d__disjoint(X24,X25)
| p__d__disjointDecomposition5(X21,X22,X23,X24,X25) )
& ( p__d__disjoint(X27,X28)
| ~ p__d__disjointDecomposition6(X26,X27,X28,X29,X30,X31) )
& ( p__d__disjoint(X27,X29)
| ~ p__d__disjointDecomposition6(X26,X27,X28,X29,X30,X31) )
& ( p__d__disjoint(X27,X30)
| ~ p__d__disjointDecomposition6(X26,X27,X28,X29,X30,X31) )
& ( p__d__disjoint(X27,X31)
| ~ p__d__disjointDecomposition6(X26,X27,X28,X29,X30,X31) )
& ( p__d__disjoint(X28,X29)
| ~ p__d__disjointDecomposition6(X26,X27,X28,X29,X30,X31) )
& ( p__d__disjoint(X28,X30)
| ~ p__d__disjointDecomposition6(X26,X27,X28,X29,X30,X31) )
& ( p__d__disjoint(X28,X31)
| ~ p__d__disjointDecomposition6(X26,X27,X28,X29,X30,X31) )
& ( p__d__disjoint(X29,X30)
| ~ p__d__disjointDecomposition6(X26,X27,X28,X29,X30,X31) )
& ( p__d__disjoint(X29,X31)
| ~ p__d__disjointDecomposition6(X26,X27,X28,X29,X30,X31) )
& ( p__d__disjoint(X30,X31)
| ~ p__d__disjointDecomposition6(X26,X27,X28,X29,X30,X31) )
& ( ~ p__d__disjoint(X27,X28)
| ~ p__d__disjoint(X27,X29)
| ~ p__d__disjoint(X27,X30)
| ~ p__d__disjoint(X27,X31)
| ~ p__d__disjoint(X28,X29)
| ~ p__d__disjoint(X28,X30)
| ~ p__d__disjoint(X28,X31)
| ~ p__d__disjoint(X29,X30)
| ~ p__d__disjoint(X29,X31)
| ~ p__d__disjoint(X30,X31)
| p__d__disjointDecomposition6(X26,X27,X28,X29,X30,X31) )
& ( p__d__disjoint(X33,X34)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjoint(X33,X35)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjoint(X33,X36)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjoint(X33,X37)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjoint(X33,X38)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjoint(X34,X35)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjoint(X34,X36)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjoint(X34,X37)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjoint(X34,X38)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjoint(X35,X36)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjoint(X35,X37)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjoint(X35,X38)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjoint(X36,X37)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjoint(X36,X38)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjoint(X37,X38)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) )
& ( ~ p__d__disjoint(X33,X34)
| ~ p__d__disjoint(X33,X35)
| ~ p__d__disjoint(X33,X36)
| ~ p__d__disjoint(X33,X37)
| ~ p__d__disjoint(X33,X38)
| ~ p__d__disjoint(X34,X35)
| ~ p__d__disjoint(X34,X36)
| ~ p__d__disjoint(X34,X37)
| ~ p__d__disjoint(X34,X38)
| ~ p__d__disjoint(X35,X36)
| ~ p__d__disjoint(X35,X37)
| ~ p__d__disjoint(X35,X38)
| ~ p__d__disjoint(X36,X37)
| ~ p__d__disjoint(X36,X38)
| ~ p__d__disjoint(X37,X38)
| p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[predefinitionsA24])])])])])]) ).
fof(c_0_18,plain,
! [X14,X15,X16,X14,X15,X16,X17,X18,X19,X20,X17,X18,X19,X20,X21,X22,X23,X24,X25,X21,X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36,X37,X38,X32,X33,X34,X35,X36,X37,X38] :
( ( p__d__exhaustiveDecomposition3(X14,X15,X16)
| ~ p__d__partition3(X14,X15,X16) )
& ( p__d__disjointDecomposition3(X14,X15,X16)
| ~ p__d__partition3(X14,X15,X16) )
& ( ~ p__d__exhaustiveDecomposition3(X14,X15,X16)
| ~ p__d__disjointDecomposition3(X14,X15,X16)
| p__d__partition3(X14,X15,X16) )
& ( p__d__exhaustiveDecomposition4(X17,X18,X19,X20)
| ~ p__d__partition4(X17,X18,X19,X20) )
& ( p__d__disjointDecomposition4(X17,X18,X19,X20)
| ~ p__d__partition4(X17,X18,X19,X20) )
& ( ~ p__d__exhaustiveDecomposition4(X17,X18,X19,X20)
| ~ p__d__disjointDecomposition4(X17,X18,X19,X20)
| p__d__partition4(X17,X18,X19,X20) )
& ( p__d__exhaustiveDecomposition5(X21,X22,X23,X24,X25)
| ~ p__d__partition5(X21,X22,X23,X24,X25) )
& ( p__d__disjointDecomposition5(X21,X22,X23,X24,X25)
| ~ p__d__partition5(X21,X22,X23,X24,X25) )
& ( ~ p__d__exhaustiveDecomposition5(X21,X22,X23,X24,X25)
| ~ p__d__disjointDecomposition5(X21,X22,X23,X24,X25)
| p__d__partition5(X21,X22,X23,X24,X25) )
& ( p__d__exhaustiveDecomposition6(X26,X27,X28,X29,X30,X31)
| ~ p__d__partition6(X26,X27,X28,X29,X30,X31) )
& ( p__d__disjointDecomposition6(X26,X27,X28,X29,X30,X31)
| ~ p__d__partition6(X26,X27,X28,X29,X30,X31) )
& ( ~ p__d__exhaustiveDecomposition6(X26,X27,X28,X29,X30,X31)
| ~ p__d__disjointDecomposition6(X26,X27,X28,X29,X30,X31)
| p__d__partition6(X26,X27,X28,X29,X30,X31) )
& ( p__d__exhaustiveDecomposition7(X32,X33,X34,X35,X36,X37,X38)
| ~ p__d__partition7(X32,X33,X34,X35,X36,X37,X38) )
& ( p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38)
| ~ p__d__partition7(X32,X33,X34,X35,X36,X37,X38) )
& ( ~ p__d__exhaustiveDecomposition7(X32,X33,X34,X35,X36,X37,X38)
| ~ p__d__disjointDecomposition7(X32,X33,X34,X35,X36,X37,X38)
| p__d__partition7(X32,X33,X34,X35,X36,X37,X38) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[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(esk1217_0,c__Hiring),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( p__d__disjoint(X1,X2)
| ~ p__d__disjointDecomposition3(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( p__d__disjointDecomposition3(X1,X2,X3)
| ~ p__d__partition3(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
p__d__subclass(c__OrganizationalProcess,c__IntentionalProcess),
inference(split_conjunct,[status(thm)],[mergeA2364]) ).
cnf(c_0_25,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_26,negated_conjecture,
p__d__instance(esk1217_0,c__JoiningAnOrganization),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_27,plain,
! [X7,X8,X9,X7,X8] :
( ( ~ p__d__disjoint(X7,X8)
| ~ p__d__instance(X9,X7)
| ~ p__d__instance(X9,X8) )
& ( p__d__instance(esk1_2(X7,X8),X7)
| p__d__disjoint(X7,X8) )
& ( p__d__instance(esk1_2(X7,X8),X8)
| p__d__disjoint(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[predefinitionsA15])])])])])])])]) ).
cnf(c_0_28,plain,
( p__d__disjoint(X1,X2)
| ~ p__d__partition3(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
p__d__partition3(c__Physical,c__Object,c__Process),
inference(split_conjunct,[status(thm)],[mergeA179]) ).
cnf(c_0_30,plain,
p__d__subclass(c__IntentionalProcess,c__Process),
inference(split_conjunct,[status(thm)],[mergeA2357]) ).
cnf(c_0_31,plain,
( p__d__instance(X1,c__IntentionalProcess)
| ~ p__d__instance(X1,c__OrganizationalProcess) ),
inference(spm,[status(thm)],[c_0_13,c_0_24]) ).
cnf(c_0_32,negated_conjecture,
p__d__instance(esk1217_0,c__OrganizationalProcess),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( ~ p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__disjoint(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
p__d__disjoint(c__Object,c__Process),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( p__d__instance(X1,c__Process)
| ~ p__d__instance(X1,c__IntentionalProcess) ),
inference(spm,[status(thm)],[c_0_13,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
p__d__instance(esk1217_0,c__IntentionalProcess),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
( ~ p__d__instance(X1,c__Object)
| ~ p__d__instance(X1,c__Process) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
p__d__instance(esk1217_0,c__Process),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
p__d__instance(esk1217_0,c__Object),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR217+1 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 11 14:55:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.82/6.01 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.82/6.01 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.82/6.01 # Preprocessing time : 0.173 s
% 0.82/6.01
% 0.82/6.01 # Failure: Out of unprocessed clauses!
% 0.82/6.01 # OLD status GaveUp
% 0.82/6.01 # Parsed axioms : 7433
% 0.82/6.01 # Removed by relevancy pruning/SinE : 7393
% 0.82/6.01 # Initial clauses : 62
% 0.82/6.01 # Removed in clause preprocessing : 0
% 0.82/6.01 # Initial clauses in saturation : 62
% 0.82/6.01 # Processed clauses : 548
% 0.82/6.01 # ...of these trivial : 1
% 0.82/6.01 # ...subsumed : 220
% 0.82/6.01 # ...remaining for further processing : 327
% 0.82/6.01 # Other redundant clauses eliminated : 0
% 0.82/6.01 # Clauses deleted for lack of memory : 0
% 0.82/6.01 # Backward-subsumed : 2
% 0.82/6.01 # Backward-rewritten : 0
% 0.82/6.01 # Generated clauses : 523
% 0.82/6.01 # ...of the previous two non-trivial : 488
% 0.82/6.01 # Contextual simplify-reflections : 89
% 0.82/6.01 # Paramodulations : 523
% 0.82/6.01 # Factorizations : 0
% 0.82/6.01 # Equation resolutions : 0
% 0.82/6.01 # Current number of processed clauses : 325
% 0.82/6.01 # Positive orientable unit clauses : 34
% 0.82/6.01 # Positive unorientable unit clauses: 0
% 0.82/6.01 # Negative unit clauses : 0
% 0.82/6.01 # Non-unit-clauses : 291
% 0.82/6.01 # Current number of unprocessed clauses: 0
% 0.82/6.01 # ...number of literals in the above : 0
% 0.82/6.01 # Current number of archived formulas : 0
% 0.82/6.01 # Current number of archived clauses : 2
% 0.82/6.01 # Clause-clause subsumption calls (NU) : 15389
% 0.82/6.01 # Rec. Clause-clause subsumption calls : 14684
% 0.82/6.01 # Non-unit clause-clause subsumptions : 311
% 0.82/6.01 # Unit Clause-clause subsumption calls : 32
% 0.82/6.01 # Rewrite failures with RHS unbound : 0
% 0.82/6.01 # BW rewrite match attempts : 0
% 0.82/6.01 # BW rewrite match successes : 0
% 0.82/6.01 # Condensation attempts : 0
% 0.82/6.01 # Condensation successes : 0
% 0.82/6.01 # Termbank termtop insertions : 75828
% 0.82/6.01
% 0.82/6.01 # -------------------------------------------------
% 0.82/6.01 # User time : 0.184 s
% 0.82/6.01 # System time : 0.010 s
% 0.82/6.01 # Total time : 0.194 s
% 0.82/6.01 # Maximum resident set size: 20428 pages
% 0.82/6.01 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.82/6.01 # Preprocessing time : 0.426 s
% 0.82/6.01
% 0.82/6.01 # Proof found!
% 0.82/6.01 # SZS status Theorem
% 0.82/6.01 # SZS output start CNFRefutation
% See solution above
% 0.82/6.01 # Proof object total steps : 41
% 0.82/6.01 # Proof object clause steps : 25
% 0.82/6.01 # Proof object formula steps : 16
% 0.82/6.01 # Proof object conjectures : 12
% 0.82/6.01 # Proof object clause conjectures : 9
% 0.82/6.01 # Proof object formula conjectures : 3
% 0.82/6.01 # Proof object initial clauses used : 12
% 0.82/6.01 # Proof object initial formulas used : 10
% 0.82/6.01 # Proof object generating inferences : 12
% 0.82/6.01 # Proof object simplifying inferences : 3
% 0.82/6.01 # Training examples: 0 positive, 0 negative
% 0.82/6.01 # Parsed axioms : 7433
% 0.82/6.01 # Removed by relevancy pruning/SinE : 0
% 0.82/6.01 # Initial clauses : 10863
% 0.82/6.01 # Removed in clause preprocessing : 20
% 0.82/6.01 # Initial clauses in saturation : 10843
% 0.82/6.01 # Processed clauses : 15866
% 0.82/6.01 # ...of these trivial : 296
% 0.82/6.01 # ...subsumed : 298
% 0.82/6.01 # ...remaining for further processing : 15272
% 0.82/6.01 # Other redundant clauses eliminated : 40
% 0.82/6.01 # Clauses deleted for lack of memory : 0
% 0.82/6.01 # Backward-subsumed : 6
% 0.82/6.01 # Backward-rewritten : 11
% 0.82/6.01 # Generated clauses : 71434
% 0.82/6.01 # ...of the previous two non-trivial : 68941
% 0.82/6.01 # Contextual simplify-reflections : 3342
% 0.82/6.01 # Paramodulations : 71335
% 0.82/6.01 # Factorizations : 1
% 0.82/6.01 # Equation resolutions : 98
% 0.82/6.01 # Current number of processed clauses : 15248
% 0.82/6.01 # Positive orientable unit clauses : 5475
% 0.82/6.01 # Positive unorientable unit clauses: 0
% 0.82/6.01 # Negative unit clauses : 10
% 0.82/6.01 # Non-unit-clauses : 9763
% 0.82/6.01 # Current number of unprocessed clauses: 63827
% 0.82/6.01 # ...number of literals in the above : 230675
% 0.82/6.01 # Current number of archived formulas : 0
% 0.82/6.01 # Current number of archived clauses : 17
% 0.82/6.01 # Clause-clause subsumption calls (NU) : 20425003
% 0.82/6.01 # Rec. Clause-clause subsumption calls : 11512653
% 0.82/6.01 # Non-unit clause-clause subsumptions : 3643
% 0.82/6.01 # Unit Clause-clause subsumption calls : 2560217
% 0.82/6.01 # Rewrite failures with RHS unbound : 0
% 0.82/6.01 # BW rewrite match attempts : 97
% 0.82/6.01 # BW rewrite match successes : 11
% 0.82/6.01 # Condensation attempts : 0
% 0.82/6.01 # Condensation successes : 0
% 0.82/6.01 # Termbank termtop insertions : 1299071
% 0.82/6.01
% 0.82/6.01 # -------------------------------------------------
% 0.82/6.01 # User time : 4.598 s
% 0.82/6.01 # System time : 0.114 s
% 0.82/6.01 # Total time : 4.712 s
% 0.82/6.01 # Maximum resident set size: 152920 pages
% 0.82/24.00 eprover: CPU time limit exceeded, terminating
% 0.82/24.02 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/24.02 eprover: No such file or directory
% 0.82/24.02 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/24.02 eprover: No such file or directory
% 0.82/24.02 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/24.02 eprover: No such file or directory
% 0.82/24.03 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/24.03 eprover: No such file or directory
% 0.82/24.03 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/24.03 eprover: No such file or directory
% 0.82/24.03 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/24.03 eprover: No such file or directory
% 0.82/24.04 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/24.04 eprover: No such file or directory
% 0.82/24.04 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/24.04 eprover: No such file or directory
% 0.82/24.04 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/24.04 eprover: No such file or directory
% 0.82/24.05 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/24.05 eprover: No such file or directory
% 0.82/24.05 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.82/24.05 eprover: No such file or directory
%------------------------------------------------------------------------------