TSTP Solution File: GEO220+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO220+1 : 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:34 EDT 2022
% Result : Theorem 7.24s 2.41s
% Output : CNFRefutation 7.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 7 unt; 3 nHn; 7 RR)
% Number of literals : 15 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_22,plain,
( unorthogonal_lines(X1,X2)
| unorthogonal_lines(X1,X3)
| ~ convergent_lines(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-66wzghxl/input.p',i_0_22) ).
cnf(i_0_15,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-66wzghxl/input.p',i_0_15) ).
cnf(i_0_17,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-66wzghxl/input.p',i_0_17) ).
cnf(i_0_16,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-66wzghxl/input.p',i_0_16) ).
cnf(c_0_27,plain,
( unorthogonal_lines(X1,X2)
| unorthogonal_lines(X1,X3)
| ~ convergent_lines(X3,X2) ),
i_0_22 ).
cnf(c_0_28,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
i_0_15 ).
cnf(c_0_29,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk2_0),
i_0_17 ).
cnf(c_0_30,negated_conjecture,
( unorthogonal_lines(X1,esk2_0)
| unorthogonal_lines(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk3_0),
i_0_16 ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO220+1 : 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 : Sat Jun 18 07:23:55 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.24/2.41 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.24/2.41 # Version: 2.1pre011
% 7.24/2.41 # Preprocessing time : 0.012 s
% 7.24/2.41
% 7.24/2.41 # Proof found!
% 7.24/2.41 # SZS status Theorem
% 7.24/2.41 # SZS output start CNFRefutation
% See solution above
% 7.24/2.41 # Proof object total steps : 10
% 7.24/2.41 # Proof object clause steps : 6
% 7.24/2.41 # Proof object formula steps : 4
% 7.24/2.41 # Proof object conjectures : 8
% 7.24/2.41 # Proof object clause conjectures : 5
% 7.24/2.41 # Proof object formula conjectures : 3
% 7.24/2.41 # Proof object initial clauses used : 4
% 7.24/2.41 # Proof object initial formulas used : 4
% 7.24/2.41 # Proof object generating inferences : 2
% 7.24/2.41 # Proof object simplifying inferences : 1
% 7.24/2.41 # Training examples: 0 positive, 0 negative
% 7.24/2.41 # Parsed axioms : 23
% 7.24/2.41 # Removed by relevancy pruning/SinE : 0
% 7.24/2.41 # Initial clauses : 23
% 7.24/2.41 # Removed in clause preprocessing : 0
% 7.24/2.41 # Initial clauses in saturation : 23
% 7.24/2.41 # Processed clauses : 25
% 7.24/2.41 # ...of these trivial : 0
% 7.24/2.41 # ...subsumed : 1
% 7.24/2.41 # ...remaining for further processing : 24
% 7.24/2.41 # Other redundant clauses eliminated : 0
% 7.24/2.41 # Clauses deleted for lack of memory : 0
% 7.24/2.41 # Backward-subsumed : 0
% 7.24/2.41 # Backward-rewritten : 0
% 7.24/2.41 # Generated clauses : 16
% 7.24/2.41 # ...of the previous two non-trivial : 9
% 7.24/2.41 # Contextual simplify-reflections : 1
% 7.24/2.41 # Paramodulations : 16
% 7.24/2.41 # Factorizations : 0
% 7.24/2.41 # Equation resolutions : 0
% 7.24/2.41 # Propositional unsat checks : 0
% 7.24/2.41 # Propositional unsat check successes : 0
% 7.24/2.41 # Current number of processed clauses : 24
% 7.24/2.41 # Positive orientable unit clauses : 1
% 7.24/2.41 # Positive unorientable unit clauses: 0
% 7.24/2.41 # Negative unit clauses : 5
% 7.24/2.41 # Non-unit-clauses : 18
% 7.24/2.41 # Current number of unprocessed clauses: 7
% 7.24/2.41 # ...number of literals in the above : 14
% 7.24/2.41 # Current number of archived formulas : 0
% 7.24/2.41 # Current number of archived clauses : 0
% 7.24/2.41 # Clause-clause subsumption calls (NU) : 21
% 7.24/2.41 # Rec. Clause-clause subsumption calls : 21
% 7.24/2.41 # Non-unit clause-clause subsumptions : 2
% 7.24/2.41 # Unit Clause-clause subsumption calls : 0
% 7.24/2.41 # Rewrite failures with RHS unbound : 0
% 7.24/2.41 # BW rewrite match attempts : 0
% 7.24/2.41 # BW rewrite match successes : 0
% 7.24/2.41 # Condensation attempts : 0
% 7.24/2.41 # Condensation successes : 0
% 7.24/2.41 # Termbank termtop insertions : 630
% 7.24/2.41
% 7.24/2.41 # -------------------------------------------------
% 7.24/2.41 # User time : 0.006 s
% 7.24/2.41 # System time : 0.006 s
% 7.24/2.41 # Total time : 0.013 s
% 7.24/2.41 # ...preprocessing : 0.012 s
% 7.24/2.41 # ...main loop : 0.001 s
% 7.24/2.41 # Maximum resident set size: 7132 pages
% 7.24/2.41
%------------------------------------------------------------------------------