TSTP Solution File: GEO545+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO545+1 : TPTP v8.1.0. Released v7.5.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 : Sat Jul 16 03:46:12 EDT 2022
% Result : Theorem 9.89s 2.66s
% Output : CNFRefutation 9.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 19
% Syntax : Number of clauses : 79 ( 56 unt; 0 nHn; 79 RR)
% Number of literals : 111 ( 0 equ; 35 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 12 ( 12 usr; 12 con; 0-0 aty)
% Number of variables : 88 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_102,plain,
( perp(X1,X2,X3,X4)
| ~ perp(X1,X2,X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_102) ).
cnf(i_0_16,negated_conjecture,
perp(esk1_0,esk4_0,esk13_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_16) ).
cnf(i_0_103,plain,
( perp(X1,X2,X3,X4)
| ~ perp(X3,X4,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_103) ).
cnf(i_0_12,negated_conjecture,
perp(esk1_0,esk4_0,esk15_0,esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_12) ).
cnf(i_0_20,negated_conjecture,
perp(esk2_0,esk3_0,esk11_0,esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_20) ).
cnf(i_0_30,plain,
( midp(X1,X2,X3)
| ~ midp(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_30) ).
cnf(i_0_17,negated_conjecture,
midp(esk13_0,esk1_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_17) ).
cnf(i_0_4,negated_conjecture,
perp(esk2_0,esk3_0,esk19_0,esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_4) ).
cnf(i_0_79,plain,
( cong(X1,X2,X1,X3)
| ~ midp(X4,X2,X3)
| ~ perp(X1,X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_79) ).
cnf(i_0_13,negated_conjecture,
midp(esk15_0,esk1_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_13) ).
cnf(i_0_21,negated_conjecture,
midp(esk11_0,esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_21) ).
cnf(i_0_43,plain,
( cong(X1,X2,X3,X4)
| ~ cong(X1,X2,X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_43) ).
cnf(i_0_5,negated_conjecture,
midp(esk19_0,esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_5) ).
cnf(i_0_44,plain,
( cong(X1,X2,X3,X4)
| ~ cong(X3,X4,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_44) ).
cnf(i_0_104,plain,
( para(X1,X2,X3,X4)
| ~ perp(X5,X6,X3,X4)
| ~ perp(X1,X2,X5,X6) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_104) ).
cnf(i_0_26,negated_conjecture,
perp(esk2_0,esk3_0,esk1_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_26) ).
cnf(i_0_80,plain,
( perp(X1,X2,X3,X4)
| ~ cong(X1,X4,X2,X4)
| ~ cong(X1,X3,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_80) ).
cnf(i_0_29,plain,
( perp(X1,X2,X3,X4)
| ~ perp(X5,X6,X3,X4)
| ~ para(X1,X2,X5,X6) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_29) ).
cnf(i_0_1,negated_conjecture,
~ perp(esk8_0,esk5_0,esk7_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zviluyhy/input.p',i_0_1) ).
cnf(c_0_124,plain,
( perp(X1,X2,X3,X4)
| ~ perp(X1,X2,X4,X3) ),
i_0_102 ).
cnf(c_0_125,negated_conjecture,
perp(esk1_0,esk4_0,esk13_0,esk6_0),
i_0_16 ).
cnf(c_0_126,plain,
( perp(X1,X2,X3,X4)
| ~ perp(X3,X4,X1,X2) ),
i_0_103 ).
cnf(c_0_127,negated_conjecture,
perp(esk1_0,esk4_0,esk6_0,esk13_0),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_128,negated_conjecture,
perp(esk1_0,esk4_0,esk15_0,esk7_0),
i_0_12 ).
cnf(c_0_129,negated_conjecture,
perp(esk2_0,esk3_0,esk11_0,esk5_0),
i_0_20 ).
cnf(c_0_130,plain,
perp(esk6_0,esk13_0,esk1_0,esk4_0),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_131,plain,
( midp(X1,X2,X3)
| ~ midp(X1,X3,X2) ),
i_0_30 ).
cnf(c_0_132,negated_conjecture,
midp(esk13_0,esk1_0,esk4_0),
i_0_17 ).
cnf(c_0_133,negated_conjecture,
perp(esk1_0,esk4_0,esk7_0,esk15_0),
inference(spm,[status(thm)],[c_0_124,c_0_128]) ).
cnf(c_0_134,negated_conjecture,
perp(esk2_0,esk3_0,esk5_0,esk11_0),
inference(spm,[status(thm)],[c_0_124,c_0_129]) ).
cnf(c_0_135,negated_conjecture,
perp(esk2_0,esk3_0,esk19_0,esk8_0),
i_0_4 ).
cnf(c_0_136,plain,
( cong(X1,X2,X1,X3)
| ~ midp(X4,X2,X3)
| ~ perp(X1,X4,X2,X3) ),
i_0_79 ).
cnf(c_0_137,plain,
perp(esk6_0,esk13_0,esk4_0,esk1_0),
inference(spm,[status(thm)],[c_0_124,c_0_130]) ).
cnf(c_0_138,negated_conjecture,
midp(esk13_0,esk4_0,esk1_0),
inference(spm,[status(thm)],[c_0_131,c_0_132]) ).
cnf(c_0_139,plain,
perp(esk7_0,esk15_0,esk1_0,esk4_0),
inference(spm,[status(thm)],[c_0_126,c_0_133]) ).
cnf(c_0_140,negated_conjecture,
midp(esk15_0,esk1_0,esk4_0),
i_0_13 ).
cnf(c_0_141,plain,
perp(esk5_0,esk11_0,esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_126,c_0_134]) ).
cnf(c_0_142,negated_conjecture,
midp(esk11_0,esk2_0,esk3_0),
i_0_21 ).
cnf(c_0_143,negated_conjecture,
perp(esk2_0,esk3_0,esk8_0,esk19_0),
inference(spm,[status(thm)],[c_0_124,c_0_135]) ).
cnf(c_0_144,plain,
( cong(X1,X2,X3,X4)
| ~ cong(X1,X2,X4,X3) ),
i_0_43 ).
cnf(c_0_145,plain,
cong(esk6_0,esk4_0,esk6_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_138])]) ).
cnf(c_0_146,plain,
perp(esk7_0,esk15_0,esk4_0,esk1_0),
inference(spm,[status(thm)],[c_0_124,c_0_139]) ).
cnf(c_0_147,negated_conjecture,
midp(esk15_0,esk4_0,esk1_0),
inference(spm,[status(thm)],[c_0_131,c_0_140]) ).
cnf(c_0_148,plain,
perp(esk5_0,esk11_0,esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_124,c_0_141]) ).
cnf(c_0_149,negated_conjecture,
midp(esk11_0,esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_131,c_0_142]) ).
cnf(c_0_150,plain,
perp(esk8_0,esk19_0,esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_126,c_0_143]) ).
cnf(c_0_151,negated_conjecture,
midp(esk19_0,esk2_0,esk3_0),
i_0_5 ).
cnf(c_0_152,plain,
( cong(X1,X2,X3,X4)
| ~ cong(X3,X4,X1,X2) ),
i_0_44 ).
cnf(c_0_153,plain,
cong(esk6_0,esk4_0,esk1_0,esk6_0),
inference(spm,[status(thm)],[c_0_144,c_0_145]) ).
cnf(c_0_154,plain,
cong(esk7_0,esk4_0,esk7_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_146]),c_0_147])]) ).
cnf(c_0_155,plain,
cong(esk5_0,esk3_0,esk5_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_148]),c_0_149])]) ).
cnf(c_0_156,plain,
perp(esk8_0,esk19_0,esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_124,c_0_150]) ).
cnf(c_0_157,negated_conjecture,
midp(esk19_0,esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_131,c_0_151]) ).
cnf(c_0_158,plain,
cong(esk1_0,esk6_0,esk6_0,esk4_0),
inference(spm,[status(thm)],[c_0_152,c_0_153]) ).
cnf(c_0_159,plain,
cong(esk7_0,esk4_0,esk1_0,esk7_0),
inference(spm,[status(thm)],[c_0_144,c_0_154]) ).
cnf(c_0_160,plain,
cong(esk5_0,esk3_0,esk2_0,esk5_0),
inference(spm,[status(thm)],[c_0_144,c_0_155]) ).
cnf(c_0_161,plain,
cong(esk8_0,esk3_0,esk8_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_156]),c_0_157])]) ).
cnf(c_0_162,plain,
( para(X1,X2,X3,X4)
| ~ perp(X5,X6,X3,X4)
| ~ perp(X1,X2,X5,X6) ),
i_0_104 ).
cnf(c_0_163,negated_conjecture,
perp(esk2_0,esk3_0,esk1_0,esk4_0),
i_0_26 ).
cnf(c_0_164,plain,
( perp(X1,X2,X3,X4)
| ~ cong(X1,X4,X2,X4)
| ~ cong(X1,X3,X2,X3) ),
i_0_80 ).
cnf(c_0_165,plain,
cong(esk1_0,esk6_0,esk4_0,esk6_0),
inference(spm,[status(thm)],[c_0_144,c_0_158]) ).
cnf(c_0_166,plain,
cong(esk1_0,esk7_0,esk7_0,esk4_0),
inference(spm,[status(thm)],[c_0_152,c_0_159]) ).
cnf(c_0_167,plain,
cong(esk2_0,esk5_0,esk5_0,esk3_0),
inference(spm,[status(thm)],[c_0_152,c_0_160]) ).
cnf(c_0_168,plain,
cong(esk8_0,esk3_0,esk2_0,esk8_0),
inference(spm,[status(thm)],[c_0_144,c_0_161]) ).
cnf(c_0_169,plain,
( perp(X1,X2,X3,X4)
| ~ perp(X5,X6,X3,X4)
| ~ para(X1,X2,X5,X6) ),
i_0_29 ).
cnf(c_0_170,negated_conjecture,
( para(X1,X2,esk1_0,esk4_0)
| ~ perp(X1,X2,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_162,c_0_163]) ).
cnf(c_0_171,plain,
( perp(esk1_0,esk4_0,X1,esk6_0)
| ~ cong(esk1_0,X1,esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_164,c_0_165]) ).
cnf(c_0_172,plain,
cong(esk1_0,esk7_0,esk4_0,esk7_0),
inference(spm,[status(thm)],[c_0_144,c_0_166]) ).
cnf(c_0_173,plain,
cong(esk2_0,esk5_0,esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_144,c_0_167]) ).
cnf(c_0_174,plain,
cong(esk2_0,esk8_0,esk8_0,esk3_0),
inference(spm,[status(thm)],[c_0_152,c_0_168]) ).
cnf(c_0_175,plain,
( perp(X1,X2,X3,X4)
| ~ perp(esk1_0,esk4_0,X3,X4)
| ~ perp(X1,X2,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_169,c_0_170]) ).
cnf(c_0_176,plain,
perp(esk1_0,esk4_0,esk7_0,esk6_0),
inference(spm,[status(thm)],[c_0_171,c_0_172]) ).
cnf(c_0_177,plain,
( perp(esk2_0,esk3_0,X1,esk5_0)
| ~ cong(esk2_0,X1,esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_164,c_0_173]) ).
cnf(c_0_178,plain,
cong(esk2_0,esk8_0,esk3_0,esk8_0),
inference(spm,[status(thm)],[c_0_144,c_0_174]) ).
cnf(c_0_179,negated_conjecture,
~ perp(esk8_0,esk5_0,esk7_0,esk6_0),
i_0_1 ).
cnf(c_0_180,plain,
( perp(X1,X2,esk7_0,esk6_0)
| ~ perp(X1,X2,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_181,plain,
perp(esk2_0,esk3_0,esk8_0,esk5_0),
inference(spm,[status(thm)],[c_0_177,c_0_178]) ).
cnf(c_0_182,negated_conjecture,
~ perp(esk8_0,esk5_0,esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_179,c_0_180]) ).
cnf(c_0_183,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_181]),c_0_182]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO545+1 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 18 03:59:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.89/2.66 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 9.89/2.66 # Version: 2.1pre011
% 9.89/2.66 # Preprocessing time : 0.013 s
% 9.89/2.66
% 9.89/2.66 # Proof found!
% 9.89/2.66 # SZS status Theorem
% 9.89/2.66 # SZS output start CNFRefutation
% See solution above
% 9.89/2.66 # Proof object total steps : 79
% 9.89/2.66 # Proof object clause steps : 60
% 9.89/2.66 # Proof object formula steps : 19
% 9.89/2.66 # Proof object conjectures : 30
% 9.89/2.66 # Proof object clause conjectures : 20
% 9.89/2.66 # Proof object formula conjectures : 10
% 9.89/2.66 # Proof object initial clauses used : 19
% 9.89/2.66 # Proof object initial formulas used : 19
% 9.89/2.66 # Proof object generating inferences : 41
% 9.89/2.66 # Proof object simplifying inferences : 9
% 9.89/2.66 # Training examples: 0 positive, 0 negative
% 9.89/2.66 # Parsed axioms : 141
% 9.89/2.66 # Removed by relevancy pruning/SinE : 0
% 9.89/2.66 # Initial clauses : 141
% 9.89/2.66 # Removed in clause preprocessing : 0
% 9.89/2.66 # Initial clauses in saturation : 141
% 9.89/2.66 # Processed clauses : 1498
% 9.89/2.66 # ...of these trivial : 102
% 9.89/2.66 # ...subsumed : 115
% 9.89/2.66 # ...remaining for further processing : 1280
% 9.89/2.66 # Other redundant clauses eliminated : 0
% 9.89/2.66 # Clauses deleted for lack of memory : 0
% 9.89/2.66 # Backward-subsumed : 4
% 9.89/2.66 # Backward-rewritten : 0
% 9.89/2.66 # Generated clauses : 8412
% 9.89/2.66 # ...of the previous two non-trivial : 7620
% 9.89/2.66 # Contextual simplify-reflections : 15
% 9.89/2.66 # Paramodulations : 8412
% 9.89/2.66 # Factorizations : 0
% 9.89/2.66 # Equation resolutions : 0
% 9.89/2.66 # Propositional unsat checks : 0
% 9.89/2.66 # Propositional unsat check successes : 0
% 9.89/2.66 # Current number of processed clauses : 1276
% 9.89/2.66 # Positive orientable unit clauses : 527
% 9.89/2.66 # Positive unorientable unit clauses: 0
% 9.89/2.66 # Negative unit clauses : 2
% 9.89/2.66 # Non-unit-clauses : 747
% 9.89/2.66 # Current number of unprocessed clauses: 6238
% 9.89/2.66 # ...number of literals in the above : 19048
% 9.89/2.66 # Current number of archived formulas : 0
% 9.89/2.66 # Current number of archived clauses : 4
% 9.89/2.66 # Clause-clause subsumption calls (NU) : 35810
% 9.89/2.66 # Rec. Clause-clause subsumption calls : 26075
% 9.89/2.66 # Non-unit clause-clause subsumptions : 134
% 9.89/2.66 # Unit Clause-clause subsumption calls : 37114
% 9.89/2.66 # Rewrite failures with RHS unbound : 0
% 9.89/2.66 # BW rewrite match attempts : 1588
% 9.89/2.66 # BW rewrite match successes : 0
% 9.89/2.66 # Condensation attempts : 0
% 9.89/2.66 # Condensation successes : 0
% 9.89/2.66 # Termbank termtop insertions : 109767
% 9.89/2.66
% 9.89/2.66 # -------------------------------------------------
% 9.89/2.66 # User time : 0.145 s
% 9.89/2.66 # System time : 0.012 s
% 9.89/2.66 # Total time : 0.157 s
% 9.89/2.66 # ...preprocessing : 0.013 s
% 9.89/2.66 # ...main loop : 0.144 s
% 9.89/2.66 # Maximum resident set size: 13428 pages
% 9.89/2.66
%------------------------------------------------------------------------------