TSTP Solution File: GEO216+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO216+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:31 EDT 2022
% Result : Theorem 7.31s 2.35s
% Output : CNFRefutation 7.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 2 nHn; 5 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_15,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5e4g2_dx/input.p',i_0_15) ).
cnf(i_0_10,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5e4g2_dx/input.p',i_0_10) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5e4g2_dx/input.p',i_0_3) ).
cnf(c_0_19,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk1_0),
i_0_15 ).
cnf(c_0_20,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
i_0_10 ).
cnf(c_0_21,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GEO216+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n026.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sat Jun 18 03:41:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # 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.31/2.35 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.31/2.35 # Version: 2.1pre011
% 7.31/2.35 # Preprocessing time : 0.009 s
% 7.31/2.35
% 7.31/2.35 # Proof found!
% 7.31/2.35 # SZS status Theorem
% 7.31/2.35 # SZS output start CNFRefutation
% See solution above
% 7.31/2.35 # Proof object total steps : 7
% 7.31/2.35 # Proof object clause steps : 4
% 7.31/2.35 # Proof object formula steps : 3
% 7.31/2.35 # Proof object conjectures : 3
% 7.31/2.35 # Proof object clause conjectures : 2
% 7.31/2.35 # Proof object formula conjectures : 1
% 7.31/2.35 # Proof object initial clauses used : 3
% 7.31/2.35 # Proof object initial formulas used : 3
% 7.31/2.35 # Proof object generating inferences : 1
% 7.31/2.35 # Proof object simplifying inferences : 1
% 7.31/2.35 # Training examples: 0 positive, 0 negative
% 7.31/2.35 # Parsed axioms : 21
% 7.31/2.35 # Removed by relevancy pruning/SinE : 0
% 7.31/2.35 # Initial clauses : 21
% 7.31/2.35 # Removed in clause preprocessing : 0
% 7.31/2.35 # Initial clauses in saturation : 21
% 7.31/2.35 # Processed clauses : 22
% 7.31/2.35 # ...of these trivial : 0
% 7.31/2.35 # ...subsumed : 1
% 7.31/2.35 # ...remaining for further processing : 20
% 7.31/2.35 # Other redundant clauses eliminated : 0
% 7.31/2.35 # Clauses deleted for lack of memory : 0
% 7.31/2.35 # Backward-subsumed : 0
% 7.31/2.35 # Backward-rewritten : 0
% 7.31/2.35 # Generated clauses : 11
% 7.31/2.35 # ...of the previous two non-trivial : 8
% 7.31/2.35 # Contextual simplify-reflections : 1
% 7.31/2.35 # Paramodulations : 11
% 7.31/2.35 # Factorizations : 0
% 7.31/2.35 # Equation resolutions : 0
% 7.31/2.35 # Propositional unsat checks : 0
% 7.31/2.35 # Propositional unsat check successes : 0
% 7.31/2.35 # Current number of processed clauses : 20
% 7.31/2.35 # Positive orientable unit clauses : 0
% 7.31/2.35 # Positive unorientable unit clauses: 0
% 7.31/2.35 # Negative unit clauses : 4
% 7.31/2.35 # Non-unit-clauses : 16
% 7.31/2.35 # Current number of unprocessed clauses: 7
% 7.31/2.35 # ...number of literals in the above : 22
% 7.31/2.35 # Current number of archived formulas : 0
% 7.31/2.35 # Current number of archived clauses : 0
% 7.31/2.35 # Clause-clause subsumption calls (NU) : 24
% 7.31/2.35 # Rec. Clause-clause subsumption calls : 22
% 7.31/2.35 # Non-unit clause-clause subsumptions : 2
% 7.31/2.35 # Unit Clause-clause subsumption calls : 0
% 7.31/2.35 # Rewrite failures with RHS unbound : 0
% 7.31/2.35 # BW rewrite match attempts : 0
% 7.31/2.35 # BW rewrite match successes : 0
% 7.31/2.35 # Condensation attempts : 0
% 7.31/2.35 # Condensation successes : 0
% 7.31/2.35 # Termbank termtop insertions : 586
% 7.31/2.35
% 7.31/2.35 # -------------------------------------------------
% 7.31/2.35 # User time : 0.009 s
% 7.31/2.35 # System time : 0.001 s
% 7.31/2.35 # Total time : 0.010 s
% 7.31/2.35 # ...preprocessing : 0.009 s
% 7.31/2.35 # ...main loop : 0.001 s
% 7.31/2.35 # Maximum resident set size: 7136 pages
% 7.31/2.35
%------------------------------------------------------------------------------