TSTP Solution File: GEO193+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO193+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:11 EDT 2022
% Result : Theorem 7.66s 2.30s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 43 ( 18 unt; 17 nHn; 32 RR)
% Number of literals : 98 ( 0 equ; 38 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 : 68 ( 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-ctrw1_z0/input.p',i_0_4) ).
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/sandbox2/tmp/enigma-theBenchmark.p-ctrw1_z0/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/sandbox2/tmp/enigma-theBenchmark.p-ctrw1_z0/input.p',i_0_8) ).
cnf(i_0_15,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctrw1_z0/input.p',i_0_15) ).
cnf(i_0_17,negated_conjecture,
convergent_lines(esk3_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctrw1_z0/input.p',i_0_17) ).
cnf(i_0_2,plain,
~ distinct_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctrw1_z0/input.p',i_0_2) ).
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-ctrw1_z0/input.p',i_0_19) ).
cnf(i_0_9,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctrw1_z0/input.p',i_0_9) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctrw1_z0/input.p',i_0_1) ).
cnf(i_0_6,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctrw1_z0/input.p',i_0_6) ).
cnf(i_0_18,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctrw1_z0/input.p',i_0_18) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctrw1_z0/input.p',i_0_3) ).
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/sandbox2/tmp/enigma-theBenchmark.p-ctrw1_z0/input.p',i_0_12) ).
cnf(i_0_14,negated_conjecture,
~ apart_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ctrw1_z0/input.p',i_0_14) ).
cnf(c_0_34,plain,
( distinct_points(X1,X2)
| distinct_points(X3,X2)
| ~ distinct_points(X3,X1) ),
i_0_4 ).
cnf(c_0_35,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X2) ),
i_0_13 ).
cnf(c_0_36,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
i_0_8 ).
cnf(c_0_37,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
i_0_15 ).
cnf(c_0_38,plain,
( distinct_points(intersection_point(X1,X2),X3)
| distinct_points(X4,X3)
| ~ apart_point_and_line(X4,X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( distinct_lines(esk3_0,X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( distinct_lines(esk3_0,X1)
| distinct_points(intersection_point(esk1_0,esk2_0),X2)
| distinct_points(intersection_point(X1,X3),X2)
| ~ convergent_lines(X1,X3) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
convergent_lines(esk3_0,esk2_0),
i_0_17 ).
cnf(c_0_42,plain,
~ distinct_lines(X1,X1),
i_0_2 ).
cnf(c_0_43,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_44,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
i_0_9 ).
cnf(c_0_45,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_46,negated_conjecture,
( distinct_points(intersection_point(esk3_0,esk2_0),X1)
| distinct_points(intersection_point(esk1_0,esk2_0),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_47,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_6 ).
cnf(c_0_48,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_18 ).
cnf(c_0_49,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_43,c_0_44]) ).
cnf(c_0_50,plain,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk3_0,esk2_0)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_52,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
i_0_12 ).
cnf(c_0_54,plain,
( apart_point_and_line(intersection_point(esk3_0,esk2_0),X1)
| apart_point_and_line(intersection_point(esk3_0,esk2_0),X2)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X2)
| ~ convergent_lines(X2,X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
~ apart_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0),
i_0_14 ).
cnf(c_0_57,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_53]) ).
cnf(c_0_58,plain,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk3_0,esk2_0),esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_59,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_35]) ).
cnf(c_0_60,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_57,c_0_58]),c_0_41])]) ).
cnf(c_0_61,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_59,c_0_60]),c_0_48])]) ).
cnf(c_0_62,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_61]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO193+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n003.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 17:51:44 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.66/2.30 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.66/2.30 # Version: 2.1pre011
% 7.66/2.30 # Preprocessing time : 0.010 s
% 7.66/2.30
% 7.66/2.30 # Proof found!
% 7.66/2.30 # SZS status Theorem
% 7.66/2.30 # SZS output start CNFRefutation
% See solution above
% 7.66/2.30 # Proof object total steps : 43
% 7.66/2.30 # Proof object clause steps : 29
% 7.66/2.30 # Proof object formula steps : 14
% 7.66/2.30 # Proof object conjectures : 12
% 7.66/2.30 # Proof object clause conjectures : 8
% 7.66/2.30 # Proof object formula conjectures : 4
% 7.66/2.30 # Proof object initial clauses used : 14
% 7.66/2.30 # Proof object initial formulas used : 14
% 7.66/2.30 # Proof object generating inferences : 15
% 7.66/2.30 # Proof object simplifying inferences : 8
% 7.66/2.30 # Training examples: 0 positive, 0 negative
% 7.66/2.30 # Parsed axioms : 19
% 7.66/2.30 # Removed by relevancy pruning/SinE : 0
% 7.66/2.30 # Initial clauses : 19
% 7.66/2.30 # Removed in clause preprocessing : 0
% 7.66/2.30 # Initial clauses in saturation : 19
% 7.66/2.30 # Processed clauses : 332
% 7.66/2.30 # ...of these trivial : 4
% 7.66/2.30 # ...subsumed : 156
% 7.66/2.30 # ...remaining for further processing : 172
% 7.66/2.30 # Other redundant clauses eliminated : 0
% 7.66/2.30 # Clauses deleted for lack of memory : 0
% 7.66/2.30 # Backward-subsumed : 15
% 7.66/2.30 # Backward-rewritten : 1
% 7.66/2.30 # Generated clauses : 2900
% 7.66/2.30 # ...of the previous two non-trivial : 2406
% 7.66/2.30 # Contextual simplify-reflections : 79
% 7.66/2.30 # Paramodulations : 2644
% 7.66/2.30 # Factorizations : 256
% 7.66/2.30 # Equation resolutions : 0
% 7.66/2.30 # Propositional unsat checks : 0
% 7.66/2.30 # Propositional unsat check successes : 0
% 7.66/2.30 # Current number of processed clauses : 156
% 7.66/2.30 # Positive orientable unit clauses : 16
% 7.66/2.30 # Positive unorientable unit clauses: 0
% 7.66/2.30 # Negative unit clauses : 4
% 7.66/2.30 # Non-unit-clauses : 136
% 7.66/2.30 # Current number of unprocessed clauses: 1860
% 7.66/2.30 # ...number of literals in the above : 11671
% 7.66/2.30 # Current number of archived formulas : 0
% 7.66/2.30 # Current number of archived clauses : 16
% 7.66/2.30 # Clause-clause subsumption calls (NU) : 4984
% 7.66/2.30 # Rec. Clause-clause subsumption calls : 1592
% 7.66/2.30 # Non-unit clause-clause subsumptions : 247
% 7.66/2.30 # Unit Clause-clause subsumption calls : 65
% 7.66/2.30 # Rewrite failures with RHS unbound : 0
% 7.66/2.30 # BW rewrite match attempts : 3
% 7.66/2.30 # BW rewrite match successes : 3
% 7.66/2.30 # Condensation attempts : 0
% 7.66/2.30 # Condensation successes : 0
% 7.66/2.30 # Termbank termtop insertions : 53925
% 7.66/2.30
% 7.66/2.30 # -------------------------------------------------
% 7.66/2.30 # User time : 0.049 s
% 7.66/2.30 # System time : 0.003 s
% 7.66/2.30 # Total time : 0.052 s
% 7.66/2.30 # ...preprocessing : 0.010 s
% 7.66/2.30 # ...main loop : 0.043 s
% 7.66/2.30 # Maximum resident set size: 7132 pages
% 7.66/2.30
%------------------------------------------------------------------------------