TSTP Solution File: GEO225+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO225+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:44:39 EDT 2022
% Result : Theorem 7.03s 2.37s
% Output : CNFRefutation 7.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 6 unt; 8 nHn; 10 RR)
% Number of literals : 38 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ypqbu5v8/input.p',i_0_4) ).
cnf(i_0_17,negated_conjecture,
distinct_points(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ypqbu5v8/input.p',i_0_17) ).
cnf(i_0_10,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X3,X2)
| ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ypqbu5v8/input.p',i_0_10) ).
cnf(i_0_15,negated_conjecture,
( apart_point_and_line(esk1_0,X1)
| apart_point_and_line(esk2_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ypqbu5v8/input.p',i_0_15) ).
cnf(i_0_11,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X2,X3)
| ~ apart_point_and_line(X1,line_connecting(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ypqbu5v8/input.p',i_0_11) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ypqbu5v8/input.p',i_0_1) ).
cnf(c_0_24,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
i_0_4 ).
cnf(c_0_25,negated_conjecture,
distinct_points(esk1_0,esk2_0),
i_0_17 ).
cnf(c_0_26,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X3,X2)
| ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
i_0_10 ).
cnf(c_0_27,negated_conjecture,
( apart_point_and_line(esk1_0,X1)
| apart_point_and_line(esk2_0,X1) ),
i_0_15 ).
cnf(c_0_28,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X2,X3)
| ~ apart_point_and_line(X1,line_connecting(X2,X3)) ),
i_0_11 ).
cnf(c_0_30,negated_conjecture,
( apart_point_and_line(esk2_0,line_connecting(X1,X2))
| distinct_points(esk1_0,X2)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( distinct_points(esk2_0,X1)
| distinct_points(esk1_0,X2)
| distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_28]) ).
cnf(c_0_32,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_33,plain,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_34,plain,
distinct_points(esk2_0,X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
$false,
inference(spm,[status(thm)],[c_0_32,c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO225+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n007.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 : Fri Jun 17 20:50:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 # 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
% 7.03/2.37 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.03/2.37 # Version: 2.1pre011
% 7.03/2.37 # Preprocessing time : 0.010 s
% 7.03/2.37
% 7.03/2.37 # Proof found!
% 7.03/2.37 # SZS status Theorem
% 7.03/2.37 # SZS output start CNFRefutation
% See solution above
% 7.03/2.37 # Proof object total steps : 18
% 7.03/2.37 # Proof object clause steps : 12
% 7.03/2.37 # Proof object formula steps : 6
% 7.03/2.37 # Proof object conjectures : 6
% 7.03/2.37 # Proof object clause conjectures : 4
% 7.03/2.37 # Proof object formula conjectures : 2
% 7.03/2.37 # Proof object initial clauses used : 6
% 7.03/2.37 # Proof object initial formulas used : 6
% 7.03/2.37 # Proof object generating inferences : 6
% 7.03/2.37 # Proof object simplifying inferences : 1
% 7.03/2.37 # Training examples: 0 positive, 0 negative
% 7.03/2.37 # Parsed axioms : 19
% 7.03/2.37 # Removed by relevancy pruning/SinE : 0
% 7.03/2.37 # Initial clauses : 19
% 7.03/2.37 # Removed in clause preprocessing : 0
% 7.03/2.37 # Initial clauses in saturation : 19
% 7.03/2.37 # Processed clauses : 54
% 7.03/2.37 # ...of these trivial : 2
% 7.03/2.37 # ...subsumed : 12
% 7.03/2.37 # ...remaining for further processing : 40
% 7.03/2.37 # Other redundant clauses eliminated : 0
% 7.03/2.37 # Clauses deleted for lack of memory : 0
% 7.03/2.37 # Backward-subsumed : 5
% 7.03/2.37 # Backward-rewritten : 1
% 7.03/2.37 # Generated clauses : 125
% 7.03/2.37 # ...of the previous two non-trivial : 113
% 7.03/2.37 # Contextual simplify-reflections : 4
% 7.03/2.37 # Paramodulations : 107
% 7.03/2.37 # Factorizations : 18
% 7.03/2.37 # Equation resolutions : 0
% 7.03/2.37 # Propositional unsat checks : 0
% 7.03/2.37 # Propositional unsat check successes : 0
% 7.03/2.37 # Current number of processed clauses : 34
% 7.03/2.37 # Positive orientable unit clauses : 4
% 7.03/2.37 # Positive unorientable unit clauses: 0
% 7.03/2.37 # Negative unit clauses : 3
% 7.03/2.37 # Non-unit-clauses : 27
% 7.03/2.37 # Current number of unprocessed clauses: 70
% 7.03/2.37 # ...number of literals in the above : 316
% 7.03/2.37 # Current number of archived formulas : 0
% 7.03/2.37 # Current number of archived clauses : 6
% 7.03/2.37 # Clause-clause subsumption calls (NU) : 165
% 7.03/2.37 # Rec. Clause-clause subsumption calls : 114
% 7.03/2.37 # Non-unit clause-clause subsumptions : 17
% 7.03/2.37 # Unit Clause-clause subsumption calls : 14
% 7.03/2.37 # Rewrite failures with RHS unbound : 0
% 7.03/2.37 # BW rewrite match attempts : 3
% 7.03/2.37 # BW rewrite match successes : 3
% 7.03/2.37 # Condensation attempts : 0
% 7.03/2.37 # Condensation successes : 0
% 7.03/2.37 # Termbank termtop insertions : 1624
% 7.03/2.37
% 7.03/2.37 # -------------------------------------------------
% 7.03/2.37 # User time : 0.010 s
% 7.03/2.37 # System time : 0.002 s
% 7.03/2.37 # Total time : 0.012 s
% 7.03/2.37 # ...preprocessing : 0.010 s
% 7.03/2.37 # ...main loop : 0.002 s
% 7.03/2.37 # Maximum resident set size: 7132 pages
% 7.03/2.37
%------------------------------------------------------------------------------