↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Computer : n024.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:17 PM UTC 2026

% Result   : Unsatisfiable 1.12s 1.61s
% Output   : CNFRefutation 1.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   37 (   4 unt;   0 def)
%            Number of atoms       :  124 (  13 equ)
%            Maximal formula atoms :   27 (   3 avg)
%            Number of connectives :  147 (  60   ~;  58   |;  20   &)
%                                         (   3 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   77 (   1 sgn  34   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_4,axiom,
    ! [X4,X5,X6] :
      ( ( rf1(X4,X5)
        & rf1(X4,X6) )
     => X5 = X6 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).

fof(axiom_10,axiom,
    ! [X4,X5] :
      ( rs(X4,X5)
     => rf1(X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_10) ).

fof(axiom_2,axiom,
    ! [X4] :
      ( cUnsatisfiable(X4)
    <=> ( ? [X5] :
            ( rf(X4,X5)
            & cp(X5) )
        & ? [X5] :
            ( rf1(X4,X5)
            & ~ cp(X5)
            & ! [X6] :
                ( rinvF1(X5,X6)
               => ? [X7] :
                    ( rs(X6,X7)
                    & cowlThing(X7) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(axiom_6,axiom,
    ! [X4,X5] :
      ( rinvF1(X4,X5)
    <=> rf1(X5,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).

fof(axiom_3,axiom,
    ! [X4,X5,X6] :
      ( ( rf(X4,X5)
        & rf(X4,X6) )
     => X5 = X6 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

fof(axiom_11,axiom,
    ! [X4,X5] :
      ( rs(X4,X5)
     => rf(X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_11) ).

fof(axiom_9,axiom,
    cUnsatisfiable(i2003_11_14_17_19_06193),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_9) ).

fof(c_0_7,plain,
    ! [X145,X146,X147] :
      ( ~ rf1(X145,X146)
      | ~ rf1(X145,X147)
      | X146 = X147 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])]) ).

fof(c_0_8,plain,
    ! [X157,X158] :
      ( ~ rs(X157,X158)
      | rf1(X157,X158) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_10])]) ).

fof(c_0_9,plain,
    ! [X4] :
      ( cUnsatisfiable(X4)
    <=> ( ? [X5] :
            ( rf(X4,X5)
            & cp(X5) )
        & ? [X5] :
            ( rf1(X4,X5)
            & ~ cp(X5)
            & ! [X6] :
                ( rinvF1(X5,X6)
               => ? [X7] :
                    ( rs(X6,X7)
                    & cowlThing(X7) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[axiom_2]) ).

cnf(c_0_10,plain,
    ( X2 = X3
    | ~ rf1(X1,X2)
    | ~ rf1(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( rf1(X1,X2)
    | ~ rs(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_12,plain,
    ! [X132,X135,X137,X138,X139,X141] :
      ( ( rf(X132,esk1_1(X132))
        | ~ cUnsatisfiable(X132) )
      & ( cp(esk1_1(X132))
        | ~ cUnsatisfiable(X132) )
      & ( rf1(X132,esk2_1(X132))
        | ~ cUnsatisfiable(X132) )
      & ( ~ cp(esk2_1(X132))
        | ~ cUnsatisfiable(X132) )
      & ( rs(X135,esk3_2(X132,X135))
        | ~ rinvF1(esk2_1(X132),X135)
        | ~ cUnsatisfiable(X132) )
      & ( cowlThing(esk3_2(X132,X135))
        | ~ rinvF1(esk2_1(X132),X135)
        | ~ cUnsatisfiable(X132) )
      & ( rinvF1(X139,esk4_2(X137,X139))
        | ~ rf1(X137,X139)
        | cp(X139)
        | ~ rf(X137,X138)
        | ~ cp(X138)
        | cUnsatisfiable(X137) )
      & ( ~ rs(esk4_2(X137,X139),X141)
        | ~ cowlThing(X141)
        | ~ rf1(X137,X139)
        | cp(X139)
        | ~ rf(X137,X138)
        | ~ cp(X138)
        | cUnsatisfiable(X137) ) ),
    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)],[c_0_9])])])])])]) ).

cnf(c_0_13,plain,
    ( X1 = X2
    | ~ rs(X3,X2)
    | ~ rf1(X3,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,plain,
    ( rs(X1,esk3_2(X2,X1))
    | ~ rinvF1(esk2_1(X2),X1)
    | ~ cUnsatisfiable(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_15,plain,
    ! [X150,X151] :
      ( ( ~ rinvF1(X150,X151)
        | rf1(X151,X150) )
      & ( ~ rf1(X151,X150)
        | rinvF1(X150,X151) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).

cnf(c_0_16,plain,
    ( X1 = esk3_2(X2,X3)
    | ~ rinvF1(esk2_1(X2),X3)
    | ~ rf1(X3,X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,plain,
    ( rinvF1(X2,X1)
    | ~ rf1(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_18,plain,
    ( X1 = esk3_2(X2,X3)
    | ~ rf1(X3,esk2_1(X2))
    | ~ rf1(X3,X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_19,plain,
    ( rf1(X1,esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_20,plain,
    ( X1 = esk3_2(X2,X2)
    | ~ rf1(X2,X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_21,plain,
    ( esk3_2(X1,X1) = esk2_1(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_20,c_0_19]) ).

fof(c_0_22,plain,
    ! [X142,X143,X144] :
      ( ~ rf(X142,X143)
      | ~ rf(X142,X144)
      | X143 = X144 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).

fof(c_0_23,plain,
    ! [X159,X160] :
      ( ~ rs(X159,X160)
      | rf(X159,X160) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_11])]) ).

cnf(c_0_24,plain,
    ( rs(X1,esk2_1(X1))
    | ~ rinvF1(esk2_1(X1),X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_21]) ).

cnf(c_0_25,plain,
    ( X2 = X3
    | ~ rf(X1,X2)
    | ~ rf(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_26,plain,
    ( rf(X1,esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_27,plain,
    ( rf(X1,X2)
    | ~ rs(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_28,plain,
    ( rs(X1,esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_17]),c_0_19]) ).

cnf(c_0_29,plain,
    ( X1 = esk1_1(X2)
    | ~ rf(X2,X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    ( rf(X1,esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,plain,
    ( cp(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_32,plain,
    ( esk1_1(X1) = esk2_1(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,plain,
    ( ~ cp(esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_34,plain,
    cUnsatisfiable(i2003_11_14_17_19_06193),
    inference(split_conjunct,[status(thm)],[axiom_9]) ).

cnf(c_0_35,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).

cnf(c_0_36,plain,
    $false,
    inference(sr,[status(thm)],[c_0_34,c_0_35]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : KRS076+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.06  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.07/0.24  % Computer : n024.cluster.edu
% 0.07/0.24  % Model    : x86_64 x86_64
% 0.07/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.24  % Memory   : 8042.1875MB
% 0.07/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.24  % CPULimit   : 300
% 0.07/0.24  % WCLimit    : 300
% 0.07/0.24  % DateTime   : Mon May  4 15:36:11 EDT 2026
% 0.07/0.24  % CPUTime    : 
% 0.07/0.25  % start to proof: theBenchmark
% 1.12/1.61  % Version  : CSE_E---1.7
% 1.12/1.61  % Problem  : theBenchmark.p
% 1.12/1.61  % SZS status Unsatisfiable for theBenchmark.p
% 1.12/1.61  % SZS output start CNFRefutation
% See solution above
% 1.12/1.61  % Total time : 1.363s
%------------------------------------------------------------------------------