TSTP Solution File: GEO228+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : GEO228+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n020.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 04:04:55 EDT 2022

% Result   : Theorem 0.17s 1.35s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   4 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   49 (  23   ~;  18   |;   5   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   16 (   2 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X2,X3] :
      ( ~ convergent_lines(X2,X3)
    <=> ( ~ unequally_directed_lines(X2,X3)
        | ~ unequally_directed_lines(X2,reverse_line(X3)) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).

fof(con_def,axiom,
    ! [X2,X3] :
      ( convergent_lines(X2,X3)
    <=> ( unequally_directed_lines(X2,X3)
        & unequally_directed_lines(X2,reverse_line(X3)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',con_def) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X2,X3] :
        ( ~ convergent_lines(X2,X3)
      <=> ( ~ unequally_directed_lines(X2,X3)
          | ~ unequally_directed_lines(X2,reverse_line(X3)) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_3,plain,
    ! [X4,X5,X4,X5] :
      ( ( unequally_directed_lines(X4,X5)
        | ~ convergent_lines(X4,X5) )
      & ( unequally_directed_lines(X4,reverse_line(X5))
        | ~ convergent_lines(X4,X5) )
      & ( ~ unequally_directed_lines(X4,X5)
        | ~ unequally_directed_lines(X4,reverse_line(X5))
        | convergent_lines(X4,X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con_def])])])])]) ).

fof(c_0_4,negated_conjecture,
    ( ( unequally_directed_lines(esk1_0,esk2_0)
      | convergent_lines(esk1_0,esk2_0) )
    & ( unequally_directed_lines(esk1_0,reverse_line(esk2_0))
      | convergent_lines(esk1_0,esk2_0) )
    & ( ~ convergent_lines(esk1_0,esk2_0)
      | ~ unequally_directed_lines(esk1_0,esk2_0)
      | ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0)) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])])])])]) ).

cnf(c_0_5,plain,
    ( unequally_directed_lines(X1,X2)
    | ~ convergent_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    ( convergent_lines(esk1_0,esk2_0)
    | unequally_directed_lines(esk1_0,esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0))
    | ~ unequally_directed_lines(esk1_0,esk2_0)
    | ~ convergent_lines(esk1_0,esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    unequally_directed_lines(esk1_0,esk2_0),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,plain,
    ( unequally_directed_lines(X1,reverse_line(X2))
    | ~ convergent_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_10,negated_conjecture,
    ~ convergent_lines(esk1_0,esk2_0),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),c_0_9]) ).

cnf(c_0_11,plain,
    ( convergent_lines(X1,X2)
    | ~ unequally_directed_lines(X1,reverse_line(X2))
    | ~ unequally_directed_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_12,negated_conjecture,
    ( convergent_lines(esk1_0,esk2_0)
    | unequally_directed_lines(esk1_0,reverse_line(esk2_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_13,negated_conjecture,
    ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_8])]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_12,c_0_10]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09  % Problem  : GEO228+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.07/0.09  % Command  : run_ET %s %d
% 0.08/0.29  % Computer : n020.cluster.edu
% 0.08/0.29  % Model    : x86_64 x86_64
% 0.08/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29  % Memory   : 8042.1875MB
% 0.08/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29  % CPULimit : 300
% 0.08/0.29  % WCLimit  : 600
% 0.08/0.29  % DateTime : Sat Jun 18 08:38:04 EDT 2022
% 0.08/0.29  % CPUTime  : 
% 0.17/1.35  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.17/1.35  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.17/1.35  # Preprocessing time       : 0.014 s
% 0.17/1.35  
% 0.17/1.35  # Proof found!
% 0.17/1.35  # SZS status Theorem
% 0.17/1.35  # SZS output start CNFRefutation
% See solution above
% 0.17/1.35  # Proof object total steps             : 15
% 0.17/1.35  # Proof object clause steps            : 10
% 0.17/1.35  # Proof object formula steps           : 5
% 0.17/1.35  # Proof object conjectures             : 10
% 0.17/1.35  # Proof object clause conjectures      : 7
% 0.17/1.35  # Proof object formula conjectures     : 3
% 0.17/1.35  # Proof object initial clauses used    : 6
% 0.17/1.35  # Proof object initial formulas used   : 2
% 0.17/1.35  # Proof object generating inferences   : 2
% 0.17/1.35  # Proof object simplifying inferences  : 7
% 0.17/1.35  # Training examples: 0 positive, 0 negative
% 0.17/1.35  # Parsed axioms                        : 32
% 0.17/1.35  # Removed by relevancy pruning/SinE    : 27
% 0.17/1.35  # Initial clauses                      : 12
% 0.17/1.35  # Removed in clause preprocessing      : 0
% 0.17/1.35  # Initial clauses in saturation        : 12
% 0.17/1.35  # Processed clauses                    : 17
% 0.17/1.35  # ...of these trivial                  : 1
% 0.17/1.35  # ...subsumed                          : 2
% 0.17/1.35  # ...remaining for further processing  : 13
% 0.17/1.35  # Other redundant clauses eliminated   : 0
% 0.17/1.35  # Clauses deleted for lack of memory   : 0
% 0.17/1.35  # Backward-subsumed                    : 0
% 0.17/1.35  # Backward-rewritten                   : 2
% 0.17/1.35  # Generated clauses                    : 12
% 0.17/1.35  # ...of the previous two non-trivial   : 9
% 0.17/1.35  # Contextual simplify-reflections      : 3
% 0.17/1.35  # Paramodulations                      : 11
% 0.17/1.35  # Factorizations                       : 0
% 0.17/1.35  # Equation resolutions                 : 0
% 0.17/1.35  # Current number of processed clauses  : 10
% 0.17/1.35  #    Positive orientable unit clauses  : 1
% 0.17/1.35  #    Positive unorientable unit clauses: 0
% 0.17/1.35  #    Negative unit clauses             : 3
% 0.17/1.35  #    Non-unit-clauses                  : 6
% 0.17/1.35  # Current number of unprocessed clauses: 1
% 0.17/1.35  # ...number of literals in the above   : 2
% 0.17/1.35  # Current number of archived formulas  : 0
% 0.17/1.35  # Current number of archived clauses   : 3
% 0.17/1.35  # Clause-clause subsumption calls (NU) : 16
% 0.17/1.35  # Rec. Clause-clause subsumption calls : 16
% 0.17/1.35  # Non-unit clause-clause subsumptions  : 5
% 0.17/1.35  # Unit Clause-clause subsumption calls : 3
% 0.17/1.35  # Rewrite failures with RHS unbound    : 0
% 0.17/1.35  # BW rewrite match attempts            : 1
% 0.17/1.35  # BW rewrite match successes           : 1
% 0.17/1.35  # Condensation attempts                : 0
% 0.17/1.35  # Condensation successes               : 0
% 0.17/1.35  # Termbank termtop insertions          : 1167
% 0.17/1.35  
% 0.17/1.35  # -------------------------------------------------
% 0.17/1.35  # User time                : 0.012 s
% 0.17/1.35  # System time              : 0.003 s
% 0.17/1.35  # Total time               : 0.015 s
% 0.17/1.35  # Maximum resident set size: 2716 pages
%------------------------------------------------------------------------------