TSTP Solution File: GEO205+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO205+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:23 EDT 2022
% Result : Theorem 5.18s 2.48s
% Output : CNFRefutation 5.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of clauses : 42 ( 14 unt; 18 nHn; 31 RR)
% Number of literals : 96 ( 0 equ; 35 neg)
% Maximal clause size : 6 ( 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 : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_15,negated_conjecture,
~ distinct_lines(esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mas8mpey/input.p',i_0_15) ).
cnf(i_0_9,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mas8mpey/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-mas8mpey/input.p',i_0_6) ).
cnf(i_0_16,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mas8mpey/input.p',i_0_16) ).
cnf(i_0_5,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mas8mpey/input.p',i_0_5) ).
cnf(i_0_14,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))
| ~ convergent_lines(esk1_0,esk3_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mas8mpey/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/sandbox/tmp/enigma-theBenchmark.p-mas8mpey/input.p',i_0_17) ).
cnf(i_0_2,plain,
~ distinct_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mas8mpey/input.p',i_0_2) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mas8mpey/input.p',i_0_1) ).
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-mas8mpey/input.p',i_0_12) ).
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-mas8mpey/input.p',i_0_13) ).
cnf(i_0_8,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mas8mpey/input.p',i_0_8) ).
cnf(c_0_30,negated_conjecture,
~ distinct_lines(esk2_0,esk3_0),
i_0_15 ).
cnf(c_0_31,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
i_0_9 ).
cnf(c_0_32,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_6 ).
cnf(c_0_33,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_16 ).
cnf(c_0_34,negated_conjecture,
~ convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
i_0_5 ).
cnf(c_0_37,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))
| ~ convergent_lines(esk1_0,esk3_0) ),
i_0_14 ).
cnf(c_0_38,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ convergent_lines(X1,X3) ),
inference(spm,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_40,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_41,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_42,plain,
~ distinct_lines(X1,X1),
i_0_2 ).
cnf(c_0_43,plain,
( distinct_lines(esk3_0,X1)
| distinct_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_44,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_45,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
i_0_12 ).
cnf(c_0_46,plain,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X2)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),X2)
| ~ distinct_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
distinct_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X2) ),
i_0_13 ).
cnf(c_0_49,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_48]) ).
cnf(c_0_52,plain,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_38])]) ).
cnf(c_0_53,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
i_0_8 ).
cnf(c_0_54,plain,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_38])]) ).
cnf(c_0_55,plain,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| distinct_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,plain,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| distinct_lines(esk3_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_55]),c_0_33])]) ).
cnf(c_0_57,plain,
distinct_lines(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_56]),c_0_33])]) ).
cnf(c_0_58,plain,
( distinct_lines(esk3_0,X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_57]) ).
cnf(c_0_59,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_58]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO205+2 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 18 16:01:27 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.18/2.48 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 5.18/2.48 # Version: 2.1pre011
% 5.18/2.48 # Preprocessing time : 0.010 s
% 5.18/2.48
% 5.18/2.48 # Proof found!
% 5.18/2.48 # SZS status Theorem
% 5.18/2.48 # SZS output start CNFRefutation
% See solution above
% 5.18/2.48 # Proof object total steps : 42
% 5.18/2.48 # Proof object clause steps : 30
% 5.18/2.48 # Proof object formula steps : 12
% 5.18/2.48 # Proof object conjectures : 10
% 5.18/2.48 # Proof object clause conjectures : 7
% 5.18/2.48 # Proof object formula conjectures : 3
% 5.18/2.48 # Proof object initial clauses used : 12
% 5.18/2.48 # Proof object initial formulas used : 12
% 5.18/2.48 # Proof object generating inferences : 17
% 5.18/2.48 # Proof object simplifying inferences : 11
% 5.18/2.48 # Training examples: 0 positive, 0 negative
% 5.18/2.48 # Parsed axioms : 17
% 5.18/2.48 # Removed by relevancy pruning/SinE : 0
% 5.18/2.48 # Initial clauses : 17
% 5.18/2.48 # Removed in clause preprocessing : 0
% 5.18/2.48 # Initial clauses in saturation : 17
% 5.18/2.48 # Processed clauses : 190
% 5.18/2.48 # ...of these trivial : 1
% 5.18/2.48 # ...subsumed : 73
% 5.18/2.48 # ...remaining for further processing : 116
% 5.18/2.48 # Other redundant clauses eliminated : 0
% 5.18/2.48 # Clauses deleted for lack of memory : 0
% 5.18/2.48 # Backward-subsumed : 3
% 5.18/2.48 # Backward-rewritten : 4
% 5.18/2.48 # Generated clauses : 1280
% 5.18/2.48 # ...of the previous two non-trivial : 1151
% 5.18/2.48 # Contextual simplify-reflections : 17
% 5.18/2.48 # Paramodulations : 1152
% 5.18/2.48 # Factorizations : 128
% 5.18/2.48 # Equation resolutions : 0
% 5.18/2.48 # Propositional unsat checks : 0
% 5.18/2.48 # Propositional unsat check successes : 0
% 5.18/2.48 # Current number of processed clauses : 109
% 5.18/2.48 # Positive orientable unit clauses : 10
% 5.18/2.48 # Positive unorientable unit clauses: 0
% 5.18/2.48 # Negative unit clauses : 5
% 5.18/2.48 # Non-unit-clauses : 94
% 5.18/2.48 # Current number of unprocessed clauses: 931
% 5.18/2.48 # ...number of literals in the above : 6021
% 5.18/2.48 # Current number of archived formulas : 0
% 5.18/2.48 # Current number of archived clauses : 7
% 5.18/2.48 # Clause-clause subsumption calls (NU) : 1863
% 5.18/2.48 # Rec. Clause-clause subsumption calls : 903
% 5.18/2.48 # Non-unit clause-clause subsumptions : 91
% 5.18/2.48 # Unit Clause-clause subsumption calls : 87
% 5.18/2.48 # Rewrite failures with RHS unbound : 0
% 5.18/2.48 # BW rewrite match attempts : 4
% 5.18/2.48 # BW rewrite match successes : 4
% 5.18/2.48 # Condensation attempts : 0
% 5.18/2.48 # Condensation successes : 0
% 5.18/2.48 # Termbank termtop insertions : 23276
% 5.18/2.48
% 5.18/2.48 # -------------------------------------------------
% 5.18/2.48 # User time : 0.027 s
% 5.18/2.48 # System time : 0.003 s
% 5.18/2.48 # Total time : 0.030 s
% 5.18/2.48 # ...preprocessing : 0.010 s
% 5.18/2.48 # ...main loop : 0.020 s
% 5.18/2.48 # Maximum resident set size: 7128 pages
% 5.18/2.48
%------------------------------------------------------------------------------