TSTP Solution File: GEO176+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO176+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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 9.17s 2.75s
% Output : CNFRefutation 9.17s
% 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_7,plain,
( distinct_points(X1,X2)
| apart_point_and_line(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mczyh09l/input.p',i_0_7) ).
cnf(i_0_15,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-mczyh09l/input.p',i_0_15) ).
cnf(i_0_14,negated_conjecture,
~ distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mczyh09l/input.p',i_0_14) ).
cnf(i_0_13,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mczyh09l/input.p',i_0_13) ).
cnf(i_0_16,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mczyh09l/input.p',i_0_16) ).
cnf(i_0_12,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mczyh09l/input.p',i_0_12) ).
cnf(c_0_23,plain,
( distinct_points(X1,X2)
| apart_point_and_line(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
i_0_7 ).
cnf(c_0_24,negated_conjecture,
( apart_point_and_line(esk1_0,esk3_0)
| apart_point_and_line(esk1_0,esk4_0) ),
i_0_15 ).
cnf(c_0_25,negated_conjecture,
~ distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
i_0_14 ).
cnf(c_0_26,negated_conjecture,
( apart_point_and_line(esk1_0,esk3_0)
| apart_point_and_line(X1,esk4_0)
| distinct_points(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
i_0_13 ).
cnf(c_0_28,negated_conjecture,
( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0)
| apart_point_and_line(esk1_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
i_0_16 ).
cnf(c_0_30,plain,
apart_point_and_line(esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_31,plain,
( apart_point_and_line(X1,esk3_0)
| distinct_points(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_32,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_33,negated_conjecture,
apart_point_and_line(intersection_point(esk3_0,esk4_0),esk3_0),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_34,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO176+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 10:57:42 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected SinE mode:
% 0.20/0.48 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.17/2.75 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 9.17/2.75 # Version: 2.1pre011
% 9.17/2.75 # Preprocessing time : 0.015 s
% 9.17/2.75
% 9.17/2.75 # Proof found!
% 9.17/2.75 # SZS status Theorem
% 9.17/2.75 # SZS output start CNFRefutation
% See solution above
% 9.17/2.75 # Proof object total steps : 18
% 9.17/2.75 # Proof object clause steps : 12
% 9.17/2.75 # Proof object formula steps : 6
% 9.17/2.75 # Proof object conjectures : 9
% 9.17/2.75 # Proof object clause conjectures : 6
% 9.17/2.75 # Proof object formula conjectures : 3
% 9.17/2.75 # Proof object initial clauses used : 6
% 9.17/2.75 # Proof object initial formulas used : 6
% 9.17/2.75 # Proof object generating inferences : 6
% 9.17/2.75 # Proof object simplifying inferences : 4
% 9.17/2.75 # Training examples: 0 positive, 0 negative
% 9.17/2.75 # Parsed axioms : 18
% 9.17/2.75 # Removed by relevancy pruning/SinE : 0
% 9.17/2.75 # Initial clauses : 18
% 9.17/2.75 # Removed in clause preprocessing : 0
% 9.17/2.75 # Initial clauses in saturation : 18
% 9.17/2.75 # Processed clauses : 39
% 9.17/2.75 # ...of these trivial : 0
% 9.17/2.75 # ...subsumed : 3
% 9.17/2.75 # ...remaining for further processing : 36
% 9.17/2.75 # Other redundant clauses eliminated : 0
% 9.17/2.75 # Clauses deleted for lack of memory : 0
% 9.17/2.75 # Backward-subsumed : 0
% 9.17/2.75 # Backward-rewritten : 5
% 9.17/2.75 # Generated clauses : 99
% 9.17/2.75 # ...of the previous two non-trivial : 87
% 9.17/2.75 # Contextual simplify-reflections : 0
% 9.17/2.75 # Paramodulations : 85
% 9.17/2.75 # Factorizations : 14
% 9.17/2.75 # Equation resolutions : 0
% 9.17/2.75 # Propositional unsat checks : 0
% 9.17/2.75 # Propositional unsat check successes : 0
% 9.17/2.75 # Current number of processed clauses : 31
% 9.17/2.75 # Positive orientable unit clauses : 4
% 9.17/2.75 # Positive unorientable unit clauses: 0
% 9.17/2.75 # Negative unit clauses : 4
% 9.17/2.75 # Non-unit-clauses : 23
% 9.17/2.75 # Current number of unprocessed clauses: 50
% 9.17/2.75 # ...number of literals in the above : 216
% 9.17/2.75 # Current number of archived formulas : 0
% 9.17/2.75 # Current number of archived clauses : 5
% 9.17/2.75 # Clause-clause subsumption calls (NU) : 59
% 9.17/2.75 # Rec. Clause-clause subsumption calls : 43
% 9.17/2.75 # Non-unit clause-clause subsumptions : 3
% 9.17/2.75 # Unit Clause-clause subsumption calls : 1
% 9.17/2.75 # Rewrite failures with RHS unbound : 0
% 9.17/2.75 # BW rewrite match attempts : 1
% 9.17/2.75 # BW rewrite match successes : 1
% 9.17/2.75 # Condensation attempts : 0
% 9.17/2.75 # Condensation successes : 0
% 9.17/2.75 # Termbank termtop insertions : 1359
% 9.17/2.75
% 9.17/2.75 # -------------------------------------------------
% 9.17/2.75 # User time : 0.009 s
% 9.17/2.75 # System time : 0.007 s
% 9.17/2.75 # Total time : 0.016 s
% 9.17/2.75 # ...preprocessing : 0.015 s
% 9.17/2.75 # ...main loop : 0.002 s
% 9.17/2.75 # Maximum resident set size: 7132 pages
% 9.17/2.75
%------------------------------------------------------------------------------