TSTP Solution File: CSR202+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR202+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:57 EDT 2022
% Result : Theorem 43.46s 8.37s
% Output : CNFRefutation 43.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 49 ( 26 unt; 0 nHn; 49 RR)
% Number of literals : 80 ( 0 equ; 37 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-7 aty)
% Number of functors : 14 ( 14 usr; 13 con; 0-1 aty)
% Number of variables : 62 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3251,plain,
( p__d__subclass(X1,X2)
| ~ p__d__subclass(X3,X2)
| ~ p__d__subclass(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_3251) ).
cnf(i_0_790,plain,
p__d__subclass(c__Communication,c__SocialInteraction),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_790) ).
cnf(i_0_3166,plain,
( p__d__disjointDecomposition7(X1,X2,X3,X4,X5,X6,X7)
| ~ p__d__partition7(X1,X2,X3,X4,X5,X6,X7) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_3166) ).
cnf(i_0_792,plain,
p__d__partition7(c__Communication,c__Stating,c__Supposing,c__Directing,c__Committing,c__Expressing,c__Declaring),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_792) ).
cnf(i_0_814,plain,
p__d__subclass(c__LinguisticCommunication,c__Communication),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_814) ).
cnf(i_0_3221,plain,
( p__d__disjoint(X1,X2)
| ~ p__d__disjointDecomposition7(X3,X1,X4,X5,X6,X7,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_3221) ).
cnf(i_0_3161,plain,
( p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__subclass(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_3161) ).
cnf(i_0_3160,negated_conjecture,
p__d__subclass(c__Declaring,c__Stating),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_3160) ).
cnf(i_0_3164,plain,
( ~ p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__disjoint(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_3164) ).
cnf(i_0_789,plain,
p__d__subclass(c__SocialInteraction,c__IntentionalProcess),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_789) ).
cnf(i_0_818,plain,
p__d__subclass(c__Stating,c__LinguisticCommunication),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_818) ).
cnf(i_0_199,plain,
( p__d__instance(esk29_1(X1),X1)
| ~ p__d__subclass(X1,c__Entity) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_199) ).
cnf(i_0_208,plain,
p__d__subclass(c__Physical,c__Entity),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_208) ).
cnf(i_0_1205,plain,
p__d__subclass(c__Process,c__Physical),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_1205) ).
cnf(i_0_521,plain,
p__d__subclass(c__IntentionalProcess,c__Process),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-14a36w4q/input.p',i_0_521) ).
cnf(c_0_3267,plain,
( p__d__subclass(X1,X2)
| ~ p__d__subclass(X3,X2)
| ~ p__d__subclass(X1,X3) ),
i_0_3251 ).
cnf(c_0_3268,plain,
p__d__subclass(c__Communication,c__SocialInteraction),
i_0_790 ).
cnf(c_0_3269,plain,
( p__d__disjointDecomposition7(X1,X2,X3,X4,X5,X6,X7)
| ~ p__d__partition7(X1,X2,X3,X4,X5,X6,X7) ),
i_0_3166 ).
cnf(c_0_3270,plain,
p__d__partition7(c__Communication,c__Stating,c__Supposing,c__Directing,c__Committing,c__Expressing,c__Declaring),
i_0_792 ).
cnf(c_0_3271,plain,
( p__d__subclass(X1,c__SocialInteraction)
| ~ p__d__subclass(X1,c__Communication) ),
inference(spm,[status(thm)],[c_0_3267,c_0_3268]) ).
cnf(c_0_3272,plain,
p__d__subclass(c__LinguisticCommunication,c__Communication),
i_0_814 ).
cnf(c_0_3273,plain,
( p__d__disjoint(X1,X2)
| ~ p__d__disjointDecomposition7(X3,X1,X4,X5,X6,X7,X2) ),
i_0_3221 ).
cnf(c_0_3274,plain,
p__d__disjointDecomposition7(c__Communication,c__Stating,c__Supposing,c__Directing,c__Committing,c__Expressing,c__Declaring),
inference(spm,[status(thm)],[c_0_3269,c_0_3270]) ).
cnf(c_0_3275,plain,
( p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__subclass(X3,X2) ),
i_0_3161 ).
cnf(c_0_3276,negated_conjecture,
p__d__subclass(c__Declaring,c__Stating),
i_0_3160 ).
cnf(c_0_3277,plain,
( p__d__subclass(X1,c__SocialInteraction)
| ~ p__d__subclass(X2,c__Communication)
| ~ p__d__subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_3267,c_0_3271]) ).
cnf(c_0_3278,plain,
( p__d__subclass(X1,c__Communication)
| ~ p__d__subclass(X1,c__LinguisticCommunication) ),
inference(spm,[status(thm)],[c_0_3267,c_0_3272]) ).
cnf(c_0_3279,plain,
( ~ p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__disjoint(X3,X2) ),
i_0_3164 ).
cnf(c_0_3280,plain,
p__d__disjoint(c__Stating,c__Declaring),
inference(spm,[status(thm)],[c_0_3273,c_0_3274]) ).
cnf(c_0_3281,negated_conjecture,
( p__d__instance(X1,c__Stating)
| ~ p__d__instance(X1,c__Declaring) ),
inference(spm,[status(thm)],[c_0_3275,c_0_3276]) ).
cnf(c_0_3282,plain,
p__d__subclass(c__SocialInteraction,c__IntentionalProcess),
i_0_789 ).
cnf(c_0_3283,plain,
( p__d__subclass(X1,c__SocialInteraction)
| ~ p__d__subclass(X2,c__LinguisticCommunication)
| ~ p__d__subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_3277,c_0_3278]) ).
cnf(c_0_3284,plain,
p__d__subclass(c__Stating,c__LinguisticCommunication),
i_0_818 ).
cnf(c_0_3285,plain,
~ p__d__instance(X1,c__Declaring),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3279,c_0_3280]),c_0_3281]) ).
cnf(c_0_3286,plain,
( p__d__instance(esk29_1(X1),X1)
| ~ p__d__subclass(X1,c__Entity) ),
i_0_199 ).
cnf(c_0_3287,plain,
p__d__subclass(c__Physical,c__Entity),
i_0_208 ).
cnf(c_0_3288,plain,
( p__d__subclass(X1,c__IntentionalProcess)
| ~ p__d__subclass(X1,c__SocialInteraction) ),
inference(spm,[status(thm)],[c_0_3267,c_0_3282]) ).
cnf(c_0_3289,plain,
( p__d__subclass(X1,c__SocialInteraction)
| ~ p__d__subclass(X1,c__Stating) ),
inference(spm,[status(thm)],[c_0_3283,c_0_3284]) ).
cnf(c_0_3290,plain,
~ p__d__subclass(c__Declaring,c__Entity),
inference(spm,[status(thm)],[c_0_3285,c_0_3286]) ).
cnf(c_0_3291,plain,
( p__d__subclass(X1,c__Entity)
| ~ p__d__subclass(X1,c__Physical) ),
inference(spm,[status(thm)],[c_0_3267,c_0_3287]) ).
cnf(c_0_3292,plain,
p__d__subclass(c__Process,c__Physical),
i_0_1205 ).
cnf(c_0_3293,plain,
p__d__subclass(c__IntentionalProcess,c__Process),
i_0_521 ).
cnf(c_0_3294,plain,
( p__d__subclass(X1,c__IntentionalProcess)
| ~ p__d__subclass(X1,c__Stating) ),
inference(spm,[status(thm)],[c_0_3288,c_0_3289]) ).
cnf(c_0_3295,plain,
~ p__d__subclass(c__Declaring,c__Physical),
inference(spm,[status(thm)],[c_0_3290,c_0_3291]) ).
cnf(c_0_3296,plain,
( p__d__subclass(X1,c__Physical)
| ~ p__d__subclass(X1,c__Process) ),
inference(spm,[status(thm)],[c_0_3267,c_0_3292]) ).
cnf(c_0_3297,plain,
( p__d__subclass(X1,c__Process)
| ~ p__d__subclass(X1,c__IntentionalProcess) ),
inference(spm,[status(thm)],[c_0_3267,c_0_3293]) ).
cnf(c_0_3298,negated_conjecture,
p__d__subclass(c__Declaring,c__IntentionalProcess),
inference(spm,[status(thm)],[c_0_3294,c_0_3276]) ).
cnf(c_0_3299,plain,
~ p__d__subclass(c__Declaring,c__Process),
inference(spm,[status(thm)],[c_0_3295,c_0_3296]) ).
cnf(c_0_3300,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3297,c_0_3298]),c_0_3299]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR202+1 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n029.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jun 11 07:13:40 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.59 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 43.46/8.37 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 43.46/8.37 # Version: 2.1pre011
% 43.46/8.37 # Preprocessing time : 0.111 s
% 43.46/8.37
% 43.46/8.37 # Proof found!
% 43.46/8.37 # SZS status Theorem
% 43.46/8.37 # SZS output start CNFRefutation
% See solution above
% 43.46/8.37 # Proof object total steps : 49
% 43.46/8.37 # Proof object clause steps : 34
% 43.46/8.37 # Proof object formula steps : 15
% 43.46/8.37 # Proof object conjectures : 4
% 43.46/8.37 # Proof object clause conjectures : 3
% 43.46/8.37 # Proof object formula conjectures : 1
% 43.46/8.37 # Proof object initial clauses used : 15
% 43.46/8.37 # Proof object initial formulas used : 15
% 43.46/8.37 # Proof object generating inferences : 19
% 43.46/8.37 # Proof object simplifying inferences : 2
% 43.46/8.37 # Training examples: 0 positive, 0 negative
% 43.46/8.37 # Parsed axioms : 4195
% 43.46/8.37 # Removed by relevancy pruning/SinE : 0
% 43.46/8.37 # Initial clauses : 4195
% 43.46/8.37 # Removed in clause preprocessing : 0
% 43.46/8.37 # Initial clauses in saturation : 4195
% 43.46/8.37 # Processed clauses : 8726
% 43.46/8.37 # ...of these trivial : 89
% 43.46/8.37 # ...subsumed : 531
% 43.46/8.37 # ...remaining for further processing : 8106
% 43.46/8.37 # Other redundant clauses eliminated : 8
% 43.46/8.37 # Clauses deleted for lack of memory : 0
% 43.46/8.37 # Backward-subsumed : 11
% 43.46/8.37 # Backward-rewritten : 10
% 43.46/8.37 # Generated clauses : 32672
% 43.46/8.37 # ...of the previous two non-trivial : 31587
% 43.46/8.37 # Contextual simplify-reflections : 2033
% 43.46/8.37 # Paramodulations : 32020
% 43.46/8.37 # Factorizations : 584
% 43.46/8.37 # Equation resolutions : 68
% 43.46/8.37 # Propositional unsat checks : 1
% 43.46/8.37 # Propositional unsat check successes : 0
% 43.46/8.37 # Current number of processed clauses : 8081
% 43.46/8.37 # Positive orientable unit clauses : 1637
% 43.46/8.37 # Positive unorientable unit clauses: 0
% 43.46/8.37 # Negative unit clauses : 1060
% 43.46/8.37 # Non-unit-clauses : 5384
% 43.46/8.37 # Current number of unprocessed clauses: 27020
% 43.46/8.37 # ...number of literals in the above : 97741
% 43.46/8.37 # Current number of archived formulas : 0
% 43.46/8.37 # Current number of archived clauses : 21
% 43.46/8.37 # Clause-clause subsumption calls (NU) : 8531717
% 43.46/8.37 # Rec. Clause-clause subsumption calls : 3101768
% 43.46/8.37 # Non-unit clause-clause subsumptions : 2466
% 43.46/8.37 # Unit Clause-clause subsumption calls : 2388859
% 43.46/8.37 # Rewrite failures with RHS unbound : 0
% 43.46/8.37 # BW rewrite match attempts : 11
% 43.46/8.37 # BW rewrite match successes : 10
% 43.46/8.37 # Condensation attempts : 0
% 43.46/8.37 # Condensation successes : 0
% 43.46/8.37 # Termbank termtop insertions : 611974
% 43.46/8.37
% 43.46/8.37 # -------------------------------------------------
% 43.46/8.37 # User time : 4.200 s
% 43.46/8.37 # System time : 0.052 s
% 43.46/8.37 # Total time : 4.252 s
% 43.46/8.37 # ...preprocessing : 0.111 s
% 43.46/8.37 # ...main loop : 4.141 s
% 43.46/8.37 # Maximum resident set size: 75780 pages
% 43.46/8.37
%------------------------------------------------------------------------------