TSTP Solution File: GEO203+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO203+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:44:21 EDT 2022
% Result : Theorem 7.69s 2.37s
% Output : CNFRefutation 7.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 10 unt; 6 nHn; 22 RR)
% Number of literals : 48 ( 0 equ; 17 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_18,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-wuvevwbi/input.p',i_0_18) ).
cnf(i_0_14,negated_conjecture,
distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wuvevwbi/input.p',i_0_14) ).
cnf(i_0_15,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wuvevwbi/input.p',i_0_15) ).
cnf(i_0_11,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wuvevwbi/input.p',i_0_11) ).
cnf(i_0_10,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wuvevwbi/input.p',i_0_10) ).
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-wuvevwbi/input.p',i_0_12) ).
cnf(i_0_16,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wuvevwbi/input.p',i_0_16) ).
cnf(i_0_17,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wuvevwbi/input.p',i_0_17) ).
cnf(c_0_27,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_18 ).
cnf(c_0_28,negated_conjecture,
distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0),
i_0_14 ).
cnf(c_0_29,negated_conjecture,
( apart_point_and_line(X1,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(X2,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X2,esk1_0)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),
i_0_15 ).
cnf(c_0_31,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
i_0_11 ).
cnf(c_0_32,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| 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(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
i_0_10 ).
cnf(c_0_34,plain,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_30])]) ).
cnf(c_0_35,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_36,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_33,c_0_34]),c_0_30])]) ).
cnf(c_0_37,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
i_0_16 ).
cnf(c_0_38,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_35,c_0_36]),c_0_37])]) ).
cnf(c_0_39,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_17 ).
cnf(c_0_40,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_38]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO203+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 18 06:10:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.69/2.37 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.69/2.37 # Version: 2.1pre011
% 7.69/2.37 # Preprocessing time : 0.012 s
% 7.69/2.37
% 7.69/2.37 # Proof found!
% 7.69/2.37 # SZS status Theorem
% 7.69/2.37 # SZS output start CNFRefutation
% See solution above
% 7.69/2.37 # Proof object total steps : 22
% 7.69/2.37 # Proof object clause steps : 14
% 7.69/2.37 # Proof object formula steps : 8
% 7.69/2.37 # Proof object conjectures : 10
% 7.69/2.37 # Proof object clause conjectures : 6
% 7.69/2.37 # Proof object formula conjectures : 4
% 7.69/2.37 # Proof object initial clauses used : 8
% 7.69/2.37 # Proof object initial formulas used : 8
% 7.69/2.37 # Proof object generating inferences : 6
% 7.69/2.37 # Proof object simplifying inferences : 8
% 7.69/2.37 # Training examples: 0 positive, 0 negative
% 7.69/2.37 # Parsed axioms : 18
% 7.69/2.37 # Removed by relevancy pruning/SinE : 0
% 7.69/2.37 # Initial clauses : 18
% 7.69/2.37 # Removed in clause preprocessing : 0
% 7.69/2.37 # Initial clauses in saturation : 18
% 7.69/2.37 # Processed clauses : 43
% 7.69/2.37 # ...of these trivial : 0
% 7.69/2.37 # ...subsumed : 5
% 7.69/2.37 # ...remaining for further processing : 38
% 7.69/2.37 # Other redundant clauses eliminated : 0
% 7.69/2.37 # Clauses deleted for lack of memory : 0
% 7.69/2.37 # Backward-subsumed : 2
% 7.69/2.37 # Backward-rewritten : 1
% 7.69/2.37 # Generated clauses : 90
% 7.69/2.37 # ...of the previous two non-trivial : 76
% 7.69/2.37 # Contextual simplify-reflections : 0
% 7.69/2.37 # Paramodulations : 84
% 7.69/2.37 # Factorizations : 6
% 7.69/2.37 # Equation resolutions : 0
% 7.69/2.37 # Propositional unsat checks : 0
% 7.69/2.37 # Propositional unsat check successes : 0
% 7.69/2.37 # Current number of processed clauses : 35
% 7.69/2.37 # Positive orientable unit clauses : 6
% 7.69/2.37 # Positive unorientable unit clauses: 0
% 7.69/2.37 # Negative unit clauses : 3
% 7.69/2.37 # Non-unit-clauses : 26
% 7.69/2.37 # Current number of unprocessed clauses: 43
% 7.69/2.37 # ...number of literals in the above : 174
% 7.69/2.37 # Current number of archived formulas : 0
% 7.69/2.37 # Current number of archived clauses : 3
% 7.69/2.37 # Clause-clause subsumption calls (NU) : 78
% 7.69/2.37 # Rec. Clause-clause subsumption calls : 45
% 7.69/2.37 # Non-unit clause-clause subsumptions : 7
% 7.69/2.37 # Unit Clause-clause subsumption calls : 2
% 7.69/2.37 # Rewrite failures with RHS unbound : 0
% 7.69/2.37 # BW rewrite match attempts : 1
% 7.69/2.37 # BW rewrite match successes : 1
% 7.69/2.37 # Condensation attempts : 0
% 7.69/2.37 # Condensation successes : 0
% 7.69/2.37 # Termbank termtop insertions : 1444
% 7.69/2.37
% 7.69/2.37 # -------------------------------------------------
% 7.69/2.37 # User time : 0.006 s
% 7.69/2.37 # System time : 0.007 s
% 7.69/2.37 # Total time : 0.013 s
% 7.69/2.37 # ...preprocessing : 0.012 s
% 7.69/2.37 # ...main loop : 0.002 s
% 7.69/2.37 # Maximum resident set size: 7136 pages
% 7.69/2.37
%------------------------------------------------------------------------------