TSTP Solution File: GEO221+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO221+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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.91s 2.43s
% Output : CNFRefutation 7.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 11 unt; 6 nHn; 13 RR)
% Number of literals : 35 ( 0 equ; 13 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 27 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_26,negated_conjecture,
~ equal_lines(orthogonal_through_point(esk3_0,esk1_0),orthogonal_through_point(esk3_0,esk2_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnv9rbsr/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-lnv9rbsr/input.p',i_0_14) ).
cnf(i_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) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnv9rbsr/input.p',i_0_46) ).
cnf(i_0_4,plain,
( ~ incident_point_and_line(X1,X2)
| ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnv9rbsr/input.p',i_0_4) ).
cnf(i_0_27,negated_conjecture,
incident_point_and_line(esk2_0,orthogonal_through_point(esk3_0,esk1_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnv9rbsr/input.p',i_0_27) ).
cnf(i_0_44,plain,
~ apart_point_and_line(X1,orthogonal_through_point(X2,X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnv9rbsr/input.p',i_0_44) ).
cnf(i_0_43,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lnv9rbsr/input.p',i_0_43) ).
cnf(c_0_54,negated_conjecture,
~ equal_lines(orthogonal_through_point(esk3_0,esk1_0),orthogonal_through_point(esk3_0,esk2_0)),
i_0_26 ).
cnf(c_0_55,plain,
( distinct_lines(X1,X2)
| equal_lines(X1,X2) ),
i_0_14 ).
cnf(c_0_56,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_46 ).
cnf(c_0_57,negated_conjecture,
distinct_lines(orthogonal_through_point(esk3_0,esk1_0),orthogonal_through_point(esk3_0,esk2_0)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
( ~ incident_point_and_line(X1,X2)
| ~ apart_point_and_line(X1,X2) ),
i_0_4 ).
cnf(c_0_59,negated_conjecture,
incident_point_and_line(esk2_0,orthogonal_through_point(esk3_0,esk1_0)),
i_0_27 ).
cnf(c_0_60,plain,
~ apart_point_and_line(X1,orthogonal_through_point(X2,X1)),
i_0_44 ).
cnf(c_0_61,plain,
( unorthogonal_lines(orthogonal_through_point(esk3_0,esk1_0),X1)
| unorthogonal_lines(orthogonal_through_point(esk3_0,esk2_0),X1)
| apart_point_and_line(X2,orthogonal_through_point(esk3_0,esk1_0))
| apart_point_and_line(X2,orthogonal_through_point(esk3_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
~ apart_point_and_line(esk2_0,orthogonal_through_point(esk3_0,esk1_0)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
i_0_43 ).
cnf(c_0_64,plain,
( unorthogonal_lines(orthogonal_through_point(esk3_0,esk2_0),X1)
| unorthogonal_lines(orthogonal_through_point(esk3_0,esk1_0),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]) ).
cnf(c_0_65,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO221+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n005.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 18:36:55 EDT 2022
% 0.12/0.33 % 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
% 7.91/2.43 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.91/2.43 # Version: 2.1pre011
% 7.91/2.43 # Preprocessing time : 0.011 s
% 7.91/2.43
% 7.91/2.43 # Proof found!
% 7.91/2.43 # SZS status Theorem
% 7.91/2.43 # SZS output start CNFRefutation
% See solution above
% 7.91/2.43 # Proof object total steps : 19
% 7.91/2.43 # Proof object clause steps : 12
% 7.91/2.43 # Proof object formula steps : 7
% 7.91/2.43 # Proof object conjectures : 6
% 7.91/2.43 # Proof object clause conjectures : 4
% 7.91/2.43 # Proof object formula conjectures : 2
% 7.91/2.43 # Proof object initial clauses used : 7
% 7.91/2.43 # Proof object initial formulas used : 7
% 7.91/2.43 # Proof object generating inferences : 5
% 7.91/2.43 # Proof object simplifying inferences : 2
% 7.91/2.43 # Training examples: 0 positive, 0 negative
% 7.91/2.43 # Parsed axioms : 48
% 7.91/2.43 # Removed by relevancy pruning/SinE : 0
% 7.91/2.43 # Initial clauses : 48
% 7.91/2.43 # Removed in clause preprocessing : 0
% 7.91/2.43 # Initial clauses in saturation : 48
% 7.91/2.43 # Processed clauses : 75
% 7.91/2.43 # ...of these trivial : 0
% 7.91/2.43 # ...subsumed : 6
% 7.91/2.43 # ...remaining for further processing : 69
% 7.91/2.43 # Other redundant clauses eliminated : 0
% 7.91/2.43 # Clauses deleted for lack of memory : 0
% 7.91/2.43 # Backward-subsumed : 1
% 7.91/2.43 # Backward-rewritten : 0
% 7.91/2.43 # Generated clauses : 152
% 7.91/2.43 # ...of the previous two non-trivial : 131
% 7.91/2.43 # Contextual simplify-reflections : 4
% 7.91/2.43 # Paramodulations : 150
% 7.91/2.43 # Factorizations : 2
% 7.91/2.43 # Equation resolutions : 0
% 7.91/2.43 # Propositional unsat checks : 0
% 7.91/2.43 # Propositional unsat check successes : 0
% 7.91/2.43 # Current number of processed clauses : 68
% 7.91/2.43 # Positive orientable unit clauses : 9
% 7.91/2.43 # Positive unorientable unit clauses: 0
% 7.91/2.43 # Negative unit clauses : 9
% 7.91/2.43 # Non-unit-clauses : 50
% 7.91/2.43 # Current number of unprocessed clauses: 88
% 7.91/2.43 # ...number of literals in the above : 316
% 7.91/2.43 # Current number of archived formulas : 0
% 7.91/2.43 # Current number of archived clauses : 1
% 7.91/2.43 # Clause-clause subsumption calls (NU) : 461
% 7.91/2.43 # Rec. Clause-clause subsumption calls : 268
% 7.91/2.43 # Non-unit clause-clause subsumptions : 11
% 7.91/2.43 # Unit Clause-clause subsumption calls : 51
% 7.91/2.43 # Rewrite failures with RHS unbound : 0
% 7.91/2.43 # BW rewrite match attempts : 2
% 7.91/2.43 # BW rewrite match successes : 0
% 7.91/2.43 # Condensation attempts : 0
% 7.91/2.43 # Condensation successes : 0
% 7.91/2.43 # Termbank termtop insertions : 3074
% 7.91/2.43
% 7.91/2.43 # -------------------------------------------------
% 7.91/2.43 # User time : 0.008 s
% 7.91/2.43 # System time : 0.006 s
% 7.91/2.43 # Total time : 0.014 s
% 7.91/2.43 # ...preprocessing : 0.011 s
% 7.91/2.43 # ...main loop : 0.003 s
% 7.91/2.43 # Maximum resident set size: 7128 pages
% 7.91/2.43
%------------------------------------------------------------------------------