TSTP Solution File: GEO188+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO188+1 : TPTP v8.1.0. Released v3.3.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:44:07 EDT 2022
% Result : Theorem 5.83s 2.50s
% Output : CNFRefutation 5.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 13 unt; 17 nHn; 21 RR)
% Number of literals : 79 ( 0 equ; 21 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 : 43 ( 0 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-2haicaj_/input.p',i_0_4) ).
cnf(i_0_16,negated_conjecture,
distinct_points(esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2haicaj_/input.p',i_0_16) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2haicaj_/input.p',i_0_1) ).
cnf(i_0_8,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2haicaj_/input.p',i_0_8) ).
cnf(i_0_14,negated_conjecture,
apart_point_and_line(esk1_0,line_connecting(esk3_0,esk2_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2haicaj_/input.p',i_0_14) ).
cnf(i_0_19,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/sandbox2/tmp/enigma-theBenchmark.p-2haicaj_/input.p',i_0_19) ).
cnf(i_0_10,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2haicaj_/input.p',i_0_10) ).
cnf(i_0_15,negated_conjecture,
~ apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2haicaj_/input.p',i_0_15) ).
cnf(i_0_18,negated_conjecture,
distinct_points(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2haicaj_/input.p',i_0_18) ).
cnf(i_0_11,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2haicaj_/input.p',i_0_11) ).
cnf(c_0_30,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
i_0_4 ).
cnf(c_0_31,negated_conjecture,
distinct_points(esk2_0,esk3_0),
i_0_16 ).
cnf(c_0_32,negated_conjecture,
( distinct_points(esk2_0,X1)
| distinct_points(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_34,plain,
( distinct_points(esk2_0,X1)
| distinct_points(esk3_0,X2)
| distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_32]) ).
cnf(c_0_35,plain,
( distinct_points(X1,esk3_0)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
i_0_8 ).
cnf(c_0_37,negated_conjecture,
apart_point_and_line(esk1_0,line_connecting(esk3_0,esk2_0)),
i_0_14 ).
cnf(c_0_38,plain,
( distinct_points(X1,esk3_0)
| distinct_points(esk2_0,X2)
| distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_35]) ).
cnf(c_0_39,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_19 ).
cnf(c_0_40,negated_conjecture,
( distinct_lines(line_connecting(esk3_0,esk2_0),X1)
| apart_point_and_line(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( distinct_points(X1,esk2_0)
| distinct_points(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_38]) ).
cnf(c_0_42,plain,
( apart_point_and_line(X1,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(X2,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk1_0,X3)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
distinct_points(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_33,c_0_41]) ).
cnf(c_0_44,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
i_0_10 ).
cnf(c_0_45,plain,
( apart_point_and_line(esk2_0,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk2_0,X1)
| apart_point_and_line(esk3_0,X1)
| apart_point_and_line(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
~ apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
i_0_15 ).
cnf(c_0_47,plain,
( apart_point_and_line(esk2_0,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk1_0,X1)
| apart_point_and_line(esk3_0,X1)
| apart_point_and_line(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_43])]) ).
cnf(c_0_48,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))
| apart_point_and_line(esk2_0,line_connecting(esk3_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
distinct_points(esk1_0,esk2_0),
i_0_18 ).
cnf(c_0_50,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
i_0_11 ).
cnf(c_0_51,plain,
( apart_point_and_line(esk2_0,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_48]),c_0_49])]) ).
cnf(c_0_52,plain,
apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_43])]) ).
cnf(c_0_53,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_52]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO188+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 10:45:55 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected SinE mode:
% 0.20/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.83/2.50 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 5.83/2.50 # Version: 2.1pre011
% 5.83/2.50 # Preprocessing time : 0.010 s
% 5.83/2.50
% 5.83/2.50 # Proof found!
% 5.83/2.50 # SZS status Theorem
% 5.83/2.50 # SZS output start CNFRefutation
% See solution above
% 5.83/2.50 # Proof object total steps : 34
% 5.83/2.50 # Proof object clause steps : 24
% 5.83/2.50 # Proof object formula steps : 10
% 5.83/2.50 # Proof object conjectures : 11
% 5.83/2.50 # Proof object clause conjectures : 7
% 5.83/2.50 # Proof object formula conjectures : 4
% 5.83/2.50 # Proof object initial clauses used : 10
% 5.83/2.50 # Proof object initial formulas used : 10
% 5.83/2.50 # Proof object generating inferences : 14
% 5.83/2.50 # Proof object simplifying inferences : 8
% 5.83/2.50 # Training examples: 0 positive, 0 negative
% 5.83/2.50 # Parsed axioms : 19
% 5.83/2.50 # Removed by relevancy pruning/SinE : 0
% 5.83/2.50 # Initial clauses : 19
% 5.83/2.50 # Removed in clause preprocessing : 0
% 5.83/2.50 # Initial clauses in saturation : 19
% 5.83/2.50 # Processed clauses : 188
% 5.83/2.50 # ...of these trivial : 2
% 5.83/2.50 # ...subsumed : 108
% 5.83/2.50 # ...remaining for further processing : 78
% 5.83/2.50 # Other redundant clauses eliminated : 0
% 5.83/2.50 # Clauses deleted for lack of memory : 0
% 5.83/2.50 # Backward-subsumed : 2
% 5.83/2.50 # Backward-rewritten : 1
% 5.83/2.50 # Generated clauses : 627
% 5.83/2.50 # ...of the previous two non-trivial : 486
% 5.83/2.50 # Contextual simplify-reflections : 23
% 5.83/2.50 # Paramodulations : 415
% 5.83/2.50 # Factorizations : 212
% 5.83/2.50 # Equation resolutions : 0
% 5.83/2.50 # Propositional unsat checks : 0
% 5.83/2.50 # Propositional unsat check successes : 0
% 5.83/2.50 # Current number of processed clauses : 75
% 5.83/2.50 # Positive orientable unit clauses : 8
% 5.83/2.50 # Positive unorientable unit clauses: 0
% 5.83/2.50 # Negative unit clauses : 4
% 5.83/2.50 # Non-unit-clauses : 63
% 5.83/2.50 # Current number of unprocessed clauses: 305
% 5.83/2.50 # ...number of literals in the above : 1514
% 5.83/2.50 # Current number of archived formulas : 0
% 5.83/2.50 # Current number of archived clauses : 3
% 5.83/2.50 # Clause-clause subsumption calls (NU) : 1613
% 5.83/2.50 # Rec. Clause-clause subsumption calls : 847
% 5.83/2.50 # Non-unit clause-clause subsumptions : 115
% 5.83/2.50 # Unit Clause-clause subsumption calls : 41
% 5.83/2.50 # Rewrite failures with RHS unbound : 0
% 5.83/2.50 # BW rewrite match attempts : 1
% 5.83/2.50 # BW rewrite match successes : 1
% 5.83/2.50 # Condensation attempts : 0
% 5.83/2.50 # Condensation successes : 0
% 5.83/2.50 # Termbank termtop insertions : 7195
% 5.83/2.50
% 5.83/2.50 # -------------------------------------------------
% 5.83/2.50 # User time : 0.015 s
% 5.83/2.50 # System time : 0.003 s
% 5.83/2.50 # Total time : 0.018 s
% 5.83/2.50 # ...preprocessing : 0.010 s
% 5.83/2.50 # ...main loop : 0.008 s
% 5.83/2.50 # Maximum resident set size: 7136 pages
% 5.83/2.50
%------------------------------------------------------------------------------