TSTP Solution File: GEO216+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO216+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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 4.40s 2.11s
% Output : CNFRefutation 4.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 6 unt; 2 nHn; 8 RR)
% Number of literals : 14 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( ~ orthogonal_lines(X1,X2)
| ~ unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-57z0wtxp/input.p',i_0_6) ).
cnf(i_0_26,negated_conjecture,
orthogonal_lines(esk1_0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-57z0wtxp/input.p',i_0_26) ).
cnf(i_0_24,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-57z0wtxp/input.p',i_0_24) ).
cnf(i_0_9,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-57z0wtxp/input.p',i_0_9) ).
cnf(c_0_31,plain,
( ~ orthogonal_lines(X1,X2)
| ~ unorthogonal_lines(X1,X2) ),
i_0_6 ).
cnf(c_0_32,negated_conjecture,
orthogonal_lines(esk1_0,esk1_0),
i_0_26 ).
cnf(c_0_33,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk1_0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
i_0_24 ).
cnf(c_0_35,plain,
~ convergent_lines(X1,X1),
i_0_9 ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO216+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jun 17 20:47:35 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.40/2.11 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 4.40/2.11 # Version: 2.1pre011
% 4.40/2.11 # Preprocessing time : 0.012 s
% 4.40/2.11
% 4.40/2.11 # Proof found!
% 4.40/2.11 # SZS status Theorem
% 4.40/2.11 # SZS output start CNFRefutation
% See solution above
% 4.40/2.11 # Proof object total steps : 10
% 4.40/2.11 # Proof object clause steps : 6
% 4.40/2.11 # Proof object formula steps : 4
% 4.40/2.11 # Proof object conjectures : 3
% 4.40/2.11 # Proof object clause conjectures : 2
% 4.40/2.11 # Proof object formula conjectures : 1
% 4.40/2.11 # Proof object initial clauses used : 4
% 4.40/2.11 # Proof object initial formulas used : 4
% 4.40/2.11 # Proof object generating inferences : 2
% 4.40/2.11 # Proof object simplifying inferences : 1
% 4.40/2.11 # Training examples: 0 positive, 0 negative
% 4.40/2.11 # Parsed axioms : 47
% 4.40/2.11 # Removed by relevancy pruning/SinE : 0
% 4.40/2.11 # Initial clauses : 47
% 4.40/2.11 # Removed in clause preprocessing : 0
% 4.40/2.11 # Initial clauses in saturation : 47
% 4.40/2.11 # Processed clauses : 49
% 4.40/2.11 # ...of these trivial : 0
% 4.40/2.11 # ...subsumed : 5
% 4.40/2.11 # ...remaining for further processing : 44
% 4.40/2.11 # Other redundant clauses eliminated : 0
% 4.40/2.11 # Clauses deleted for lack of memory : 0
% 4.40/2.11 # Backward-subsumed : 0
% 4.40/2.11 # Backward-rewritten : 0
% 4.40/2.11 # Generated clauses : 42
% 4.40/2.11 # ...of the previous two non-trivial : 30
% 4.40/2.11 # Contextual simplify-reflections : 4
% 4.40/2.11 # Paramodulations : 14
% 4.40/2.11 # Factorizations : 28
% 4.40/2.11 # Equation resolutions : 0
% 4.40/2.11 # Propositional unsat checks : 0
% 4.40/2.11 # Propositional unsat check successes : 0
% 4.40/2.11 # Current number of processed clauses : 44
% 4.40/2.11 # Positive orientable unit clauses : 1
% 4.40/2.11 # Positive unorientable unit clauses: 0
% 4.40/2.11 # Negative unit clauses : 8
% 4.40/2.11 # Non-unit-clauses : 35
% 4.40/2.11 # Current number of unprocessed clauses: 28
% 4.40/2.11 # ...number of literals in the above : 83
% 4.40/2.11 # Current number of archived formulas : 0
% 4.40/2.11 # Current number of archived clauses : 0
% 4.40/2.11 # Clause-clause subsumption calls (NU) : 245
% 4.40/2.11 # Rec. Clause-clause subsumption calls : 125
% 4.40/2.11 # Non-unit clause-clause subsumptions : 8
% 4.40/2.11 # Unit Clause-clause subsumption calls : 11
% 4.40/2.11 # Rewrite failures with RHS unbound : 0
% 4.40/2.11 # BW rewrite match attempts : 0
% 4.40/2.11 # BW rewrite match successes : 0
% 4.40/2.11 # Condensation attempts : 0
% 4.40/2.11 # Condensation successes : 0
% 4.40/2.11 # Termbank termtop insertions : 1283
% 4.40/2.11
% 4.40/2.11 # -------------------------------------------------
% 4.40/2.11 # User time : 0.009 s
% 4.40/2.11 # System time : 0.004 s
% 4.40/2.11 # Total time : 0.013 s
% 4.40/2.11 # ...preprocessing : 0.012 s
% 4.40/2.11 # ...main loop : 0.001 s
% 4.40/2.11 # Maximum resident set size: 7140 pages
% 4.40/2.11
%------------------------------------------------------------------------------