TSTP Solution File: GEO190+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO190+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:08 EDT 2022
% Result : Theorem 9.38s 2.76s
% Output : CNFRefutation 9.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 11 unt; 13 nHn; 20 RR)
% Number of literals : 71 ( 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 : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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-dwkq5oau/input.p',i_0_8) ).
cnf(i_0_14,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk2_0,esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dwkq5oau/input.p',i_0_14) ).
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-dwkq5oau/input.p',i_0_4) ).
cnf(i_0_18,negated_conjecture,
distinct_points(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dwkq5oau/input.p',i_0_18) ).
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-dwkq5oau/input.p',i_0_19) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dwkq5oau/input.p',i_0_1) ).
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-dwkq5oau/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-dwkq5oau/input.p',i_0_11) ).
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-dwkq5oau/input.p',i_0_10) ).
cnf(c_0_29,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
i_0_8 ).
cnf(c_0_30,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk2_0,esk1_0)),
i_0_14 ).
cnf(c_0_31,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
i_0_4 ).
cnf(c_0_32,negated_conjecture,
distinct_points(esk1_0,esk2_0),
i_0_18 ).
cnf(c_0_33,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_34,negated_conjecture,
( distinct_lines(line_connecting(esk2_0,esk1_0),X1)
| apart_point_and_line(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_36,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
( apart_point_and_line(X1,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(X2,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk3_0,X3)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
distinct_points(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
~ apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
i_0_15 ).
cnf(c_0_40,plain,
( apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk1_0,X1)
| apart_point_and_line(esk2_0,X1)
| apart_point_and_line(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X2,X3)
| ~ apart_point_and_line(X1,line_connecting(X2,X3)) ),
i_0_11 ).
cnf(c_0_42,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(esk2_0,esk1_0))
| apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X3,X2)
| ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
i_0_10 ).
cnf(c_0_44,plain,
( apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))
| apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_32])]),c_0_35]) ).
cnf(c_0_45,plain,
( apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_38])]),c_0_35]) ).
cnf(c_0_46,plain,
apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_45]),c_0_32])]),c_0_35]) ).
cnf(c_0_47,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_46]),c_0_38])]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.08 % Problem : GEO190+2 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.09 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.28 % Computer : n018.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Sat Jun 18 06:53:19 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.13/0.37 # ENIGMATIC: Selected SinE mode:
% 0.13/0.38 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.13/0.38 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.13/0.38 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.38/2.76 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 9.38/2.76 # Version: 2.1pre011
% 9.38/2.76 # Preprocessing time : 0.015 s
% 9.38/2.76
% 9.38/2.76 # Proof found!
% 9.38/2.76 # SZS status Theorem
% 9.38/2.76 # SZS output start CNFRefutation
% See solution above
% 9.38/2.76 # Proof object total steps : 28
% 9.38/2.76 # Proof object clause steps : 19
% 9.38/2.76 # Proof object formula steps : 9
% 9.38/2.76 # Proof object conjectures : 9
% 9.38/2.76 # Proof object clause conjectures : 6
% 9.38/2.76 # Proof object formula conjectures : 3
% 9.38/2.76 # Proof object initial clauses used : 9
% 9.38/2.76 # Proof object initial formulas used : 9
% 9.38/2.76 # Proof object generating inferences : 10
% 9.38/2.76 # Proof object simplifying inferences : 12
% 9.38/2.76 # Training examples: 0 positive, 0 negative
% 9.38/2.76 # Parsed axioms : 19
% 9.38/2.76 # Removed by relevancy pruning/SinE : 0
% 9.38/2.76 # Initial clauses : 19
% 9.38/2.76 # Removed in clause preprocessing : 0
% 9.38/2.76 # Initial clauses in saturation : 19
% 9.38/2.76 # Processed clauses : 166
% 9.38/2.76 # ...of these trivial : 2
% 9.38/2.76 # ...subsumed : 86
% 9.38/2.76 # ...remaining for further processing : 78
% 9.38/2.76 # Other redundant clauses eliminated : 0
% 9.38/2.76 # Clauses deleted for lack of memory : 0
% 9.38/2.76 # Backward-subsumed : 2
% 9.38/2.76 # Backward-rewritten : 3
% 9.38/2.76 # Generated clauses : 593
% 9.38/2.76 # ...of the previous two non-trivial : 463
% 9.38/2.76 # Contextual simplify-reflections : 17
% 9.38/2.76 # Paramodulations : 377
% 9.38/2.76 # Factorizations : 216
% 9.38/2.76 # Equation resolutions : 0
% 9.38/2.76 # Propositional unsat checks : 0
% 9.38/2.76 # Propositional unsat check successes : 0
% 9.38/2.76 # Current number of processed clauses : 73
% 9.38/2.76 # Positive orientable unit clauses : 8
% 9.38/2.76 # Positive unorientable unit clauses: 0
% 9.38/2.76 # Negative unit clauses : 4
% 9.38/2.76 # Non-unit-clauses : 61
% 9.38/2.76 # Current number of unprocessed clauses: 300
% 9.38/2.76 # ...number of literals in the above : 1525
% 9.38/2.76 # Current number of archived formulas : 0
% 9.38/2.76 # Current number of archived clauses : 5
% 9.38/2.76 # Clause-clause subsumption calls (NU) : 1301
% 9.38/2.76 # Rec. Clause-clause subsumption calls : 787
% 9.38/2.76 # Non-unit clause-clause subsumptions : 87
% 9.38/2.76 # Unit Clause-clause subsumption calls : 8
% 9.38/2.76 # Rewrite failures with RHS unbound : 0
% 9.38/2.76 # BW rewrite match attempts : 2
% 9.38/2.76 # BW rewrite match successes : 2
% 9.38/2.76 # Condensation attempts : 0
% 9.38/2.76 # Condensation successes : 0
% 9.38/2.76 # Termbank termtop insertions : 6949
% 9.38/2.76
% 9.38/2.76 # -------------------------------------------------
% 9.38/2.76 # User time : 0.022 s
% 9.38/2.76 # System time : 0.005 s
% 9.38/2.76 # Total time : 0.027 s
% 9.38/2.76 # ...preprocessing : 0.015 s
% 9.38/2.76 # ...main loop : 0.013 s
% 9.38/2.76 # Maximum resident set size: 7140 pages
% 9.38/2.76
%------------------------------------------------------------------------------