TSTP Solution File: GEO126+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO126+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:34 EDT 2022
% Result : Theorem 8.48s 2.56s
% Output : CNFRefutation 8.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 14 unt; 3 nHn; 22 RR)
% Number of literals : 53 ( 8 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 42 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_74,plain,
( X1 = X2
| ordered_by(X3,X1,X2)
| ~ incident_o(X2,X3)
| ~ start_point(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k3nvltzc/input.p',i_0_74) ).
cnf(i_0_60,plain,
start_point(esk16_1(X1),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k3nvltzc/input.p',i_0_60) ).
cnf(i_0_34,plain,
( incident_c(X1,X2)
| ~ end_point(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k3nvltzc/input.p',i_0_34) ).
cnf(i_0_67,plain,
( end_point(esk20_1(X1),X1)
| ~ open(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k3nvltzc/input.p',i_0_67) ).
cnf(i_0_42,plain,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k3nvltzc/input.p',i_0_42) ).
cnf(i_0_15,plain,
inner_point(esk2_1(X1),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k3nvltzc/input.p',i_0_15) ).
cnf(i_0_82,negated_conjecture,
( X1 = X2
| ~ ordered_by(esk24_0,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k3nvltzc/input.p',i_0_82) ).
cnf(i_0_52,plain,
( incident_o(X1,X2)
| ~ incident_c(X1,esk13_1(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k3nvltzc/input.p',i_0_52) ).
cnf(i_0_54,plain,
open(esk13_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k3nvltzc/input.p',i_0_54) ).
cnf(i_0_41,plain,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k3nvltzc/input.p',i_0_41) ).
cnf(c_0_93,plain,
( X1 = X2
| ordered_by(X3,X1,X2)
| ~ incident_o(X2,X3)
| ~ start_point(X1,X3) ),
i_0_74 ).
cnf(c_0_94,plain,
start_point(esk16_1(X1),X1),
i_0_60 ).
cnf(c_0_95,plain,
( incident_c(X1,X2)
| ~ end_point(X1,X2) ),
i_0_34 ).
cnf(c_0_96,plain,
( end_point(esk20_1(X1),X1)
| ~ open(X1) ),
i_0_67 ).
cnf(c_0_97,plain,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
i_0_42 ).
cnf(c_0_98,plain,
inner_point(esk2_1(X1),X1),
i_0_15 ).
cnf(c_0_99,negated_conjecture,
( X1 = X2
| ~ ordered_by(esk24_0,X1,X2) ),
i_0_82 ).
cnf(c_0_100,plain,
( esk16_1(X1) = X2
| ordered_by(X1,esk16_1(X1),X2)
| ~ incident_o(X2,X1) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_101,plain,
( incident_o(X1,X2)
| ~ incident_c(X1,esk13_1(X2)) ),
i_0_52 ).
cnf(c_0_102,plain,
( incident_c(esk20_1(X1),X1)
| ~ open(X1) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_103,plain,
open(esk13_1(X1)),
i_0_54 ).
cnf(c_0_104,plain,
incident_c(esk2_1(X1),X1),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_105,negated_conjecture,
( esk16_1(esk24_0) = X1
| ~ incident_o(X1,esk24_0) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_106,plain,
incident_o(esk20_1(esk13_1(X1)),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103])]) ).
cnf(c_0_107,plain,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
i_0_41 ).
cnf(c_0_108,plain,
incident_o(esk2_1(esk13_1(X1)),X1),
inference(spm,[status(thm)],[c_0_101,c_0_104]) ).
cnf(c_0_109,plain,
esk20_1(esk13_1(esk24_0)) = esk16_1(esk24_0),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_110,plain,
~ end_point(esk2_1(X1),X1),
inference(spm,[status(thm)],[c_0_107,c_0_98]) ).
cnf(c_0_111,plain,
esk2_1(esk13_1(esk24_0)) = esk16_1(esk24_0),
inference(spm,[status(thm)],[c_0_105,c_0_108]) ).
cnf(c_0_112,plain,
end_point(esk16_1(esk24_0),esk13_1(esk24_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_109]),c_0_103])]) ).
cnf(c_0_113,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO126+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n015.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 04:24:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 # 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.48/2.56 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.48/2.56 # Version: 2.1pre011
% 8.48/2.56 # Preprocessing time : 0.019 s
% 8.48/2.56
% 8.48/2.56 # Proof found!
% 8.48/2.56 # SZS status Theorem
% 8.48/2.56 # SZS output start CNFRefutation
% See solution above
% 8.48/2.56 # Proof object total steps : 31
% 8.48/2.56 # Proof object clause steps : 21
% 8.48/2.56 # Proof object formula steps : 10
% 8.48/2.56 # Proof object conjectures : 3
% 8.48/2.56 # Proof object clause conjectures : 2
% 8.48/2.56 # Proof object formula conjectures : 1
% 8.48/2.56 # Proof object initial clauses used : 10
% 8.48/2.56 # Proof object initial formulas used : 10
% 8.48/2.56 # Proof object generating inferences : 11
% 8.48/2.56 # Proof object simplifying inferences : 6
% 8.48/2.56 # Training examples: 0 positive, 0 negative
% 8.48/2.56 # Parsed axioms : 86
% 8.48/2.56 # Removed by relevancy pruning/SinE : 0
% 8.48/2.56 # Initial clauses : 86
% 8.48/2.56 # Removed in clause preprocessing : 0
% 8.48/2.56 # Initial clauses in saturation : 86
% 8.48/2.56 # Processed clauses : 183
% 8.48/2.56 # ...of these trivial : 0
% 8.48/2.56 # ...subsumed : 12
% 8.48/2.56 # ...remaining for further processing : 171
% 8.48/2.56 # Other redundant clauses eliminated : 4
% 8.48/2.56 # Clauses deleted for lack of memory : 0
% 8.48/2.56 # Backward-subsumed : 0
% 8.48/2.56 # Backward-rewritten : 0
% 8.48/2.56 # Generated clauses : 498
% 8.48/2.56 # ...of the previous two non-trivial : 448
% 8.48/2.56 # Contextual simplify-reflections : 11
% 8.48/2.56 # Paramodulations : 476
% 8.48/2.56 # Factorizations : 11
% 8.48/2.56 # Equation resolutions : 11
% 8.48/2.56 # Propositional unsat checks : 0
% 8.48/2.56 # Propositional unsat check successes : 0
% 8.48/2.56 # Current number of processed clauses : 170
% 8.48/2.56 # Positive orientable unit clauses : 12
% 8.48/2.56 # Positive unorientable unit clauses: 0
% 8.48/2.56 # Negative unit clauses : 8
% 8.48/2.56 # Non-unit-clauses : 150
% 8.48/2.56 # Current number of unprocessed clauses: 350
% 8.48/2.56 # ...number of literals in the above : 1479
% 8.48/2.56 # Current number of archived formulas : 0
% 8.48/2.56 # Current number of archived clauses : 0
% 8.48/2.56 # Clause-clause subsumption calls (NU) : 3811
% 8.48/2.56 # Rec. Clause-clause subsumption calls : 1638
% 8.48/2.56 # Non-unit clause-clause subsumptions : 23
% 8.48/2.56 # Unit Clause-clause subsumption calls : 1122
% 8.48/2.56 # Rewrite failures with RHS unbound : 0
% 8.48/2.56 # BW rewrite match attempts : 15
% 8.48/2.56 # BW rewrite match successes : 0
% 8.48/2.56 # Condensation attempts : 0
% 8.48/2.56 # Condensation successes : 0
% 8.48/2.56 # Termbank termtop insertions : 8283
% 8.48/2.56
% 8.48/2.56 # -------------------------------------------------
% 8.48/2.56 # User time : 0.032 s
% 8.48/2.56 # System time : 0.003 s
% 8.48/2.56 # Total time : 0.035 s
% 8.48/2.56 # ...preprocessing : 0.019 s
% 8.48/2.56 # ...main loop : 0.016 s
% 8.48/2.56 # Maximum resident set size: 7124 pages
% 8.48/2.56
%------------------------------------------------------------------------------