TSTP Solution File: GEO218+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO218+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:33 EDT 2022
% Result : Theorem 8.50s 2.55s
% Output : CNFRefutation 8.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 14 unt; 12 nHn; 18 RR)
% Number of literals : 54 ( 0 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( ~ orthogonal_lines(X1,X2)
| ~ unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jy38jk73/input.p',i_0_6) ).
cnf(i_0_27,negated_conjecture,
orthogonal_lines(esk1_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jy38jk73/input.p',i_0_27) ).
cnf(i_0_24,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jy38jk73/input.p',i_0_24) ).
cnf(i_0_16,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jy38jk73/input.p',i_0_16) ).
cnf(i_0_26,negated_conjecture,
~ orthogonal_lines(esk2_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jy38jk73/input.p',i_0_26) ).
cnf(i_0_5,plain,
( orthogonal_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jy38jk73/input.p',i_0_5) ).
cnf(i_0_31,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X3)
| ~ convergent_lines(X2,X3)
| ~ unorthogonal_lines(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jy38jk73/input.p',i_0_31) ).
cnf(i_0_2,plain,
( ~ parallel_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jy38jk73/input.p',i_0_2) ).
cnf(i_0_28,negated_conjecture,
parallel_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jy38jk73/input.p',i_0_28) ).
cnf(i_0_9,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jy38jk73/input.p',i_0_9) ).
cnf(c_0_42,plain,
( ~ orthogonal_lines(X1,X2)
| ~ unorthogonal_lines(X1,X2) ),
i_0_6 ).
cnf(c_0_43,negated_conjecture,
orthogonal_lines(esk1_0,esk3_0),
i_0_27 ).
cnf(c_0_44,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
i_0_24 ).
cnf(c_0_46,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_16 ).
cnf(c_0_47,plain,
convergent_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
~ orthogonal_lines(esk2_0,esk3_0),
i_0_26 ).
cnf(c_0_49,plain,
( orthogonal_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
i_0_5 ).
cnf(c_0_50,plain,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X3)
| ~ convergent_lines(X2,X3)
| ~ unorthogonal_lines(X2,X3) ),
i_0_31 ).
cnf(c_0_52,negated_conjecture,
unorthogonal_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
( ~ parallel_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
i_0_2 ).
cnf(c_0_54,negated_conjecture,
parallel_lines(esk1_0,esk2_0),
i_0_28 ).
cnf(c_0_55,plain,
~ convergent_lines(X1,X1),
i_0_9 ).
cnf(c_0_56,plain,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk3_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_50]) ).
cnf(c_0_57,plain,
( unorthogonal_lines(X1,esk3_0)
| convergent_lines(X1,esk2_0)
| ~ convergent_lines(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,negated_conjecture,
~ convergent_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,plain,
( convergent_lines(X1,esk3_0)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
~ convergent_lines(esk2_0,esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_57]),c_0_58]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GEO218+3 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 04:26:06 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected SinE mode:
% 0.22/0.49 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.50/2.55 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.50/2.55 # Version: 2.1pre011
% 8.50/2.55 # Preprocessing time : 0.020 s
% 8.50/2.55
% 8.50/2.55 # Proof found!
% 8.50/2.55 # SZS status Theorem
% 8.50/2.55 # SZS output start CNFRefutation
% See solution above
% 8.50/2.55 # Proof object total steps : 30
% 8.50/2.55 # Proof object clause steps : 20
% 8.50/2.55 # Proof object formula steps : 10
% 8.50/2.55 # Proof object conjectures : 11
% 8.50/2.55 # Proof object clause conjectures : 8
% 8.50/2.55 # Proof object formula conjectures : 3
% 8.50/2.55 # Proof object initial clauses used : 10
% 8.50/2.55 # Proof object initial formulas used : 10
% 8.50/2.55 # Proof object generating inferences : 10
% 8.50/2.55 # Proof object simplifying inferences : 2
% 8.50/2.55 # Training examples: 0 positive, 0 negative
% 8.50/2.55 # Parsed axioms : 49
% 8.50/2.55 # Removed by relevancy pruning/SinE : 0
% 8.50/2.55 # Initial clauses : 49
% 8.50/2.55 # Removed in clause preprocessing : 0
% 8.50/2.55 # Initial clauses in saturation : 49
% 8.50/2.55 # Processed clauses : 79
% 8.50/2.55 # ...of these trivial : 0
% 8.50/2.55 # ...subsumed : 14
% 8.50/2.55 # ...remaining for further processing : 65
% 8.50/2.55 # Other redundant clauses eliminated : 0
% 8.50/2.55 # Clauses deleted for lack of memory : 0
% 8.50/2.55 # Backward-subsumed : 0
% 8.50/2.55 # Backward-rewritten : 0
% 8.50/2.55 # Generated clauses : 113
% 8.50/2.55 # ...of the previous two non-trivial : 92
% 8.50/2.55 # Contextual simplify-reflections : 6
% 8.50/2.55 # Paramodulations : 111
% 8.50/2.55 # Factorizations : 2
% 8.50/2.55 # Equation resolutions : 0
% 8.50/2.55 # Propositional unsat checks : 0
% 8.50/2.55 # Propositional unsat check successes : 0
% 8.50/2.55 # Current number of processed clauses : 65
% 8.50/2.55 # Positive orientable unit clauses : 7
% 8.50/2.55 # Positive unorientable unit clauses: 0
% 8.50/2.55 # Negative unit clauses : 11
% 8.50/2.55 # Non-unit-clauses : 47
% 8.50/2.55 # Current number of unprocessed clauses: 59
% 8.50/2.55 # ...number of literals in the above : 243
% 8.50/2.55 # Current number of archived formulas : 0
% 8.50/2.55 # Current number of archived clauses : 0
% 8.50/2.55 # Clause-clause subsumption calls (NU) : 387
% 8.50/2.55 # Rec. Clause-clause subsumption calls : 239
% 8.50/2.55 # Non-unit clause-clause subsumptions : 15
% 8.50/2.55 # Unit Clause-clause subsumption calls : 58
% 8.50/2.55 # Rewrite failures with RHS unbound : 0
% 8.50/2.55 # BW rewrite match attempts : 0
% 8.50/2.55 # BW rewrite match successes : 0
% 8.50/2.55 # Condensation attempts : 0
% 8.50/2.55 # Condensation successes : 0
% 8.50/2.55 # Termbank termtop insertions : 2194
% 8.50/2.55
% 8.50/2.55 # -------------------------------------------------
% 8.50/2.55 # User time : 0.016 s
% 8.50/2.55 # System time : 0.009 s
% 8.50/2.55 # Total time : 0.024 s
% 8.50/2.55 # ...preprocessing : 0.020 s
% 8.50/2.55 # ...main loop : 0.004 s
% 8.50/2.55 # Maximum resident set size: 7124 pages
% 8.50/2.55
%------------------------------------------------------------------------------