TSTP Solution File: GEO176+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO176+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:57 EDT 2022
% Result : Theorem 7.63s 2.38s
% Output : CNFRefutation 7.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 7 unt; 7 nHn; 14 RR)
% Number of literals : 32 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_17,plain,
( apart_point_and_line(X1,X2)
| distinct_points(X3,X1)
| ~ apart_point_and_line(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u2vnk7k8/input.p',i_0_17) ).
cnf(i_0_27,negated_conjecture,
( apart_point_and_line(esk1_0,esk3_0)
| apart_point_and_line(esk1_0,esk4_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u2vnk7k8/input.p',i_0_27) ).
cnf(i_0_26,negated_conjecture,
~ distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u2vnk7k8/input.p',i_0_26) ).
cnf(i_0_22,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u2vnk7k8/input.p',i_0_22) ).
cnf(i_0_28,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u2vnk7k8/input.p',i_0_28) ).
cnf(i_0_23,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u2vnk7k8/input.p',i_0_23) ).
cnf(c_0_35,plain,
( apart_point_and_line(X1,X2)
| distinct_points(X3,X1)
| ~ apart_point_and_line(X3,X2) ),
i_0_17 ).
cnf(c_0_36,negated_conjecture,
( apart_point_and_line(esk1_0,esk3_0)
| apart_point_and_line(esk1_0,esk4_0) ),
i_0_27 ).
cnf(c_0_37,negated_conjecture,
~ distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
i_0_26 ).
cnf(c_0_38,negated_conjecture,
( apart_point_and_line(esk1_0,esk4_0)
| apart_point_and_line(X1,esk3_0)
| distinct_points(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
i_0_22 ).
cnf(c_0_40,negated_conjecture,
( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk3_0)
| apart_point_and_line(esk1_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
i_0_28 ).
cnf(c_0_42,plain,
apart_point_and_line(esk1_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_43,plain,
( apart_point_and_line(X1,esk4_0)
| distinct_points(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_42]) ).
cnf(c_0_44,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
i_0_23 ).
cnf(c_0_45,negated_conjecture,
apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0),
inference(spm,[status(thm)],[c_0_37,c_0_43]) ).
cnf(c_0_46,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GEO176+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.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 22:45:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # 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.63/2.38 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.63/2.38 # Version: 2.1pre011
% 7.63/2.38 # Preprocessing time : 0.012 s
% 7.63/2.38
% 7.63/2.38 # Proof found!
% 7.63/2.38 # SZS status Theorem
% 7.63/2.38 # SZS output start CNFRefutation
% See solution above
% 7.63/2.38 # Proof object total steps : 18
% 7.63/2.38 # Proof object clause steps : 12
% 7.63/2.38 # Proof object formula steps : 6
% 7.63/2.38 # Proof object conjectures : 9
% 7.63/2.38 # Proof object clause conjectures : 6
% 7.63/2.38 # Proof object formula conjectures : 3
% 7.63/2.38 # Proof object initial clauses used : 6
% 7.63/2.38 # Proof object initial formulas used : 6
% 7.63/2.38 # Proof object generating inferences : 6
% 7.63/2.38 # Proof object simplifying inferences : 4
% 7.63/2.38 # Training examples: 0 positive, 0 negative
% 7.63/2.38 # Parsed axioms : 50
% 7.63/2.38 # Removed by relevancy pruning/SinE : 0
% 7.63/2.38 # Initial clauses : 50
% 7.63/2.38 # Removed in clause preprocessing : 0
% 7.63/2.38 # Initial clauses in saturation : 50
% 7.63/2.38 # Processed clauses : 75
% 7.63/2.38 # ...of these trivial : 0
% 7.63/2.38 # ...subsumed : 8
% 7.63/2.38 # ...remaining for further processing : 67
% 7.63/2.38 # Other redundant clauses eliminated : 0
% 7.63/2.38 # Clauses deleted for lack of memory : 0
% 7.63/2.38 # Backward-subsumed : 0
% 7.63/2.38 # Backward-rewritten : 4
% 7.63/2.38 # Generated clauses : 131
% 7.63/2.38 # ...of the previous two non-trivial : 105
% 7.63/2.38 # Contextual simplify-reflections : 4
% 7.63/2.38 # Paramodulations : 121
% 7.63/2.39 # Factorizations : 10
% 7.63/2.39 # Equation resolutions : 0
% 7.63/2.39 # Propositional unsat checks : 0
% 7.63/2.39 # Propositional unsat check successes : 0
% 7.63/2.39 # Current number of processed clauses : 63
% 7.63/2.39 # Positive orientable unit clauses : 7
% 7.63/2.39 # Positive unorientable unit clauses: 0
% 7.63/2.39 # Negative unit clauses : 8
% 7.63/2.39 # Non-unit-clauses : 48
% 7.63/2.39 # Current number of unprocessed clauses: 68
% 7.63/2.39 # ...number of literals in the above : 253
% 7.63/2.39 # Current number of archived formulas : 0
% 7.63/2.39 # Current number of archived clauses : 4
% 7.63/2.39 # Clause-clause subsumption calls (NU) : 375
% 7.63/2.39 # Rec. Clause-clause subsumption calls : 228
% 7.63/2.39 # Non-unit clause-clause subsumptions : 12
% 7.63/2.39 # Unit Clause-clause subsumption calls : 19
% 7.63/2.39 # Rewrite failures with RHS unbound : 0
% 7.63/2.39 # BW rewrite match attempts : 1
% 7.63/2.39 # BW rewrite match successes : 1
% 7.63/2.39 # Condensation attempts : 0
% 7.63/2.39 # Condensation successes : 0
% 7.63/2.39 # Termbank termtop insertions : 2280
% 7.63/2.39
% 7.63/2.39 # -------------------------------------------------
% 7.63/2.39 # User time : 0.011 s
% 7.63/2.39 # System time : 0.003 s
% 7.63/2.39 # Total time : 0.014 s
% 7.63/2.39 # ...preprocessing : 0.012 s
% 7.63/2.39 # ...main loop : 0.003 s
% 7.63/2.39 # Maximum resident set size: 7136 pages
% 7.63/2.39
%------------------------------------------------------------------------------