↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.22s 1.72s
% Output   : CNFRefutation 1.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   4 unt;   0 def)
%            Number of atoms       :   49 (  11 equ)
%            Maximal formula atoms :   25 (   4 avg)
%            Number of connectives :   63 (  25   ~;  26   |;  10   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   20 (   1 sgn   9   !;   2   ?)

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

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

fof(c_0_2,plain,
    ! [X57,X60,X61,X62,X63,X64] :
      ( ( rr(X57,esk1_1(X57))
        | ~ cUnsatisfiable(X57) )
      & ( rr(X57,esk2_1(X57))
        | ~ cUnsatisfiable(X57) )
      & ( esk1_1(X57) != esk2_1(X57)
        | ~ cUnsatisfiable(X57) )
      & ( ~ rr(X57,X60)
        | ~ rr(X57,X61)
        | X60 = X61
        | ~ cUnsatisfiable(X57) )
      & ( rr(X62,esk3_1(X62))
        | ~ rr(X62,X63)
        | ~ rr(X62,X64)
        | X63 = X64
        | cUnsatisfiable(X62) )
      & ( rr(X62,esk4_1(X62))
        | ~ rr(X62,X63)
        | ~ rr(X62,X64)
        | X63 = X64
        | cUnsatisfiable(X62) )
      & ( esk3_1(X62) != esk4_1(X62)
        | ~ rr(X62,X63)
        | ~ rr(X62,X64)
        | X63 = X64
        | cUnsatisfiable(X62) ) ),
    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_3,plain,
    ( X2 = X3
    | ~ rr(X1,X2)
    | ~ rr(X1,X3)
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,plain,
    ( rr(X1,esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,plain,
    ( X1 = esk2_1(X2)
    | ~ rr(X2,X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

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

cnf(c_0_7,plain,
    ( esk1_1(X1) != esk2_1(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,plain,
    cUnsatisfiable(i2003_11_14_17_20_14253),
    inference(split_conjunct,[status(thm)],[axiom_4]) ).

cnf(c_0_9,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).

cnf(c_0_10,plain,
    $false,
    inference(sr,[status(thm)],[c_0_8,c_0_9]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : KRS095+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.12  % 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.16/0.33  % Computer : n019.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:48:29 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 1.22/1.72  % Version  : CSE_E---1.7
% 1.22/1.72  % Problem  : theBenchmark.p
% 1.22/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.22/1.72  % SZS output start CNFRefutation
% See solution above
% 1.22/1.72  % Total time : 1.374s
%------------------------------------------------------------------------------