%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO194+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:12 EDT 2022
% Result : Theorem 7.38s 2.31s
% Output : CNFRefutation 7.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 34 ( 15 unt; 11 nHn; 31 RR)
% Number of literals : 84 ( 0 equ; 34 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/tmp/enigma-theBenchmark.p-urzrq4t_/input.p',i_0_19) ).
cnf(i_0_9,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-urzrq4t_/input.p',i_0_9) ).
cnf(i_0_6,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-urzrq4t_/input.p',i_0_6) ).
cnf(i_0_18,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-urzrq4t_/input.p',i_0_18) ).
cnf(i_0_12,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-urzrq4t_/input.p',i_0_12) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-urzrq4t_/input.p',i_0_3) ).
cnf(i_0_15,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-urzrq4t_/input.p',i_0_15) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-urzrq4t_/input.p',i_0_1) ).
cnf(i_0_13,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-urzrq4t_/input.p',i_0_13) ).
cnf(i_0_16,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-urzrq4t_/input.p',i_0_16) ).
cnf(i_0_14,negated_conjecture,
~ apart_point_and_line(intersection_point(esk1_0,esk3_0),esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-urzrq4t_/input.p',i_0_14) ).
cnf(c_0_31,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_32,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
i_0_9 ).
cnf(c_0_33,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_6 ).
cnf(c_0_34,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_18 ).
cnf(c_0_35,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(X1,X4)
| ~ convergent_lines(X2,X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
i_0_12 ).
cnf(c_0_37,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_38,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( apart_point_and_line(intersection_point(X1,X2),X3)
| apart_point_and_line(intersection_point(X1,X2),X4)
| apart_point_and_line(X5,X3)
| apart_point_and_line(X5,X4)
| ~ apart_point_and_line(X5,X2)
| ~ convergent_lines(X4,X3)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( apart_point_and_line(intersection_point(X1,X2),esk2_0)
| apart_point_and_line(intersection_point(X1,X2),esk1_0)
| apart_point_and_line(X3,esk2_0)
| apart_point_and_line(X3,esk1_0)
| ~ apart_point_and_line(X3,X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
i_0_15 ).
cnf(c_0_43,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_44,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X2) ),
i_0_13 ).
cnf(c_0_45,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(X1,esk3_0),esk1_0)
| apart_point_and_line(intersection_point(X1,esk3_0),esk2_0)
| ~ convergent_lines(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
i_0_16 ).
cnf(c_0_47,negated_conjecture,
~ apart_point_and_line(intersection_point(esk1_0,esk3_0),esk2_0),
i_0_14 ).
cnf(c_0_48,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_50,plain,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_46])]) ).
cnf(c_0_51,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_36]) ).
cnf(c_0_52,plain,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_50]),c_0_34])]) ).
cnf(c_0_53,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO194+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n015.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 : Sat Jun 18 00:54:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.38/2.31 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.38/2.31 # Version: 2.1pre011
% 7.38/2.31 # Preprocessing time : 0.009 s
% 7.38/2.31
% 7.38/2.31 # Proof found!
% 7.38/2.31 # SZS status Theorem
% 7.38/2.31 # SZS output start CNFRefutation
% See solution above
% 7.38/2.31 # Proof object total steps : 34
% 7.38/2.31 # Proof object clause steps : 23
% 7.38/2.31 # Proof object formula steps : 11
% 7.38/2.31 # Proof object conjectures : 11
% 7.38/2.31 # Proof object clause conjectures : 7
% 7.38/2.31 # Proof object formula conjectures : 4
% 7.38/2.31 # Proof object initial clauses used : 11
% 7.38/2.31 # Proof object initial formulas used : 11
% 7.38/2.31 # Proof object generating inferences : 12
% 7.38/2.31 # Proof object simplifying inferences : 7
% 7.38/2.31 # Training examples: 0 positive, 0 negative
% 7.38/2.31 # Parsed axioms : 19
% 7.38/2.31 # Removed by relevancy pruning/SinE : 0
% 7.38/2.31 # Initial clauses : 19
% 7.38/2.31 # Removed in clause preprocessing : 0
% 7.38/2.31 # Initial clauses in saturation : 19
% 7.38/2.31 # Processed clauses : 133
% 7.38/2.31 # ...of these trivial : 4
% 7.38/2.31 # ...subsumed : 41
% 7.38/2.31 # ...remaining for further processing : 88
% 7.38/2.31 # Other redundant clauses eliminated : 0
% 7.38/2.31 # Clauses deleted for lack of memory : 0
% 7.38/2.31 # Backward-subsumed : 3
% 7.38/2.31 # Backward-rewritten : 1
% 7.38/2.31 # Generated clauses : 648
% 7.38/2.31 # ...of the previous two non-trivial : 564
% 7.38/2.31 # Contextual simplify-reflections : 3
% 7.38/2.31 # Paramodulations : 538
% 7.38/2.31 # Factorizations : 110
% 7.38/2.31 # Equation resolutions : 0
% 7.38/2.31 # Propositional unsat checks : 0
% 7.38/2.31 # Propositional unsat check successes : 0
% 7.38/2.31 # Current number of processed clauses : 84
% 7.38/2.31 # Positive orientable unit clauses : 13
% 7.38/2.31 # Positive unorientable unit clauses: 0
% 7.38/2.31 # Negative unit clauses : 4
% 7.38/2.31 # Non-unit-clauses : 67
% 7.38/2.31 # Current number of unprocessed clauses: 394
% 7.38/2.31 # ...number of literals in the above : 1971
% 7.38/2.31 # Current number of archived formulas : 0
% 7.38/2.31 # Current number of archived clauses : 4
% 7.38/2.31 # Clause-clause subsumption calls (NU) : 805
% 7.38/2.31 # Rec. Clause-clause subsumption calls : 350
% 7.38/2.31 # Non-unit clause-clause subsumptions : 45
% 7.38/2.31 # Unit Clause-clause subsumption calls : 32
% 7.38/2.31 # Rewrite failures with RHS unbound : 0
% 7.38/2.31 # BW rewrite match attempts : 2
% 7.38/2.31 # BW rewrite match successes : 2
% 7.38/2.31 # Condensation attempts : 0
% 7.38/2.31 # Condensation successes : 0
% 7.38/2.31 # Termbank termtop insertions : 8497
% 7.38/2.31
% 7.38/2.31 # -------------------------------------------------
% 7.38/2.31 # User time : 0.016 s
% 7.38/2.31 # System time : 0.002 s
% 7.38/2.31 # Total time : 0.018 s
% 7.38/2.31 # ...preprocessing : 0.009 s
% 7.38/2.31 # ...main loop : 0.009 s
% 7.38/2.31 # Maximum resident set size: 7128 pages
% 7.38/2.31
%------------------------------------------------------------------------------