TSTP Solution File: GEO173+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO173+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:55 EDT 2022
% Result : Theorem 8.71s 2.64s
% Output : CNFRefutation 8.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 10 unt; 4 nHn; 18 RR)
% Number of literals : 37 ( 0 equ; 17 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_38,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X4,X2)
| apart_point_and_line(X4,X3)
| ~ distinct_points(X4,X1)
| ~ distinct_lines(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y_rbd4fz/input.p',i_0_38) ).
cnf(i_0_28,negated_conjecture,
distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y_rbd4fz/input.p',i_0_28) ).
cnf(i_0_30,negated_conjecture,
distinct_points(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y_rbd4fz/input.p',i_0_30) ).
cnf(i_0_27,negated_conjecture,
~ apart_point_and_line(esk1_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y_rbd4fz/input.p',i_0_27) ).
cnf(i_0_26,negated_conjecture,
~ apart_point_and_line(esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y_rbd4fz/input.p',i_0_26) ).
cnf(i_0_21,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y_rbd4fz/input.p',i_0_21) ).
cnf(i_0_20,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y_rbd4fz/input.p',i_0_20) ).
cnf(c_0_46,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X4,X2)
| apart_point_and_line(X4,X3)
| ~ distinct_points(X4,X1)
| ~ distinct_lines(X3,X2) ),
i_0_38 ).
cnf(c_0_47,negated_conjecture,
distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0)),
i_0_28 ).
cnf(c_0_48,negated_conjecture,
( apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X1,esk3_0)
| apart_point_and_line(X2,esk3_0)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
distinct_points(esk1_0,esk2_0),
i_0_30 ).
cnf(c_0_50,negated_conjecture,
~ apart_point_and_line(esk1_0,esk3_0),
i_0_27 ).
cnf(c_0_51,negated_conjecture,
~ apart_point_and_line(esk2_0,esk3_0),
i_0_26 ).
cnf(c_0_52,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
i_0_21 ).
cnf(c_0_53,negated_conjecture,
( apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51]) ).
cnf(c_0_54,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
i_0_20 ).
cnf(c_0_55,plain,
apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_49])]) ).
cnf(c_0_56,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO173+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 18 10:15:39 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.71/2.64 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.71/2.64 # Version: 2.1pre011
% 8.71/2.64 # Preprocessing time : 0.019 s
% 8.71/2.64
% 8.71/2.64 # Proof found!
% 8.71/2.64 # SZS status Theorem
% 8.71/2.64 # SZS output start CNFRefutation
% See solution above
% 8.71/2.64 # Proof object total steps : 18
% 8.71/2.64 # Proof object clause steps : 11
% 8.71/2.64 # Proof object formula steps : 7
% 8.71/2.64 # Proof object conjectures : 10
% 8.71/2.64 # Proof object clause conjectures : 6
% 8.71/2.64 # Proof object formula conjectures : 4
% 8.71/2.64 # Proof object initial clauses used : 7
% 8.71/2.64 # Proof object initial formulas used : 7
% 8.71/2.64 # Proof object generating inferences : 4
% 8.71/2.64 # Proof object simplifying inferences : 6
% 8.71/2.64 # Training examples: 0 positive, 0 negative
% 8.71/2.64 # Parsed axioms : 51
% 8.71/2.64 # Removed by relevancy pruning/SinE : 0
% 8.71/2.64 # Initial clauses : 51
% 8.71/2.64 # Removed in clause preprocessing : 0
% 8.71/2.64 # Initial clauses in saturation : 51
% 8.71/2.64 # Processed clauses : 56
% 8.71/2.64 # ...of these trivial : 0
% 8.71/2.64 # ...subsumed : 4
% 8.71/2.64 # ...remaining for further processing : 52
% 8.71/2.64 # Other redundant clauses eliminated : 0
% 8.71/2.64 # Clauses deleted for lack of memory : 0
% 8.71/2.64 # Backward-subsumed : 0
% 8.71/2.64 # Backward-rewritten : 1
% 8.71/2.64 # Generated clauses : 33
% 8.71/2.64 # ...of the previous two non-trivial : 21
% 8.71/2.64 # Contextual simplify-reflections : 4
% 8.71/2.64 # Paramodulations : 33
% 8.71/2.64 # Factorizations : 0
% 8.71/2.64 # Equation resolutions : 0
% 8.71/2.64 # Propositional unsat checks : 0
% 8.71/2.64 # Propositional unsat check successes : 0
% 8.71/2.64 # Current number of processed clauses : 51
% 8.71/2.64 # Positive orientable unit clauses : 6
% 8.71/2.64 # Positive unorientable unit clauses: 0
% 8.71/2.64 # Negative unit clauses : 9
% 8.71/2.64 # Non-unit-clauses : 36
% 8.71/2.64 # Current number of unprocessed clauses: 12
% 8.71/2.64 # ...number of literals in the above : 26
% 8.71/2.64 # Current number of archived formulas : 0
% 8.71/2.64 # Current number of archived clauses : 1
% 8.71/2.64 # Clause-clause subsumption calls (NU) : 284
% 8.71/2.64 # Rec. Clause-clause subsumption calls : 140
% 8.71/2.64 # Non-unit clause-clause subsumptions : 8
% 8.71/2.64 # Unit Clause-clause subsumption calls : 22
% 8.71/2.64 # Rewrite failures with RHS unbound : 0
% 8.71/2.64 # BW rewrite match attempts : 1
% 8.71/2.64 # BW rewrite match successes : 1
% 8.71/2.64 # Condensation attempts : 0
% 8.71/2.64 # Condensation successes : 0
% 8.71/2.64 # Termbank termtop insertions : 1391
% 8.71/2.64
% 8.71/2.64 # -------------------------------------------------
% 8.71/2.64 # User time : 0.015 s
% 8.71/2.64 # System time : 0.006 s
% 8.71/2.64 # Total time : 0.021 s
% 8.71/2.64 # ...preprocessing : 0.019 s
% 8.71/2.64 # ...main loop : 0.002 s
% 8.71/2.64 # Maximum resident set size: 7128 pages
% 8.71/2.64
%------------------------------------------------------------------------------