↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.28s 1.72s
% Output   : CNFRefutation 1.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   33 (   4 unt;   0 def)
%            Number of atoms       :  118 (   6 equ)
%            Maximal formula atoms :   35 (   3 avg)
%            Number of connectives :  146 (  61   ~;  58   |;  19   &)
%                                         (   5 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   1 con; 0-1 aty)
%            Number of variables   :   59 (   2 sgn  30   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_3,axiom,
    ! [X4] :
      ( cp(X4)
    <=> ~ ? [X7] : ra_Px1(X4,X7) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

fof(axiom_4,axiom,
    ! [X4] :
      ( cpxcomp(X4)
    <=> ? [X5] : ra_Px1(X4,X5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

fof(axiom_8,axiom,
    ! [X4,X7] :
      ( rs(X4,X7)
     => rr(X4,X7) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).

fof(axiom_2,axiom,
    ! [X4] :
      ( cUnsatisfiable(X4)
    <=> ( ! [X5,X6] :
            ( ( rr(X4,X5)
              & rr(X4,X6) )
           => X5 = X6 )
        & ? [X7] :
            ( rr(X4,X7)
            & ca_Vx2(X7) )
        & ? [X7] :
            ( rs(X4,X7)
            & cp(X7) )
        & cpxcomp(X4) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(axiom_6,axiom,
    ! [X4,X7] :
      ( rinvS(X4,X7)
    <=> rs(X7,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).

fof(axiom_5,axiom,
    ! [X4] :
      ( ca_Vx2(X4)
    <=> ! [X7] :
          ( rinvS(X4,X7)
         => cp(X7) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

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

fof(c_0_7,plain,
    ! [X117,X118,X119] :
      ( ( ~ cp(X117)
        | ~ ra_Px1(X117,X118) )
      & ( ra_Px1(X119,esk5_1(X119))
        | cp(X119) ) ),
    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_3])])])])]) ).

fof(c_0_8,plain,
    ! [X121,X123,X124] :
      ( ( ~ cpxcomp(X121)
        | ra_Px1(X121,esk6_1(X121)) )
      & ( ~ ra_Px1(X123,X124)
        | cpxcomp(X123) ) ),
    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_4])])])])]) ).

fof(c_0_9,plain,
    ! [X131,X132] :
      ( ~ rs(X131,X132)
      | rr(X131,X132) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_8])]) ).

fof(c_0_10,plain,
    ! [X107,X108,X109,X112,X115,X116] :
      ( ( ~ rr(X107,X108)
        | ~ rr(X107,X109)
        | X108 = X109
        | ~ cUnsatisfiable(X107) )
      & ( rr(X107,esk1_1(X107))
        | ~ cUnsatisfiable(X107) )
      & ( ca_Vx2(esk1_1(X107))
        | ~ cUnsatisfiable(X107) )
      & ( rs(X107,esk2_1(X107))
        | ~ cUnsatisfiable(X107) )
      & ( cp(esk2_1(X107))
        | ~ cUnsatisfiable(X107) )
      & ( cpxcomp(X107)
        | ~ cUnsatisfiable(X107) )
      & ( rr(X112,esk3_1(X112))
        | ~ rr(X112,X115)
        | ~ ca_Vx2(X115)
        | ~ rs(X112,X116)
        | ~ cp(X116)
        | ~ cpxcomp(X112)
        | cUnsatisfiable(X112) )
      & ( rr(X112,esk4_1(X112))
        | ~ rr(X112,X115)
        | ~ ca_Vx2(X115)
        | ~ rs(X112,X116)
        | ~ cp(X116)
        | ~ cpxcomp(X112)
        | cUnsatisfiable(X112) )
      & ( esk3_1(X112) != esk4_1(X112)
        | ~ rr(X112,X115)
        | ~ ca_Vx2(X115)
        | ~ rs(X112,X116)
        | ~ cp(X116)
        | ~ cpxcomp(X112)
        | cUnsatisfiable(X112) ) ),
    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])])])])])]) ).

fof(c_0_11,plain,
    ! [X129,X130] :
      ( ( ~ rinvS(X129,X130)
        | rs(X130,X129) )
      & ( ~ rs(X130,X129)
        | rinvS(X129,X130) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).

cnf(c_0_12,plain,
    ( ~ cp(X1)
    | ~ ra_Px1(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,plain,
    ( ra_Px1(X1,esk6_1(X1))
    | ~ cpxcomp(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    ( rr(X1,X2)
    | ~ rs(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    ( rs(X1,esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_16,plain,
    ! [X125,X126,X127] :
      ( ( ~ ca_Vx2(X125)
        | ~ rinvS(X125,X126)
        | cp(X126) )
      & ( rinvS(X127,esk7_1(X127))
        | ca_Vx2(X127) )
      & ( ~ cp(esk7_1(X127))
        | ca_Vx2(X127) ) ),
    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_5])])])])])]) ).

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

cnf(c_0_18,plain,
    ( ~ cpxcomp(X1)
    | ~ cp(X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,plain,
    ( cpxcomp(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_20,plain,
    ( X2 = X3
    | ~ rr(X1,X2)
    | ~ rr(X1,X3)
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_21,plain,
    ( rr(X1,esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_22,plain,
    ( cp(X2)
    | ~ ca_Vx2(X1)
    | ~ rinvS(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_23,plain,
    ( rinvS(esk2_1(X1),X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_15]) ).

cnf(c_0_24,plain,
    ( ~ cp(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

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

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

cnf(c_0_27,plain,
    ( ~ ca_Vx2(esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).

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

cnf(c_0_29,plain,
    ( ca_Vx2(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_30,plain,
    cUnsatisfiable(i2003_11_14_17_21_22376),
    inference(split_conjunct,[status(thm)],[axiom_7]) ).

cnf(c_0_31,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).

cnf(c_0_32,plain,
    $false,
    inference(sr,[status(thm)],[c_0_30,c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : KRS113+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.16/0.33  % Computer : n010.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Mon May  4 20:37:51 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.28/1.72  % Version  : CSE_E---1.7
% 1.28/1.72  % Problem  : theBenchmark.p
% 1.28/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.72  % SZS output start CNFRefutation
% See solution above
% 1.28/1.72  % Total time : 1.372s
%------------------------------------------------------------------------------