↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.26s 1.72s
% Output   : CNFRefutation 1.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   41 (   5 unt;   0 def)
%            Number of atoms       :  115 (  12 equ)
%            Maximal formula atoms :   19 (   2 avg)
%            Number of connectives :  132 (  58   ~;  49   |;  16   &)
%                                         (   1 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   69 (   2 sgn  32   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
    ! [X4] :
      ( cowlThing(X4)
      & ~ cowlNothing(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).

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

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

fof(axiom_2,axiom,
    ! [X4] :
      ( cUnsatisfiable(X4)
    <=> ( ? [X5] :
            ( rf2(X4,X5)
            & cp2(X5) )
        & ? [X5] :
            ( rf1(X4,X5)
            & cp1(X5) )
        & ? [X5] :
            ( rr(X4,X5)
            & cowlThing(X5) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(axiom_5,axiom,
    ! [X4] :
      ( cowlThing(X4)
     => ! [X6,X7] :
          ( ( rf2(X4,X6)
            & rf2(X4,X7) )
         => X6 = X7 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).

fof(axiom_3,axiom,
    ! [X4] :
      ( cp1(X4)
     => ~ cp2(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

fof(axiom_8,axiom,
    ! [X4,X5] :
      ( rr(X4,X5)
     => rf2(X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_8) ).

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

fof(c_0_8,plain,
    ! [X4] :
      ( cowlThing(X4)
      & ~ cowlNothing(X4) ),
    inference(fof_simplification,[status(thm)],[axiom_0]) ).

fof(c_0_9,plain,
    ! [X100,X101,X102] :
      ( ~ cowlThing(X100)
      | ~ rf1(X100,X101)
      | ~ rf1(X100,X102)
      | X101 = X102 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).

fof(c_0_10,plain,
    ! [X89] :
      ( cowlThing(X89)
      & ~ cowlNothing(X89) ),
    inference(variable_rename,[status(thm)],[c_0_8]) ).

fof(c_0_11,plain,
    ! [X106,X107] :
      ( ~ rr(X106,X107)
      | rf1(X106,X107) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])]) ).

fof(c_0_12,plain,
    ! [X91,X95,X96,X97,X98] :
      ( ( rf2(X91,esk1_1(X91))
        | ~ cUnsatisfiable(X91) )
      & ( cp2(esk1_1(X91))
        | ~ cUnsatisfiable(X91) )
      & ( rf1(X91,esk2_1(X91))
        | ~ cUnsatisfiable(X91) )
      & ( cp1(esk2_1(X91))
        | ~ cUnsatisfiable(X91) )
      & ( rr(X91,esk3_1(X91))
        | ~ cUnsatisfiable(X91) )
      & ( cowlThing(esk3_1(X91))
        | ~ cUnsatisfiable(X91) )
      & ( ~ rf2(X95,X96)
        | ~ cp2(X96)
        | ~ rf1(X95,X97)
        | ~ cp1(X97)
        | ~ rr(X95,X98)
        | ~ cowlThing(X98)
        | cUnsatisfiable(X95) ) ),
    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_13,plain,
    ! [X103,X104,X105] :
      ( ~ cowlThing(X103)
      | ~ rf2(X103,X104)
      | ~ rf2(X103,X105)
      | X104 = X105 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).

cnf(c_0_14,plain,
    ( X2 = X3
    | ~ cowlThing(X1)
    | ~ rf1(X1,X2)
    | ~ rf1(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    cowlThing(X1),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

cnf(c_0_17,plain,
    ( rr(X1,esk3_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_18,plain,
    ! [X4] :
      ( cp1(X4)
     => ~ cp2(X4) ),
    inference(fof_simplification,[status(thm)],[axiom_3]) ).

cnf(c_0_19,plain,
    ( X2 = X3
    | ~ cowlThing(X1)
    | ~ rf2(X1,X2)
    | ~ rf2(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_20,plain,
    ! [X108,X109] :
      ( ~ rr(X108,X109)
      | rf2(X108,X109) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_8])]) ).

cnf(c_0_21,plain,
    ( X2 = X3
    | ~ rf1(X1,X3)
    | ~ rf1(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).

cnf(c_0_22,plain,
    ( rf1(X1,esk3_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

fof(c_0_23,plain,
    ! [X99] :
      ( ~ cp1(X99)
      | ~ cp2(X99) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])]) ).

cnf(c_0_24,plain,
    ( X2 = X3
    | ~ rf2(X1,X3)
    | ~ rf2(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_15])]) ).

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

cnf(c_0_26,plain,
    ( rf2(X1,X2)
    | ~ rr(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_27,plain,
    ( X1 = esk3_1(X2)
    | ~ rf1(X2,X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

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

cnf(c_0_29,plain,
    ( ~ cp1(X1)
    | ~ cp2(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

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

cnf(c_0_31,plain,
    ( X1 = esk1_1(X2)
    | ~ rf2(X2,X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_32,plain,
    ( rf2(X1,esk3_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_17]) ).

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

cnf(c_0_34,plain,
    ( esk2_1(X1) = esk3_1(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_35,plain,
    ( ~ cp1(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_36,plain,
    ( esk1_1(X1) = esk3_1(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_37,plain,
    ( cp1(esk3_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_38,plain,
    cUnsatisfiable(i2003_11_14_17_19_17492),
    inference(split_conjunct,[status(thm)],[axiom_6]) ).

cnf(c_0_39,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).

cnf(c_0_40,plain,
    $false,
    inference(sr,[status(thm)],[c_0_38,c_0_39]),
    [proof] ).

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