TSTP Solution File: GEO198+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO198+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:17 EDT 2022
% Result : Theorem 4.74s 2.26s
% Output : CNFRefutation 4.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of clauses : 39 ( 15 unt; 16 nHn; 31 RR)
% Number of literals : 96 ( 0 equ; 34 neg)
% Maximal clause size : 7 ( 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 : 59 ( 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-h524wpa3/input.p',i_0_6) ).
cnf(i_0_16,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h524wpa3/input.p',i_0_16) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h524wpa3/input.p',i_0_3) ).
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-h524wpa3/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-h524wpa3/input.p',i_0_9) ).
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-h524wpa3/input.p',i_0_12) ).
cnf(i_0_14,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk3_0),esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h524wpa3/input.p',i_0_14) ).
cnf(i_0_18,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h524wpa3/input.p',i_0_18) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-h524wpa3/input.p',i_0_1) ).
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-h524wpa3/input.p',i_0_15) ).
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-h524wpa3/input.p',i_0_13) ).
cnf(c_0_31,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_6 ).
cnf(c_0_32,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
i_0_16 ).
cnf(c_0_33,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_35,plain,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk3_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_33]) ).
cnf(c_0_36,plain,
( convergent_lines(X1,esk3_0)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,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_38,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
i_0_9 ).
cnf(c_0_39,plain,
( convergent_lines(X1,esk3_0)
| convergent_lines(esk1_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_36]) ).
cnf(c_0_40,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_37,c_0_38]) ).
cnf(c_0_41,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
i_0_12 ).
cnf(c_0_42,plain,
( convergent_lines(X1,esk1_0)
| convergent_lines(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_39]) ).
cnf(c_0_43,plain,
( apart_point_and_line(intersection_point(X1,X2),X3)
| apart_point_and_line(intersection_point(X1,X2),X4)
| apart_point_and_line(X5,X3)
| apart_point_and_line(X5,X4)
| ~ apart_point_and_line(X5,X2)
| ~ convergent_lines(X4,X3)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
convergent_lines(esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_34,c_0_42]) ).
cnf(c_0_45,plain,
( apart_point_and_line(intersection_point(X1,X2),esk3_0)
| apart_point_and_line(intersection_point(X1,X2),esk1_0)
| apart_point_and_line(X3,esk3_0)
| apart_point_and_line(X3,esk1_0)
| ~ apart_point_and_line(X3,X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk3_0),esk2_0),
i_0_14 ).
cnf(c_0_47,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_18 ).
cnf(c_0_48,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_49,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk3_0)
| apart_point_and_line(intersection_point(X1,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(X1,esk2_0),esk3_0)
| ~ convergent_lines(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
~ apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
i_0_15 ).
cnf(c_0_52,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X2) ),
i_0_13 ).
cnf(c_0_53,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_41]) ).
cnf(c_0_54,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_34]) ).
cnf(c_0_55,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_52]) ).
cnf(c_0_56,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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_32])]) ).
cnf(c_0_57,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_55,c_0_56]),c_0_32])]) ).
cnf(c_0_58,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_57]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO198+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n017.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 06:33:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.74/2.26 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 4.74/2.26 # Version: 2.1pre011
% 4.74/2.26 # Preprocessing time : 0.010 s
% 4.74/2.26
% 4.74/2.26 # Proof found!
% 4.74/2.26 # SZS status Theorem
% 4.74/2.26 # SZS output start CNFRefutation
% See solution above
% 4.74/2.26 # Proof object total steps : 39
% 4.74/2.26 # Proof object clause steps : 28
% 4.74/2.26 # Proof object formula steps : 11
% 4.74/2.26 # Proof object conjectures : 12
% 4.74/2.26 # Proof object clause conjectures : 8
% 4.74/2.26 # Proof object formula conjectures : 4
% 4.74/2.26 # Proof object initial clauses used : 11
% 4.74/2.26 # Proof object initial formulas used : 11
% 4.74/2.26 # Proof object generating inferences : 17
% 4.74/2.26 # Proof object simplifying inferences : 8
% 4.74/2.26 # Training examples: 0 positive, 0 negative
% 4.74/2.26 # Parsed axioms : 19
% 4.74/2.26 # Removed by relevancy pruning/SinE : 0
% 4.74/2.26 # Initial clauses : 19
% 4.74/2.26 # Removed in clause preprocessing : 0
% 4.74/2.26 # Initial clauses in saturation : 19
% 4.74/2.26 # Processed clauses : 123
% 4.74/2.26 # ...of these trivial : 5
% 4.74/2.26 # ...subsumed : 35
% 4.74/2.26 # ...remaining for further processing : 83
% 4.74/2.26 # Other redundant clauses eliminated : 0
% 4.74/2.26 # Clauses deleted for lack of memory : 0
% 4.74/2.26 # Backward-subsumed : 2
% 4.74/2.26 # Backward-rewritten : 1
% 4.74/2.26 # Generated clauses : 633
% 4.74/2.26 # ...of the previous two non-trivial : 544
% 4.74/2.26 # Contextual simplify-reflections : 3
% 4.74/2.26 # Paramodulations : 529
% 4.74/2.26 # Factorizations : 104
% 4.74/2.26 # Equation resolutions : 0
% 4.74/2.26 # Propositional unsat checks : 0
% 4.74/2.26 # Propositional unsat check successes : 0
% 4.74/2.26 # Current number of processed clauses : 80
% 4.74/2.26 # Positive orientable unit clauses : 11
% 4.74/2.26 # Positive unorientable unit clauses: 0
% 4.74/2.26 # Negative unit clauses : 4
% 4.74/2.26 # Non-unit-clauses : 65
% 4.74/2.26 # Current number of unprocessed clauses: 421
% 4.74/2.26 # ...number of literals in the above : 2131
% 4.74/2.26 # Current number of archived formulas : 0
% 4.74/2.26 # Current number of archived clauses : 3
% 4.74/2.26 # Clause-clause subsumption calls (NU) : 721
% 4.74/2.26 # Rec. Clause-clause subsumption calls : 332
% 4.74/2.26 # Non-unit clause-clause subsumptions : 38
% 4.74/2.26 # Unit Clause-clause subsumption calls : 24
% 4.74/2.26 # Rewrite failures with RHS unbound : 0
% 4.74/2.26 # BW rewrite match attempts : 2
% 4.74/2.26 # BW rewrite match successes : 2
% 4.74/2.26 # Condensation attempts : 0
% 4.74/2.26 # Condensation successes : 0
% 4.74/2.26 # Termbank termtop insertions : 8283
% 4.74/2.26
% 4.74/2.26 # -------------------------------------------------
% 4.74/2.26 # User time : 0.015 s
% 4.74/2.26 # System time : 0.003 s
% 4.74/2.26 # Total time : 0.018 s
% 4.74/2.26 # ...preprocessing : 0.010 s
% 4.74/2.26 # ...main loop : 0.009 s
% 4.74/2.26 # Maximum resident set size: 7128 pages
% 4.74/2.26
%------------------------------------------------------------------------------