%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO204+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:22 EDT 2022
% Result : Theorem 8.45s 2.52s
% Output : CNFRefutation 8.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 10 unt; 14 nHn; 23 RR)
% Number of literals : 71 ( 0 equ; 23 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 : 35 ( 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-2m5acmiw/input.p',i_0_4) ).
cnf(i_0_16,negated_conjecture,
distinct_points(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2m5acmiw/input.p',i_0_16) ).
cnf(i_0_15,negated_conjecture,
~ distinct_points(esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2m5acmiw/input.p',i_0_15) ).
cnf(i_0_14,negated_conjecture,
( distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))
| ~ distinct_points(esk1_0,esk3_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2m5acmiw/input.p',i_0_14) ).
cnf(i_0_17,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-2m5acmiw/input.p',i_0_17) ).
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-2m5acmiw/input.p',i_0_11) ).
cnf(i_0_7,plain,
( distinct_points(X1,X2)
| apart_point_and_line(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2m5acmiw/input.p',i_0_7) ).
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-2m5acmiw/input.p',i_0_10) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2m5acmiw/input.p',i_0_1) ).
cnf(c_0_27,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
i_0_4 ).
cnf(c_0_28,negated_conjecture,
distinct_points(esk1_0,esk2_0),
i_0_16 ).
cnf(c_0_29,negated_conjecture,
~ distinct_points(esk2_0,esk3_0),
i_0_15 ).
cnf(c_0_30,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))
| ~ distinct_points(esk1_0,esk3_0) ),
i_0_14 ).
cnf(c_0_32,negated_conjecture,
distinct_points(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
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_17 ).
cnf(c_0_34,negated_conjecture,
distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_35,plain,
( apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X1,line_connecting(esk1_0,esk3_0))
| apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X2,line_connecting(esk1_0,esk3_0))
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
i_0_11 ).
cnf(c_0_37,negated_conjecture,
( apart_point_and_line(esk3_0,line_connecting(esk1_0,esk3_0))
| apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_35,c_0_32]) ).
cnf(c_0_38,plain,
( distinct_points(X1,X2)
| apart_point_and_line(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
i_0_7 ).
cnf(c_0_39,plain,
( apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))
| apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_32])]) ).
cnf(c_0_40,plain,
( apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))
| distinct_points(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
i_0_10 ).
cnf(c_0_42,plain,
( apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))
| distinct_points(esk3_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_40]),c_0_28])]) ).
cnf(c_0_43,plain,
( apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| distinct_points(esk3_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_32])]) ).
cnf(c_0_44,plain,
distinct_points(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_43]),c_0_28])]) ).
cnf(c_0_45,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_46,plain,
( distinct_points(esk3_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_44]) ).
cnf(c_0_47,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO204+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 08:34:00 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.48 # ENIGMATIC: Selected SinE mode:
% 0.21/0.49 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.45/2.52 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.45/2.52 # Version: 2.1pre011
% 8.45/2.52 # Preprocessing time : 0.009 s
% 8.45/2.52
% 8.45/2.52 # Proof found!
% 8.45/2.52 # SZS status Theorem
% 8.45/2.52 # SZS output start CNFRefutation
% See solution above
% 8.45/2.52 # Proof object total steps : 30
% 8.45/2.52 # Proof object clause steps : 21
% 8.45/2.52 # Proof object formula steps : 9
% 8.45/2.52 # Proof object conjectures : 10
% 8.45/2.52 # Proof object clause conjectures : 7
% 8.45/2.52 # Proof object formula conjectures : 3
% 8.45/2.52 # Proof object initial clauses used : 9
% 8.45/2.52 # Proof object initial formulas used : 9
% 8.45/2.52 # Proof object generating inferences : 11
% 8.45/2.52 # Proof object simplifying inferences : 11
% 8.45/2.52 # Training examples: 0 positive, 0 negative
% 8.45/2.52 # Parsed axioms : 17
% 8.45/2.52 # Removed by relevancy pruning/SinE : 0
% 8.45/2.52 # Initial clauses : 17
% 8.45/2.52 # Removed in clause preprocessing : 0
% 8.45/2.52 # Initial clauses in saturation : 17
% 8.45/2.52 # Processed clauses : 105
% 8.45/2.52 # ...of these trivial : 0
% 8.45/2.52 # ...subsumed : 47
% 8.45/2.52 # ...remaining for further processing : 58
% 8.45/2.52 # Other redundant clauses eliminated : 0
% 8.45/2.52 # Clauses deleted for lack of memory : 0
% 8.45/2.52 # Backward-subsumed : 4
% 8.45/2.52 # Backward-rewritten : 2
% 8.45/2.52 # Generated clauses : 647
% 8.45/2.52 # ...of the previous two non-trivial : 596
% 8.45/2.52 # Contextual simplify-reflections : 19
% 8.45/2.52 # Paramodulations : 539
% 8.45/2.52 # Factorizations : 108
% 8.45/2.52 # Equation resolutions : 0
% 8.45/2.52 # Propositional unsat checks : 0
% 8.45/2.52 # Propositional unsat check successes : 0
% 8.45/2.52 # Current number of processed clauses : 52
% 8.45/2.52 # Positive orientable unit clauses : 5
% 8.45/2.52 # Positive unorientable unit clauses: 0
% 8.45/2.52 # Negative unit clauses : 4
% 8.45/2.52 # Non-unit-clauses : 43
% 8.45/2.52 # Current number of unprocessed clauses: 488
% 8.45/2.52 # ...number of literals in the above : 3344
% 8.45/2.52 # Current number of archived formulas : 0
% 8.45/2.52 # Current number of archived clauses : 6
% 8.45/2.52 # Clause-clause subsumption calls (NU) : 878
% 8.45/2.52 # Rec. Clause-clause subsumption calls : 589
% 8.45/2.52 # Non-unit clause-clause subsumptions : 69
% 8.45/2.52 # Unit Clause-clause subsumption calls : 41
% 8.45/2.52 # Rewrite failures with RHS unbound : 0
% 8.45/2.52 # BW rewrite match attempts : 3
% 8.45/2.52 # BW rewrite match successes : 3
% 8.45/2.52 # Condensation attempts : 0
% 8.45/2.52 # Condensation successes : 0
% 8.45/2.52 # Termbank termtop insertions : 12142
% 8.45/2.52
% 8.45/2.52 # -------------------------------------------------
% 8.45/2.52 # User time : 0.017 s
% 8.45/2.52 # System time : 0.002 s
% 8.45/2.52 # Total time : 0.019 s
% 8.45/2.52 # ...preprocessing : 0.009 s
% 8.45/2.52 # ...main loop : 0.010 s
% 8.45/2.52 # Maximum resident set size: 7128 pages
% 8.45/2.52
%------------------------------------------------------------------------------