TSTP Solution File: GEO125+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO125+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:43:33 EDT 2022
% Result : Theorem 7.98s 2.47s
% Output : CNFRefutation 7.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 10 unt; 4 nHn; 26 RR)
% Number of literals : 50 ( 9 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-4 aty)
% Number of variables : 52 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( X1 != X2
| ~ between_c(X3,X1,X4,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f44wtvn6/input.p',i_0_6) ).
cnf(i_0_60,plain,
( between_c(esk17_4(X1,X2,X3,X4),X1,X2,X3)
| ~ between_o(X4,X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f44wtvn6/input.p',i_0_60) ).
cnf(i_0_7,plain,
( between_o(X1,X2,X3,X4)
| ~ ordered_by(X1,X3,X2)
| ~ ordered_by(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f44wtvn6/input.p',i_0_7) ).
cnf(i_0_41,plain,
( X1 = X2
| ordered_by(X3,X2,X1)
| ~ finish_point(X1,X3)
| ~ incident_o(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f44wtvn6/input.p',i_0_41) ).
cnf(i_0_28,negated_conjecture,
finish_point(esk11_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f44wtvn6/input.p',i_0_28) ).
cnf(i_0_53,plain,
( incident_o(X1,X2)
| ~ ordered_by(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f44wtvn6/input.p',i_0_53) ).
cnf(i_0_29,negated_conjecture,
finish_point(esk10_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f44wtvn6/input.p',i_0_29) ).
cnf(i_0_42,plain,
( incident_o(X1,X2)
| ~ finish_point(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f44wtvn6/input.p',i_0_42) ).
cnf(i_0_27,negated_conjecture,
esk11_0 != esk10_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f44wtvn6/input.p',i_0_27) ).
cnf(c_0_70,plain,
( X1 != X2
| ~ between_c(X3,X1,X4,X2) ),
i_0_6 ).
cnf(c_0_71,plain,
~ between_c(X1,X2,X3,X2),
inference(er,[status(thm)],[c_0_70]) ).
cnf(c_0_72,plain,
( between_c(esk17_4(X1,X2,X3,X4),X1,X2,X3)
| ~ between_o(X4,X1,X2,X3) ),
i_0_60 ).
cnf(c_0_73,plain,
~ between_o(X1,X2,X3,X2),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_74,plain,
( between_o(X1,X2,X3,X4)
| ~ ordered_by(X1,X3,X2)
| ~ ordered_by(X1,X4,X3) ),
i_0_7 ).
cnf(c_0_75,plain,
( X1 = X2
| ordered_by(X3,X2,X1)
| ~ finish_point(X1,X3)
| ~ incident_o(X2,X3) ),
i_0_41 ).
cnf(c_0_76,negated_conjecture,
finish_point(esk11_0,esk9_0),
i_0_28 ).
cnf(c_0_77,plain,
( ~ ordered_by(X1,X2,X3)
| ~ ordered_by(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_78,negated_conjecture,
( esk11_0 = X1
| ordered_by(esk9_0,X1,esk11_0)
| ~ incident_o(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_79,plain,
( incident_o(X1,X2)
| ~ ordered_by(X2,X3,X1) ),
i_0_53 ).
cnf(c_0_80,negated_conjecture,
finish_point(esk10_0,esk9_0),
i_0_29 ).
cnf(c_0_81,plain,
( incident_o(X1,X2)
| ~ finish_point(X1,X2) ),
i_0_42 ).
cnf(c_0_82,negated_conjecture,
( esk11_0 = X1
| ~ ordered_by(esk9_0,esk11_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]) ).
cnf(c_0_83,negated_conjecture,
( esk10_0 = X1
| ordered_by(esk9_0,X1,esk10_0)
| ~ incident_o(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_75,c_0_80]) ).
cnf(c_0_84,negated_conjecture,
incident_o(esk11_0,esk9_0),
inference(spm,[status(thm)],[c_0_81,c_0_76]) ).
cnf(c_0_85,negated_conjecture,
esk11_0 != esk10_0,
i_0_27 ).
cnf(c_0_86,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84])]),c_0_85]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO125+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.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 17 20:47:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.98/2.47 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.98/2.47 # Version: 2.1pre011
% 7.98/2.47 # Preprocessing time : 0.021 s
% 7.98/2.47
% 7.98/2.47 # Proof found!
% 7.98/2.47 # SZS status Theorem
% 7.98/2.47 # SZS output start CNFRefutation
% See solution above
% 7.98/2.47 # Proof object total steps : 26
% 7.98/2.47 # Proof object clause steps : 17
% 7.98/2.47 # Proof object formula steps : 9
% 7.98/2.47 # Proof object conjectures : 11
% 7.98/2.47 # Proof object clause conjectures : 8
% 7.98/2.47 # Proof object formula conjectures : 3
% 7.98/2.47 # Proof object initial clauses used : 9
% 7.98/2.47 # Proof object initial formulas used : 9
% 7.98/2.47 # Proof object generating inferences : 7
% 7.98/2.47 # Proof object simplifying inferences : 5
% 7.98/2.47 # Training examples: 0 positive, 0 negative
% 7.98/2.47 # Parsed axioms : 88
% 7.98/2.47 # Removed by relevancy pruning/SinE : 0
% 7.98/2.47 # Initial clauses : 88
% 7.98/2.47 # Removed in clause preprocessing : 0
% 7.98/2.47 # Initial clauses in saturation : 88
% 7.98/2.47 # Processed clauses : 111
% 7.98/2.47 # ...of these trivial : 0
% 7.98/2.47 # ...subsumed : 2
% 7.98/2.47 # ...remaining for further processing : 109
% 7.98/2.47 # Other redundant clauses eliminated : 4
% 7.98/2.47 # Clauses deleted for lack of memory : 0
% 7.98/2.47 # Backward-subsumed : 0
% 7.98/2.47 # Backward-rewritten : 0
% 7.98/2.47 # Generated clauses : 199
% 7.98/2.47 # ...of the previous two non-trivial : 163
% 7.98/2.47 # Contextual simplify-reflections : 2
% 7.98/2.47 # Paramodulations : 182
% 7.98/2.47 # Factorizations : 10
% 7.98/2.47 # Equation resolutions : 7
% 7.98/2.47 # Propositional unsat checks : 0
% 7.98/2.47 # Propositional unsat check successes : 0
% 7.98/2.47 # Current number of processed clauses : 108
% 7.98/2.47 # Positive orientable unit clauses : 10
% 7.98/2.47 # Positive unorientable unit clauses: 0
% 7.98/2.47 # Negative unit clauses : 8
% 7.98/2.47 # Non-unit-clauses : 90
% 7.98/2.47 # Current number of unprocessed clauses: 139
% 7.98/2.47 # ...number of literals in the above : 622
% 7.98/2.47 # Current number of archived formulas : 0
% 7.98/2.47 # Current number of archived clauses : 0
% 7.98/2.47 # Clause-clause subsumption calls (NU) : 1420
% 7.98/2.47 # Rec. Clause-clause subsumption calls : 571
% 7.98/2.47 # Non-unit clause-clause subsumptions : 4
% 7.98/2.47 # Unit Clause-clause subsumption calls : 554
% 7.98/2.47 # Rewrite failures with RHS unbound : 0
% 7.98/2.47 # BW rewrite match attempts : 15
% 7.98/2.47 # BW rewrite match successes : 0
% 7.98/2.47 # Condensation attempts : 0
% 7.98/2.47 # Condensation successes : 0
% 7.98/2.47 # Termbank termtop insertions : 4380
% 7.98/2.47
% 7.98/2.47 # -------------------------------------------------
% 7.98/2.47 # User time : 0.026 s
% 7.98/2.47 # System time : 0.004 s
% 7.98/2.47 # Total time : 0.030 s
% 7.98/2.47 # ...preprocessing : 0.021 s
% 7.98/2.47 # ...main loop : 0.009 s
% 7.98/2.47 # Maximum resident set size: 7128 pages
% 7.98/2.47
%------------------------------------------------------------------------------