↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN943+1 : TPTP v9.2.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n023.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  : 300s
% DateTime : Tue May  5 05:51:07 PM UTC 2026

% Result   : Theorem 1.22s 1.71s
% Output   : CNFRefutation 1.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (   4 unt;   0 def)
%            Number of atoms       :   64 (   0 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :   65 (  16   ~;  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   :   22 (   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/sandbox/benchmark/theBenchmark.p',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,
    ! [X14,X15,X16,X17,X18] :
      ( p(esk1_0)
      & e(esk1_0)
      & ( ~ e(X14)
        | g(X14)
        | s(X14,f(X14)) )
      & ( ~ e(X15)
        | g(X15)
        | c(f(X15)) )
      & ( ~ s(esk1_0,X18)
        | p(X18) )
      & ( ~ p(X16)
        | ~ g(X16) )
      & ( ~ p(X17)
        | ~ c(X17) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).

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

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

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

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

cnf(c_0_7,negated_conjecture,
    ( c(f(esk1_0))
    | g(esk1_0) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

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

cnf(c_0_9,negated_conjecture,
    ( s(esk1_0,f(esk1_0))
    | g(esk1_0) ),
    inference(spm,[status(thm)],[c_0_5,c_0_4]) ).

cnf(c_0_10,negated_conjecture,
    ( g(esk1_0)
    | ~ p(f(esk1_0)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

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

cnf(c_0_12,negated_conjecture,
    g(esk1_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SYN943+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.11  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32  % Computer : n023.cluster.edu
% 0.14/0.32  % Model    : x86_64 x86_64
% 0.14/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32  % Memory   : 8042.1875MB
% 0.14/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32  % CPULimit   : 300
% 0.14/0.32  % WCLimit    : 300
% 0.14/0.32  % DateTime   : Tue May  5 08:51:08 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 1.22/1.71  % Version  : CSE_E---1.7
% 1.22/1.71  % Problem  : theBenchmark.p
% 1.22/1.71  % SZS status Theorem for theBenchmark.p
% 1.22/1.71  % SZS output start CNFRefutation
% See solution above
% 1.22/1.71  % Total time : 1.370s
%------------------------------------------------------------------------------