TSTP Solution File: GEO215+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO215+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:31 EDT 2022
% Result : Theorem 7.77s 2.23s
% Output : CNFRefutation 7.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 12 unt; 8 nHn; 21 RR)
% Number of literals : 63 ( 0 equ; 28 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_28,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| unorthogonal_lines(X2,X4)
| unorthogonal_lines(X3,X4)
| ~ distinct_lines(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qi16t8v/input.p',i_0_28) ).
cnf(i_0_9,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qi16t8v/input.p',i_0_9) ).
cnf(i_0_16,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qi16t8v/input.p',i_0_16) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qi16t8v/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/sandbox2/tmp/enigma-theBenchmark.p-9qi16t8v/input.p',i_0_12) ).
cnf(i_0_15,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qi16t8v/input.p',i_0_15) ).
cnf(i_0_14,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qi16t8v/input.p',i_0_14) ).
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-9qi16t8v/input.p',i_0_6) ).
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-9qi16t8v/input.p',i_0_13) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9qi16t8v/input.p',i_0_3) ).
cnf(c_0_39,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| unorthogonal_lines(X2,X4)
| unorthogonal_lines(X3,X4)
| ~ distinct_lines(X3,X2) ),
i_0_28 ).
cnf(c_0_40,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
i_0_9 ).
cnf(c_0_41,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| unorthogonal_lines(X2,X4)
| unorthogonal_lines(X3,X4)
| ~ convergent_lines(X2,X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_16 ).
cnf(c_0_43,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_44,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
i_0_12 ).
cnf(c_0_45,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk3_0),
i_0_15 ).
cnf(c_0_46,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X1,esk1_0)
| unorthogonal_lines(esk2_0,X2)
| unorthogonal_lines(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk3_0),
i_0_14 ).
cnf(c_0_48,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_6 ).
cnf(c_0_49,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X2) ),
i_0_13 ).
cnf(c_0_50,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X1,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_52,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_53,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_42]) ).
cnf(c_0_54,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_49]) ).
cnf(c_0_55,plain,
( apart_point_and_line(intersection_point(X1,esk1_0),esk2_0)
| ~ convergent_lines(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO215+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 14:07:56 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.77/2.23 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.77/2.23 # Version: 2.1pre011
% 7.77/2.23 # Preprocessing time : 0.017 s
% 7.77/2.23
% 7.77/2.23 # Proof found!
% 7.77/2.23 # SZS status Theorem
% 7.77/2.23 # SZS output start CNFRefutation
% See solution above
% 7.77/2.23 # Proof object total steps : 29
% 7.77/2.23 # Proof object clause steps : 19
% 7.77/2.23 # Proof object formula steps : 10
% 7.77/2.23 # Proof object conjectures : 9
% 7.77/2.23 # Proof object clause conjectures : 6
% 7.77/2.23 # Proof object formula conjectures : 3
% 7.77/2.23 # Proof object initial clauses used : 10
% 7.77/2.23 # Proof object initial formulas used : 10
% 7.77/2.23 # Proof object generating inferences : 9
% 7.77/2.23 # Proof object simplifying inferences : 3
% 7.77/2.23 # Training examples: 0 positive, 0 negative
% 7.77/2.23 # Parsed axioms : 28
% 7.77/2.23 # Removed by relevancy pruning/SinE : 0
% 7.77/2.23 # Initial clauses : 28
% 7.77/2.23 # Removed in clause preprocessing : 0
% 7.77/2.23 # Initial clauses in saturation : 28
% 7.77/2.23 # Processed clauses : 127
% 7.77/2.23 # ...of these trivial : 2
% 7.77/2.23 # ...subsumed : 28
% 7.77/2.23 # ...remaining for further processing : 97
% 7.77/2.23 # Other redundant clauses eliminated : 0
% 7.77/2.23 # Clauses deleted for lack of memory : 0
% 7.77/2.23 # Backward-subsumed : 3
% 7.77/2.23 # Backward-rewritten : 0
% 7.77/2.23 # Generated clauses : 863
% 7.77/2.23 # ...of the previous two non-trivial : 790
% 7.77/2.23 # Contextual simplify-reflections : 4
% 7.77/2.23 # Paramodulations : 771
% 7.77/2.23 # Factorizations : 92
% 7.77/2.23 # Equation resolutions : 0
% 7.77/2.23 # Propositional unsat checks : 0
% 7.77/2.23 # Propositional unsat check successes : 0
% 7.77/2.23 # Current number of processed clauses : 94
% 7.77/2.23 # Positive orientable unit clauses : 14
% 7.77/2.23 # Positive unorientable unit clauses: 0
% 7.77/2.23 # Negative unit clauses : 9
% 7.77/2.23 # Non-unit-clauses : 71
% 7.77/2.23 # Current number of unprocessed clauses: 652
% 7.77/2.23 # ...number of literals in the above : 3799
% 7.77/2.23 # Current number of archived formulas : 0
% 7.77/2.23 # Current number of archived clauses : 3
% 7.77/2.23 # Clause-clause subsumption calls (NU) : 1273
% 7.77/2.23 # Rec. Clause-clause subsumption calls : 547
% 7.77/2.23 # Non-unit clause-clause subsumptions : 34
% 7.77/2.23 # Unit Clause-clause subsumption calls : 183
% 7.77/2.23 # Rewrite failures with RHS unbound : 0
% 7.77/2.23 # BW rewrite match attempts : 0
% 7.77/2.23 # BW rewrite match successes : 0
% 7.77/2.23 # Condensation attempts : 0
% 7.77/2.23 # Condensation successes : 0
% 7.77/2.23 # Termbank termtop insertions : 11701
% 7.77/2.23
% 7.77/2.23 # -------------------------------------------------
% 7.77/2.23 # User time : 0.031 s
% 7.77/2.23 # System time : 0.004 s
% 7.77/2.23 # Total time : 0.035 s
% 7.77/2.23 # ...preprocessing : 0.017 s
% 7.77/2.23 # ...main loop : 0.018 s
% 7.77/2.23 # Maximum resident set size: 7124 pages
% 7.77/2.23
%------------------------------------------------------------------------------