TSTP Solution File: CSR061+6 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR061+6 : TPTP v8.1.0. Bugfixed v5.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:47:14 EDT 2022
% Result : Theorem 82.64s 68.73s
% Output : CNFRefutation 82.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 6 unt; 0 nHn; 8 RR)
% Number of literals : 14 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 8 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_594,plain,
( reifiablefunction(X1)
| ~ natfunction(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-39ny9c8f/input.p',i_0_594) ).
cnf(i_0_2349,plain,
natfunction(f_intervalstartedbyfn_inclusive(X1),c_intervalstartedbyfn_inclusive),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-39ny9c8f/input.p',i_0_2349) ).
cnf(i_0_80,plain,
( ~ reifiablefunction(X1)
| ~ unreifiablefunction(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-39ny9c8f/input.p',i_0_80) ).
cnf(i_0_3243,plain,
unreifiablefunction(c_intervalstartedbyfn_inclusive),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-39ny9c8f/input.p',i_0_3243) ).
cnf(c_0_3248,plain,
( reifiablefunction(X1)
| ~ natfunction(X2,X1) ),
i_0_594 ).
cnf(c_0_3249,plain,
natfunction(f_intervalstartedbyfn_inclusive(X1),c_intervalstartedbyfn_inclusive),
i_0_2349 ).
cnf(c_0_3250,plain,
( ~ reifiablefunction(X1)
| ~ unreifiablefunction(X1) ),
i_0_80 ).
cnf(c_0_3251,plain,
reifiablefunction(c_intervalstartedbyfn_inclusive),
inference(spm,[status(thm)],[c_0_3248,c_0_3249]) ).
cnf(c_0_3252,plain,
unreifiablefunction(c_intervalstartedbyfn_inclusive),
i_0_3243 ).
cnf(c_0_3253,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3250,c_0_3251]),c_0_3252])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR061+6 : TPTP v8.1.0. Bugfixed v5.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 10 16:52:10 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 64.17/64.43 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 64.17/64.43 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 64.17/64.43 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 64.17/64.43 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 82.64/68.73 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 82.64/68.73 # Version: 2.1pre011
% 82.64/68.73 # Preprocessing time : 0.079 s
% 82.64/68.73
% 82.64/68.73 # Proof found!
% 82.64/68.73 # SZS status Theorem
% 82.64/68.73 # SZS output start CNFRefutation
% See solution above
% 82.64/68.73 # Proof object total steps : 10
% 82.64/68.73 # Proof object clause steps : 6
% 82.64/68.73 # Proof object formula steps : 4
% 82.64/68.73 # Proof object conjectures : 0
% 82.64/68.73 # Proof object clause conjectures : 0
% 82.64/68.73 # Proof object formula conjectures : 0
% 82.64/68.73 # Proof object initial clauses used : 4
% 82.64/68.73 # Proof object initial formulas used : 4
% 82.64/68.73 # Proof object generating inferences : 2
% 82.64/68.73 # Proof object simplifying inferences : 2
% 82.64/68.73 # Training examples: 0 positive, 0 negative
% 82.64/68.73 # Parsed axioms : 3559
% 82.64/68.73 # Removed by relevancy pruning/SinE : 0
% 82.64/68.73 # Initial clauses : 3559
% 82.64/68.73 # Removed in clause preprocessing : 0
% 82.64/68.73 # Initial clauses in saturation : 3559
% 82.64/68.73 # Processed clauses : 8343
% 82.64/68.73 # ...of these trivial : 1191
% 82.64/68.73 # ...subsumed : 300
% 82.64/68.73 # ...remaining for further processing : 6852
% 82.64/68.73 # Other redundant clauses eliminated : 9
% 82.64/68.73 # Clauses deleted for lack of memory : 0
% 82.64/68.73 # Backward-subsumed : 57
% 82.64/68.73 # Backward-rewritten : 78
% 82.64/68.73 # Generated clauses : 18431
% 82.64/68.73 # ...of the previous two non-trivial : 16580
% 82.64/68.73 # Contextual simplify-reflections : 80
% 82.64/68.73 # Paramodulations : 18422
% 82.64/68.73 # Factorizations : 0
% 82.64/68.73 # Equation resolutions : 9
% 82.64/68.73 # Propositional unsat checks : 1
% 82.64/68.73 # Propositional unsat check successes : 0
% 82.64/68.73 # Current number of processed clauses : 6708
% 82.64/68.73 # Positive orientable unit clauses : 2769
% 82.64/68.73 # Positive unorientable unit clauses: 0
% 82.64/68.73 # Negative unit clauses : 188
% 82.64/68.73 # Non-unit-clauses : 3751
% 82.64/68.73 # Current number of unprocessed clauses: 11285
% 82.64/68.73 # ...number of literals in the above : 23952
% 82.64/68.73 # Current number of archived formulas : 0
% 82.64/68.73 # Current number of archived clauses : 135
% 82.64/68.73 # Clause-clause subsumption calls (NU) : 6601965
% 82.64/68.73 # Rec. Clause-clause subsumption calls : 4119310
% 82.64/68.73 # Non-unit clause-clause subsumptions : 316
% 82.64/68.73 # Unit Clause-clause subsumption calls : 136223
% 82.64/68.73 # Rewrite failures with RHS unbound : 0
% 82.64/68.73 # BW rewrite match attempts : 413
% 82.64/68.73 # BW rewrite match successes : 38
% 82.64/68.73 # Condensation attempts : 0
% 82.64/68.73 # Condensation successes : 0
% 82.64/68.73 # Termbank termtop insertions : 217197
% 82.64/68.73
% 82.64/68.73 # -------------------------------------------------
% 82.64/68.73 # User time : 1.172 s
% 82.64/68.73 # System time : 0.023 s
% 82.64/68.73 # Total time : 1.196 s
% 82.64/68.73 # ...preprocessing : 0.079 s
% 82.64/68.73 # ...main loop : 1.117 s
% 82.64/68.73 # Maximum resident set size: 39028 pages
% 82.64/68.73
%------------------------------------------------------------------------------