↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : KRS124+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 : n007.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 04:36:24 PM UTC 2026

% Result   : Unsatisfiable 1.25s 1.71s
% Output   : CNFRefutation 1.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   24 (   5 unt;   0 def)
%            Number of atoms       :   70 (   0 equ)
%            Maximal formula atoms :   15 (   2 avg)
%            Number of connectives :   80 (  34   ~;  29   |;  11   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   34 (   3 sgn  18   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_6,axiom,
    ! [X1] :
      ( cd(X1)
    <=> ~ ? [X2] : ra_Px1(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).

fof(axiom_7,axiom,
    ! [X1] :
      ( cdxcomp(X1)
    <=> ? [X3] : ra_Px1(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).

fof(axiom_3,axiom,
    ! [X1] :
      ( cc(X1)
     => cdxcomp(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

fof(axiom_12,axiom,
    ! [X1] :
      ( ca_Ax3(X1)
    <=> ( cd(X1)
        & cc(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).

fof(axiom_2,axiom,
    ! [X1] :
      ( cUnsatisfiable(X1)
    <=> ( ? [X2] :
            ( rr(X1,X2)
            & cowlThing(X2) )
        & ! [X2] :
            ( rr(X1,X2)
           => ca_Ax3(X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(axiom_13,axiom,
    cUnsatisfiable(i2003_11_14_17_22_10903),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).

fof(c_0_6,plain,
    ! [X34,X35,X36] :
      ( ( ~ cd(X34)
        | ~ ra_Px1(X34,X35) )
      & ( ra_Px1(X36,esk3_1(X36))
        | cd(X36) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])])])]) ).

fof(c_0_7,plain,
    ! [X38,X40,X41] :
      ( ( ~ cdxcomp(X38)
        | ra_Px1(X38,esk4_1(X38)) )
      & ( ~ ra_Px1(X40,X41)
        | cdxcomp(X40) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])])])]) ).

cnf(c_0_8,plain,
    ( ~ cd(X1)
    | ~ ra_Px1(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,plain,
    ( ra_Px1(X1,esk4_1(X1))
    | ~ cdxcomp(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_10,plain,
    ! [X31] :
      ( ~ cc(X31)
      | cdxcomp(X31) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).

cnf(c_0_11,plain,
    ( ~ cd(X1)
    | ~ cdxcomp(X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,plain,
    ( cdxcomp(X1)
    | ~ cc(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_13,plain,
    ! [X52] :
      ( ( cd(X52)
        | ~ ca_Ax3(X52) )
      & ( cc(X52)
        | ~ ca_Ax3(X52) )
      & ( ~ cd(X52)
        | ~ cc(X52)
        | ca_Ax3(X52) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_12])])]) ).

fof(c_0_14,plain,
    ! [X25,X27,X28,X29] :
      ( ( rr(X25,esk1_1(X25))
        | ~ cUnsatisfiable(X25) )
      & ( cowlThing(esk1_1(X25))
        | ~ cUnsatisfiable(X25) )
      & ( ~ rr(X25,X27)
        | ca_Ax3(X27)
        | ~ cUnsatisfiable(X25) )
      & ( rr(X28,esk2_1(X28))
        | ~ rr(X28,X29)
        | ~ cowlThing(X29)
        | cUnsatisfiable(X28) )
      & ( ~ ca_Ax3(esk2_1(X28))
        | ~ rr(X28,X29)
        | ~ cowlThing(X29)
        | cUnsatisfiable(X28) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])])]) ).

cnf(c_0_15,plain,
    ( ~ cd(X1)
    | ~ cc(X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    ( cc(X1)
    | ~ ca_Ax3(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,plain,
    ( cd(X1)
    | ~ ca_Ax3(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_18,plain,
    ( ca_Ax3(X2)
    | ~ rr(X1,X2)
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_19,plain,
    ( rr(X1,esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,plain,
    ~ ca_Ax3(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

cnf(c_0_21,plain,
    cUnsatisfiable(i2003_11_14_17_22_10903),
    inference(split_conjunct,[status(thm)],[axiom_13]) ).

cnf(c_0_22,plain,
    ~ cUnsatisfiable(X1),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

cnf(c_0_23,plain,
    $false,
    inference(sr,[status(thm)],[c_0_21,c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : KRS124+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.12  % 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.15/0.33  % Computer : n007.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Mon May  4 20:37:09 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.25/1.71  % Version  : CSE_E---1.7
% 1.25/1.71  % Problem  : theBenchmark.p
% 1.25/1.71  % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.71  % SZS output start CNFRefutation
% See solution above
% 1.25/1.71  % Total time : 1.368s
%------------------------------------------------------------------------------