TSTP Solution File: GEO192+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO192+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:10 EDT 2022
% Result : Theorem 7.33s 2.46s
% Output : CNFRefutation 7.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 13 unt; 7 nHn; 21 RR)
% Number of literals : 51 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 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 : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-17oumn22/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-17oumn22/input.p',i_0_12) ).
cnf(i_0_8,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-17oumn22/input.p',i_0_8) ).
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-17oumn22/input.p',i_0_15) ).
cnf(i_0_16,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-17oumn22/input.p',i_0_16) ).
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-17oumn22/input.p',i_0_13) ).
cnf(i_0_5,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-17oumn22/input.p',i_0_5) ).
cnf(i_0_2,plain,
~ distinct_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-17oumn22/input.p',i_0_2) ).
cnf(i_0_14,negated_conjecture,
( ~ distinct_lines(esk1_0,esk3_0)
| ~ distinct_lines(esk2_0,esk3_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-17oumn22/input.p',i_0_14) ).
cnf(c_0_26,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_27,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
i_0_12 ).
cnf(c_0_28,plain,
( distinct_lines(X1,X2)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X3,X1) ),
i_0_8 ).
cnf(c_0_29,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
i_0_15 ).
cnf(c_0_30,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( distinct_lines(esk3_0,X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_16 ).
cnf(c_0_33,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X2) ),
i_0_13 ).
cnf(c_0_34,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
i_0_5 ).
cnf(c_0_35,plain,
distinct_lines(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_36,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_33]) ).
cnf(c_0_37,plain,
~ distinct_lines(X1,X1),
i_0_2 ).
cnf(c_0_38,plain,
( distinct_lines(esk3_0,X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
distinct_lines(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_31]),c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
( ~ distinct_lines(esk1_0,esk3_0)
| ~ distinct_lines(esk2_0,esk3_0) ),
i_0_14 ).
cnf(c_0_41,plain,
distinct_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( distinct_lines(esk3_0,X1)
| distinct_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
~ distinct_lines(esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_44,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_42]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO192+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 : n018.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 : Fri Jun 17 16:01:34 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.33/2.46 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.33/2.46 # Version: 2.1pre011
% 7.33/2.46 # Preprocessing time : 0.009 s
% 7.33/2.46
% 7.33/2.46 # Proof found!
% 7.33/2.46 # SZS status Theorem
% 7.33/2.46 # SZS output start CNFRefutation
% See solution above
% 7.33/2.46 # Proof object total steps : 28
% 7.33/2.46 # Proof object clause steps : 19
% 7.33/2.46 # Proof object formula steps : 9
% 7.33/2.46 # Proof object conjectures : 8
% 7.33/2.46 # Proof object clause conjectures : 5
% 7.33/2.46 # Proof object formula conjectures : 3
% 7.33/2.46 # Proof object initial clauses used : 9
% 7.33/2.46 # Proof object initial formulas used : 9
% 7.33/2.46 # Proof object generating inferences : 9
% 7.33/2.46 # Proof object simplifying inferences : 7
% 7.33/2.46 # Training examples: 0 positive, 0 negative
% 7.33/2.46 # Parsed axioms : 17
% 7.33/2.46 # Removed by relevancy pruning/SinE : 0
% 7.33/2.46 # Initial clauses : 17
% 7.33/2.46 # Removed in clause preprocessing : 0
% 7.33/2.46 # Initial clauses in saturation : 17
% 7.33/2.46 # Processed clauses : 45
% 7.33/2.46 # ...of these trivial : 2
% 7.33/2.46 # ...subsumed : 3
% 7.33/2.46 # ...remaining for further processing : 40
% 7.33/2.46 # Other redundant clauses eliminated : 0
% 7.33/2.46 # Clauses deleted for lack of memory : 0
% 7.33/2.46 # Backward-subsumed : 0
% 7.33/2.46 # Backward-rewritten : 2
% 7.33/2.46 # Generated clauses : 71
% 7.33/2.46 # ...of the previous two non-trivial : 65
% 7.33/2.46 # Contextual simplify-reflections : 0
% 7.33/2.46 # Paramodulations : 69
% 7.33/2.46 # Factorizations : 2
% 7.33/2.46 # Equation resolutions : 0
% 7.33/2.46 # Propositional unsat checks : 0
% 7.33/2.46 # Propositional unsat check successes : 0
% 7.33/2.46 # Current number of processed clauses : 38
% 7.33/2.46 # Positive orientable unit clauses : 8
% 7.33/2.46 # Positive unorientable unit clauses: 0
% 7.33/2.46 # Negative unit clauses : 4
% 7.33/2.46 # Non-unit-clauses : 26
% 7.33/2.46 # Current number of unprocessed clauses: 37
% 7.33/2.46 # ...number of literals in the above : 151
% 7.33/2.46 # Current number of archived formulas : 0
% 7.33/2.46 # Current number of archived clauses : 2
% 7.33/2.46 # Clause-clause subsumption calls (NU) : 47
% 7.33/2.46 # Rec. Clause-clause subsumption calls : 34
% 7.33/2.46 # Non-unit clause-clause subsumptions : 3
% 7.33/2.46 # Unit Clause-clause subsumption calls : 10
% 7.33/2.46 # Rewrite failures with RHS unbound : 0
% 7.33/2.46 # BW rewrite match attempts : 1
% 7.33/2.46 # BW rewrite match successes : 1
% 7.33/2.46 # Condensation attempts : 0
% 7.33/2.46 # Condensation successes : 0
% 7.33/2.46 # Termbank termtop insertions : 1213
% 7.33/2.46
% 7.33/2.46 # -------------------------------------------------
% 7.33/2.46 # User time : 0.007 s
% 7.33/2.46 # System time : 0.003 s
% 7.33/2.46 # Total time : 0.010 s
% 7.33/2.46 # ...preprocessing : 0.009 s
% 7.33/2.46 # ...main loop : 0.001 s
% 7.33/2.46 # Maximum resident set size: 7124 pages
% 7.33/2.46
%------------------------------------------------------------------------------