↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : RNG126+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n017.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 : Mon Jul 18 20:27:01 EDT 2022

% Result   : Theorem 0.23s 1.41s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   30 (  11 unt;   0 def)
%            Number of atoms       :  175 (  43 equ)
%            Maximal formula atoms :   33 (   5 avg)
%            Number of connectives :  203 (  58   ~;  52   |;  75   &)
%                                         (   8 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   32 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :   22 (  22 usr;  11 con; 0-2 aty)
%            Number of variables   :   69 (   6 sgn  44   !;  19   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mDefDvs,axiom,
    ! [X1] :
      ( aElement0(X1)
     => ! [X2] :
          ( aDivisorOf0(X2,X1)
        <=> ( aElement0(X2)
            & doDivides0(X2,X1) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefDvs) ).

fof(m__2373,hypothesis,
    ( ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xu,X1) = xa )
    & doDivides0(xu,xa)
    & aDivisorOf0(xu,xa)
    & ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xu,X1) = xb )
    & doDivides0(xu,xb)
    & aDivisorOf0(xu,xb) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2373) ).

fof(m__,conjecture,
    ( ! [X1] :
        ( aElementOf0(X1,slsdtgt0(xa))
      <=> ? [X2] :
            ( aElement0(X2)
            & sdtasdt0(xa,X2) = X1 ) )
   => ( ! [X1] :
          ( aElementOf0(X1,slsdtgt0(xb))
        <=> ? [X2] :
              ( aElement0(X2)
              & sdtasdt0(xb,X2) = X1 ) )
     => ( ? [X1,X2] :
            ( aElementOf0(X1,slsdtgt0(xa))
            & aElementOf0(X2,slsdtgt0(xb))
            & sdtpldt0(X1,X2) = xc )
        | aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

fof(m__2744,hypothesis,
    ? [X1] :
      ( aElement0(X1)
      & sdtasdt0(xu,X1) = xc ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2744) ).

fof(mMulComm,axiom,
    ! [X1,X2] :
      ( ( aElement0(X1)
        & aElement0(X2) )
     => sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulComm) ).

fof(m__2091,hypothesis,
    ( aElement0(xa)
    & aElement0(xb) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2091) ).

fof(m__2174,hypothesis,
    ( aSet0(xI)
    & ! [X1] :
        ( aElementOf0(X1,xI)
       => ( ! [X2] :
              ( aElementOf0(X2,xI)
             => aElementOf0(sdtpldt0(X1,X2),xI) )
          & ! [X2] :
              ( aElement0(X2)
             => aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
    & aIdeal0(xI)
    & ! [X1] :
        ( aElementOf0(X1,slsdtgt0(xa))
      <=> ? [X2] :
            ( aElement0(X2)
            & sdtasdt0(xa,X2) = X1 ) )
    & ! [X1] :
        ( aElementOf0(X1,slsdtgt0(xb))
      <=> ? [X2] :
            ( aElement0(X2)
            & sdtasdt0(xb,X2) = X1 ) )
    & ! [X1] :
        ( aElementOf0(X1,xI)
      <=> ? [X2,X3] :
            ( aElementOf0(X2,slsdtgt0(xa))
            & aElementOf0(X3,slsdtgt0(xb))
            & sdtpldt0(X2,X3) = X1 ) )
    & xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2174) ).

fof(m__2273,hypothesis,
    ( ? [X1,X2] :
        ( aElementOf0(X1,slsdtgt0(xa))
        & aElementOf0(X2,slsdtgt0(xb))
        & sdtpldt0(X1,X2) = xu )
    & aElementOf0(xu,xI)
    & xu != sz00
    & ! [X1] :
        ( ( ( ? [X2,X3] :
                ( aElementOf0(X2,slsdtgt0(xa))
                & aElementOf0(X3,slsdtgt0(xb))
                & sdtpldt0(X2,X3) = X1 )
            | aElementOf0(X1,xI) )
          & X1 != sz00 )
       => ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2273) ).

fof(c_0_8,plain,
    ! [X3,X4,X4] :
      ( ( aElement0(X4)
        | ~ aDivisorOf0(X4,X3)
        | ~ aElement0(X3) )
      & ( doDivides0(X4,X3)
        | ~ aDivisorOf0(X4,X3)
        | ~ aElement0(X3) )
      & ( ~ aElement0(X4)
        | ~ doDivides0(X4,X3)
        | aDivisorOf0(X4,X3)
        | ~ aElement0(X3) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDvs])])])])])]) ).

fof(c_0_9,hypothesis,
    ( aElement0(esk19_0)
    & sdtasdt0(xu,esk19_0) = xa
    & doDivides0(xu,xa)
    & aDivisorOf0(xu,xa)
    & aElement0(esk20_0)
    & sdtasdt0(xu,esk20_0) = xb
    & doDivides0(xu,xb)
    & aDivisorOf0(xu,xb) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__2373])])])]) ).

fof(c_0_10,negated_conjecture,
    ~ ( ! [X1] :
          ( aElementOf0(X1,slsdtgt0(xa))
        <=> ? [X2] :
              ( aElement0(X2)
              & sdtasdt0(xa,X2) = X1 ) )
     => ( ! [X1] :
            ( aElementOf0(X1,slsdtgt0(xb))
          <=> ? [X2] :
                ( aElement0(X2)
                & sdtasdt0(xb,X2) = X1 ) )
       => ( ? [X1,X2] :
              ( aElementOf0(X1,slsdtgt0(xa))
              & aElementOf0(X2,slsdtgt0(xb))
              & sdtpldt0(X1,X2) = xc )
          | aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_11,hypothesis,
    ( aElement0(esk21_0)
    & sdtasdt0(xu,esk21_0) = xc ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2744])]) ).

fof(c_0_12,plain,
    ! [X3,X4] :
      ( ~ aElement0(X3)
      | ~ aElement0(X4)
      | sdtasdt0(X3,X4) = sdtasdt0(X4,X3) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).

cnf(c_0_13,plain,
    ( aElement0(X2)
    | ~ aElement0(X1)
    | ~ aDivisorOf0(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,hypothesis,
    aDivisorOf0(xu,xb),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,hypothesis,
    aElement0(xb),
    inference(split_conjunct,[status(thm)],[m__2091]) ).

fof(c_0_16,negated_conjecture,
    ! [X3,X3,X5,X6,X6,X8,X9,X10] :
      ( ( aElement0(esk22_1(X3))
        | ~ aElementOf0(X3,slsdtgt0(xa)) )
      & ( sdtasdt0(xa,esk22_1(X3)) = X3
        | ~ aElementOf0(X3,slsdtgt0(xa)) )
      & ( ~ aElement0(X5)
        | sdtasdt0(xa,X5) != X3
        | aElementOf0(X3,slsdtgt0(xa)) )
      & ( aElement0(esk23_1(X6))
        | ~ aElementOf0(X6,slsdtgt0(xb)) )
      & ( sdtasdt0(xb,esk23_1(X6)) = X6
        | ~ aElementOf0(X6,slsdtgt0(xb)) )
      & ( ~ aElement0(X8)
        | sdtasdt0(xb,X8) != X6
        | aElementOf0(X6,slsdtgt0(xb)) )
      & ( ~ aElementOf0(X9,slsdtgt0(xa))
        | ~ aElementOf0(X10,slsdtgt0(xb))
        | sdtpldt0(X9,X10) != xc )
      & ~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))) ),
    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)],[c_0_10])])])])])])]) ).

fof(c_0_17,hypothesis,
    ! [X4,X5,X6,X7,X7,X9,X10,X10,X12,X13,X13,X16,X17] :
      ( aSet0(xI)
      & ( ~ aElementOf0(X5,xI)
        | aElementOf0(sdtpldt0(X4,X5),xI)
        | ~ aElementOf0(X4,xI) )
      & ( ~ aElement0(X6)
        | aElementOf0(sdtasdt0(X6,X4),xI)
        | ~ aElementOf0(X4,xI) )
      & aIdeal0(xI)
      & ( aElement0(esk4_1(X7))
        | ~ aElementOf0(X7,slsdtgt0(xa)) )
      & ( sdtasdt0(xa,esk4_1(X7)) = X7
        | ~ aElementOf0(X7,slsdtgt0(xa)) )
      & ( ~ aElement0(X9)
        | sdtasdt0(xa,X9) != X7
        | aElementOf0(X7,slsdtgt0(xa)) )
      & ( aElement0(esk5_1(X10))
        | ~ aElementOf0(X10,slsdtgt0(xb)) )
      & ( sdtasdt0(xb,esk5_1(X10)) = X10
        | ~ aElementOf0(X10,slsdtgt0(xb)) )
      & ( ~ aElement0(X12)
        | sdtasdt0(xb,X12) != X10
        | aElementOf0(X10,slsdtgt0(xb)) )
      & ( aElementOf0(esk6_1(X13),slsdtgt0(xa))
        | ~ aElementOf0(X13,xI) )
      & ( aElementOf0(esk7_1(X13),slsdtgt0(xb))
        | ~ aElementOf0(X13,xI) )
      & ( sdtpldt0(esk6_1(X13),esk7_1(X13)) = X13
        | ~ aElementOf0(X13,xI) )
      & ( ~ aElementOf0(X16,slsdtgt0(xa))
        | ~ aElementOf0(X17,slsdtgt0(xb))
        | sdtpldt0(X16,X17) != X13
        | aElementOf0(X13,xI) )
      & xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
    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)],[m__2174])])])])])])]) ).

cnf(c_0_18,hypothesis,
    sdtasdt0(xu,esk21_0) = xc,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_19,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_20,hypothesis,
    aElement0(esk21_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_21,hypothesis,
    aElement0(xu),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

fof(c_0_22,hypothesis,
    ! [X6,X7,X8] :
      ( aElementOf0(esk17_0,slsdtgt0(xa))
      & aElementOf0(esk18_0,slsdtgt0(xb))
      & sdtpldt0(esk17_0,esk18_0) = xu
      & aElementOf0(xu,xI)
      & xu != sz00
      & ( ~ aElementOf0(X7,slsdtgt0(xa))
        | ~ aElementOf0(X8,slsdtgt0(xb))
        | sdtpldt0(X7,X8) != X6
        | X6 = sz00
        | ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) )
      & ( ~ aElementOf0(X6,xI)
        | X6 = sz00
        | ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) ) ),
    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)],[inference(fof_simplification,[status(thm)],[m__2273])])])])])])])]) ).

cnf(c_0_23,negated_conjecture,
    ~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_24,hypothesis,
    xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_25,hypothesis,
    ( aElementOf0(sdtasdt0(X2,X1),xI)
    | ~ aElementOf0(X1,xI)
    | ~ aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_26,hypothesis,
    sdtasdt0(esk21_0,xu) = xc,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21])]) ).

cnf(c_0_27,hypothesis,
    aElementOf0(xu,xI),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_28,negated_conjecture,
    ~ aElementOf0(xc,xI),
    inference(rw,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_20])]),c_0_28]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : RNG126+4 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n017.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon May 30 08:21:55 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.23/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41  # Preprocessing time       : 0.025 s
% 0.23/1.41  
% 0.23/1.41  # Proof found!
% 0.23/1.41  # SZS status Theorem
% 0.23/1.41  # SZS output start CNFRefutation
% See solution above
% 0.23/1.41  # Proof object total steps             : 30
% 0.23/1.41  # Proof object clause steps            : 14
% 0.23/1.41  # Proof object formula steps           : 16
% 0.23/1.41  # Proof object conjectures             : 5
% 0.23/1.41  # Proof object clause conjectures      : 2
% 0.23/1.41  # Proof object formula conjectures     : 3
% 0.23/1.41  # Proof object initial clauses used    : 10
% 0.23/1.41  # Proof object initial formulas used   : 8
% 0.23/1.41  # Proof object generating inferences   : 3
% 0.23/1.41  # Proof object simplifying inferences  : 11
% 0.23/1.41  # Training examples: 0 positive, 0 negative
% 0.23/1.41  # Parsed axioms                        : 48
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 11
% 0.23/1.41  # Initial clauses                      : 170
% 0.23/1.41  # Removed in clause preprocessing      : 4
% 0.23/1.41  # Initial clauses in saturation        : 166
% 0.23/1.41  # Processed clauses                    : 539
% 0.23/1.41  # ...of these trivial                  : 38
% 0.23/1.41  # ...subsumed                          : 155
% 0.23/1.41  # ...remaining for further processing  : 346
% 0.23/1.41  # Other redundant clauses eliminated   : 31
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 14
% 0.23/1.41  # Backward-rewritten                   : 85
% 0.23/1.41  # Generated clauses                    : 1888
% 0.23/1.41  # ...of the previous two non-trivial   : 1741
% 0.23/1.41  # Contextual simplify-reflections      : 60
% 0.23/1.41  # Paramodulations                      : 1838
% 0.23/1.41  # Factorizations                       : 3
% 0.23/1.41  # Equation resolutions                 : 45
% 0.23/1.41  # Current number of processed clauses  : 245
% 0.23/1.41  #    Positive orientable unit clauses  : 63
% 0.23/1.41  #    Positive unorientable unit clauses: 0
% 0.23/1.41  #    Negative unit clauses             : 18
% 0.23/1.41  #    Non-unit-clauses                  : 164
% 0.23/1.41  # Current number of unprocessed clauses: 803
% 0.23/1.41  # ...number of literals in the above   : 3555
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 101
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 9973
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 6271
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 154
% 0.23/1.41  # Unit Clause-clause subsumption calls : 1186
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 5
% 0.23/1.41  # BW rewrite match successes           : 5
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 32089
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.090 s
% 0.23/1.41  # System time              : 0.004 s
% 0.23/1.41  # Total time               : 0.094 s
% 0.23/1.41  # Maximum resident set size: 4888 pages
% 0.23/23.41  eprover: CPU time limit exceeded, terminating
% 0.23/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42  eprover: No such file or directory
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48  eprover: No such file or directory
%------------------------------------------------------------------------------