TSTP Solution File: GEO214+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO214+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:30 EDT 2022
% Result : Theorem 8.04s 2.56s
% Output : CNFRefutation 8.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 9 unt; 8 nHn; 9 RR)
% Number of literals : 32 ( 0 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_22,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X3,X2)
| ~ convergent_lines(X1,X3)
| ~ unorthogonal_lines(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1jmmtw8a/input.p',i_0_22) ).
cnf(i_0_15,negated_conjecture,
unorthogonal_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1jmmtw8a/input.p',i_0_15) ).
cnf(i_0_14,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1jmmtw8a/input.p',i_0_14) ).
cnf(i_0_24,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1jmmtw8a/input.p',i_0_24) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1jmmtw8a/input.p',i_0_3) ).
cnf(i_0_6,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1jmmtw8a/input.p',i_0_6) ).
cnf(c_0_31,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X3,X2)
| ~ convergent_lines(X1,X3)
| ~ unorthogonal_lines(X1,X3) ),
i_0_22 ).
cnf(c_0_32,negated_conjecture,
unorthogonal_lines(esk1_0,esk2_0),
i_0_15 ).
cnf(c_0_33,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk1_0),
i_0_14 ).
cnf(c_0_34,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
i_0_24 ).
cnf(c_0_35,negated_conjecture,
( convergent_lines(esk1_0,X1)
| unorthogonal_lines(esk2_0,X1)
| ~ convergent_lines(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_37,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_6 ).
cnf(c_0_38,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
~ convergent_lines(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_35]),c_0_36]) ).
cnf(c_0_40,plain,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO214+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Fri Jun 17 18:10:25 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.04/2.56 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.04/2.56 # Version: 2.1pre011
% 8.04/2.56 # Preprocessing time : 0.019 s
% 8.04/2.56
% 8.04/2.56 # Proof found!
% 8.04/2.56 # SZS status Theorem
% 8.04/2.56 # SZS output start CNFRefutation
% See solution above
% 8.04/2.56 # Proof object total steps : 17
% 8.04/2.56 # Proof object clause steps : 11
% 8.04/2.56 # Proof object formula steps : 6
% 8.04/2.56 # Proof object conjectures : 7
% 8.04/2.56 # Proof object clause conjectures : 5
% 8.04/2.56 # Proof object formula conjectures : 2
% 8.04/2.56 # Proof object initial clauses used : 6
% 8.04/2.56 # Proof object initial formulas used : 6
% 8.04/2.56 # Proof object generating inferences : 5
% 8.04/2.56 # Proof object simplifying inferences : 2
% 8.04/2.56 # Training examples: 0 positive, 0 negative
% 8.04/2.56 # Parsed axioms : 27
% 8.04/2.56 # Removed by relevancy pruning/SinE : 0
% 8.04/2.56 # Initial clauses : 27
% 8.04/2.56 # Removed in clause preprocessing : 0
% 8.04/2.56 # Initial clauses in saturation : 27
% 8.04/2.56 # Processed clauses : 39
% 8.04/2.56 # ...of these trivial : 0
% 8.04/2.56 # ...subsumed : 3
% 8.04/2.56 # ...remaining for further processing : 36
% 8.04/2.56 # Other redundant clauses eliminated : 0
% 8.04/2.56 # Clauses deleted for lack of memory : 0
% 8.04/2.56 # Backward-subsumed : 0
% 8.04/2.56 # Backward-rewritten : 0
% 8.04/2.56 # Generated clauses : 40
% 8.04/2.56 # ...of the previous two non-trivial : 31
% 8.04/2.56 # Contextual simplify-reflections : 1
% 8.04/2.56 # Paramodulations : 38
% 8.04/2.56 # Factorizations : 2
% 8.04/2.56 # Equation resolutions : 0
% 8.04/2.56 # Propositional unsat checks : 0
% 8.04/2.56 # Propositional unsat check successes : 0
% 8.04/2.56 # Current number of processed clauses : 36
% 8.04/2.56 # Positive orientable unit clauses : 2
% 8.04/2.56 # Positive unorientable unit clauses: 0
% 8.04/2.56 # Negative unit clauses : 9
% 8.04/2.56 # Non-unit-clauses : 25
% 8.04/2.56 # Current number of unprocessed clauses: 19
% 8.04/2.56 # ...number of literals in the above : 80
% 8.04/2.56 # Current number of archived formulas : 0
% 8.04/2.56 # Current number of archived clauses : 0
% 8.04/2.56 # Clause-clause subsumption calls (NU) : 52
% 8.04/2.56 # Rec. Clause-clause subsumption calls : 41
% 8.04/2.56 # Non-unit clause-clause subsumptions : 3
% 8.04/2.56 # Unit Clause-clause subsumption calls : 16
% 8.04/2.56 # Rewrite failures with RHS unbound : 0
% 8.04/2.56 # BW rewrite match attempts : 0
% 8.04/2.56 # BW rewrite match successes : 0
% 8.04/2.56 # Condensation attempts : 0
% 8.04/2.56 # Condensation successes : 0
% 8.04/2.56 # Termbank termtop insertions : 1010
% 8.04/2.56
% 8.04/2.56 # -------------------------------------------------
% 8.04/2.56 # User time : 0.014 s
% 8.04/2.56 # System time : 0.007 s
% 8.04/2.56 # Total time : 0.021 s
% 8.04/2.56 # ...preprocessing : 0.019 s
% 8.04/2.56 # ...main loop : 0.002 s
% 8.04/2.56 # Maximum resident set size: 7128 pages
% 8.04/2.56
%------------------------------------------------------------------------------