TSTP Solution File: CSR104+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR104+1 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:47:59 EDT 2022
% Result : Theorem 16.44s 4.34s
% Output : CNFRefutation 16.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 35 ( 19 unt; 0 nHn; 35 RR)
% Number of literals : 74 ( 0 equ; 44 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 30 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2095,plain,
( s__temporalPart(X1,X2)
| ~ s__during(X1,X2)
| ~ s__instance(X1,s__TimeInterval)
| ~ s__instance(X2,s__TimeInterval) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x0jdgf9e/input.p',i_0_2095) ).
cnf(i_0_3147,plain,
s__during(s__TimeInterval35_1,s__TimeInterval35_2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x0jdgf9e/input.p',i_0_3147) ).
cnf(i_0_3145,plain,
s__instance(s__TimeInterval35_2,s__TimeInterval),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x0jdgf9e/input.p',i_0_3145) ).
cnf(i_0_3144,plain,
s__instance(s__TimeInterval35_1,s__TimeInterval),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x0jdgf9e/input.p',i_0_3144) ).
cnf(i_0_106,plain,
( s__temporalPart(X1,X2)
| ~ s__temporalPart(X1,X3)
| ~ s__temporalPart(X3,X2)
| ~ s__instance(X1,s__TimePosition)
| ~ s__instance(X3,s__TimePosition)
| ~ s__instance(X2,s__TimePosition) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x0jdgf9e/input.p',i_0_106) ).
cnf(i_0_894,plain,
( s__instance(X1,X2)
| ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2)
| ~ s__instance(X3,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x0jdgf9e/input.p',i_0_894) ).
cnf(i_0_804,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x0jdgf9e/input.p',i_0_804) ).
cnf(i_0_805,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x0jdgf9e/input.p',i_0_805) ).
cnf(i_0_3148,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x0jdgf9e/input.p',i_0_3148) ).
cnf(i_0_3146,plain,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x0jdgf9e/input.p',i_0_3146) ).
cnf(i_0_2124,plain,
s__subclass(s__TimeInterval,s__TimePosition),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x0jdgf9e/input.p',i_0_2124) ).
cnf(i_0_2125,plain,
s__subclass(s__TimePoint,s__TimePosition),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x0jdgf9e/input.p',i_0_2125) ).
cnf(i_0_3143,plain,
s__instance(s__TimePoint35_1,s__TimePoint),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x0jdgf9e/input.p',i_0_3143) ).
cnf(c_0_3162,plain,
( s__temporalPart(X1,X2)
| ~ s__during(X1,X2)
| ~ s__instance(X1,s__TimeInterval)
| ~ s__instance(X2,s__TimeInterval) ),
i_0_2095 ).
cnf(c_0_3163,plain,
s__during(s__TimeInterval35_1,s__TimeInterval35_2),
i_0_3147 ).
cnf(c_0_3164,plain,
s__instance(s__TimeInterval35_2,s__TimeInterval),
i_0_3145 ).
cnf(c_0_3165,plain,
s__instance(s__TimeInterval35_1,s__TimeInterval),
i_0_3144 ).
cnf(c_0_3166,plain,
( s__temporalPart(X1,X2)
| ~ s__temporalPart(X1,X3)
| ~ s__temporalPart(X3,X2)
| ~ s__instance(X1,s__TimePosition)
| ~ s__instance(X3,s__TimePosition)
| ~ s__instance(X2,s__TimePosition) ),
i_0_106 ).
cnf(c_0_3167,plain,
s__temporalPart(s__TimeInterval35_1,s__TimeInterval35_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3162,c_0_3163]),c_0_3164])]),c_0_3165])]) ).
cnf(c_0_3168,plain,
( s__instance(X1,X2)
| ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2)
| ~ s__instance(X3,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass) ),
i_0_894 ).
cnf(c_0_3169,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
i_0_804 ).
cnf(c_0_3170,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
i_0_805 ).
cnf(c_0_3171,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
i_0_3148 ).
cnf(c_0_3172,plain,
( s__temporalPart(X1,s__TimeInterval35_2)
| ~ s__temporalPart(X1,s__TimeInterval35_1)
| ~ s__instance(s__TimeInterval35_1,s__TimePosition)
| ~ s__instance(s__TimeInterval35_2,s__TimePosition)
| ~ s__instance(X1,s__TimePosition) ),
inference(spm,[status(thm)],[c_0_3166,c_0_3167]) ).
cnf(c_0_3173,plain,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_1),
i_0_3146 ).
cnf(c_0_3174,plain,
( s__instance(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_3168,c_0_3169]),c_0_3170]) ).
cnf(c_0_3175,plain,
s__subclass(s__TimeInterval,s__TimePosition),
i_0_2124 ).
cnf(c_0_3176,negated_conjecture,
( ~ s__instance(s__TimeInterval35_1,s__TimePosition)
| ~ s__instance(s__TimeInterval35_2,s__TimePosition)
| ~ s__instance(s__TimePoint35_1,s__TimePosition) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3171,c_0_3172]),c_0_3173])]) ).
cnf(c_0_3177,plain,
( s__instance(X1,s__TimePosition)
| ~ s__instance(X1,s__TimeInterval) ),
inference(spm,[status(thm)],[c_0_3174,c_0_3175]) ).
cnf(c_0_3178,negated_conjecture,
( ~ s__instance(s__TimeInterval35_1,s__TimePosition)
| ~ s__instance(s__TimePoint35_1,s__TimePosition) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3176,c_0_3177]),c_0_3164])]) ).
cnf(c_0_3179,plain,
s__subclass(s__TimePoint,s__TimePosition),
i_0_2125 ).
cnf(c_0_3180,plain,
~ s__instance(s__TimePoint35_1,s__TimePosition),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3178,c_0_3177]),c_0_3165])]) ).
cnf(c_0_3181,plain,
( s__instance(X1,s__TimePosition)
| ~ s__instance(X1,s__TimePoint) ),
inference(spm,[status(thm)],[c_0_3174,c_0_3179]) ).
cnf(c_0_3182,plain,
s__instance(s__TimePoint35_1,s__TimePoint),
i_0_3143 ).
cnf(c_0_3183,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3180,c_0_3181]),c_0_3182])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR104+1 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n028.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 : Fri Jun 10 23:42:06 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.43 # ENIGMATIC: Selected SinE mode:
% 0.45/0.66 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.45/0.66 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.45/0.66 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.45/0.66 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 16.44/4.34 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 16.44/4.34 # Version: 2.1pre011
% 16.44/4.34 # Preprocessing time : 0.118 s
% 16.44/4.34
% 16.44/4.34 # Proof found!
% 16.44/4.34 # SZS status Theorem
% 16.44/4.34 # SZS output start CNFRefutation
% See solution above
% 16.44/4.34 # Proof object total steps : 35
% 16.44/4.34 # Proof object clause steps : 22
% 16.44/4.34 # Proof object formula steps : 13
% 16.44/4.34 # Proof object conjectures : 4
% 16.44/4.34 # Proof object clause conjectures : 3
% 16.44/4.34 # Proof object formula conjectures : 1
% 16.44/4.34 # Proof object initial clauses used : 13
% 16.44/4.34 # Proof object initial formulas used : 13
% 16.44/4.34 # Proof object generating inferences : 8
% 16.44/4.34 # Proof object simplifying inferences : 14
% 16.44/4.34 # Training examples: 0 positive, 0 negative
% 16.44/4.34 # Parsed axioms : 3114
% 16.44/4.34 # Removed by relevancy pruning/SinE : 0
% 16.44/4.34 # Initial clauses : 3114
% 16.44/4.34 # Removed in clause preprocessing : 0
% 16.44/4.34 # Initial clauses in saturation : 3114
% 16.44/4.34 # Processed clauses : 4828
% 16.44/4.34 # ...of these trivial : 613
% 16.44/4.34 # ...subsumed : 209
% 16.44/4.34 # ...remaining for further processing : 4006
% 16.44/4.34 # Other redundant clauses eliminated : 48
% 16.44/4.34 # Clauses deleted for lack of memory : 0
% 16.44/4.34 # Backward-subsumed : 38
% 16.44/4.34 # Backward-rewritten : 18
% 16.44/4.34 # Generated clauses : 11292
% 16.44/4.34 # ...of the previous two non-trivial : 9931
% 16.44/4.34 # Contextual simplify-reflections : 742
% 16.44/4.34 # Paramodulations : 11223
% 16.44/4.34 # Factorizations : 0
% 16.44/4.34 # Equation resolutions : 69
% 16.44/4.34 # Propositional unsat checks : 0
% 16.44/4.34 # Propositional unsat check successes : 0
% 16.44/4.34 # Current number of processed clauses : 3948
% 16.44/4.34 # Positive orientable unit clauses : 1666
% 16.44/4.34 # Positive unorientable unit clauses: 20
% 16.44/4.34 # Negative unit clauses : 2
% 16.44/4.34 # Non-unit-clauses : 2260
% 16.44/4.34 # Current number of unprocessed clauses: 8105
% 16.44/4.34 # ...number of literals in the above : 41080
% 16.44/4.34 # Current number of archived formulas : 0
% 16.44/4.34 # Current number of archived clauses : 56
% 16.44/4.34 # Clause-clause subsumption calls (NU) : 1649250
% 16.44/4.34 # Rec. Clause-clause subsumption calls : 136005
% 16.44/4.34 # Non-unit clause-clause subsumptions : 922
% 16.44/4.34 # Unit Clause-clause subsumption calls : 73138
% 16.44/4.34 # Rewrite failures with RHS unbound : 96
% 16.44/4.34 # BW rewrite match attempts : 54
% 16.44/4.34 # BW rewrite match successes : 45
% 16.44/4.34 # Condensation attempts : 0
% 16.44/4.34 # Condensation successes : 0
% 16.44/4.34 # Termbank termtop insertions : 275516
% 16.44/4.34
% 16.44/4.34 # -------------------------------------------------
% 16.44/4.34 # User time : 0.833 s
% 16.44/4.34 # System time : 0.014 s
% 16.44/4.34 # Total time : 0.847 s
% 16.44/4.34 # ...preprocessing : 0.118 s
% 16.44/4.34 # ...main loop : 0.729 s
% 16.44/4.34 # Maximum resident set size: 32844 pages
% 16.44/4.34
%------------------------------------------------------------------------------