TSTP Solution File: GEO222+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO222+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:36 EDT 2022
% Result : Theorem 7.56s 2.33s
% Output : CNFRefutation 7.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 41 ( 15 unt; 18 nHn; 23 RR)
% Number of literals : 90 ( 0 equ; 34 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 76 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nuh6g58h/input.p',i_0_5) ).
cnf(i_0_9,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nuh6g58h/input.p',i_0_9) ).
cnf(i_0_14,negated_conjecture,
convergent_lines(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nuh6g58h/input.p',i_0_14) ).
cnf(i_0_2,plain,
~ distinct_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nuh6g58h/input.p',i_0_2) ).
cnf(i_0_26,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| unorthogonal_lines(X2,X4)
| unorthogonal_lines(X3,X4)
| ~ distinct_lines(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nuh6g58h/input.p',i_0_26) ).
cnf(i_0_1,plain,
~ distinct_points(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nuh6g58h/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/sandbox/tmp/enigma-theBenchmark.p-nuh6g58h/input.p',i_0_12) ).
cnf(i_0_24,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nuh6g58h/input.p',i_0_24) ).
cnf(i_0_23,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nuh6g58h/input.p',i_0_23) ).
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/sandbox/tmp/enigma-theBenchmark.p-nuh6g58h/input.p',i_0_13) ).
cnf(i_0_6,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nuh6g58h/input.p',i_0_6) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nuh6g58h/input.p',i_0_3) ).
cnf(i_0_21,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X3,X2)
| ~ convergent_lines(X1,X3)
| ~ unorthogonal_lines(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nuh6g58h/input.p',i_0_21) ).
cnf(c_0_40,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ distinct_lines(X3,X1) ),
i_0_5 ).
cnf(c_0_41,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
i_0_9 ).
cnf(c_0_42,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ convergent_lines(X1,X3) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_43,negated_conjecture,
convergent_lines(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)),
i_0_14 ).
cnf(c_0_44,plain,
~ distinct_lines(X1,X1),
i_0_2 ).
cnf(c_0_45,negated_conjecture,
( distinct_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| unorthogonal_lines(X2,X4)
| unorthogonal_lines(X3,X4)
| ~ distinct_lines(X3,X2) ),
i_0_26 ).
cnf(c_0_47,plain,
distinct_lines(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
~ distinct_points(X1,X1),
i_0_1 ).
cnf(c_0_49,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X3) ),
i_0_12 ).
cnf(c_0_50,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
i_0_24 ).
cnf(c_0_51,plain,
( unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)
| unorthogonal_lines(esk2_0,X1)
| apart_point_and_line(X2,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))
| apart_point_and_line(X2,esk2_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
( unorthogonal_lines(esk2_0,orthogonal_through_point(esk2_0,esk1_0))
| apart_point_and_line(X1,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))
| apart_point_and_line(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
i_0_23 ).
cnf(c_0_55,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X2) ),
i_0_13 ).
cnf(c_0_56,plain,
( unorthogonal_lines(esk2_0,orthogonal_through_point(esk2_0,esk1_0))
| apart_point_and_line(intersection_point(X1,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)),esk2_0)
| ~ convergent_lines(X1,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_6 ).
cnf(c_0_58,plain,
convergent_lines(orthogonal_through_point(X1,X2),X1),
inference(spm,[status(thm)],[c_0_50,c_0_54]) ).
cnf(c_0_59,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
( unorthogonal_lines(esk2_0,orthogonal_through_point(esk2_0,esk1_0))
| apart_point_and_line(intersection_point(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)),esk2_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_43]) ).
cnf(c_0_61,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_62,plain,
( convergent_lines(orthogonal_through_point(X1,X2),X3)
| convergent_lines(X1,X3) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X3,X2)
| ~ convergent_lines(X1,X3)
| ~ unorthogonal_lines(X1,X3) ),
i_0_21 ).
cnf(c_0_64,plain,
unorthogonal_lines(esk2_0,orthogonal_through_point(esk2_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_43])]) ).
cnf(c_0_65,plain,
convergent_lines(X1,orthogonal_through_point(X1,X2)),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_66,plain,
( unorthogonal_lines(orthogonal_through_point(esk2_0,esk1_0),X1)
| convergent_lines(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]) ).
cnf(c_0_67,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_66]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO222+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n003.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 : Sat Jun 18 07:13:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/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
% 7.56/2.33 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.56/2.33 # Version: 2.1pre011
% 7.56/2.33 # Preprocessing time : 0.010 s
% 7.56/2.33
% 7.56/2.33 # Proof found!
% 7.56/2.33 # SZS status Theorem
% 7.56/2.33 # SZS output start CNFRefutation
% See solution above
% 7.56/2.33 # Proof object total steps : 41
% 7.56/2.33 # Proof object clause steps : 28
% 7.56/2.33 # Proof object formula steps : 13
% 7.56/2.33 # Proof object conjectures : 4
% 7.56/2.33 # Proof object clause conjectures : 3
% 7.56/2.33 # Proof object formula conjectures : 1
% 7.56/2.33 # Proof object initial clauses used : 13
% 7.56/2.33 # Proof object initial formulas used : 13
% 7.56/2.33 # Proof object generating inferences : 15
% 7.56/2.33 # Proof object simplifying inferences : 5
% 7.56/2.33 # Training examples: 0 positive, 0 negative
% 7.56/2.33 # Parsed axioms : 26
% 7.56/2.33 # Removed by relevancy pruning/SinE : 0
% 7.56/2.33 # Initial clauses : 26
% 7.56/2.33 # Removed in clause preprocessing : 0
% 7.56/2.33 # Initial clauses in saturation : 26
% 7.56/2.33 # Processed clauses : 129
% 7.56/2.33 # ...of these trivial : 1
% 7.56/2.33 # ...subsumed : 56
% 7.56/2.33 # ...remaining for further processing : 72
% 7.56/2.33 # Other redundant clauses eliminated : 0
% 7.56/2.33 # Clauses deleted for lack of memory : 0
% 7.56/2.33 # Backward-subsumed : 2
% 7.56/2.33 # Backward-rewritten : 3
% 7.56/2.33 # Generated clauses : 406
% 7.56/2.33 # ...of the previous two non-trivial : 368
% 7.56/2.33 # Contextual simplify-reflections : 3
% 7.56/2.33 # Paramodulations : 328
% 7.56/2.33 # Factorizations : 78
% 7.56/2.33 # Equation resolutions : 0
% 7.56/2.33 # Propositional unsat checks : 0
% 7.56/2.33 # Propositional unsat check successes : 0
% 7.56/2.33 # Current number of processed clauses : 67
% 7.56/2.33 # Positive orientable unit clauses : 12
% 7.56/2.33 # Positive unorientable unit clauses: 0
% 7.56/2.33 # Negative unit clauses : 7
% 7.56/2.33 # Non-unit-clauses : 48
% 7.56/2.33 # Current number of unprocessed clauses: 216
% 7.56/2.33 # ...number of literals in the above : 923
% 7.56/2.33 # Current number of archived formulas : 0
% 7.56/2.33 # Current number of archived clauses : 5
% 7.56/2.33 # Clause-clause subsumption calls (NU) : 400
% 7.56/2.33 # Rec. Clause-clause subsumption calls : 271
% 7.56/2.33 # Non-unit clause-clause subsumptions : 27
% 7.56/2.33 # Unit Clause-clause subsumption calls : 56
% 7.56/2.33 # Rewrite failures with RHS unbound : 0
% 7.56/2.33 # BW rewrite match attempts : 6
% 7.56/2.33 # BW rewrite match successes : 1
% 7.56/2.33 # Condensation attempts : 0
% 7.56/2.33 # Condensation successes : 0
% 7.56/2.33 # Termbank termtop insertions : 5482
% 7.56/2.33
% 7.56/2.33 # -------------------------------------------------
% 7.56/2.33 # User time : 0.012 s
% 7.56/2.33 # System time : 0.005 s
% 7.56/2.33 # Total time : 0.017 s
% 7.56/2.33 # ...preprocessing : 0.010 s
% 7.56/2.33 # ...main loop : 0.006 s
% 7.56/2.33 # Maximum resident set size: 7136 pages
% 7.56/2.33
%------------------------------------------------------------------------------