TSTP Solution File: GEO087+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO087+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:16 EDT 2022
% Result : Theorem 7.64s 2.52s
% Output : CNFRefutation 7.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 9 unt; 0 nHn; 16 RR)
% Number of literals : 35 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 28 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_39,plain,
( incident_c(X1,X2)
| ~ part_of(X3,X2)
| ~ incident_c(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7kwb6mv/input.p',i_0_39) ).
cnf(i_0_16,negated_conjecture,
part_of(esk8_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7kwb6mv/input.p',i_0_16) ).
cnf(i_0_26,plain,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7kwb6mv/input.p',i_0_26) ).
cnf(i_0_3,plain,
inner_point(esk1_1(X1),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7kwb6mv/input.p',i_0_3) ).
cnf(i_0_32,plain,
( end_point(X1,X2)
| ~ incident_c(X1,X3)
| ~ incident_c(X1,X2)
| ~ meet(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7kwb6mv/input.p',i_0_32) ).
cnf(i_0_15,negated_conjecture,
meet(esk10_0,esk8_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7kwb6mv/input.p',i_0_15) ).
cnf(i_0_27,plain,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m7kwb6mv/input.p',i_0_27) ).
cnf(c_0_47,plain,
( incident_c(X1,X2)
| ~ part_of(X3,X2)
| ~ incident_c(X1,X3) ),
i_0_39 ).
cnf(c_0_48,negated_conjecture,
part_of(esk8_0,esk9_0),
i_0_16 ).
cnf(c_0_49,plain,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
i_0_26 ).
cnf(c_0_50,plain,
inner_point(esk1_1(X1),X1),
i_0_3 ).
cnf(c_0_51,plain,
( end_point(X1,X2)
| ~ incident_c(X1,X3)
| ~ incident_c(X1,X2)
| ~ meet(X4,X2,X3) ),
i_0_32 ).
cnf(c_0_52,negated_conjecture,
meet(esk10_0,esk8_0,esk9_0),
i_0_15 ).
cnf(c_0_53,negated_conjecture,
( incident_c(X1,esk9_0)
| ~ incident_c(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
i_0_27 ).
cnf(c_0_55,plain,
~ end_point(esk1_1(X1),X1),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
( end_point(X1,esk8_0)
| ~ incident_c(X1,esk8_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_57,plain,
incident_c(esk1_1(X1),X1),
inference(spm,[status(thm)],[c_0_54,c_0_50]) ).
cnf(c_0_58,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO087+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n010.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 17:04:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.64/2.52 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.64/2.52 # Version: 2.1pre011
% 7.64/2.52 # Preprocessing time : 0.018 s
% 7.64/2.52
% 7.64/2.52 # Proof found!
% 7.64/2.52 # SZS status Theorem
% 7.64/2.52 # SZS output start CNFRefutation
% See solution above
% 7.64/2.52 # Proof object total steps : 19
% 7.64/2.52 # Proof object clause steps : 12
% 7.64/2.52 # Proof object formula steps : 7
% 7.64/2.52 # Proof object conjectures : 6
% 7.64/2.52 # Proof object clause conjectures : 4
% 7.64/2.52 # Proof object formula conjectures : 2
% 7.64/2.52 # Proof object initial clauses used : 7
% 7.64/2.52 # Proof object initial formulas used : 7
% 7.64/2.52 # Proof object generating inferences : 5
% 7.64/2.52 # Proof object simplifying inferences : 3
% 7.64/2.52 # Training examples: 0 positive, 0 negative
% 7.64/2.52 # Parsed axioms : 45
% 7.64/2.52 # Removed by relevancy pruning/SinE : 0
% 7.64/2.52 # Initial clauses : 45
% 7.64/2.52 # Removed in clause preprocessing : 0
% 7.64/2.52 # Initial clauses in saturation : 45
% 7.64/2.52 # Processed clauses : 72
% 7.64/2.52 # ...of these trivial : 0
% 7.64/2.52 # ...subsumed : 2
% 7.64/2.52 # ...remaining for further processing : 70
% 7.64/2.52 # Other redundant clauses eliminated : 4
% 7.64/2.52 # Clauses deleted for lack of memory : 0
% 7.64/2.52 # Backward-subsumed : 0
% 7.64/2.52 # Backward-rewritten : 0
% 7.64/2.52 # Generated clauses : 132
% 7.64/2.52 # ...of the previous two non-trivial : 110
% 7.64/2.52 # Contextual simplify-reflections : 2
% 7.64/2.52 # Paramodulations : 116
% 7.64/2.52 # Factorizations : 8
% 7.64/2.52 # Equation resolutions : 8
% 7.64/2.52 # Propositional unsat checks : 0
% 7.64/2.52 # Propositional unsat check successes : 0
% 7.64/2.52 # Current number of processed clauses : 70
% 7.64/2.52 # Positive orientable unit clauses : 9
% 7.64/2.52 # Positive unorientable unit clauses: 0
% 7.64/2.52 # Negative unit clauses : 2
% 7.64/2.52 # Non-unit-clauses : 59
% 7.64/2.52 # Current number of unprocessed clauses: 82
% 7.64/2.52 # ...number of literals in the above : 390
% 7.64/2.52 # Current number of archived formulas : 0
% 7.64/2.52 # Current number of archived clauses : 0
% 7.64/2.52 # Clause-clause subsumption calls (NU) : 587
% 7.64/2.52 # Rec. Clause-clause subsumption calls : 324
% 7.64/2.52 # Non-unit clause-clause subsumptions : 4
% 7.64/2.52 # Unit Clause-clause subsumption calls : 55
% 7.64/2.52 # Rewrite failures with RHS unbound : 0
% 7.64/2.52 # BW rewrite match attempts : 16
% 7.64/2.52 # BW rewrite match successes : 0
% 7.64/2.52 # Condensation attempts : 0
% 7.64/2.52 # Condensation successes : 0
% 7.64/2.52 # Termbank termtop insertions : 2734
% 7.64/2.52
% 7.64/2.52 # -------------------------------------------------
% 7.64/2.52 # User time : 0.020 s
% 7.64/2.52 # System time : 0.004 s
% 7.64/2.52 # Total time : 0.024 s
% 7.64/2.52 # ...preprocessing : 0.018 s
% 7.64/2.52 # ...main loop : 0.005 s
% 7.64/2.52 # Maximum resident set size: 7132 pages
% 7.64/2.52
%------------------------------------------------------------------------------