TSTP Solution File: GEO172+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO172+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:43:54 EDT 2022
% Result : Theorem 7.40s 2.32s
% Output : CNFRefutation 7.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 37 ( 18 unt; 11 nHn; 30 RR)
% Number of literals : 76 ( 0 equ; 34 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 : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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-fx32wyhq/input.p',i_0_6) ).
cnf(i_0_17,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fx32wyhq/input.p',i_0_17) ).
cnf(i_0_5,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fx32wyhq/input.p',i_0_5) ).
cnf(i_0_9,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fx32wyhq/input.p',i_0_9) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fx32wyhq/input.p',i_0_3) ).
cnf(i_0_2,plain,
~ distinct_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fx32wyhq/input.p',i_0_2) ).
cnf(i_0_18,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-fx32wyhq/input.p',i_0_18) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fx32wyhq/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/sandbox2/tmp/enigma-theBenchmark.p-fx32wyhq/input.p',i_0_13) ).
cnf(i_0_14,negated_conjecture,
distinct_points(esk3_0,intersection_point(esk1_0,esk2_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fx32wyhq/input.p',i_0_14) ).
cnf(i_0_15,negated_conjecture,
~ apart_point_and_line(esk3_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fx32wyhq/input.p',i_0_15) ).
cnf(i_0_16,negated_conjecture,
~ apart_point_and_line(esk3_0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fx32wyhq/input.p',i_0_16) ).
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-fx32wyhq/input.p',i_0_12) ).
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_17 ).
cnf(c_0_34,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
i_0_5 ).
cnf(c_0_35,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
i_0_9 ).
cnf(c_0_36,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_37,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_38,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ convergent_lines(X1,X3) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
~ distinct_lines(X1,X1),
i_0_2 ).
cnf(c_0_41,plain,
( distinct_lines(esk1_0,X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,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_18 ).
cnf(c_0_43,plain,
distinct_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
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,X2) ),
i_0_13 ).
cnf(c_0_46,plain,
( apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X2,esk2_0)
| apart_point_and_line(X2,esk1_0)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
distinct_points(esk3_0,intersection_point(esk1_0,esk2_0)),
i_0_14 ).
cnf(c_0_48,negated_conjecture,
~ apart_point_and_line(esk3_0,esk2_0),
i_0_15 ).
cnf(c_0_49,negated_conjecture,
~ apart_point_and_line(esk3_0,esk1_0),
i_0_16 ).
cnf(c_0_50,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
i_0_12 ).
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_45]) ).
cnf(c_0_52,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) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49]) ).
cnf(c_0_53,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_50]) ).
cnf(c_0_54,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_51,c_0_52]),c_0_33])]) ).
cnf(c_0_55,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GEO172+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n022.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 04:02:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.40/2.32 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.40/2.32 # Version: 2.1pre011
% 7.40/2.32 # Preprocessing time : 0.009 s
% 7.40/2.32
% 7.40/2.32 # Proof found!
% 7.40/2.32 # SZS status Theorem
% 7.40/2.32 # SZS output start CNFRefutation
% See solution above
% 7.40/2.32 # Proof object total steps : 37
% 7.40/2.32 # Proof object clause steps : 24
% 7.40/2.32 # Proof object formula steps : 13
% 7.40/2.32 # Proof object conjectures : 10
% 7.40/2.32 # Proof object clause conjectures : 6
% 7.40/2.32 # Proof object formula conjectures : 4
% 7.40/2.32 # Proof object initial clauses used : 13
% 7.40/2.32 # Proof object initial formulas used : 13
% 7.40/2.32 # Proof object generating inferences : 11
% 7.40/2.32 # Proof object simplifying inferences : 6
% 7.40/2.32 # Training examples: 0 positive, 0 negative
% 7.40/2.32 # Parsed axioms : 18
% 7.40/2.32 # Removed by relevancy pruning/SinE : 0
% 7.40/2.32 # Initial clauses : 18
% 7.40/2.32 # Removed in clause preprocessing : 0
% 7.40/2.32 # Initial clauses in saturation : 18
% 7.40/2.32 # Processed clauses : 176
% 7.40/2.32 # ...of these trivial : 0
% 7.40/2.32 # ...subsumed : 107
% 7.40/2.32 # ...remaining for further processing : 69
% 7.40/2.32 # Other redundant clauses eliminated : 0
% 7.40/2.32 # Clauses deleted for lack of memory : 0
% 7.40/2.32 # Backward-subsumed : 0
% 7.40/2.32 # Backward-rewritten : 1
% 7.40/2.32 # Generated clauses : 547
% 7.40/2.32 # ...of the previous two non-trivial : 475
% 7.40/2.32 # Contextual simplify-reflections : 30
% 7.40/2.32 # Paramodulations : 351
% 7.40/2.32 # Factorizations : 196
% 7.40/2.32 # Equation resolutions : 0
% 7.40/2.32 # Propositional unsat checks : 0
% 7.40/2.32 # Propositional unsat check successes : 0
% 7.40/2.32 # Current number of processed clauses : 68
% 7.40/2.32 # Positive orientable unit clauses : 5
% 7.40/2.32 # Positive unorientable unit clauses: 0
% 7.40/2.32 # Negative unit clauses : 5
% 7.40/2.32 # Non-unit-clauses : 58
% 7.40/2.32 # Current number of unprocessed clauses: 309
% 7.40/2.32 # ...number of literals in the above : 1453
% 7.40/2.32 # Current number of archived formulas : 0
% 7.40/2.32 # Current number of archived clauses : 1
% 7.40/2.32 # Clause-clause subsumption calls (NU) : 1535
% 7.40/2.32 # Rec. Clause-clause subsumption calls : 823
% 7.40/2.32 # Non-unit clause-clause subsumptions : 112
% 7.40/2.32 # Unit Clause-clause subsumption calls : 2
% 7.40/2.32 # Rewrite failures with RHS unbound : 0
% 7.40/2.32 # BW rewrite match attempts : 1
% 7.40/2.32 # BW rewrite match successes : 1
% 7.40/2.32 # Condensation attempts : 0
% 7.40/2.32 # Condensation successes : 0
% 7.40/2.32 # Termbank termtop insertions : 5330
% 7.40/2.32
% 7.40/2.32 # -------------------------------------------------
% 7.40/2.32 # User time : 0.013 s
% 7.40/2.32 # System time : 0.002 s
% 7.40/2.32 # Total time : 0.015 s
% 7.40/2.32 # ...preprocessing : 0.009 s
% 7.40/2.32 # ...main loop : 0.007 s
% 7.40/2.32 # Maximum resident set size: 7140 pages
% 7.40/2.32
%------------------------------------------------------------------------------