↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : GEO126+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n005.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:03:46 EDT 2022

% Result   : Theorem 0.24s 1.41s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   38 (  15 unt;   0 def)
%            Number of atoms       :  123 (  12 equ)
%            Maximal formula atoms :   27 (   3 avg)
%            Number of connectives :  135 (  50   ~;  52   |;  26   &)
%                                         (   5 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   1 con; 0-2 aty)
%            Number of variables   :   74 (   9 sgn  41   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(theorem_4_11,conjecture,
    ! [X9] :
    ? [X3,X5] :
      ( ordered_by(X9,X3,X5)
      & X3 != X5 ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',theorem_4_11) ).

fof(start_point_defn,axiom,
    ! [X3,X9] :
      ( start_point(X3,X9)
    <=> ( incident_o(X3,X9)
        & ! [X5] :
            ( ( X3 != X5
              & incident_o(X5,X9) )
           => ordered_by(X9,X3,X5) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',start_point_defn) ).

fof(o4,axiom,
    ! [X9] :
    ? [X3] : start_point(X3,X9),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',o4) ).

fof(inner_point_defn,axiom,
    ! [X3,X1] :
      ( inner_point(X3,X1)
    <=> ( incident_c(X3,X1)
        & ~ end_point(X3,X1) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',inner_point_defn) ).

fof(c3,axiom,
    ! [X1] :
    ? [X3] : inner_point(X3,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',c3) ).

fof(end_point_defn,axiom,
    ! [X3,X1] :
      ( end_point(X3,X1)
    <=> ( incident_c(X3,X1)
        & ! [X2,X4] :
            ( ( part_of(X2,X1)
              & part_of(X4,X1)
              & incident_c(X3,X2)
              & incident_c(X3,X4) )
           => ( part_of(X2,X4)
              | part_of(X4,X2) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',end_point_defn) ).

fof(open_defn,axiom,
    ! [X1] :
      ( open(X1)
    <=> ? [X3] : end_point(X3,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',open_defn) ).

fof(o2,axiom,
    ! [X9] :
    ? [X1] :
      ( open(X1)
      & ! [X3] :
          ( incident_o(X3,X9)
        <=> incident_c(X3,X1) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',o2) ).

fof(c_0_8,negated_conjecture,
    ~ ! [X9] :
      ? [X3,X5] :
        ( ordered_by(X9,X3,X5)
        & X3 != X5 ),
    inference(assume_negation,[status(cth)],[theorem_4_11]) ).

fof(c_0_9,plain,
    ! [X10,X11,X12,X10,X11] :
      ( ( incident_o(X10,X11)
        | ~ start_point(X10,X11) )
      & ( X10 = X12
        | ~ incident_o(X12,X11)
        | ordered_by(X11,X10,X12)
        | ~ start_point(X10,X11) )
      & ( X10 != esk15_2(X10,X11)
        | ~ incident_o(X10,X11)
        | start_point(X10,X11) )
      & ( incident_o(esk15_2(X10,X11),X11)
        | ~ incident_o(X10,X11)
        | start_point(X10,X11) )
      & ( ~ ordered_by(X11,X10,esk15_2(X10,X11))
        | ~ incident_o(X10,X11)
        | start_point(X10,X11) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[start_point_defn])])])])])])]) ).

fof(c_0_10,plain,
    ! [X10] : start_point(esk20_1(X10),X10),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[o4])]) ).

fof(c_0_11,plain,
    ! [X4,X5,X4,X5] :
      ( ( incident_c(X4,X5)
        | ~ inner_point(X4,X5) )
      & ( ~ end_point(X4,X5)
        | ~ inner_point(X4,X5) )
      & ( ~ incident_c(X4,X5)
        | end_point(X4,X5)
        | inner_point(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)],[inference(fof_simplification,[status(thm)],[inner_point_defn])])])])])]) ).

fof(c_0_12,plain,
    ! [X4] : inner_point(esk8_1(X4),X4),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c3])]) ).

fof(c_0_13,plain,
    ! [X5,X6,X7,X8,X5,X6] :
      ( ( incident_c(X5,X6)
        | ~ end_point(X5,X6) )
      & ( ~ part_of(X7,X6)
        | ~ part_of(X8,X6)
        | ~ incident_c(X5,X7)
        | ~ incident_c(X5,X8)
        | part_of(X7,X8)
        | part_of(X8,X7)
        | ~ end_point(X5,X6) )
      & ( part_of(esk3_2(X5,X6),X6)
        | ~ incident_c(X5,X6)
        | end_point(X5,X6) )
      & ( part_of(esk4_2(X5,X6),X6)
        | ~ incident_c(X5,X6)
        | end_point(X5,X6) )
      & ( incident_c(X5,esk3_2(X5,X6))
        | ~ incident_c(X5,X6)
        | end_point(X5,X6) )
      & ( incident_c(X5,esk4_2(X5,X6))
        | ~ incident_c(X5,X6)
        | end_point(X5,X6) )
      & ( ~ part_of(esk3_2(X5,X6),esk4_2(X5,X6))
        | ~ incident_c(X5,X6)
        | end_point(X5,X6) )
      & ( ~ part_of(esk4_2(X5,X6),esk3_2(X5,X6))
        | ~ incident_c(X5,X6)
        | end_point(X5,X6) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[end_point_defn])])])])])])]) ).

fof(c_0_14,plain,
    ! [X4,X4,X6] :
      ( ( ~ open(X4)
        | end_point(esk7_1(X4),X4) )
      & ( ~ end_point(X6,X4)
        | open(X4) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[open_defn])])])])])]) ).

fof(c_0_15,negated_conjecture,
    ! [X11,X12] :
      ( ~ ordered_by(esk25_0,X11,X12)
      | X11 = X12 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).

cnf(c_0_16,plain,
    ( ordered_by(X2,X1,X3)
    | X1 = X3
    | ~ start_point(X1,X2)
    | ~ incident_o(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_17,plain,
    start_point(esk20_1(X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_18,plain,
    ! [X10,X12,X12] :
      ( open(esk17_1(X10))
      & ( ~ incident_o(X12,X10)
        | incident_c(X12,esk17_1(X10)) )
      & ( ~ incident_c(X12,esk17_1(X10))
        | incident_o(X12,X10) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[o2])])])])])]) ).

cnf(c_0_19,plain,
    ( incident_c(X1,X2)
    | ~ inner_point(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_20,plain,
    inner_point(esk8_1(X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_21,plain,
    ( incident_c(X1,X2)
    | ~ end_point(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_22,plain,
    ( end_point(esk7_1(X1),X1)
    | ~ open(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_23,negated_conjecture,
    ( X1 = X2
    | ~ ordered_by(esk25_0,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_24,plain,
    ( esk20_1(X1) = X2
    | ordered_by(X1,esk20_1(X1),X2)
    | ~ incident_o(X2,X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_25,plain,
    ( incident_o(X1,X2)
    | ~ incident_c(X1,esk17_1(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_26,plain,
    incident_c(esk8_1(X1),X1),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_27,plain,
    ( incident_c(esk7_1(X1),X1)
    | ~ open(X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_28,plain,
    open(esk17_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_29,plain,
    ( ~ inner_point(X1,X2)
    | ~ end_point(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_30,negated_conjecture,
    ( esk20_1(esk25_0) = X1
    | ~ incident_o(X1,esk25_0) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_31,plain,
    incident_o(esk8_1(esk17_1(X1)),X1),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_32,plain,
    incident_o(esk7_1(esk17_1(X1)),X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_27]),c_0_28])]) ).

cnf(c_0_33,plain,
    ~ end_point(esk8_1(X1),X1),
    inference(spm,[status(thm)],[c_0_29,c_0_20]) ).

cnf(c_0_34,negated_conjecture,
    esk8_1(esk17_1(esk25_0)) = esk20_1(esk25_0),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,negated_conjecture,
    esk7_1(esk17_1(esk25_0)) = esk20_1(esk25_0),
    inference(spm,[status(thm)],[c_0_30,c_0_32]) ).

cnf(c_0_36,negated_conjecture,
    ~ end_point(esk20_1(esk25_0),esk17_1(esk25_0)),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_37,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_35]),c_0_28])]),c_0_36]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GEO126+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n005.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jun 18 04:14:08 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.24/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41  # Preprocessing time       : 0.015 s
% 0.24/1.41  
% 0.24/1.41  # Failure: Out of unprocessed clauses!
% 0.24/1.41  # OLD status GaveUp
% 0.24/1.41  # Parsed axioms                        : 28
% 0.24/1.41  # Removed by relevancy pruning/SinE    : 25
% 0.24/1.41  # Initial clauses                      : 5
% 0.24/1.41  # Removed in clause preprocessing      : 0
% 0.24/1.41  # Initial clauses in saturation        : 5
% 0.24/1.41  # Processed clauses                    : 16
% 0.24/1.41  # ...of these trivial                  : 0
% 0.24/1.41  # ...subsumed                          : 1
% 0.24/1.41  # ...remaining for further processing  : 15
% 0.24/1.41  # Other redundant clauses eliminated   : 0
% 0.24/1.41  # Clauses deleted for lack of memory   : 0
% 0.24/1.41  # Backward-subsumed                    : 0
% 0.24/1.41  # Backward-rewritten                   : 0
% 0.24/1.41  # Generated clauses                    : 14
% 0.24/1.41  # ...of the previous two non-trivial   : 11
% 0.24/1.41  # Contextual simplify-reflections      : 1
% 0.24/1.41  # Paramodulations                      : 12
% 0.24/1.41  # Factorizations                       : 2
% 0.24/1.41  # Equation resolutions                 : 0
% 0.24/1.41  # Current number of processed clauses  : 15
% 0.24/1.41  #    Positive orientable unit clauses  : 0
% 0.24/1.41  #    Positive unorientable unit clauses: 0
% 0.24/1.41  #    Negative unit clauses             : 0
% 0.24/1.41  #    Non-unit-clauses                  : 15
% 0.24/1.41  # Current number of unprocessed clauses: 0
% 0.24/1.41  # ...number of literals in the above   : 0
% 0.24/1.41  # Current number of archived formulas  : 0
% 0.24/1.41  # Current number of archived clauses   : 0
% 0.24/1.41  # Clause-clause subsumption calls (NU) : 37
% 0.24/1.41  # Rec. Clause-clause subsumption calls : 15
% 0.24/1.41  # Non-unit clause-clause subsumptions  : 2
% 0.24/1.41  # Unit Clause-clause subsumption calls : 0
% 0.24/1.41  # Rewrite failures with RHS unbound    : 0
% 0.24/1.41  # BW rewrite match attempts            : 0
% 0.24/1.41  # BW rewrite match successes           : 0
% 0.24/1.41  # Condensation attempts                : 0
% 0.24/1.41  # Condensation successes               : 0
% 0.24/1.41  # Termbank termtop insertions          : 989
% 0.24/1.41  
% 0.24/1.41  # -------------------------------------------------
% 0.24/1.41  # User time                : 0.013 s
% 0.24/1.41  # System time              : 0.003 s
% 0.24/1.41  # Total time               : 0.016 s
% 0.24/1.41  # Maximum resident set size: 2708 pages
% 0.24/1.41  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.41  # Preprocessing time       : 0.020 s
% 0.24/1.41  
% 0.24/1.41  # Proof found!
% 0.24/1.41  # SZS status Theorem
% 0.24/1.41  # SZS output start CNFRefutation
% See solution above
% 0.24/1.41  # Proof object total steps             : 38
% 0.24/1.41  # Proof object clause steps            : 21
% 0.24/1.41  # Proof object formula steps           : 17
% 0.24/1.41  # Proof object conjectures             : 9
% 0.24/1.41  # Proof object clause conjectures      : 6
% 0.24/1.41  # Proof object formula conjectures     : 3
% 0.24/1.41  # Proof object initial clauses used    : 10
% 0.24/1.41  # Proof object initial formulas used   : 8
% 0.24/1.41  # Proof object generating inferences   : 11
% 0.24/1.41  # Proof object simplifying inferences  : 5
% 0.24/1.41  # Training examples: 0 positive, 0 negative
% 0.24/1.41  # Parsed axioms                        : 28
% 0.24/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.24/1.41  # Initial clauses                      : 86
% 0.24/1.41  # Removed in clause preprocessing      : 0
% 0.24/1.41  # Initial clauses in saturation        : 86
% 0.24/1.41  # Processed clauses                    : 325
% 0.24/1.41  # ...of these trivial                  : 0
% 0.24/1.41  # ...subsumed                          : 57
% 0.24/1.41  # ...remaining for further processing  : 268
% 0.24/1.41  # Other redundant clauses eliminated   : 4
% 0.24/1.41  # Clauses deleted for lack of memory   : 0
% 0.24/1.41  # Backward-subsumed                    : 0
% 0.24/1.41  # Backward-rewritten                   : 0
% 0.24/1.41  # Generated clauses                    : 808
% 0.24/1.41  # ...of the previous two non-trivial   : 751
% 0.24/1.41  # Contextual simplify-reflections      : 6
% 0.24/1.41  # Paramodulations                      : 752
% 0.24/1.41  # Factorizations                       : 10
% 0.24/1.41  # Equation resolutions                 : 46
% 0.24/1.41  # Current number of processed clauses  : 267
% 0.24/1.41  #    Positive orientable unit clauses  : 10
% 0.24/1.41  #    Positive unorientable unit clauses: 0
% 0.24/1.41  #    Negative unit clauses             : 8
% 0.24/1.41  #    Non-unit-clauses                  : 249
% 0.24/1.41  # Current number of unprocessed clauses: 512
% 0.24/1.41  # ...number of literals in the above   : 2158
% 0.24/1.41  # Current number of archived formulas  : 0
% 0.24/1.41  # Current number of archived clauses   : 0
% 0.24/1.41  # Clause-clause subsumption calls (NU) : 10744
% 0.24/1.41  # Rec. Clause-clause subsumption calls : 6174
% 0.24/1.41  # Non-unit clause-clause subsumptions  : 61
% 0.24/1.41  # Unit Clause-clause subsumption calls : 626
% 0.24/1.41  # Rewrite failures with RHS unbound    : 0
% 0.24/1.41  # BW rewrite match attempts            : 17
% 0.24/1.41  # BW rewrite match successes           : 0
% 0.24/1.41  # Condensation attempts                : 0
% 0.24/1.41  # Condensation successes               : 0
% 0.24/1.41  # Termbank termtop insertions          : 16209
% 0.24/1.41  
% 0.24/1.41  # -------------------------------------------------
% 0.24/1.41  # User time                : 0.039 s
% 0.24/1.41  # System time              : 0.011 s
% 0.24/1.41  # Total time               : 0.050 s
% 0.24/1.41  # Maximum resident set size: 3904 pages
%------------------------------------------------------------------------------