↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN949+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 : n012.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:08 PM UTC 2026

% Result   : Theorem 0.11s 1.51s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   6 unt;   0 def)
%            Number of atoms       :   43 (   0 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   40 (  11   ~;   8   |;  15   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   29 (   1 sgn  17   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ! [X1,X2,X3] :
      ( ( s(X1)
        & s(X2)
        & r(X2,X3)
        & ! [X4] :
            ( s(X4)
           => p(X4) )
        & ! [X4,X5] :
            ( r(X4,X5)
           => q(X4,X5) ) )
     => ? [X4,X5] :
          ( p(X4)
          & q(X4,X5) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(i_0_1,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ( s(X1)
          & s(X2)
          & r(X2,X3)
          & ! [X4] :
              ( s(X4)
             => p(X4) )
          & ! [X4,X5] :
              ( r(X4,X5)
             => q(X4,X5) ) )
       => ? [X4,X5] :
            ( p(X4)
            & q(X4,X5) ) ),
    inference(assume_negation,[status(cth)],[prove_this]) ).

fof(i_0_2,negated_conjecture,
    ! [X17,X18,X19,X20,X21] :
      ( s(esk1_0)
      & s(esk2_0)
      & r(esk2_0,esk3_0)
      & ( ~ s(X17)
        | p(X17) )
      & ( ~ r(X18,X19)
        | q(X18,X19) )
      & ( ~ p(X20)
        | ~ q(X20,X21) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_1])])])]) ).

cnf(i_0_3,negated_conjecture,
    ( q(X1,X2)
    | ~ r(X1,X2) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_4,negated_conjecture,
    ( ~ p(X1)
    | ~ q(X1,X2) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_5,negated_conjecture,
    ( p(X1)
    | ~ s(X1) ),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_6,negated_conjecture,
    r(esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_7,negated_conjecture,
    s(esk2_0),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_8,negated_conjecture,
    s(esk1_0),
    inference(split_conjunct,[status(thm)],[i_0_2]),
    [final] ).

cnf(i_0_9,plain,
    q(esk2_0,esk3_0),
    inference(scs_inference,[],[i_0_6,i_0_3]) ).

cnf(i_0_10,plain,
    ( ~ r(X1,X2)
    | q(X1,X2) ),
    inference(rename_variables,[],[i_0_3]) ).

cnf(i_0_11,plain,
    p(esk2_0),
    inference(scs_inference,[],[i_0_6,i_0_7,i_0_3,i_0_5]) ).

cnf(i_0_12,plain,
    ( ~ s(X1)
    | p(X1) ),
    inference(rename_variables,[],[i_0_5]) ).

cnf(i_0_13,plain,
    $false,
    inference(scs_inference,[],[i_0_6,i_0_7,i_0_3,i_0_5,i_0_4]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : SYN949+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.06  % 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.06/0.24  % Computer : n012.cluster.edu
% 0.06/0.24  % Model    : x86_64 x86_64
% 0.06/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24  % Memory   : 8042.1875MB
% 0.06/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24  % CPULimit   : 300
% 0.06/0.24  % WCLimit    : 300
% 0.06/0.24  % DateTime   : Tue May  5 08:50:31 EDT 2026
% 0.06/0.24  % CPUTime    : 
% 0.06/0.25  % start to proof: theBenchmark
% 0.11/1.51  % Version  : CSE_E---1.7
% 0.11/1.51  % Problem  : theBenchmark.p
% 0.11/1.51  % SZS status Theorem for theBenchmark.p
% 0.11/1.51  % SZS output start CNFRefutation
% See solution above
% 0.11/1.52  % Total time : 1.262s
%------------------------------------------------------------------------------