TSTP Solution File: GEO203+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO203+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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 6.85s 2.26s
% Output : CNFRefutation 6.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 11 unt; 8 nHn; 23 RR)
% Number of literals : 53 ( 0 equ; 19 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_26,negated_conjecture,
~ equal_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-t2p2xeue/input.p',i_0_26) ).
cnf(i_0_14,plain,
( distinct_lines(X1,X2)
| equal_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t2p2xeue/input.p',i_0_14) ).
cnf(i_0_37,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-t2p2xeue/input.p',i_0_37) ).
cnf(i_0_27,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t2p2xeue/input.p',i_0_27) ).
cnf(i_0_21,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t2p2xeue/input.p',i_0_21) ).
cnf(i_0_20,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t2p2xeue/input.p',i_0_20) ).
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-t2p2xeue/input.p',i_0_22) ).
cnf(i_0_28,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t2p2xeue/input.p',i_0_28) ).
cnf(i_0_29,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t2p2xeue/input.p',i_0_29) ).
cnf(c_0_47,negated_conjecture,
~ equal_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0),
i_0_26 ).
cnf(c_0_48,plain,
( distinct_lines(X1,X2)
| equal_lines(X1,X2) ),
i_0_14 ).
cnf(c_0_49,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_37 ).
cnf(c_0_50,negated_conjecture,
distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
( 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_49,c_0_50]) ).
cnf(c_0_52,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),
i_0_27 ).
cnf(c_0_53,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
i_0_21 ).
cnf(c_0_54,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_51,c_0_52]) ).
cnf(c_0_55,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
i_0_20 ).
cnf(c_0_56,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_53,c_0_54]),c_0_52])]) ).
cnf(c_0_57,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
i_0_22 ).
cnf(c_0_58,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_55,c_0_56]),c_0_52])]) ).
cnf(c_0_59,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
i_0_28 ).
cnf(c_0_60,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_57,c_0_58]),c_0_59])]) ).
cnf(c_0_61,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
i_0_29 ).
cnf(c_0_62,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_60]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO203+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n009.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 18:39:39 EDT 2022
% 0.19/0.34 % 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.85/2.26 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.85/2.26 # Version: 2.1pre011
% 6.85/2.26 # Preprocessing time : 0.016 s
% 6.85/2.26
% 6.85/2.26 # Proof found!
% 6.85/2.26 # SZS status Theorem
% 6.85/2.26 # SZS output start CNFRefutation
% See solution above
% 6.85/2.26 # Proof object total steps : 25
% 6.85/2.26 # Proof object clause steps : 16
% 6.85/2.26 # Proof object formula steps : 9
% 6.85/2.26 # Proof object conjectures : 10
% 6.85/2.26 # Proof object clause conjectures : 6
% 6.85/2.26 # Proof object formula conjectures : 4
% 6.85/2.26 # Proof object initial clauses used : 9
% 6.85/2.26 # Proof object initial formulas used : 9
% 6.85/2.26 # Proof object generating inferences : 7
% 6.85/2.26 # Proof object simplifying inferences : 8
% 6.85/2.26 # Training examples: 0 positive, 0 negative
% 6.85/2.26 # Parsed axioms : 50
% 6.85/2.26 # Removed by relevancy pruning/SinE : 0
% 6.85/2.26 # Initial clauses : 50
% 6.85/2.26 # Removed in clause preprocessing : 0
% 6.85/2.26 # Initial clauses in saturation : 50
% 6.85/2.26 # Processed clauses : 58
% 6.85/2.26 # ...of these trivial : 0
% 6.85/2.26 # ...subsumed : 4
% 6.85/2.26 # ...remaining for further processing : 54
% 6.85/2.26 # Other redundant clauses eliminated : 0
% 6.85/2.26 # Clauses deleted for lack of memory : 0
% 6.85/2.26 # Backward-subsumed : 2
% 6.85/2.26 # Backward-rewritten : 1
% 6.85/2.26 # Generated clauses : 43
% 6.85/2.26 # ...of the previous two non-trivial : 31
% 6.85/2.26 # Contextual simplify-reflections : 4
% 6.85/2.26 # Paramodulations : 43
% 6.85/2.26 # Factorizations : 0
% 6.85/2.26 # Equation resolutions : 0
% 6.85/2.26 # Propositional unsat checks : 0
% 6.85/2.26 # Propositional unsat check successes : 0
% 6.85/2.26 # Current number of processed clauses : 51
% 6.85/2.26 # Positive orientable unit clauses : 7
% 6.85/2.26 # Positive unorientable unit clauses: 0
% 6.85/2.26 # Negative unit clauses : 8
% 6.85/2.26 # Non-unit-clauses : 36
% 6.85/2.26 # Current number of unprocessed clauses: 15
% 6.85/2.26 # ...number of literals in the above : 32
% 6.85/2.26 # Current number of archived formulas : 0
% 6.85/2.26 # Current number of archived clauses : 3
% 6.85/2.26 # Clause-clause subsumption calls (NU) : 391
% 6.85/2.26 # Rec. Clause-clause subsumption calls : 195
% 6.85/2.26 # Non-unit clause-clause subsumptions : 10
% 6.85/2.26 # Unit Clause-clause subsumption calls : 18
% 6.85/2.26 # Rewrite failures with RHS unbound : 0
% 6.85/2.26 # BW rewrite match attempts : 1
% 6.85/2.26 # BW rewrite match successes : 1
% 6.85/2.26 # Condensation attempts : 0
% 6.85/2.26 # Condensation successes : 0
% 6.85/2.26 # Termbank termtop insertions : 1574
% 6.85/2.26
% 6.85/2.26 # -------------------------------------------------
% 6.85/2.26 # User time : 0.016 s
% 6.85/2.26 # System time : 0.003 s
% 6.85/2.26 # Total time : 0.019 s
% 6.85/2.26 # ...preprocessing : 0.016 s
% 6.85/2.26 # ...main loop : 0.002 s
% 6.85/2.26 # Maximum resident set size: 7124 pages
% 6.85/2.26
%------------------------------------------------------------------------------