%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO186+3 : TPTP v8.1.0. Released v4.0.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:06 EDT 2022
% Result : Theorem 7.29s 2.23s
% Output : CNFRefutation 7.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 30 ( 15 unt; 9 nHn; 23 RR)
% Number of literals : 61 ( 0 equ; 25 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_19,plain,
( convergent_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ convergent_lines(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bgfz4ynq/input.p',i_0_19) ).
cnf(i_0_29,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bgfz4ynq/input.p',i_0_29) ).
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/sandbox2/tmp/enigma-theBenchmark.p-bgfz4ynq/input.p',i_0_38) ).
cnf(i_0_26,negated_conjecture,
~ equal_points(esk1_0,intersection_point(esk3_0,esk4_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bgfz4ynq/input.p',i_0_26) ).
cnf(i_0_12,plain,
( distinct_points(X1,X2)
| equal_points(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bgfz4ynq/input.p',i_0_12) ).
cnf(i_0_4,plain,
( ~ incident_point_and_line(X1,X2)
| ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bgfz4ynq/input.p',i_0_4) ).
cnf(i_0_27,negated_conjecture,
incident_point_and_line(esk1_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bgfz4ynq/input.p',i_0_27) ).
cnf(i_0_28,negated_conjecture,
incident_point_and_line(esk1_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bgfz4ynq/input.p',i_0_28) ).
cnf(i_0_22,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bgfz4ynq/input.p',i_0_22) ).
cnf(i_0_9,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bgfz4ynq/input.p',i_0_9) ).
cnf(i_0_23,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bgfz4ynq/input.p',i_0_23) ).
cnf(c_0_50,plain,
( convergent_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ convergent_lines(X1,X3) ),
i_0_19 ).
cnf(c_0_51,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
i_0_29 ).
cnf(c_0_52,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_53,negated_conjecture,
( distinct_lines(esk4_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
~ equal_points(esk1_0,intersection_point(esk3_0,esk4_0)),
i_0_26 ).
cnf(c_0_55,plain,
( distinct_points(X1,X2)
| equal_points(X1,X2) ),
i_0_12 ).
cnf(c_0_56,plain,
( ~ incident_point_and_line(X1,X2)
| ~ apart_point_and_line(X1,X2) ),
i_0_4 ).
cnf(c_0_57,negated_conjecture,
incident_point_and_line(esk1_0,esk4_0),
i_0_27 ).
cnf(c_0_58,plain,
( apart_point_and_line(X1,esk4_0)
| apart_point_and_line(X2,esk4_0)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,X3)
| convergent_lines(esk3_0,X3)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
~ apart_point_and_line(esk1_0,esk4_0),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
incident_point_and_line(esk1_0,esk3_0),
i_0_28 ).
cnf(c_0_62,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
i_0_22 ).
cnf(c_0_63,negated_conjecture,
( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0)
| apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)
| apart_point_and_line(esk1_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_64,negated_conjecture,
~ apart_point_and_line(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_56,c_0_61]) ).
cnf(c_0_65,plain,
~ convergent_lines(X1,X1),
i_0_9 ).
cnf(c_0_66,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
i_0_23 ).
cnf(c_0_67,plain,
apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_51])]),c_0_64]),c_0_65]) ).
cnf(c_0_68,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO186+3 : TPTP v8.1.0. Released v4.0.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 15:27:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.29/2.23 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.29/2.23 # Version: 2.1pre011
% 7.29/2.23 # Preprocessing time : 0.017 s
% 7.29/2.23
% 7.29/2.23 # Proof found!
% 7.29/2.23 # SZS status Theorem
% 7.29/2.23 # SZS output start CNFRefutation
% See solution above
% 7.29/2.24 # Proof object total steps : 30
% 7.29/2.24 # Proof object clause steps : 19
% 7.29/2.24 # Proof object formula steps : 11
% 7.29/2.24 # Proof object conjectures : 13
% 7.29/2.24 # Proof object clause conjectures : 9
% 7.29/2.24 # Proof object formula conjectures : 4
% 7.29/2.24 # Proof object initial clauses used : 11
% 7.29/2.24 # Proof object initial formulas used : 11
% 7.29/2.24 # Proof object generating inferences : 8
% 7.29/2.24 # Proof object simplifying inferences : 7
% 7.29/2.24 # Training examples: 0 positive, 0 negative
% 7.29/2.24 # Parsed axioms : 51
% 7.29/2.24 # Removed by relevancy pruning/SinE : 0
% 7.29/2.24 # Initial clauses : 51
% 7.29/2.24 # Removed in clause preprocessing : 0
% 7.29/2.24 # Initial clauses in saturation : 51
% 7.29/2.24 # Processed clauses : 330
% 7.29/2.24 # ...of these trivial : 0
% 7.29/2.24 # ...subsumed : 170
% 7.29/2.24 # ...remaining for further processing : 160
% 7.29/2.24 # Other redundant clauses eliminated : 0
% 7.29/2.24 # Clauses deleted for lack of memory : 0
% 7.29/2.24 # Backward-subsumed : 5
% 7.29/2.24 # Backward-rewritten : 0
% 7.29/2.24 # Generated clauses : 1585
% 7.29/2.24 # ...of the previous two non-trivial : 1339
% 7.29/2.24 # Contextual simplify-reflections : 64
% 7.29/2.24 # Paramodulations : 1297
% 7.29/2.24 # Factorizations : 288
% 7.29/2.24 # Equation resolutions : 0
% 7.29/2.24 # Propositional unsat checks : 0
% 7.29/2.24 # Propositional unsat check successes : 0
% 7.29/2.24 # Current number of processed clauses : 155
% 7.29/2.24 # Positive orientable unit clauses : 16
% 7.29/2.24 # Positive unorientable unit clauses: 0
% 7.29/2.24 # Negative unit clauses : 10
% 7.29/2.24 # Non-unit-clauses : 129
% 7.29/2.24 # Current number of unprocessed clauses: 1007
% 7.29/2.24 # ...number of literals in the above : 4880
% 7.29/2.24 # Current number of archived formulas : 0
% 7.29/2.24 # Current number of archived clauses : 5
% 7.29/2.24 # Clause-clause subsumption calls (NU) : 5495
% 7.29/2.24 # Rec. Clause-clause subsumption calls : 2797
% 7.29/2.24 # Non-unit clause-clause subsumptions : 196
% 7.29/2.24 # Unit Clause-clause subsumption calls : 183
% 7.29/2.24 # Rewrite failures with RHS unbound : 0
% 7.29/2.24 # BW rewrite match attempts : 1
% 7.29/2.24 # BW rewrite match successes : 1
% 7.29/2.24 # Condensation attempts : 0
% 7.29/2.24 # Condensation successes : 0
% 7.29/2.24 # Termbank termtop insertions : 17993
% 7.29/2.24
% 7.29/2.24 # -------------------------------------------------
% 7.29/2.24 # User time : 0.038 s
% 7.29/2.24 # System time : 0.006 s
% 7.29/2.24 # Total time : 0.044 s
% 7.29/2.24 # ...preprocessing : 0.017 s
% 7.29/2.24 # ...main loop : 0.027 s
% 7.29/2.24 # Maximum resident set size: 7136 pages
% 7.29/2.24
%------------------------------------------------------------------------------