↑ Up

ET---2.0.THM-CRf.s

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

% Computer : n004.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 : Thu Jul 21 06:06:30 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ! [X1] :
    ? [X2,X3,X4,X5,X6] :
      ( ( p(X1)
        & e(X1)
        & ( e(X2)
         => ( g(X2)
            | s(X2,f(X2)) ) )
        & ( e(X3)
         => ( g(X3)
            | c(f(X3)) ) )
        & ( s(X1,X6)
         => p(X6) ) )
     => ( ( p(X4)
          & g(X4) )
        | ( p(X5)
          & c(X5) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_this) ).

fof(c_0_1,negated_conjecture,
    ~ ! [X1] :
      ? [X2,X3,X4,X5,X6] :
        ( ( p(X1)
          & e(X1)
          & ( e(X2)
           => ( g(X2)
              | s(X2,f(X2)) ) )
          & ( e(X3)
           => ( g(X3)
              | c(f(X3)) ) )
          & ( s(X1,X6)
           => p(X6) ) )
       => ( ( p(X4)
            & g(X4) )
          | ( p(X5)
            & c(X5) ) ) ),
    inference(assume_negation,[status(cth)],[prove_this]) ).

fof(c_0_2,negated_conjecture,
    ! [X8,X9,X12,X10,X11] :
      ( p(esk1_0)
      & e(esk1_0)
      & ( ~ e(X8)
        | g(X8)
        | s(X8,f(X8)) )
      & ( ~ e(X9)
        | g(X9)
        | c(f(X9)) )
      & ( ~ s(esk1_0,X12)
        | p(X12) )
      & ( ~ p(X10)
        | ~ g(X10) )
      & ( ~ p(X11)
        | ~ c(X11) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( ~ c(X1)
    | ~ p(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( c(f(X1))
    | g(X1)
    | ~ e(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( p(X1)
    | ~ s(esk1_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ( s(X1,f(X1))
    | g(X1)
    | ~ e(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    e(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    ( g(X1)
    | ~ e(X1)
    | ~ p(f(X1)) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_9,negated_conjecture,
    ( g(esk1_0)
    | p(f(esk1_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ g(X1)
    | ~ p(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_11,negated_conjecture,
    g(esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_7])]) ).

cnf(c_0_12,negated_conjecture,
    p(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN943+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n004.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 Jul 11 11:41:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.23/1.40  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40  # Preprocessing time       : 0.013 s
% 0.23/1.40  
% 0.23/1.40  # Proof found!
% 0.23/1.40  # SZS status Theorem
% 0.23/1.40  # SZS output start CNFRefutation
% See solution above
% 0.23/1.40  # Proof object total steps             : 14
% 0.23/1.40  # Proof object clause steps            : 11
% 0.23/1.40  # Proof object formula steps           : 3
% 0.23/1.40  # Proof object conjectures             : 14
% 0.23/1.40  # Proof object clause conjectures      : 11
% 0.23/1.40  # Proof object formula conjectures     : 3
% 0.23/1.40  # Proof object initial clauses used    : 7
% 0.23/1.40  # Proof object initial formulas used   : 1
% 0.23/1.40  # Proof object generating inferences   : 4
% 0.23/1.40  # Proof object simplifying inferences  : 6
% 0.23/1.40  # Training examples: 0 positive, 0 negative
% 0.23/1.40  # Parsed axioms                        : 1
% 0.23/1.40  # Removed by relevancy pruning/SinE    : 0
% 0.23/1.40  # Initial clauses                      : 7
% 0.23/1.40  # Removed in clause preprocessing      : 0
% 0.23/1.40  # Initial clauses in saturation        : 7
% 0.23/1.40  # Processed clauses                    : 10
% 0.23/1.40  # ...of these trivial                  : 0
% 0.23/1.40  # ...subsumed                          : 0
% 0.23/1.40  # ...remaining for further processing  : 10
% 0.23/1.40  # Other redundant clauses eliminated   : 0
% 0.23/1.40  # Clauses deleted for lack of memory   : 0
% 0.23/1.40  # Backward-subsumed                    : 0
% 0.23/1.40  # Backward-rewritten                   : 1
% 0.23/1.40  # Generated clauses                    : 4
% 0.23/1.40  # ...of the previous two non-trivial   : 3
% 0.23/1.40  # Contextual simplify-reflections      : 0
% 0.23/1.40  # Paramodulations                      : 4
% 0.23/1.40  # Factorizations                       : 0
% 0.23/1.40  # Equation resolutions                 : 0
% 0.23/1.40  # Current number of processed clauses  : 9
% 0.23/1.40  #    Positive orientable unit clauses  : 3
% 0.23/1.40  #    Positive unorientable unit clauses: 0
% 0.23/1.40  #    Negative unit clauses             : 0
% 0.23/1.40  #    Non-unit-clauses                  : 6
% 0.23/1.40  # Current number of unprocessed clauses: 0
% 0.23/1.40  # ...number of literals in the above   : 0
% 0.23/1.40  # Current number of archived formulas  : 0
% 0.23/1.40  # Current number of archived clauses   : 1
% 0.23/1.40  # Clause-clause subsumption calls (NU) : 1
% 0.23/1.40  # Rec. Clause-clause subsumption calls : 1
% 0.23/1.40  # Non-unit clause-clause subsumptions  : 0
% 0.23/1.40  # Unit Clause-clause subsumption calls : 0
% 0.23/1.40  # Rewrite failures with RHS unbound    : 0
% 0.23/1.40  # BW rewrite match attempts            : 1
% 0.23/1.40  # BW rewrite match successes           : 1
% 0.23/1.40  # Condensation attempts                : 0
% 0.23/1.40  # Condensation successes               : 0
% 0.23/1.40  # Termbank termtop insertions          : 525
% 0.23/1.40  
% 0.23/1.40  # -------------------------------------------------
% 0.23/1.40  # User time                : 0.013 s
% 0.23/1.40  # System time              : 0.001 s
% 0.23/1.40  # Total time               : 0.014 s
% 0.23/1.40  # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------