TSTP Solution File: CSR069+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR069+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:22 EDT 2022
% Result : Theorem 9.95s 3.78s
% Output : CNFRefutation 9.95s
% 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_432,plain,
( borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24)
| ~ mtvisible(c_tptpgeo_member1_mt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8nvmixsm/input.p',i_0_432) ).
cnf(i_0_2534,negated_conjecture,
mtvisible(c_tptpgeo_member1_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8nvmixsm/input.p',i_0_2534) ).
cnf(i_0_2533,negated_conjecture,
~ borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8nvmixsm/input.p',i_0_2533) ).
cnf(c_0_2538,plain,
( borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24)
| ~ mtvisible(c_tptpgeo_member1_mt) ),
i_0_432 ).
cnf(c_0_2539,negated_conjecture,
mtvisible(c_tptpgeo_member1_mt),
i_0_2534 ).
cnf(c_0_2540,negated_conjecture,
~ borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24),
i_0_2533 ).
cnf(c_0_2541,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2538,c_0_2539])]),c_0_2540]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR069+3 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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 : Fri Jun 10 15:38:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.43/0.60 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.43/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.43/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.43/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.95/3.78 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 9.95/3.78 # Version: 2.1pre011
% 9.95/3.78 # Preprocessing time : 0.068 s
% 9.95/3.78
% 9.95/3.78 # Proof found!
% 9.95/3.78 # SZS status Theorem
% 9.95/3.78 # SZS output start CNFRefutation
% See solution above
% 9.95/3.78 # Proof object total steps : 7
% 9.95/3.78 # Proof object clause steps : 4
% 9.95/3.78 # Proof object formula steps : 3
% 9.95/3.78 # Proof object conjectures : 4
% 9.95/3.78 # Proof object clause conjectures : 2
% 9.95/3.78 # Proof object formula conjectures : 2
% 9.95/3.78 # Proof object initial clauses used : 3
% 9.95/3.78 # Proof object initial formulas used : 3
% 9.95/3.78 # Proof object generating inferences : 0
% 9.95/3.78 # Proof object simplifying inferences : 3
% 9.95/3.78 # Training examples: 0 positive, 0 negative
% 9.95/3.78 # Parsed axioms : 2534
% 9.95/3.78 # Removed by relevancy pruning/SinE : 0
% 9.95/3.78 # Initial clauses : 2534
% 9.95/3.78 # Removed in clause preprocessing : 0
% 9.95/3.78 # Initial clauses in saturation : 2534
% 9.95/3.78 # Processed clauses : 13
% 9.95/3.78 # ...of these trivial : 1
% 9.95/3.78 # ...subsumed : 0
% 9.95/3.78 # ...remaining for further processing : 11
% 9.95/3.78 # Other redundant clauses eliminated : 0
% 9.95/3.78 # Clauses deleted for lack of memory : 0
% 9.95/3.78 # Backward-subsumed : 0
% 9.95/3.78 # Backward-rewritten : 0
% 9.95/3.78 # Generated clauses : 0
% 9.95/3.78 # ...of the previous two non-trivial : 0
% 9.95/3.78 # Contextual simplify-reflections : 0
% 9.95/3.78 # Paramodulations : 0
% 9.95/3.78 # Factorizations : 0
% 9.95/3.78 # Equation resolutions : 0
% 9.95/3.78 # Propositional unsat checks : 0
% 9.95/3.78 # Propositional unsat check successes : 0
% 9.95/3.78 # Current number of processed clauses : 11
% 9.95/3.78 # Positive orientable unit clauses : 7
% 9.95/3.78 # Positive unorientable unit clauses: 0
% 9.95/3.78 # Negative unit clauses : 2
% 9.95/3.78 # Non-unit-clauses : 2
% 9.95/3.78 # Current number of unprocessed clauses: 2521
% 9.95/3.78 # ...number of literals in the above : 4168
% 9.95/3.78 # Current number of archived formulas : 0
% 9.95/3.78 # Current number of archived clauses : 0
% 9.95/3.78 # Clause-clause subsumption calls (NU) : 0
% 9.95/3.78 # Rec. Clause-clause subsumption calls : 0
% 9.95/3.78 # Non-unit clause-clause subsumptions : 0
% 9.95/3.78 # Unit Clause-clause subsumption calls : 1
% 9.95/3.78 # Rewrite failures with RHS unbound : 0
% 9.95/3.78 # BW rewrite match attempts : 0
% 9.95/3.78 # BW rewrite match successes : 0
% 9.95/3.78 # Condensation attempts : 0
% 9.95/3.78 # Condensation successes : 0
% 9.95/3.78 # Termbank termtop insertions : 28263
% 9.95/3.78
% 9.95/3.78 # -------------------------------------------------
% 9.95/3.78 # User time : 0.064 s
% 9.95/3.78 # System time : 0.005 s
% 9.95/3.78 # Total time : 0.069 s
% 9.95/3.78 # ...preprocessing : 0.068 s
% 9.95/3.78 # ...main loop : 0.001 s
% 9.95/3.78 # Maximum resident set size: 9708 pages
% 9.95/3.78
%------------------------------------------------------------------------------