TSTP Solution File: GEO202+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO202+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:20 EDT 2022
% Result : Theorem 7.39s 2.35s
% Output : CNFRefutation 7.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 12 unt; 7 nHn; 29 RR)
% Number of literals : 70 ( 0 equ; 27 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/tmp/enigma-theBenchmark.p-fajzv6ps/input.p',i_0_18) ).
cnf(i_0_9,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fajzv6ps/input.p',i_0_9) ).
cnf(i_0_15,negated_conjecture,
convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fajzv6ps/input.p',i_0_15) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fajzv6ps/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-fajzv6ps/input.p',i_0_12) ).
cnf(i_0_14,negated_conjecture,
distinct_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fajzv6ps/input.p',i_0_14) ).
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-fajzv6ps/input.p',i_0_13) ).
cnf(i_0_11,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X2,X3)
| ~ apart_point_and_line(X1,line_connecting(X2,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fajzv6ps/input.p',i_0_11) ).
cnf(i_0_16,negated_conjecture,
distinct_points(esk1_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fajzv6ps/input.p',i_0_16) ).
cnf(i_0_17,negated_conjecture,
distinct_points(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fajzv6ps/input.p',i_0_17) ).
cnf(c_0_29,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_30,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
i_0_9 ).
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)
| ~ convergent_lines(X2,X3)
| ~ distinct_points(X1,X4) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),
i_0_15 ).
cnf(c_0_33,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_34,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
i_0_12 ).
cnf(c_0_35,negated_conjecture,
( apart_point_and_line(X1,line_connecting(esk1_0,esk3_0))
| apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X2,line_connecting(esk1_0,esk3_0))
| apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))
| ~ distinct_points(X2,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
distinct_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0),
i_0_14 ).
cnf(c_0_37,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X2) ),
i_0_13 ).
cnf(c_0_38,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk2_0))
| apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk3_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_37]) ).
cnf(c_0_41,plain,
( apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_32])]) ).
cnf(c_0_42,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X2,X3)
| ~ apart_point_and_line(X1,line_connecting(X2,X3)) ),
i_0_11 ).
cnf(c_0_43,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)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_32])]) ).
cnf(c_0_44,negated_conjecture,
distinct_points(esk1_0,esk3_0),
i_0_16 ).
cnf(c_0_45,plain,
apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_33]) ).
cnf(c_0_46,negated_conjecture,
distinct_points(esk1_0,esk2_0),
i_0_17 ).
cnf(c_0_47,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_45]),c_0_46])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO202+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 18 00:44:14 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.39/2.35 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.39/2.35 # Version: 2.1pre011
% 7.39/2.35 # Preprocessing time : 0.011 s
% 7.39/2.35
% 7.39/2.35 # Proof found!
% 7.39/2.35 # SZS status Theorem
% 7.39/2.35 # SZS output start CNFRefutation
% See solution above
% 7.39/2.35 # Proof object total steps : 29
% 7.39/2.35 # Proof object clause steps : 19
% 7.39/2.35 # Proof object formula steps : 10
% 7.39/2.35 # Proof object conjectures : 10
% 7.39/2.35 # Proof object clause conjectures : 6
% 7.39/2.35 # Proof object formula conjectures : 4
% 7.39/2.35 # Proof object initial clauses used : 10
% 7.39/2.35 # Proof object initial formulas used : 10
% 7.39/2.35 # Proof object generating inferences : 9
% 7.39/2.35 # Proof object simplifying inferences : 10
% 7.39/2.35 # Training examples: 0 positive, 0 negative
% 7.39/2.35 # Parsed axioms : 18
% 7.39/2.35 # Removed by relevancy pruning/SinE : 0
% 7.39/2.35 # Initial clauses : 18
% 7.39/2.35 # Removed in clause preprocessing : 0
% 7.39/2.35 # Initial clauses in saturation : 18
% 7.39/2.35 # Processed clauses : 123
% 7.39/2.35 # ...of these trivial : 5
% 7.39/2.35 # ...subsumed : 37
% 7.39/2.35 # ...remaining for further processing : 81
% 7.39/2.35 # Other redundant clauses eliminated : 0
% 7.39/2.35 # Clauses deleted for lack of memory : 0
% 7.39/2.35 # Backward-subsumed : 8
% 7.39/2.35 # Backward-rewritten : 2
% 7.39/2.35 # Generated clauses : 795
% 7.39/2.35 # ...of the previous two non-trivial : 709
% 7.39/2.35 # Contextual simplify-reflections : 6
% 7.39/2.35 # Paramodulations : 617
% 7.39/2.35 # Factorizations : 178
% 7.39/2.35 # Equation resolutions : 0
% 7.39/2.35 # Propositional unsat checks : 0
% 7.39/2.35 # Propositional unsat check successes : 0
% 7.39/2.35 # Current number of processed clauses : 71
% 7.39/2.35 # Positive orientable unit clauses : 11
% 7.39/2.35 # Positive unorientable unit clauses: 0
% 7.39/2.35 # Negative unit clauses : 3
% 7.39/2.35 # Non-unit-clauses : 57
% 7.39/2.35 # Current number of unprocessed clauses: 554
% 7.39/2.35 # ...number of literals in the above : 3124
% 7.39/2.35 # Current number of archived formulas : 0
% 7.39/2.35 # Current number of archived clauses : 10
% 7.39/2.35 # Clause-clause subsumption calls (NU) : 1396
% 7.39/2.35 # Rec. Clause-clause subsumption calls : 533
% 7.39/2.35 # Non-unit clause-clause subsumptions : 50
% 7.39/2.35 # Unit Clause-clause subsumption calls : 68
% 7.39/2.35 # Rewrite failures with RHS unbound : 0
% 7.39/2.35 # BW rewrite match attempts : 2
% 7.39/2.35 # BW rewrite match successes : 2
% 7.39/2.35 # Condensation attempts : 0
% 7.39/2.35 # Condensation successes : 0
% 7.39/2.35 # Termbank termtop insertions : 13454
% 7.39/2.35
% 7.39/2.35 # -------------------------------------------------
% 7.39/2.35 # User time : 0.018 s
% 7.39/2.35 # System time : 0.005 s
% 7.39/2.35 # Total time : 0.023 s
% 7.39/2.35 # ...preprocessing : 0.011 s
% 7.39/2.35 # ...main loop : 0.011 s
% 7.39/2.35 # Maximum resident set size: 7124 pages
% 7.39/2.35
%------------------------------------------------------------------------------