TSTP Solution File: GEO595+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO595+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:28 EDT 2022
% Result : Theorem 8.61s 2.48s
% Output : CNFRefutation 8.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of clauses : 55 ( 20 unt; 0 nHn; 53 RR)
% Number of literals : 100 ( 0 equ; 48 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-8 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 111 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_20,plain,
( coll(X1,X2,X3)
| ~ coll(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_20) ).
cnf(i_0_5,negated_conjecture,
coll(esk6_0,esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_5) ).
cnf(i_0_31,plain,
( coll(X1,X2,X3)
| ~ coll(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_31) ).
cnf(i_0_46,plain,
( cyclic(X1,X2,X3,X4)
| ~ coll(X3,X4,X2)
| ~ eqangle(X3,X1,X3,X2,X4,X1,X4,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_46) ).
cnf(i_0_43,plain,
( eqangle(X1,X2,X3,X4,X5,X6,X3,X4)
| ~ para(X1,X2,X5,X6) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_43) ).
cnf(i_0_85,plain,
( para(X1,X2,X3,X4)
| ~ perp(X5,X6,X3,X4)
| ~ perp(X1,X2,X5,X6) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_85) ).
cnf(i_0_9,negated_conjecture,
perp(esk4_0,esk1_0,esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_9) ).
cnf(i_0_84,plain,
( perp(X1,X2,X3,X4)
| ~ perp(X3,X4,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_84) ).
cnf(i_0_42,plain,
( coll(X1,X2,X3)
| ~ coll(X3,X4,X2)
| ~ coll(X3,X4,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_42) ).
cnf(i_0_3,negated_conjecture,
coll(esk7_0,esk1_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_3) ).
cnf(i_0_15,plain,
( cyclic(X1,X2,X3,X4)
| ~ cyclic(X1,X3,X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_15) ).
cnf(i_0_16,plain,
( cyclic(X1,X2,X3,X4)
| ~ cyclic(X2,X1,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_16) ).
cnf(i_0_14,plain,
( cyclic(X1,X2,X3,X4)
| ~ cyclic(X1,X2,X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_14) ).
cnf(i_0_17,plain,
( cyclic(X1,X2,X3,X4)
| ~ cyclic(X5,X1,X2,X4)
| ~ cyclic(X5,X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_17) ).
cnf(i_0_1,negated_conjecture,
~ cyclic(esk2_0,esk3_0,esk6_0,esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y0zgobvu/input.p',i_0_1) ).
cnf(c_0_101,plain,
( coll(X1,X2,X3)
| ~ coll(X1,X3,X2) ),
i_0_20 ).
cnf(c_0_102,negated_conjecture,
coll(esk6_0,esk1_0,esk2_0),
i_0_5 ).
cnf(c_0_103,plain,
( coll(X1,X2,X3)
| ~ coll(X2,X1,X3) ),
i_0_31 ).
cnf(c_0_104,negated_conjecture,
coll(esk6_0,esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_105,plain,
( cyclic(X1,X2,X3,X4)
| ~ coll(X3,X4,X2)
| ~ eqangle(X3,X1,X3,X2,X4,X1,X4,X2) ),
i_0_46 ).
cnf(c_0_106,plain,
( eqangle(X1,X2,X3,X4,X5,X6,X3,X4)
| ~ para(X1,X2,X5,X6) ),
i_0_43 ).
cnf(c_0_107,plain,
( para(X1,X2,X3,X4)
| ~ perp(X5,X6,X3,X4)
| ~ perp(X1,X2,X5,X6) ),
i_0_85 ).
cnf(c_0_108,negated_conjecture,
perp(esk4_0,esk1_0,esk2_0,esk3_0),
i_0_9 ).
cnf(c_0_109,plain,
( perp(X1,X2,X3,X4)
| ~ perp(X3,X4,X1,X2) ),
i_0_84 ).
cnf(c_0_110,plain,
( coll(X1,X2,X3)
| ~ coll(X3,X4,X2)
| ~ coll(X3,X4,X1) ),
i_0_42 ).
cnf(c_0_111,plain,
coll(esk2_0,esk6_0,esk1_0),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_112,negated_conjecture,
coll(esk7_0,esk1_0,esk3_0),
i_0_3 ).
cnf(c_0_113,plain,
( cyclic(X1,X2,X3,X3)
| ~ para(X3,X1,X3,X1)
| ~ coll(X3,X3,X2) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_114,negated_conjecture,
( para(X1,X2,esk2_0,esk3_0)
| ~ perp(X1,X2,esk4_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_115,negated_conjecture,
perp(esk2_0,esk3_0,esk4_0,esk1_0),
inference(spm,[status(thm)],[c_0_109,c_0_108]) ).
cnf(c_0_116,plain,
( coll(X1,esk1_0,esk2_0)
| ~ coll(esk2_0,esk6_0,X1) ),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_117,negated_conjecture,
coll(esk7_0,esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_101,c_0_112]) ).
cnf(c_0_118,plain,
( cyclic(X1,X2,X3,X4)
| ~ cyclic(X1,X3,X2,X4) ),
i_0_15 ).
cnf(c_0_119,plain,
( cyclic(esk3_0,X1,esk2_0,esk2_0)
| ~ coll(esk2_0,esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_115])]) ).
cnf(c_0_120,plain,
coll(esk1_0,esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_116,c_0_111]) ).
cnf(c_0_121,plain,
( coll(X1,esk1_0,esk7_0)
| ~ coll(esk7_0,esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_110,c_0_117]) ).
cnf(c_0_122,plain,
( cyclic(X1,X2,X3,X4)
| ~ cyclic(X2,X1,X3,X4) ),
i_0_16 ).
cnf(c_0_123,plain,
( cyclic(esk3_0,esk2_0,X1,esk2_0)
| ~ coll(esk2_0,esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_124,plain,
( coll(X1,esk2_0,esk1_0)
| ~ coll(esk1_0,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_110,c_0_120]) ).
cnf(c_0_125,negated_conjecture,
coll(esk1_0,esk1_0,esk7_0),
inference(spm,[status(thm)],[c_0_121,c_0_117]) ).
cnf(c_0_126,plain,
( cyclic(X1,X2,X3,X4)
| ~ cyclic(X1,X2,X4,X3) ),
i_0_14 ).
cnf(c_0_127,plain,
( cyclic(esk2_0,esk3_0,X1,esk2_0)
| ~ coll(esk2_0,esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_128,negated_conjecture,
coll(esk7_0,esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_129,plain,
( cyclic(esk2_0,esk3_0,esk2_0,X1)
| ~ coll(esk2_0,esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_130,plain,
coll(esk7_0,esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_101,c_0_128]) ).
cnf(c_0_131,plain,
( cyclic(X1,X2,X3,X4)
| ~ cyclic(X5,X1,X2,X4)
| ~ cyclic(X5,X1,X2,X3) ),
i_0_17 ).
cnf(c_0_132,plain,
( cyclic(esk2_0,esk2_0,esk3_0,X1)
| ~ coll(esk2_0,esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_118,c_0_129]) ).
cnf(c_0_133,plain,
( coll(X1,esk2_0,esk7_0)
| ~ coll(esk7_0,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_110,c_0_130]) ).
cnf(c_0_134,negated_conjecture,
~ cyclic(esk2_0,esk3_0,esk6_0,esk7_0),
i_0_1 ).
cnf(c_0_135,plain,
( cyclic(esk2_0,esk3_0,X1,X2)
| ~ cyclic(esk2_0,esk2_0,esk3_0,X1)
| ~ coll(esk2_0,esk2_0,X2) ),
inference(spm,[status(thm)],[c_0_131,c_0_132]) ).
cnf(c_0_136,plain,
coll(esk2_0,esk2_0,esk7_0),
inference(spm,[status(thm)],[c_0_133,c_0_130]) ).
cnf(c_0_137,negated_conjecture,
( coll(X1,esk2_0,esk6_0)
| ~ coll(esk6_0,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_110,c_0_102]) ).
cnf(c_0_138,negated_conjecture,
~ cyclic(esk2_0,esk2_0,esk3_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136])]) ).
cnf(c_0_139,negated_conjecture,
coll(esk2_0,esk2_0,esk6_0),
inference(spm,[status(thm)],[c_0_137,c_0_102]) ).
cnf(c_0_140,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_132]),c_0_139])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO595+1 : TPTP v8.1.0. Released v7.5.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 21:51:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.61/2.48 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.61/2.48 # Version: 2.1pre011
% 8.61/2.48 # Preprocessing time : 0.023 s
% 8.61/2.48
% 8.61/2.48 # Proof found!
% 8.61/2.48 # SZS status Theorem
% 8.61/2.48 # SZS output start CNFRefutation
% See solution above
% 8.61/2.48 # Proof object total steps : 55
% 8.61/2.48 # Proof object clause steps : 40
% 8.61/2.48 # Proof object formula steps : 15
% 8.61/2.48 # Proof object conjectures : 17
% 8.61/2.48 # Proof object clause conjectures : 13
% 8.61/2.48 # Proof object formula conjectures : 4
% 8.61/2.48 # Proof object initial clauses used : 15
% 8.61/2.48 # Proof object initial formulas used : 15
% 8.61/2.48 # Proof object generating inferences : 25
% 8.61/2.48 # Proof object simplifying inferences : 6
% 8.61/2.48 # Training examples: 0 positive, 0 negative
% 8.61/2.48 # Parsed axioms : 122
% 8.61/2.48 # Removed by relevancy pruning/SinE : 0
% 8.61/2.48 # Initial clauses : 122
% 8.61/2.48 # Removed in clause preprocessing : 0
% 8.61/2.48 # Initial clauses in saturation : 122
% 8.61/2.48 # Processed clauses : 856
% 8.61/2.48 # ...of these trivial : 54
% 8.61/2.48 # ...subsumed : 81
% 8.61/2.48 # ...remaining for further processing : 721
% 8.61/2.48 # Other redundant clauses eliminated : 0
% 8.61/2.48 # Clauses deleted for lack of memory : 0
% 8.61/2.48 # Backward-subsumed : 7
% 8.61/2.48 # Backward-rewritten : 6
% 8.61/2.48 # Generated clauses : 4160
% 8.61/2.48 # ...of the previous two non-trivial : 3498
% 8.61/2.48 # Contextual simplify-reflections : 27
% 8.61/2.48 # Paramodulations : 4160
% 8.61/2.48 # Factorizations : 0
% 8.61/2.48 # Equation resolutions : 0
% 8.61/2.48 # Propositional unsat checks : 0
% 8.61/2.48 # Propositional unsat check successes : 0
% 8.61/2.48 # Current number of processed clauses : 708
% 8.61/2.48 # Positive orientable unit clauses : 188
% 8.61/2.48 # Positive unorientable unit clauses: 0
% 8.61/2.48 # Negative unit clauses : 2
% 8.61/2.48 # Non-unit-clauses : 518
% 8.61/2.48 # Current number of unprocessed clauses: 2742
% 8.61/2.48 # ...number of literals in the above : 9822
% 8.61/2.48 # Current number of archived formulas : 0
% 8.61/2.48 # Current number of archived clauses : 13
% 8.61/2.48 # Clause-clause subsumption calls (NU) : 27918
% 8.61/2.48 # Rec. Clause-clause subsumption calls : 15670
% 8.61/2.48 # Non-unit clause-clause subsumptions : 115
% 8.61/2.48 # Unit Clause-clause subsumption calls : 4729
% 8.61/2.48 # Rewrite failures with RHS unbound : 0
% 8.61/2.48 # BW rewrite match attempts : 439
% 8.61/2.48 # BW rewrite match successes : 4
% 8.61/2.48 # Condensation attempts : 0
% 8.61/2.48 # Condensation successes : 0
% 8.61/2.48 # Termbank termtop insertions : 51492
% 8.61/2.48
% 8.61/2.48 # -------------------------------------------------
% 8.61/2.48 # User time : 0.109 s
% 8.61/2.48 # System time : 0.010 s
% 8.61/2.48 # Total time : 0.119 s
% 8.61/2.48 # ...preprocessing : 0.023 s
% 8.61/2.48 # ...main loop : 0.096 s
% 8.61/2.48 # Maximum resident set size: 8148 pages
% 8.61/2.48
%------------------------------------------------------------------------------