TSTP Solution File: CSR217+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR217+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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 02:49:59 EDT 2022
% Result : Theorem 52.90s 10.15s
% Output : CNFRefutation 52.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 37 ( 23 unt; 0 nHn; 37 RR)
% Number of literals : 55 ( 2 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 32 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3396,plain,
( p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__subclass(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9w64hy14/input.p',i_0_3396) ).
cnf(i_0_514,plain,
p__d__subclass(c__Hiring,c__JoiningAnOrganization),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9w64hy14/input.p',i_0_514) ).
cnf(i_0_3,negated_conjecture,
p__d__instance(esk1_0,c__Hiring),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9w64hy14/input.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
esk2_0 = esk1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9w64hy14/input.p',i_0_1) ).
cnf(i_0_507,plain,
p__d__subclass(c__JoiningAnOrganization,c__OrganizationalProcess),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9w64hy14/input.p',i_0_507) ).
cnf(i_0_3484,plain,
( p__d__disjoint(X1,X2)
| ~ p__d__disjointDecomposition3(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9w64hy14/input.p',i_0_3484) ).
cnf(i_0_3413,plain,
( p__d__disjointDecomposition3(X1,X2,X3)
| ~ p__d__partition3(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9w64hy14/input.p',i_0_3413) ).
cnf(i_0_501,plain,
p__d__subclass(c__OrganizationalProcess,c__IntentionalProcess),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9w64hy14/input.p',i_0_501) ).
cnf(i_0_169,plain,
p__d__partition3(c__Physical,c__Object,c__Process),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9w64hy14/input.p',i_0_169) ).
cnf(i_0_493,plain,
p__d__subclass(c__IntentionalProcess,c__Process),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9w64hy14/input.p',i_0_493) ).
cnf(i_0_3399,plain,
( ~ p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__disjoint(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9w64hy14/input.p',i_0_3399) ).
cnf(i_0_4,negated_conjecture,
p__d__instance(esk2_0,c__Object),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9w64hy14/input.p',i_0_4) ).
cnf(c_0_3497,plain,
( p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__subclass(X3,X2) ),
i_0_3396 ).
cnf(c_0_3498,plain,
p__d__subclass(c__Hiring,c__JoiningAnOrganization),
i_0_514 ).
cnf(c_0_3499,negated_conjecture,
p__d__instance(esk1_0,c__Hiring),
i_0_3 ).
cnf(c_0_3500,negated_conjecture,
esk2_0 = esk1_0,
i_0_1 ).
cnf(c_0_3501,plain,
p__d__subclass(c__JoiningAnOrganization,c__OrganizationalProcess),
i_0_507 ).
cnf(c_0_3502,plain,
( p__d__instance(X1,c__JoiningAnOrganization)
| ~ p__d__instance(X1,c__Hiring) ),
inference(spm,[status(thm)],[c_0_3497,c_0_3498]) ).
cnf(c_0_3503,negated_conjecture,
p__d__instance(esk2_0,c__Hiring),
inference(rw,[status(thm)],[c_0_3499,c_0_3500]) ).
cnf(c_0_3504,plain,
( p__d__disjoint(X1,X2)
| ~ p__d__disjointDecomposition3(X3,X1,X2) ),
i_0_3484 ).
cnf(c_0_3505,plain,
( p__d__disjointDecomposition3(X1,X2,X3)
| ~ p__d__partition3(X1,X2,X3) ),
i_0_3413 ).
cnf(c_0_3506,plain,
p__d__subclass(c__OrganizationalProcess,c__IntentionalProcess),
i_0_501 ).
cnf(c_0_3507,plain,
( p__d__instance(X1,c__OrganizationalProcess)
| ~ p__d__instance(X1,c__JoiningAnOrganization) ),
inference(spm,[status(thm)],[c_0_3497,c_0_3501]) ).
cnf(c_0_3508,negated_conjecture,
p__d__instance(esk2_0,c__JoiningAnOrganization),
inference(spm,[status(thm)],[c_0_3502,c_0_3503]) ).
cnf(c_0_3509,plain,
( p__d__disjoint(X1,X2)
| ~ p__d__partition3(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_3504,c_0_3505]) ).
cnf(c_0_3510,plain,
p__d__partition3(c__Physical,c__Object,c__Process),
i_0_169 ).
cnf(c_0_3511,plain,
p__d__subclass(c__IntentionalProcess,c__Process),
i_0_493 ).
cnf(c_0_3512,plain,
( p__d__instance(X1,c__IntentionalProcess)
| ~ p__d__instance(X1,c__OrganizationalProcess) ),
inference(spm,[status(thm)],[c_0_3497,c_0_3506]) ).
cnf(c_0_3513,negated_conjecture,
p__d__instance(esk2_0,c__OrganizationalProcess),
inference(spm,[status(thm)],[c_0_3507,c_0_3508]) ).
cnf(c_0_3514,plain,
( ~ p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__disjoint(X3,X2) ),
i_0_3399 ).
cnf(c_0_3515,plain,
p__d__disjoint(c__Object,c__Process),
inference(spm,[status(thm)],[c_0_3509,c_0_3510]) ).
cnf(c_0_3516,plain,
( p__d__instance(X1,c__Process)
| ~ p__d__instance(X1,c__IntentionalProcess) ),
inference(spm,[status(thm)],[c_0_3497,c_0_3511]) ).
cnf(c_0_3517,negated_conjecture,
p__d__instance(esk2_0,c__IntentionalProcess),
inference(spm,[status(thm)],[c_0_3512,c_0_3513]) ).
cnf(c_0_3518,plain,
( ~ p__d__instance(X1,c__Object)
| ~ p__d__instance(X1,c__Process) ),
inference(spm,[status(thm)],[c_0_3514,c_0_3515]) ).
cnf(c_0_3519,plain,
p__d__instance(esk2_0,c__Process),
inference(spm,[status(thm)],[c_0_3516,c_0_3517]) ).
cnf(c_0_3520,negated_conjecture,
p__d__instance(esk2_0,c__Object),
i_0_4 ).
cnf(c_0_3521,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3518,c_0_3519]),c_0_3520])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : CSR217+1 : TPTP v8.1.0. Released v7.3.0.
% 0.13/0.15 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.36 % Computer : n008.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jun 11 15:02:39 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.21/0.48 # ENIGMATIC: Selected SinE mode:
% 0.39/0.62 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.62 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.39/0.62 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.39/0.62 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 52.90/10.15 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 52.90/10.15 # Version: 2.1pre011
% 52.90/10.15 # Preprocessing time : 0.138 s
% 52.90/10.15
% 52.90/10.15 # Proof found!
% 52.90/10.15 # SZS status Theorem
% 52.90/10.15 # SZS output start CNFRefutation
% See solution above
% 52.90/10.15 # Proof object total steps : 37
% 52.90/10.15 # Proof object clause steps : 25
% 52.90/10.15 # Proof object formula steps : 12
% 52.90/10.15 # Proof object conjectures : 10
% 52.90/10.15 # Proof object clause conjectures : 7
% 52.90/10.15 # Proof object formula conjectures : 3
% 52.90/10.15 # Proof object initial clauses used : 12
% 52.90/10.15 # Proof object initial formulas used : 12
% 52.90/10.15 # Proof object generating inferences : 12
% 52.90/10.15 # Proof object simplifying inferences : 3
% 52.90/10.15 # Training examples: 0 positive, 0 negative
% 52.90/10.15 # Parsed axioms : 4292
% 52.90/10.15 # Removed by relevancy pruning/SinE : 0
% 52.90/10.15 # Initial clauses : 4292
% 52.90/10.15 # Removed in clause preprocessing : 0
% 52.90/10.15 # Initial clauses in saturation : 4292
% 52.90/10.15 # Processed clauses : 8654
% 52.90/10.15 # ...of these trivial : 91
% 52.90/10.15 # ...subsumed : 262
% 52.90/10.15 # ...remaining for further processing : 8301
% 52.90/10.15 # Other redundant clauses eliminated : 8
% 52.90/10.15 # Clauses deleted for lack of memory : 0
% 52.90/10.15 # Backward-subsumed : 12
% 52.90/10.15 # Backward-rewritten : 28
% 52.90/10.15 # Generated clauses : 35300
% 52.90/10.15 # ...of the previous two non-trivial : 34326
% 52.90/10.15 # Contextual simplify-reflections : 1658
% 52.90/10.15 # Paramodulations : 34638
% 52.90/10.15 # Factorizations : 574
% 52.90/10.15 # Equation resolutions : 88
% 52.90/10.15 # Propositional unsat checks : 1
% 52.90/10.15 # Propositional unsat check successes : 0
% 52.90/10.15 # Current number of processed clauses : 8257
% 52.90/10.15 # Positive orientable unit clauses : 1740
% 52.90/10.15 # Positive unorientable unit clauses: 0
% 52.90/10.15 # Negative unit clauses : 967
% 52.90/10.15 # Non-unit-clauses : 5550
% 52.90/10.15 # Current number of unprocessed clauses: 29830
% 52.90/10.15 # ...number of literals in the above : 113470
% 52.90/10.15 # Current number of archived formulas : 0
% 52.90/10.15 # Current number of archived clauses : 40
% 52.90/10.15 # Clause-clause subsumption calls (NU) : 8066811
% 52.90/10.15 # Rec. Clause-clause subsumption calls : 3396788
% 52.90/10.15 # Non-unit clause-clause subsumptions : 1818
% 52.90/10.15 # Unit Clause-clause subsumption calls : 2026331
% 52.90/10.15 # Rewrite failures with RHS unbound : 0
% 52.90/10.15 # BW rewrite match attempts : 8
% 52.90/10.15 # BW rewrite match successes : 8
% 52.90/10.15 # Condensation attempts : 0
% 52.90/10.15 # Condensation successes : 0
% 52.90/10.15 # Termbank termtop insertions : 672336
% 52.90/10.15
% 52.90/10.15 # -------------------------------------------------
% 52.90/10.15 # User time : 5.020 s
% 52.90/10.15 # System time : 0.065 s
% 52.90/10.15 # Total time : 5.085 s
% 52.90/10.15 # ...preprocessing : 0.138 s
% 52.90/10.15 # ...main loop : 4.947 s
% 52.90/10.15 # Maximum resident set size: 81116 pages
% 52.90/10.15
%------------------------------------------------------------------------------