TSTP Solution File: CSR053+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR053+3 : TPTP v8.1.0. Released v3.4.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:05 EDT 2022
% Result : Theorem 10.51s 3.40s
% Output : CNFRefutation 10.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_640,plain,
( geographicalsubregions(c_georegion_l3_x11_y2,c_georegion_l4_x35_y7)
| ~ mtvisible(c_tptpgeo_member1_mt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r6pq1309/input.p',i_0_640) ).
cnf(i_0_2467,negated_conjecture,
mtvisible(c_tptpgeo_member1_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r6pq1309/input.p',i_0_2467) ).
cnf(i_0_2466,negated_conjecture,
~ geographicalsubregions(c_georegion_l3_x11_y2,c_georegion_l4_x35_y7),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r6pq1309/input.p',i_0_2466) ).
cnf(c_0_2471,plain,
( geographicalsubregions(c_georegion_l3_x11_y2,c_georegion_l4_x35_y7)
| ~ mtvisible(c_tptpgeo_member1_mt) ),
i_0_640 ).
cnf(c_0_2472,negated_conjecture,
mtvisible(c_tptpgeo_member1_mt),
i_0_2467 ).
cnf(c_0_2473,negated_conjecture,
~ geographicalsubregions(c_georegion_l3_x11_y2,c_georegion_l4_x35_y7),
i_0_2466 ).
cnf(c_0_2474,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2471,c_0_2472])]),c_0_2473]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR053+3 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 11 18:21:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.41/0.59 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.41/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.41/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.41/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.51/3.40 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 10.51/3.40 # Version: 2.1pre011
% 10.51/3.40 # Preprocessing time : 0.051 s
% 10.51/3.40
% 10.51/3.40 # Proof found!
% 10.51/3.40 # SZS status Theorem
% 10.51/3.40 # SZS output start CNFRefutation
% See solution above
% 10.51/3.40 # Proof object total steps : 7
% 10.51/3.40 # Proof object clause steps : 4
% 10.51/3.40 # Proof object formula steps : 3
% 10.51/3.40 # Proof object conjectures : 4
% 10.51/3.40 # Proof object clause conjectures : 2
% 10.51/3.40 # Proof object formula conjectures : 2
% 10.51/3.40 # Proof object initial clauses used : 3
% 10.51/3.40 # Proof object initial formulas used : 3
% 10.51/3.40 # Proof object generating inferences : 0
% 10.51/3.40 # Proof object simplifying inferences : 3
% 10.51/3.40 # Training examples: 0 positive, 0 negative
% 10.51/3.40 # Parsed axioms : 2467
% 10.51/3.40 # Removed by relevancy pruning/SinE : 0
% 10.51/3.40 # Initial clauses : 2467
% 10.51/3.40 # Removed in clause preprocessing : 0
% 10.51/3.40 # Initial clauses in saturation : 2467
% 10.51/3.40 # Processed clauses : 13
% 10.51/3.40 # ...of these trivial : 0
% 10.51/3.40 # ...subsumed : 0
% 10.51/3.40 # ...remaining for further processing : 12
% 10.51/3.40 # Other redundant clauses eliminated : 0
% 10.51/3.40 # Clauses deleted for lack of memory : 0
% 10.51/3.40 # Backward-subsumed : 0
% 10.51/3.40 # Backward-rewritten : 0
% 10.51/3.40 # Generated clauses : 0
% 10.51/3.40 # ...of the previous two non-trivial : 0
% 10.51/3.40 # Contextual simplify-reflections : 0
% 10.51/3.40 # Paramodulations : 0
% 10.51/3.40 # Factorizations : 0
% 10.51/3.40 # Equation resolutions : 0
% 10.51/3.40 # Propositional unsat checks : 0
% 10.51/3.40 # Propositional unsat check successes : 0
% 10.51/3.40 # Current number of processed clauses : 12
% 10.51/3.40 # Positive orientable unit clauses : 8
% 10.51/3.40 # Positive unorientable unit clauses: 0
% 10.51/3.40 # Negative unit clauses : 2
% 10.51/3.40 # Non-unit-clauses : 2
% 10.51/3.40 # Current number of unprocessed clauses: 2454
% 10.51/3.40 # ...number of literals in the above : 4019
% 10.51/3.40 # Current number of archived formulas : 0
% 10.51/3.40 # Current number of archived clauses : 0
% 10.51/3.40 # Clause-clause subsumption calls (NU) : 0
% 10.51/3.40 # Rec. Clause-clause subsumption calls : 0
% 10.51/3.40 # Non-unit clause-clause subsumptions : 0
% 10.51/3.40 # Unit Clause-clause subsumption calls : 2
% 10.51/3.40 # Rewrite failures with RHS unbound : 0
% 10.51/3.40 # BW rewrite match attempts : 0
% 10.51/3.40 # BW rewrite match successes : 0
% 10.51/3.40 # Condensation attempts : 0
% 10.51/3.40 # Condensation successes : 0
% 10.51/3.40 # Termbank termtop insertions : 27403
% 10.51/3.40
% 10.51/3.40 # -------------------------------------------------
% 10.51/3.40 # User time : 0.046 s
% 10.51/3.40 # System time : 0.006 s
% 10.51/3.40 # Total time : 0.052 s
% 10.51/3.40 # ...preprocessing : 0.051 s
% 10.51/3.40 # ...main loop : 0.001 s
% 10.51/3.40 # Maximum resident set size: 9456 pages
% 10.51/3.40
%------------------------------------------------------------------------------