TSTP Solution File: GEO217+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : GEO217+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n021.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:32 EDT 2022

% Result   : Theorem 7.55s 2.31s
% Output   : CNFRefutation 7.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   16 (  10 unt;   6 nHn;  10 RR)
%            Number of literals    :   25 (   0 equ;   8 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   13 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
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-qb1xq6gr/input.p',i_0_6) ).

cnf(i_0_15,negated_conjecture,
    convergent_lines(esk2_0,esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qb1xq6gr/input.p',i_0_15) ).

cnf(i_0_3,plain,
    ~ convergent_lines(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qb1xq6gr/input.p',i_0_3) ).

cnf(i_0_17,negated_conjecture,
    ~ convergent_lines(esk1_0,esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qb1xq6gr/input.p',i_0_17) ).

cnf(i_0_16,negated_conjecture,
    ~ convergent_lines(esk1_0,esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qb1xq6gr/input.p',i_0_16) ).

cnf(c_0_23,plain,
    ( convergent_lines(X1,X2)
    | convergent_lines(X3,X2)
    | ~ convergent_lines(X3,X1) ),
    i_0_6 ).

cnf(c_0_24,negated_conjecture,
    convergent_lines(esk2_0,esk3_0),
    i_0_15 ).

cnf(c_0_25,negated_conjecture,
    ( convergent_lines(esk2_0,X1)
    | convergent_lines(esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_26,plain,
    ~ convergent_lines(X1,X1),
    i_0_3 ).

cnf(c_0_27,plain,
    ( convergent_lines(esk3_0,X1)
    | convergent_lines(esk2_0,X2)
    | convergent_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_23,c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    ~ convergent_lines(esk1_0,esk2_0),
    i_0_17 ).

cnf(c_0_29,plain,
    ( convergent_lines(X1,esk2_0)
    | convergent_lines(esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    convergent_lines(esk3_0,esk1_0),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_31,negated_conjecture,
    ~ convergent_lines(esk1_0,esk3_0),
    i_0_16 ).

cnf(c_0_32,plain,
    ( convergent_lines(esk3_0,X1)
    | convergent_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_30]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GEO217+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n021.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Fri Jun 17 19:04:17 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.44  # ENIGMATIC: Selected SinE mode:
% 0.20/0.45  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.55/2.31  # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.55/2.31  # Version: 2.1pre011
% 7.55/2.31  # Preprocessing time       : 0.009 s
% 7.55/2.31  
% 7.55/2.31  # Proof found!
% 7.55/2.31  # SZS status Theorem
% 7.55/2.31  # SZS output start CNFRefutation
% See solution above
% 7.55/2.31  # Proof object total steps             : 16
% 7.55/2.31  # Proof object clause steps            : 11
% 7.55/2.31  # Proof object formula steps           : 5
% 7.55/2.31  # Proof object conjectures             : 9
% 7.55/2.31  # Proof object clause conjectures      : 6
% 7.55/2.31  # Proof object formula conjectures     : 3
% 7.55/2.31  # Proof object initial clauses used    : 5
% 7.55/2.31  # Proof object initial formulas used   : 5
% 7.55/2.31  # Proof object generating inferences   : 6
% 7.55/2.31  # Proof object simplifying inferences  : 1
% 7.55/2.31  # Training examples: 0 positive, 0 negative
% 7.55/2.31  # Parsed axioms                        : 23
% 7.55/2.31  # Removed by relevancy pruning/SinE    : 0
% 7.55/2.31  # Initial clauses                      : 23
% 7.55/2.31  # Removed in clause preprocessing      : 0
% 7.55/2.31  # Initial clauses in saturation        : 23
% 7.55/2.31  # Processed clauses                    : 43
% 7.55/2.31  # ...of these trivial                  : 0
% 7.55/2.31  # ...subsumed                          : 5
% 7.55/2.31  # ...remaining for further processing  : 38
% 7.55/2.31  # Other redundant clauses eliminated   : 0
% 7.55/2.31  # Clauses deleted for lack of memory   : 0
% 7.55/2.31  # Backward-subsumed                    : 0
% 7.55/2.31  # Backward-rewritten                   : 0
% 7.55/2.31  # Generated clauses                    : 107
% 7.55/2.31  # ...of the previous two non-trivial   : 86
% 7.55/2.31  # Contextual simplify-reflections      : 1
% 7.55/2.31  # Paramodulations                      : 95
% 7.55/2.31  # Factorizations                       : 12
% 7.55/2.31  # Equation resolutions                 : 0
% 7.55/2.31  # Propositional unsat checks           : 0
% 7.55/2.31  # Propositional unsat check successes  : 0
% 7.55/2.31  # Current number of processed clauses  : 38
% 7.55/2.31  #    Positive orientable unit clauses  : 3
% 7.55/2.31  #    Positive unorientable unit clauses: 0
% 7.55/2.31  #    Negative unit clauses             : 5
% 7.55/2.31  #    Non-unit-clauses                  : 30
% 7.55/2.31  # Current number of unprocessed clauses: 63
% 7.55/2.31  # ...number of literals in the above   : 266
% 7.55/2.31  # Current number of archived formulas  : 0
% 7.55/2.31  # Current number of archived clauses   : 0
% 7.55/2.31  # Clause-clause subsumption calls (NU) : 111
% 7.55/2.31  # Rec. Clause-clause subsumption calls : 81
% 7.55/2.31  # Non-unit clause-clause subsumptions  : 6
% 7.55/2.31  # Unit Clause-clause subsumption calls : 23
% 7.55/2.31  # Rewrite failures with RHS unbound    : 0
% 7.55/2.31  # BW rewrite match attempts            : 0
% 7.55/2.31  # BW rewrite match successes           : 0
% 7.55/2.31  # Condensation attempts                : 0
% 7.55/2.31  # Condensation successes               : 0
% 7.55/2.31  # Termbank termtop insertions          : 1574
% 7.55/2.31  
% 7.55/2.31  # -------------------------------------------------
% 7.55/2.31  # User time                : 0.007 s
% 7.55/2.31  # System time              : 0.003 s
% 7.55/2.31  # Total time               : 0.010 s
% 7.55/2.31  # ...preprocessing         : 0.009 s
% 7.55/2.31  # ...main loop             : 0.002 s
% 7.55/2.31  # Maximum resident set size: 7136 pages
% 7.55/2.31  
%------------------------------------------------------------------------------