TSTP Solution File: GEO219+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO219+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:34 EDT 2022
% Result : Theorem 7.82s 2.31s
% Output : CNFRefutation 7.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 32 ( 14 unt; 14 nHn; 18 RR)
% Number of literals : 61 ( 0 equ; 25 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( ~ orthogonal_lines(X1,X2)
| ~ unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-624z828g/input.p',i_0_6) ).
cnf(i_0_28,negated_conjecture,
orthogonal_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-624z828g/input.p',i_0_28) ).
cnf(i_0_26,negated_conjecture,
~ orthogonal_lines(esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-624z828g/input.p',i_0_26) ).
cnf(i_0_5,plain,
( orthogonal_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-624z828g/input.p',i_0_5) ).
cnf(i_0_24,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-624z828g/input.p',i_0_24) ).
cnf(i_0_32,plain,
( convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| ~ convergent_lines(X2,X3)
| ~ unorthogonal_lines(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-624z828g/input.p',i_0_32) ).
cnf(i_0_16,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-624z828g/input.p',i_0_16) ).
cnf(i_0_2,plain,
( ~ parallel_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-624z828g/input.p',i_0_2) ).
cnf(i_0_27,negated_conjecture,
parallel_lines(esk1_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-624z828g/input.p',i_0_27) ).
cnf(i_0_9,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-624z828g/input.p',i_0_9) ).
cnf(i_0_30,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X3)
| ~ convergent_lines(X3,X2)
| ~ unorthogonal_lines(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-624z828g/input.p',i_0_30) ).
cnf(c_0_44,plain,
( ~ orthogonal_lines(X1,X2)
| ~ unorthogonal_lines(X1,X2) ),
i_0_6 ).
cnf(c_0_45,negated_conjecture,
orthogonal_lines(esk1_0,esk2_0),
i_0_28 ).
cnf(c_0_46,negated_conjecture,
~ orthogonal_lines(esk2_0,esk3_0),
i_0_26 ).
cnf(c_0_47,plain,
( orthogonal_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
i_0_5 ).
cnf(c_0_48,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
i_0_24 ).
cnf(c_0_50,plain,
( convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| ~ convergent_lines(X2,X3)
| ~ unorthogonal_lines(X2,X3) ),
i_0_32 ).
cnf(c_0_51,negated_conjecture,
unorthogonal_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_16 ).
cnf(c_0_53,plain,
convergent_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,plain,
( ~ parallel_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
i_0_2 ).
cnf(c_0_55,negated_conjecture,
parallel_lines(esk1_0,esk3_0),
i_0_27 ).
cnf(c_0_56,plain,
( convergent_lines(X1,esk3_0)
| convergent_lines(X1,esk2_0)
| ~ convergent_lines(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,plain,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
~ convergent_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,plain,
~ convergent_lines(X1,X1),
i_0_9 ).
cnf(c_0_60,plain,
( convergent_lines(X1,esk2_0)
| convergent_lines(X1,esk3_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_61,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X3)
| ~ convergent_lines(X3,X2)
| ~ unorthogonal_lines(X3,X2) ),
i_0_30 ).
cnf(c_0_62,plain,
convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
( unorthogonal_lines(X1,esk2_0)
| convergent_lines(X1,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_51]),c_0_62])]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_63]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GEO219+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 : n023.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 10:28:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.82/2.31 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.82/2.31 # Version: 2.1pre011
% 7.82/2.31 # Preprocessing time : 0.017 s
% 7.82/2.31
% 7.82/2.31 # Proof found!
% 7.82/2.31 # SZS status Theorem
% 7.82/2.31 # SZS output start CNFRefutation
% See solution above
% 7.82/2.31 # Proof object total steps : 32
% 7.82/2.31 # Proof object clause steps : 21
% 7.82/2.31 # Proof object formula steps : 11
% 7.82/2.31 # Proof object conjectures : 10
% 7.82/2.31 # Proof object clause conjectures : 7
% 7.82/2.31 # Proof object formula conjectures : 3
% 7.82/2.31 # Proof object initial clauses used : 11
% 7.82/2.31 # Proof object initial formulas used : 11
% 7.82/2.31 # Proof object generating inferences : 10
% 7.82/2.31 # Proof object simplifying inferences : 4
% 7.82/2.31 # Training examples: 0 positive, 0 negative
% 7.82/2.31 # Parsed axioms : 49
% 7.82/2.31 # Removed by relevancy pruning/SinE : 0
% 7.82/2.31 # Initial clauses : 49
% 7.82/2.31 # Removed in clause preprocessing : 0
% 7.82/2.31 # Initial clauses in saturation : 49
% 7.82/2.31 # Processed clauses : 71
% 7.82/2.31 # ...of these trivial : 0
% 7.82/2.31 # ...subsumed : 7
% 7.82/2.31 # ...remaining for further processing : 64
% 7.82/2.31 # Other redundant clauses eliminated : 0
% 7.82/2.31 # Clauses deleted for lack of memory : 0
% 7.82/2.31 # Backward-subsumed : 1
% 7.82/2.31 # Backward-rewritten : 4
% 7.82/2.31 # Generated clauses : 102
% 7.82/2.31 # ...of the previous two non-trivial : 86
% 7.82/2.31 # Contextual simplify-reflections : 4
% 7.82/2.31 # Paramodulations : 102
% 7.82/2.31 # Factorizations : 0
% 7.82/2.31 # Equation resolutions : 0
% 7.82/2.31 # Propositional unsat checks : 0
% 7.82/2.31 # Propositional unsat check successes : 0
% 7.82/2.31 # Current number of processed clauses : 59
% 7.82/2.31 # Positive orientable unit clauses : 8
% 7.82/2.31 # Positive unorientable unit clauses: 0
% 7.82/2.31 # Negative unit clauses : 10
% 7.82/2.31 # Non-unit-clauses : 41
% 7.82/2.31 # Current number of unprocessed clauses: 42
% 7.82/2.31 # ...number of literals in the above : 131
% 7.82/2.31 # Current number of archived formulas : 0
% 7.82/2.31 # Current number of archived clauses : 5
% 7.82/2.31 # Clause-clause subsumption calls (NU) : 332
% 7.82/2.31 # Rec. Clause-clause subsumption calls : 203
% 7.82/2.31 # Non-unit clause-clause subsumptions : 10
% 7.82/2.31 # Unit Clause-clause subsumption calls : 55
% 7.82/2.31 # Rewrite failures with RHS unbound : 0
% 7.82/2.31 # BW rewrite match attempts : 1
% 7.82/2.31 # BW rewrite match successes : 1
% 7.82/2.31 # Condensation attempts : 0
% 7.82/2.31 # Condensation successes : 0
% 7.82/2.31 # Termbank termtop insertions : 2117
% 7.82/2.31
% 7.82/2.31 # -------------------------------------------------
% 7.82/2.31 # User time : 0.015 s
% 7.82/2.31 # System time : 0.005 s
% 7.82/2.31 # Total time : 0.020 s
% 7.82/2.31 # ...preprocessing : 0.017 s
% 7.82/2.31 # ...main loop : 0.004 s
% 7.82/2.31 # Maximum resident set size: 7128 pages
% 7.82/2.31
%------------------------------------------------------------------------------