%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO214+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:29 EDT 2022
% Result : Theorem 8.09s 2.47s
% Output : CNFRefutation 8.09s
% 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/sandbox2/tmp/enigma-theBenchmark.p-xtri5o2e/input.p',i_0_22) ).
cnf(i_0_15,negated_conjecture,
unorthogonal_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xtri5o2e/input.p',i_0_15) ).
cnf(i_0_14,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xtri5o2e/input.p',i_0_14) ).
cnf(i_0_24,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xtri5o2e/input.p',i_0_24) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xtri5o2e/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/sandbox2/tmp/enigma-theBenchmark.p-xtri5o2e/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.03/0.12 % Problem : GEO214+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 21:48:25 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.09/2.47 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.09/2.47 # Version: 2.1pre011
% 8.09/2.47 # Preprocessing time : 0.014 s
% 8.09/2.47
% 8.09/2.47 # Proof found!
% 8.09/2.47 # SZS status Theorem
% 8.09/2.47 # SZS output start CNFRefutation
% See solution above
% 8.09/2.47 # Proof object total steps : 17
% 8.09/2.47 # Proof object clause steps : 11
% 8.09/2.47 # Proof object formula steps : 6
% 8.09/2.47 # Proof object conjectures : 7
% 8.09/2.47 # Proof object clause conjectures : 5
% 8.09/2.47 # Proof object formula conjectures : 2
% 8.09/2.47 # Proof object initial clauses used : 6
% 8.09/2.47 # Proof object initial formulas used : 6
% 8.09/2.47 # Proof object generating inferences : 5
% 8.09/2.47 # Proof object simplifying inferences : 2
% 8.09/2.47 # Training examples: 0 positive, 0 negative
% 8.09/2.47 # Parsed axioms : 27
% 8.09/2.47 # Removed by relevancy pruning/SinE : 0
% 8.09/2.47 # Initial clauses : 27
% 8.09/2.47 # Removed in clause preprocessing : 0
% 8.09/2.47 # Initial clauses in saturation : 27
% 8.09/2.47 # Processed clauses : 37
% 8.09/2.47 # ...of these trivial : 0
% 8.09/2.47 # ...subsumed : 2
% 8.09/2.47 # ...remaining for further processing : 35
% 8.09/2.47 # Other redundant clauses eliminated : 0
% 8.09/2.47 # Clauses deleted for lack of memory : 0
% 8.09/2.47 # Backward-subsumed : 0
% 8.09/2.47 # Backward-rewritten : 0
% 8.09/2.47 # Generated clauses : 35
% 8.09/2.47 # ...of the previous two non-trivial : 29
% 8.09/2.47 # Contextual simplify-reflections : 2
% 8.09/2.47 # Paramodulations : 35
% 8.09/2.47 # Factorizations : 0
% 8.09/2.47 # Equation resolutions : 0
% 8.09/2.47 # Propositional unsat checks : 0
% 8.09/2.47 # Propositional unsat check successes : 0
% 8.09/2.47 # Current number of processed clauses : 35
% 8.09/2.47 # Positive orientable unit clauses : 2
% 8.09/2.47 # Positive unorientable unit clauses: 0
% 8.09/2.47 # Negative unit clauses : 9
% 8.09/2.47 # Non-unit-clauses : 24
% 8.09/2.47 # Current number of unprocessed clauses: 19
% 8.09/2.47 # ...number of literals in the above : 87
% 8.09/2.47 # Current number of archived formulas : 0
% 8.09/2.47 # Current number of archived clauses : 0
% 8.09/2.47 # Clause-clause subsumption calls (NU) : 41
% 8.09/2.47 # Rec. Clause-clause subsumption calls : 39
% 8.09/2.47 # Non-unit clause-clause subsumptions : 4
% 8.09/2.47 # Unit Clause-clause subsumption calls : 15
% 8.09/2.47 # Rewrite failures with RHS unbound : 0
% 8.09/2.47 # BW rewrite match attempts : 0
% 8.09/2.47 # BW rewrite match successes : 0
% 8.09/2.47 # Condensation attempts : 0
% 8.09/2.47 # Condensation successes : 0
% 8.09/2.47 # Termbank termtop insertions : 979
% 8.09/2.47
% 8.09/2.47 # -------------------------------------------------
% 8.09/2.47 # User time : 0.009 s
% 8.09/2.47 # System time : 0.006 s
% 8.09/2.47 # Total time : 0.015 s
% 8.09/2.47 # ...preprocessing : 0.014 s
% 8.09/2.47 # ...main loop : 0.001 s
% 8.09/2.47 # Maximum resident set size: 7128 pages
% 8.09/2.47
%------------------------------------------------------------------------------