TSTP Solution File: CSR069+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR069+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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 8.10s 2.72s
% Output : CNFRefutation 8.10s
% 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_511,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-8rv5i4e1/input.p',i_0_511) ).
cnf(i_0_1066,negated_conjecture,
mtvisible(c_tptpgeo_member1_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8rv5i4e1/input.p',i_0_1066) ).
cnf(i_0_1065,negated_conjecture,
~ borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8rv5i4e1/input.p',i_0_1065) ).
cnf(c_0_1070,plain,
( borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24)
| ~ mtvisible(c_tptpgeo_member1_mt) ),
i_0_511 ).
cnf(c_0_1071,negated_conjecture,
mtvisible(c_tptpgeo_member1_mt),
i_0_1066 ).
cnf(c_0_1072,negated_conjecture,
~ borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24),
i_0_1065 ).
cnf(c_0_1073,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_1070,c_0_1071])]),c_0_1072]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR069+2 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n023.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 : Sat Jun 11 07:52:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.49 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.10/2.72 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.10/2.72 # Version: 2.1pre011
% 8.10/2.72 # Preprocessing time : 0.029 s
% 8.10/2.72
% 8.10/2.72 # Proof found!
% 8.10/2.72 # SZS status Theorem
% 8.10/2.72 # SZS output start CNFRefutation
% See solution above
% 8.10/2.72 # Proof object total steps : 7
% 8.10/2.72 # Proof object clause steps : 4
% 8.10/2.72 # Proof object formula steps : 3
% 8.10/2.72 # Proof object conjectures : 4
% 8.10/2.72 # Proof object clause conjectures : 2
% 8.10/2.72 # Proof object formula conjectures : 2
% 8.10/2.72 # Proof object initial clauses used : 3
% 8.10/2.72 # Proof object initial formulas used : 3
% 8.10/2.72 # Proof object generating inferences : 0
% 8.10/2.72 # Proof object simplifying inferences : 3
% 8.10/2.72 # Training examples: 0 positive, 0 negative
% 8.10/2.72 # Parsed axioms : 1066
% 8.10/2.72 # Removed by relevancy pruning/SinE : 0
% 8.10/2.72 # Initial clauses : 1066
% 8.10/2.72 # Removed in clause preprocessing : 0
% 8.10/2.72 # Initial clauses in saturation : 1066
% 8.10/2.72 # Processed clauses : 13
% 8.10/2.72 # ...of these trivial : 0
% 8.10/2.72 # ...subsumed : 0
% 8.10/2.72 # ...remaining for further processing : 12
% 8.10/2.72 # Other redundant clauses eliminated : 0
% 8.10/2.72 # Clauses deleted for lack of memory : 0
% 8.10/2.72 # Backward-subsumed : 0
% 8.10/2.72 # Backward-rewritten : 0
% 8.10/2.72 # Generated clauses : 0
% 8.10/2.72 # ...of the previous two non-trivial : 0
% 8.10/2.72 # Contextual simplify-reflections : 0
% 8.10/2.72 # Paramodulations : 0
% 8.10/2.72 # Factorizations : 0
% 8.10/2.72 # Equation resolutions : 0
% 8.10/2.72 # Propositional unsat checks : 0
% 8.10/2.72 # Propositional unsat check successes : 0
% 8.10/2.72 # Current number of processed clauses : 12
% 8.10/2.72 # Positive orientable unit clauses : 8
% 8.10/2.72 # Positive unorientable unit clauses: 0
% 8.10/2.72 # Negative unit clauses : 2
% 8.10/2.72 # Non-unit-clauses : 2
% 8.10/2.72 # Current number of unprocessed clauses: 1053
% 8.10/2.72 # ...number of literals in the above : 1829
% 8.10/2.72 # Current number of archived formulas : 0
% 8.10/2.72 # Current number of archived clauses : 0
% 8.10/2.72 # Clause-clause subsumption calls (NU) : 0
% 8.10/2.72 # Rec. Clause-clause subsumption calls : 0
% 8.10/2.72 # Non-unit clause-clause subsumptions : 0
% 8.10/2.72 # Unit Clause-clause subsumption calls : 1
% 8.10/2.72 # Rewrite failures with RHS unbound : 0
% 8.10/2.72 # BW rewrite match attempts : 0
% 8.10/2.72 # BW rewrite match successes : 0
% 8.10/2.72 # Condensation attempts : 0
% 8.10/2.72 # Condensation successes : 0
% 8.10/2.72 # Termbank termtop insertions : 11527
% 8.10/2.72
% 8.10/2.72 # -------------------------------------------------
% 8.10/2.72 # User time : 0.025 s
% 8.10/2.72 # System time : 0.005 s
% 8.10/2.72 # Total time : 0.030 s
% 8.10/2.72 # ...preprocessing : 0.029 s
% 8.10/2.72 # ...main loop : 0.001 s
% 8.10/2.72 # Maximum resident set size: 7136 pages
% 8.10/2.72
%------------------------------------------------------------------------------