TSTP Solution File: GEO203+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO203+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:21 EDT 2022
% Result : Theorem 6.69s 2.28s
% Output : CNFRefutation 6.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 12 unt; 6 nHn; 25 RR)
% Number of literals : 58 ( 0 equ; 21 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 : 32 ( 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-rcifdhof/input.p',i_0_18) ).
cnf(i_0_14,negated_conjecture,
distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rcifdhof/input.p',i_0_14) ).
cnf(i_0_15,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rcifdhof/input.p',i_0_15) ).
cnf(i_0_10,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X3,X2)
| ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rcifdhof/input.p',i_0_10) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rcifdhof/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/sandbox/tmp/enigma-theBenchmark.p-rcifdhof/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-rcifdhof/input.p',i_0_11) ).
cnf(i_0_16,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rcifdhof/input.p',i_0_16) ).
cnf(i_0_17,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rcifdhof/input.p',i_0_17) ).
cnf(c_0_28,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_29,negated_conjecture,
distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0),
i_0_14 ).
cnf(c_0_30,negated_conjecture,
( apart_point_and_line(X1,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(X2,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X2,esk1_0)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),
i_0_15 ).
cnf(c_0_32,plain,
( distinct_points(X1,X2)
| ~ distinct_points(X3,X2)
| ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
i_0_10 ).
cnf(c_0_33,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_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),esk1_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
~ distinct_points(X1,X1),
i_0_1 ).
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_points(X1,X2)
| ~ distinct_points(X2,X3)
| ~ apart_point_and_line(X1,line_connecting(X2,X3)) ),
i_0_11 ).
cnf(c_0_37,plain,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_31])]),c_0_34]) ).
cnf(c_0_38,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_31])]),c_0_34]) ).
cnf(c_0_40,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
i_0_16 ).
cnf(c_0_41,plain,
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_38,c_0_39]),c_0_40])]) ).
cnf(c_0_42,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_17 ).
cnf(c_0_43,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_41]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO203+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 15:35:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.69/2.28 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.69/2.28 # Version: 2.1pre011
% 6.69/2.28 # Preprocessing time : 0.010 s
% 6.69/2.28
% 6.69/2.28 # Proof found!
% 6.69/2.28 # SZS status Theorem
% 6.69/2.28 # SZS output start CNFRefutation
% See solution above
% 6.69/2.28 # Proof object total steps : 25
% 6.69/2.28 # Proof object clause steps : 16
% 6.69/2.28 # Proof object formula steps : 9
% 6.69/2.28 # Proof object conjectures : 10
% 6.69/2.28 # Proof object clause conjectures : 6
% 6.69/2.28 # Proof object formula conjectures : 4
% 6.69/2.28 # Proof object initial clauses used : 9
% 6.69/2.28 # Proof object initial formulas used : 9
% 6.69/2.28 # Proof object generating inferences : 7
% 6.69/2.28 # Proof object simplifying inferences : 10
% 6.69/2.28 # Training examples: 0 positive, 0 negative
% 6.69/2.28 # Parsed axioms : 18
% 6.69/2.28 # Removed by relevancy pruning/SinE : 0
% 6.69/2.28 # Initial clauses : 18
% 6.69/2.28 # Removed in clause preprocessing : 0
% 6.69/2.28 # Initial clauses in saturation : 18
% 6.69/2.28 # Processed clauses : 67
% 6.69/2.28 # ...of these trivial : 0
% 6.69/2.28 # ...subsumed : 9
% 6.69/2.28 # ...remaining for further processing : 58
% 6.69/2.28 # Other redundant clauses eliminated : 0
% 6.69/2.28 # Clauses deleted for lack of memory : 0
% 6.69/2.28 # Backward-subsumed : 4
% 6.69/2.28 # Backward-rewritten : 4
% 6.69/2.28 # Generated clauses : 213
% 6.69/2.28 # ...of the previous two non-trivial : 180
% 6.69/2.28 # Contextual simplify-reflections : 0
% 6.69/2.28 # Paramodulations : 195
% 6.69/2.28 # Factorizations : 18
% 6.69/2.28 # Equation resolutions : 0
% 6.69/2.28 # Propositional unsat checks : 0
% 6.69/2.28 # Propositional unsat check successes : 0
% 6.69/2.28 # Current number of processed clauses : 50
% 6.69/2.28 # Positive orientable unit clauses : 9
% 6.69/2.28 # Positive unorientable unit clauses: 0
% 6.69/2.28 # Negative unit clauses : 3
% 6.69/2.28 # Non-unit-clauses : 38
% 6.69/2.28 # Current number of unprocessed clauses: 90
% 6.69/2.28 # ...number of literals in the above : 422
% 6.69/2.28 # Current number of archived formulas : 0
% 6.69/2.28 # Current number of archived clauses : 8
% 6.69/2.28 # Clause-clause subsumption calls (NU) : 190
% 6.69/2.28 # Rec. Clause-clause subsumption calls : 118
% 6.69/2.28 # Non-unit clause-clause subsumptions : 12
% 6.69/2.28 # Unit Clause-clause subsumption calls : 18
% 6.69/2.28 # Rewrite failures with RHS unbound : 0
% 6.69/2.28 # BW rewrite match attempts : 1
% 6.69/2.28 # BW rewrite match successes : 1
% 6.69/2.28 # Condensation attempts : 0
% 6.69/2.28 # Condensation successes : 0
% 6.69/2.28 # Termbank termtop insertions : 3445
% 6.69/2.28
% 6.69/2.28 # -------------------------------------------------
% 6.69/2.28 # User time : 0.012 s
% 6.69/2.28 # System time : 0.001 s
% 6.69/2.28 # Total time : 0.013 s
% 6.69/2.28 # ...preprocessing : 0.010 s
% 6.69/2.28 # ...main loop : 0.004 s
% 6.69/2.28 # Maximum resident set size: 7128 pages
% 6.69/2.28
%------------------------------------------------------------------------------