TSTP Solution File: GEO224+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO224+3 : TPTP v8.1.0. Released v4.0.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:38 EDT 2022
% Result : Theorem 6.65s 2.22s
% Output : CNFRefutation 6.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 9 unt; 4 nHn; 20 RR)
% Number of literals : 50 ( 0 equ; 30 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_26,negated_conjecture,
( ~ point(X1)
| ~ incident_point_and_line(X1,esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gycdlvmn/input.p',i_0_26) ).
cnf(i_0_3,plain,
( incident_point_and_line(X1,X2)
| apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gycdlvmn/input.p',i_0_3) ).
cnf(i_0_38,plain,
( point(intersection_point(X1,X2))
| ~ line(X2)
| ~ line(X1)
| ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gycdlvmn/input.p',i_0_38) ).
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-gycdlvmn/input.p',i_0_23) ).
cnf(i_0_27,negated_conjecture,
line(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gycdlvmn/input.p',i_0_27) ).
cnf(i_0_46,plain,
( line(orthogonal_through_point(X1,X2))
| ~ point(X2)
| ~ line(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gycdlvmn/input.p',i_0_46) ).
cnf(i_0_44,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gycdlvmn/input.p',i_0_44) ).
cnf(i_0_24,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gycdlvmn/input.p',i_0_24) ).
cnf(i_0_28,negated_conjecture,
point(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gycdlvmn/input.p',i_0_28) ).
cnf(c_0_56,negated_conjecture,
( ~ point(X1)
| ~ incident_point_and_line(X1,esk2_0) ),
i_0_26 ).
cnf(c_0_57,plain,
( incident_point_and_line(X1,X2)
| apart_point_and_line(X1,X2) ),
i_0_3 ).
cnf(c_0_58,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| ~ point(X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,plain,
( point(intersection_point(X1,X2))
| ~ line(X2)
| ~ line(X1)
| ~ convergent_lines(X1,X2) ),
i_0_38 ).
cnf(c_0_60,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
i_0_23 ).
cnf(c_0_61,plain,
( apart_point_and_line(intersection_point(X1,X2),esk2_0)
| ~ convergent_lines(X1,X2)
| ~ line(X2)
| ~ line(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
line(esk2_0),
i_0_27 ).
cnf(c_0_63,plain,
( ~ convergent_lines(X1,esk2_0)
| ~ line(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).
cnf(c_0_64,plain,
( line(orthogonal_through_point(X1,X2))
| ~ point(X2)
| ~ line(X1) ),
i_0_46 ).
cnf(c_0_65,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
i_0_44 ).
cnf(c_0_66,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
i_0_24 ).
cnf(c_0_67,plain,
( ~ convergent_lines(orthogonal_through_point(X1,X2),esk2_0)
| ~ line(X1)
| ~ point(X2) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,plain,
convergent_lines(orthogonal_through_point(X1,X2),X1),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
point(esk1_0),
i_0_28 ).
cnf(c_0_70,plain,
~ point(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_62])]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_69,c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO224+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jun 17 15:28:41 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # 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
% 6.65/2.22 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.65/2.22 # Version: 2.1pre011
% 6.65/2.22 # Preprocessing time : 0.010 s
% 6.65/2.22
% 6.65/2.22 # Proof found!
% 6.65/2.22 # SZS status Theorem
% 6.65/2.22 # SZS output start CNFRefutation
% See solution above
% 6.65/2.22 # Proof object total steps : 25
% 6.65/2.22 # Proof object clause steps : 16
% 6.65/2.22 # Proof object formula steps : 9
% 6.65/2.22 # Proof object conjectures : 8
% 6.65/2.22 # Proof object clause conjectures : 5
% 6.65/2.22 # Proof object formula conjectures : 3
% 6.65/2.22 # Proof object initial clauses used : 9
% 6.65/2.22 # Proof object initial formulas used : 9
% 6.65/2.22 # Proof object generating inferences : 6
% 6.65/2.22 # Proof object simplifying inferences : 5
% 6.65/2.22 # Training examples: 0 positive, 0 negative
% 6.65/2.22 # Parsed axioms : 49
% 6.65/2.22 # Removed by relevancy pruning/SinE : 0
% 6.65/2.22 # Initial clauses : 49
% 6.65/2.22 # Removed in clause preprocessing : 0
% 6.65/2.22 # Initial clauses in saturation : 49
% 6.65/2.22 # Processed clauses : 74
% 6.65/2.22 # ...of these trivial : 0
% 6.65/2.22 # ...subsumed : 7
% 6.65/2.22 # ...remaining for further processing : 67
% 6.65/2.22 # Other redundant clauses eliminated : 0
% 6.65/2.22 # Clauses deleted for lack of memory : 0
% 6.65/2.22 # Backward-subsumed : 0
% 6.65/2.22 # Backward-rewritten : 0
% 6.65/2.22 # Generated clauses : 99
% 6.65/2.22 # ...of the previous two non-trivial : 81
% 6.65/2.22 # Contextual simplify-reflections : 4
% 6.65/2.22 # Paramodulations : 96
% 6.65/2.22 # Factorizations : 2
% 6.65/2.22 # Equation resolutions : 0
% 6.65/2.22 # Propositional unsat checks : 0
% 6.65/2.22 # Propositional unsat check successes : 0
% 6.65/2.22 # Current number of processed clauses : 66
% 6.65/2.22 # Positive orientable unit clauses : 6
% 6.65/2.22 # Positive unorientable unit clauses: 0
% 6.65/2.22 # Negative unit clauses : 8
% 6.65/2.22 # Non-unit-clauses : 52
% 6.65/2.22 # Current number of unprocessed clauses: 56
% 6.65/2.22 # ...number of literals in the above : 184
% 6.65/2.22 # Current number of archived formulas : 0
% 6.65/2.22 # Current number of archived clauses : 1
% 6.65/2.22 # Clause-clause subsumption calls (NU) : 431
% 6.65/2.22 # Rec. Clause-clause subsumption calls : 251
% 6.65/2.22 # Non-unit clause-clause subsumptions : 9
% 6.65/2.22 # Unit Clause-clause subsumption calls : 55
% 6.65/2.22 # Rewrite failures with RHS unbound : 0
% 6.65/2.22 # BW rewrite match attempts : 0
% 6.65/2.22 # BW rewrite match successes : 0
% 6.65/2.22 # Condensation attempts : 0
% 6.65/2.22 # Condensation successes : 0
% 6.65/2.22 # Termbank termtop insertions : 2066
% 6.65/2.22
% 6.65/2.22 # -------------------------------------------------
% 6.65/2.22 # User time : 0.010 s
% 6.65/2.22 # System time : 0.002 s
% 6.65/2.22 # Total time : 0.012 s
% 6.65/2.22 # ...preprocessing : 0.010 s
% 6.65/2.22 # ...main loop : 0.002 s
% 6.65/2.22 # Maximum resident set size: 7124 pages
% 6.65/2.22
%------------------------------------------------------------------------------