TSTP Solution File: GEO211+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO211+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:27 EDT 2022
% Result : Theorem 7.07s 2.39s
% Output : CNFRefutation 7.07s
% 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_14,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8eiyg6yb/input.p',i_0_14) ).
cnf(i_0_23,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8eiyg6yb/input.p',i_0_23) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8eiyg6yb/input.p',i_0_3) ).
cnf(c_0_27,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk1_0),
i_0_14 ).
cnf(c_0_28,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
i_0_23 ).
cnf(c_0_29,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO211+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n016.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:47:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.07/2.39 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.07/2.39 # Version: 2.1pre011
% 7.07/2.39 # Preprocessing time : 0.011 s
% 7.07/2.39
% 7.07/2.39 # Proof found!
% 7.07/2.39 # SZS status Theorem
% 7.07/2.39 # SZS output start CNFRefutation
% See solution above
% 7.07/2.39 # Proof object total steps : 7
% 7.07/2.39 # Proof object clause steps : 4
% 7.07/2.39 # Proof object formula steps : 3
% 7.07/2.39 # Proof object conjectures : 3
% 7.07/2.39 # Proof object clause conjectures : 2
% 7.07/2.39 # Proof object formula conjectures : 1
% 7.07/2.39 # Proof object initial clauses used : 3
% 7.07/2.39 # Proof object initial formulas used : 3
% 7.07/2.39 # Proof object generating inferences : 1
% 7.07/2.39 # Proof object simplifying inferences : 1
% 7.07/2.39 # Training examples: 0 positive, 0 negative
% 7.07/2.39 # Parsed axioms : 26
% 7.07/2.39 # Removed by relevancy pruning/SinE : 0
% 7.07/2.39 # Initial clauses : 26
% 7.07/2.39 # Removed in clause preprocessing : 0
% 7.07/2.39 # Initial clauses in saturation : 26
% 7.07/2.39 # Processed clauses : 27
% 7.07/2.39 # ...of these trivial : 0
% 7.07/2.39 # ...subsumed : 1
% 7.07/2.39 # ...remaining for further processing : 25
% 7.07/2.39 # Other redundant clauses eliminated : 0
% 7.07/2.39 # Clauses deleted for lack of memory : 0
% 7.07/2.39 # Backward-subsumed : 0
% 7.07/2.39 # Backward-rewritten : 0
% 7.07/2.39 # Generated clauses : 37
% 7.07/2.39 # ...of the previous two non-trivial : 36
% 7.07/2.39 # Contextual simplify-reflections : 1
% 7.07/2.39 # Paramodulations : 11
% 7.07/2.39 # Factorizations : 26
% 7.07/2.39 # Equation resolutions : 0
% 7.07/2.39 # Propositional unsat checks : 0
% 7.07/2.39 # Propositional unsat check successes : 0
% 7.07/2.39 # Current number of processed clauses : 25
% 7.07/2.39 # Positive orientable unit clauses : 0
% 7.07/2.39 # Positive unorientable unit clauses: 0
% 7.07/2.39 # Negative unit clauses : 8
% 7.07/2.39 # Non-unit-clauses : 17
% 7.07/2.39 # Current number of unprocessed clauses: 35
% 7.07/2.39 # ...number of literals in the above : 106
% 7.07/2.39 # Current number of archived formulas : 0
% 7.07/2.39 # Current number of archived clauses : 0
% 7.07/2.39 # Clause-clause subsumption calls (NU) : 20
% 7.07/2.39 # Rec. Clause-clause subsumption calls : 16
% 7.07/2.39 # Non-unit clause-clause subsumptions : 2
% 7.07/2.39 # Unit Clause-clause subsumption calls : 0
% 7.07/2.39 # Rewrite failures with RHS unbound : 0
% 7.07/2.39 # BW rewrite match attempts : 0
% 7.07/2.39 # BW rewrite match successes : 0
% 7.07/2.39 # Condensation attempts : 0
% 7.07/2.39 # Condensation successes : 0
% 7.07/2.39 # Termbank termtop insertions : 831
% 7.07/2.39
% 7.07/2.39 # -------------------------------------------------
% 7.07/2.39 # User time : 0.006 s
% 7.07/2.39 # System time : 0.006 s
% 7.07/2.39 # Total time : 0.012 s
% 7.07/2.39 # ...preprocessing : 0.011 s
% 7.07/2.39 # ...main loop : 0.001 s
% 7.07/2.39 # Maximum resident set size: 7136 pages
% 7.07/2.39
%------------------------------------------------------------------------------