TSTP Solution File: GEO212+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO212+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:28 EDT 2022
% Result : Theorem 7.75s 2.41s
% Output : CNFRefutation 7.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 12 unt; 10 nHn; 12 RR)
% Number of literals : 40 ( 0 equ; 14 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 : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jx4bz70p/input.p',i_0_14) ).
cnf(i_0_25,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jx4bz70p/input.p',i_0_25) ).
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-jx4bz70p/input.p',i_0_6) ).
cnf(i_0_23,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-jx4bz70p/input.p',i_0_23) ).
cnf(i_0_16,negated_conjecture,
unorthogonal_lines(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jx4bz70p/input.p',i_0_16) ).
cnf(i_0_15,negated_conjecture,
~ convergent_lines(esk1_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jx4bz70p/input.p',i_0_15) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jx4bz70p/input.p',i_0_3) ).
cnf(c_0_33,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk3_0),
i_0_14 ).
cnf(c_0_34,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
i_0_25 ).
cnf(c_0_35,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_6 ).
cnf(c_0_36,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X3,X2)
| ~ convergent_lines(X1,X3)
| ~ unorthogonal_lines(X1,X3) ),
i_0_23 ).
cnf(c_0_39,negated_conjecture,
unorthogonal_lines(esk1_0,esk2_0),
i_0_16 ).
cnf(c_0_40,negated_conjecture,
~ convergent_lines(esk1_0,esk3_0),
i_0_15 ).
cnf(c_0_41,plain,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk3_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_37]) ).
cnf(c_0_42,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_43,negated_conjecture,
( convergent_lines(esk1_0,X1)
| unorthogonal_lines(esk2_0,X1)
| ~ convergent_lines(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_45,negated_conjecture,
~ convergent_lines(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_43]),c_0_40]) ).
cnf(c_0_46,plain,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO212+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n027.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 : Sat Jun 18 01:58:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/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
% 7.75/2.41 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.75/2.41 # Version: 2.1pre011
% 7.75/2.41 # Preprocessing time : 0.011 s
% 7.75/2.41
% 7.75/2.41 # Proof found!
% 7.75/2.41 # SZS status Theorem
% 7.75/2.41 # SZS output start CNFRefutation
% See solution above
% 7.75/2.41 # Proof object total steps : 22
% 7.75/2.41 # Proof object clause steps : 15
% 7.75/2.41 # Proof object formula steps : 7
% 7.75/2.41 # Proof object conjectures : 11
% 7.75/2.41 # Proof object clause conjectures : 8
% 7.75/2.41 # Proof object formula conjectures : 3
% 7.75/2.41 # Proof object initial clauses used : 7
% 7.75/2.41 # Proof object initial formulas used : 7
% 7.75/2.41 # Proof object generating inferences : 8
% 7.75/2.41 # Proof object simplifying inferences : 3
% 7.75/2.41 # Training examples: 0 positive, 0 negative
% 7.75/2.41 # Parsed axioms : 28
% 7.75/2.41 # Removed by relevancy pruning/SinE : 0
% 7.75/2.41 # Initial clauses : 28
% 7.75/2.41 # Removed in clause preprocessing : 0
% 7.75/2.41 # Initial clauses in saturation : 28
% 7.75/2.41 # Processed clauses : 45
% 7.75/2.41 # ...of these trivial : 0
% 7.75/2.41 # ...subsumed : 3
% 7.75/2.41 # ...remaining for further processing : 42
% 7.75/2.41 # Other redundant clauses eliminated : 0
% 7.75/2.41 # Clauses deleted for lack of memory : 0
% 7.75/2.41 # Backward-subsumed : 0
% 7.75/2.41 # Backward-rewritten : 0
% 7.75/2.41 # Generated clauses : 49
% 7.75/2.41 # ...of the previous two non-trivial : 36
% 7.75/2.41 # Contextual simplify-reflections : 1
% 7.75/2.41 # Paramodulations : 47
% 7.75/2.41 # Factorizations : 2
% 7.75/2.41 # Equation resolutions : 0
% 7.75/2.41 # Propositional unsat checks : 0
% 7.75/2.41 # Propositional unsat check successes : 0
% 7.75/2.41 # Current number of processed clauses : 42
% 7.75/2.41 # Positive orientable unit clauses : 5
% 7.75/2.41 # Positive unorientable unit clauses: 0
% 7.75/2.41 # Negative unit clauses : 10
% 7.75/2.41 # Non-unit-clauses : 27
% 7.75/2.41 # Current number of unprocessed clauses: 18
% 7.75/2.41 # ...number of literals in the above : 71
% 7.75/2.41 # Current number of archived formulas : 0
% 7.75/2.41 # Current number of archived clauses : 0
% 7.75/2.41 # Clause-clause subsumption calls (NU) : 71
% 7.75/2.41 # Rec. Clause-clause subsumption calls : 48
% 7.75/2.41 # Non-unit clause-clause subsumptions : 3
% 7.75/2.41 # Unit Clause-clause subsumption calls : 44
% 7.75/2.41 # Rewrite failures with RHS unbound : 0
% 7.75/2.41 # BW rewrite match attempts : 0
% 7.75/2.41 # BW rewrite match successes : 0
% 7.75/2.41 # Condensation attempts : 0
% 7.75/2.41 # Condensation successes : 0
% 7.75/2.41 # Termbank termtop insertions : 1083
% 7.75/2.41
% 7.75/2.41 # -------------------------------------------------
% 7.75/2.41 # User time : 0.009 s
% 7.75/2.41 # System time : 0.003 s
% 7.75/2.41 # Total time : 0.012 s
% 7.75/2.41 # ...preprocessing : 0.011 s
% 7.75/2.41 # ...main loop : 0.001 s
% 7.75/2.41 # Maximum resident set size: 7136 pages
% 7.75/2.41
%------------------------------------------------------------------------------