TSTP Solution File: GEO213+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO213+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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.22s 2.58s
% Output : CNFRefutation 8.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 13 unt; 10 nHn; 15 RR)
% Number of literals : 45 ( 0 equ; 17 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-s8cb9gyh/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-s8cb9gyh/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-s8cb9gyh/input.p',i_0_6) ).
cnf(i_0_15,negated_conjecture,
~ distinct_lines(esk1_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-s8cb9gyh/input.p',i_0_15) ).
cnf(i_0_9,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-s8cb9gyh/input.p',i_0_9) ).
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-s8cb9gyh/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-s8cb9gyh/input.p',i_0_16) ).
cnf(i_0_3,plain,
~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-s8cb9gyh/input.p',i_0_3) ).
cnf(c_0_34,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk3_0),
i_0_14 ).
cnf(c_0_35,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
i_0_25 ).
cnf(c_0_36,plain,
( convergent_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1) ),
i_0_6 ).
cnf(c_0_37,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
~ distinct_lines(esk1_0,esk3_0),
i_0_15 ).
cnf(c_0_39,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
i_0_9 ).
cnf(c_0_40,plain,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X3,X2)
| ~ convergent_lines(X1,X3)
| ~ unorthogonal_lines(X1,X3) ),
i_0_23 ).
cnf(c_0_42,negated_conjecture,
unorthogonal_lines(esk1_0,esk2_0),
i_0_16 ).
cnf(c_0_43,negated_conjecture,
~ convergent_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk3_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_40]) ).
cnf(c_0_45,plain,
~ convergent_lines(X1,X1),
i_0_3 ).
cnf(c_0_46,negated_conjecture,
( convergent_lines(esk1_0,X1)
| unorthogonal_lines(esk2_0,X1)
| ~ convergent_lines(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_48,negated_conjecture,
~ convergent_lines(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_46]),c_0_43]) ).
cnf(c_0_49,plain,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO213+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jun 18 14:02:30 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected SinE mode:
% 0.22/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.22/2.58 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.22/2.58 # Version: 2.1pre011
% 8.22/2.58 # Preprocessing time : 0.010 s
% 8.22/2.58
% 8.22/2.58 # Proof found!
% 8.22/2.58 # SZS status Theorem
% 8.22/2.58 # SZS output start CNFRefutation
% See solution above
% 8.22/2.58 # Proof object total steps : 25
% 8.22/2.58 # Proof object clause steps : 17
% 8.22/2.58 # Proof object formula steps : 8
% 8.22/2.58 # Proof object conjectures : 12
% 8.22/2.58 # Proof object clause conjectures : 9
% 8.22/2.58 # Proof object formula conjectures : 3
% 8.22/2.58 # Proof object initial clauses used : 8
% 8.22/2.58 # Proof object initial formulas used : 8
% 8.22/2.58 # Proof object generating inferences : 9
% 8.22/2.58 # Proof object simplifying inferences : 3
% 8.22/2.58 # Training examples: 0 positive, 0 negative
% 8.22/2.58 # Parsed axioms : 28
% 8.22/2.58 # Removed by relevancy pruning/SinE : 0
% 8.22/2.58 # Initial clauses : 28
% 8.22/2.58 # Removed in clause preprocessing : 0
% 8.22/2.58 # Initial clauses in saturation : 28
% 8.22/2.58 # Processed clauses : 51
% 8.22/2.58 # ...of these trivial : 0
% 8.22/2.58 # ...subsumed : 4
% 8.22/2.58 # ...remaining for further processing : 47
% 8.22/2.58 # Other redundant clauses eliminated : 0
% 8.22/2.58 # Clauses deleted for lack of memory : 0
% 8.22/2.58 # Backward-subsumed : 0
% 8.22/2.58 # Backward-rewritten : 0
% 8.22/2.58 # Generated clauses : 72
% 8.22/2.58 # ...of the previous two non-trivial : 58
% 8.22/2.58 # Contextual simplify-reflections : 2
% 8.22/2.58 # Paramodulations : 70
% 8.22/2.58 # Factorizations : 2
% 8.22/2.58 # Equation resolutions : 0
% 8.22/2.58 # Propositional unsat checks : 0
% 8.22/2.58 # Propositional unsat check successes : 0
% 8.22/2.58 # Current number of processed clauses : 47
% 8.22/2.58 # Positive orientable unit clauses : 6
% 8.22/2.58 # Positive unorientable unit clauses: 0
% 8.22/2.58 # Negative unit clauses : 11
% 8.22/2.58 # Non-unit-clauses : 30
% 8.22/2.58 # Current number of unprocessed clauses: 33
% 8.22/2.58 # ...number of literals in the above : 128
% 8.22/2.58 # Current number of archived formulas : 0
% 8.22/2.58 # Current number of archived clauses : 0
% 8.22/2.58 # Clause-clause subsumption calls (NU) : 87
% 8.22/2.58 # Rec. Clause-clause subsumption calls : 64
% 8.22/2.58 # Non-unit clause-clause subsumptions : 4
% 8.22/2.58 # Unit Clause-clause subsumption calls : 49
% 8.22/2.58 # Rewrite failures with RHS unbound : 0
% 8.22/2.58 # BW rewrite match attempts : 0
% 8.22/2.58 # BW rewrite match successes : 0
% 8.22/2.58 # Condensation attempts : 0
% 8.22/2.58 # Condensation successes : 0
% 8.22/2.58 # Termbank termtop insertions : 1326
% 8.22/2.58
% 8.22/2.58 # -------------------------------------------------
% 8.22/2.58 # User time : 0.007 s
% 8.22/2.58 # System time : 0.004 s
% 8.22/2.58 # Total time : 0.011 s
% 8.22/2.58 # ...preprocessing : 0.010 s
% 8.22/2.58 # ...main loop : 0.001 s
% 8.22/2.58 # Maximum resident set size: 7132 pages
% 8.22/2.58
%------------------------------------------------------------------------------