TSTP Solution File: GEO222+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO222+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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 4.90s 2.44s
% Output : CNFRefutation 4.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 10 unt; 17 nHn; 12 RR)
% Number of literals : 73 ( 0 equ; 23 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 61 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( distinct_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ot635zpe/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/sandbox2/tmp/enigma-theBenchmark.p-ot635zpe/input.p',i_0_14) ).
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/sandbox2/tmp/enigma-theBenchmark.p-ot635zpe/input.p',i_0_26) ).
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-ot635zpe/input.p',i_0_12) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ot635zpe/input.p',i_0_3) ).
cnf(i_0_24,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ot635zpe/input.p',i_0_24) ).
cnf(i_0_23,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ot635zpe/input.p',i_0_23) ).
cnf(i_0_13,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ot635zpe/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/sandbox2/tmp/enigma-theBenchmark.p-ot635zpe/input.p',i_0_6) ).
cnf(i_0_21,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X3,X2)
| ~ convergent_lines(X1,X3)
| ~ unorthogonal_lines(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ot635zpe/input.p',i_0_21) ).
cnf(c_0_37,plain,
( distinct_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_9 ).
cnf(c_0_38,negated_conjecture,
convergent_lines(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)),
i_0_14 ).
cnf(c_0_39,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_40,negated_conjecture,
( distinct_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_42,plain,
( unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)
| unorthogonal_lines(X2,X1)
| apart_point_and_line(X3,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))
| apart_point_and_line(X3,X2)
| convergent_lines(esk2_0,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
( unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)
| unorthogonal_lines(X2,X1)
| apart_point_and_line(intersection_point(X2,X3),orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0))
| convergent_lines(esk2_0,X2)
| ~ convergent_lines(X2,X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_45,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
i_0_24 ).
cnf(c_0_46,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
i_0_23 ).
cnf(c_0_47,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
i_0_13 ).
cnf(c_0_48,negated_conjecture,
( unorthogonal_lines(orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0),X1)
| unorthogonal_lines(esk2_0,X1)
| apart_point_and_line(intersection_point(esk2_0,orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)),orthogonal_through_point(orthogonal_through_point(esk2_0,esk1_0),esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_38]),c_0_44]) ).
cnf(c_0_49,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_6 ).
cnf(c_0_50,plain,
convergent_lines(orthogonal_through_point(X1,X2),X1),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
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) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_38])]) ).
cnf(c_0_52,plain,
( convergent_lines(orthogonal_through_point(X1,X2),X3)
| convergent_lines(X1,X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X3,X2)
| ~ convergent_lines(X1,X3)
| ~ unorthogonal_lines(X1,X3) ),
i_0_21 ).
cnf(c_0_54,plain,
unorthogonal_lines(esk2_0,orthogonal_through_point(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_45,c_0_51]) ).
cnf(c_0_55,plain,
convergent_lines(X1,orthogonal_through_point(X1,X2)),
inference(spm,[status(thm)],[c_0_44,c_0_52]) ).
cnf(c_0_56,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_53,c_0_54]),c_0_55])]) ).
cnf(c_0_57,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_56]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO222+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 17 20:57:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.90/2.44 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 4.90/2.44 # Version: 2.1pre011
% 4.90/2.44 # Preprocessing time : 0.019 s
% 4.90/2.44
% 4.90/2.44 # Proof found!
% 4.90/2.44 # SZS status Theorem
% 4.90/2.44 # SZS output start CNFRefutation
% See solution above
% 4.90/2.44 # Proof object total steps : 31
% 4.90/2.44 # Proof object clause steps : 21
% 4.90/2.44 # Proof object formula steps : 10
% 4.90/2.44 # Proof object conjectures : 4
% 4.90/2.44 # Proof object clause conjectures : 3
% 4.90/2.44 # Proof object formula conjectures : 1
% 4.90/2.44 # Proof object initial clauses used : 10
% 4.90/2.44 # Proof object initial formulas used : 10
% 4.90/2.44 # Proof object generating inferences : 11
% 4.90/2.44 # Proof object simplifying inferences : 6
% 4.90/2.44 # Training examples: 0 positive, 0 negative
% 4.90/2.44 # Parsed axioms : 26
% 4.90/2.44 # Removed by relevancy pruning/SinE : 0
% 4.90/2.44 # Initial clauses : 26
% 4.90/2.44 # Removed in clause preprocessing : 0
% 4.90/2.44 # Initial clauses in saturation : 26
% 4.90/2.44 # Processed clauses : 97
% 4.90/2.44 # ...of these trivial : 0
% 4.90/2.44 # ...subsumed : 26
% 4.90/2.44 # ...remaining for further processing : 71
% 4.90/2.44 # Other redundant clauses eliminated : 0
% 4.90/2.44 # Clauses deleted for lack of memory : 0
% 4.90/2.44 # Backward-subsumed : 1
% 4.90/2.44 # Backward-rewritten : 0
% 4.90/2.44 # Generated clauses : 597
% 4.90/2.44 # ...of the previous two non-trivial : 532
% 4.90/2.44 # Contextual simplify-reflections : 3
% 4.90/2.44 # Paramodulations : 533
% 4.90/2.44 # Factorizations : 64
% 4.90/2.44 # Equation resolutions : 0
% 4.90/2.44 # Propositional unsat checks : 0
% 4.90/2.44 # Propositional unsat check successes : 0
% 4.90/2.44 # Current number of processed clauses : 70
% 4.90/2.44 # Positive orientable unit clauses : 7
% 4.90/2.44 # Positive unorientable unit clauses: 0
% 4.90/2.44 # Negative unit clauses : 7
% 4.90/2.44 # Non-unit-clauses : 56
% 4.90/2.44 # Current number of unprocessed clauses: 453
% 4.90/2.44 # ...number of literals in the above : 2355
% 4.90/2.44 # Current number of archived formulas : 0
% 4.90/2.44 # Current number of archived clauses : 1
% 4.90/2.44 # Clause-clause subsumption calls (NU) : 848
% 4.90/2.44 # Rec. Clause-clause subsumption calls : 543
% 4.90/2.44 # Non-unit clause-clause subsumptions : 30
% 4.90/2.44 # Unit Clause-clause subsumption calls : 41
% 4.90/2.44 # Rewrite failures with RHS unbound : 0
% 4.90/2.44 # BW rewrite match attempts : 3
% 4.90/2.44 # BW rewrite match successes : 0
% 4.90/2.44 # Condensation attempts : 0
% 4.90/2.44 # Condensation successes : 0
% 4.90/2.44 # Termbank termtop insertions : 10436
% 4.90/2.44
% 4.90/2.44 # -------------------------------------------------
% 4.90/2.44 # User time : 0.027 s
% 4.90/2.44 # System time : 0.008 s
% 4.90/2.44 # Total time : 0.035 s
% 4.90/2.44 # ...preprocessing : 0.019 s
% 4.90/2.44 # ...main loop : 0.015 s
% 4.90/2.44 # Maximum resident set size: 7124 pages
% 4.90/2.44
%------------------------------------------------------------------------------