↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.11s 1.61s
% Output   : CNFRefutation 1.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   33 (   4 unt;   0 def)
%            Number of atoms       :  140 (   0 equ)
%            Maximal formula atoms :   29 (   4 avg)
%            Number of connectives :  175 (  68   ~;  62   |;  27   &)
%                                         (   5 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   1 con; 0-2 aty)
%            Number of variables   :   78 (   2 sgn  39   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_4,axiom,
    ! [X1] :
      ( cc(X1)
    <=> ! [X2] :
          ( rinvR(X1,X2)
         => ! [X3] :
              ( rinvP(X2,X3)
             => ! [X4] :
                  ( rinvS(X3,X4)
                 => ~ ca(X4) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).

fof(axiom_7,axiom,
    ! [X1,X2] :
      ( rinvS(X1,X2)
    <=> rs(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).

fof(axiom_2,axiom,
    ! [X1] :
      ( cUnsatisfiable(X1)
     => ? [X2] :
          ( rs(X1,X2)
          & ? [X3] :
              ( rp(X2,X3)
              & cowlThing(X3) )
          & ! [X3] :
              ( rr(X2,X3)
             => cc(X3) )
          & ! [X3] :
              ( rp(X2,X3)
             => ? [X4] :
                  ( rr(X3,X4)
                  & cowlThing(X4) ) )
          & ! [X3] :
              ( rp(X2,X3)
             => ? [X4] :
                  ( rp(X3,X4)
                  & cowlThing(X4) ) )
          & ! [X3] :
              ( rp(X2,X3)
             => ! [X4] :
                  ( rr(X3,X4)
                 => cc(X4) ) )
          & ? [X3] :
              ( rr(X2,X3)
              & cowlThing(X3) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(axiom_3,axiom,
    ! [X1] :
      ( cUnsatisfiable(X1)
     => ca(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

fof(axiom_5,axiom,
    ! [X1,X2] :
      ( rinvP(X1,X2)
    <=> rp(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).

fof(axiom_6,axiom,
    ! [X1,X2] :
      ( rinvR(X1,X2)
    <=> rr(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).

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

fof(c_0_7,plain,
    ! [X1] :
      ( cc(X1)
    <=> ! [X2] :
          ( rinvR(X1,X2)
         => ! [X3] :
              ( rinvP(X2,X3)
             => ! [X4] :
                  ( rinvS(X3,X4)
                 => ~ ca(X4) ) ) ) ),
    inference(fof_simplification,[status(thm)],[axiom_4]) ).

fof(c_0_8,plain,
    ! [X58,X59] :
      ( ( ~ rinvS(X58,X59)
        | rs(X59,X58) )
      & ( ~ rs(X59,X58)
        | rinvS(X58,X59) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])]) ).

fof(c_0_9,plain,
    ! [X34,X37,X38,X40,X42,X43] :
      ( ( rs(X34,esk1_1(X34))
        | ~ cUnsatisfiable(X34) )
      & ( rp(esk1_1(X34),esk2_1(X34))
        | ~ cUnsatisfiable(X34) )
      & ( cowlThing(esk2_1(X34))
        | ~ cUnsatisfiable(X34) )
      & ( ~ rr(esk1_1(X34),X37)
        | cc(X37)
        | ~ cUnsatisfiable(X34) )
      & ( rr(X38,esk3_2(X34,X38))
        | ~ rp(esk1_1(X34),X38)
        | ~ cUnsatisfiable(X34) )
      & ( cowlThing(esk3_2(X34,X38))
        | ~ rp(esk1_1(X34),X38)
        | ~ cUnsatisfiable(X34) )
      & ( rp(X40,esk4_2(X34,X40))
        | ~ rp(esk1_1(X34),X40)
        | ~ cUnsatisfiable(X34) )
      & ( cowlThing(esk4_2(X34,X40))
        | ~ rp(esk1_1(X34),X40)
        | ~ cUnsatisfiable(X34) )
      & ( ~ rp(esk1_1(X34),X42)
        | ~ rr(X42,X43)
        | cc(X43)
        | ~ cUnsatisfiable(X34) )
      & ( rr(esk1_1(X34),esk5_1(X34))
        | ~ cUnsatisfiable(X34) )
      & ( cowlThing(esk5_1(X34))
        | ~ cUnsatisfiable(X34) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])]) ).

fof(c_0_10,plain,
    ! [X46,X47,X48,X49,X50] :
      ( ( ~ cc(X46)
        | ~ rinvR(X46,X47)
        | ~ rinvP(X47,X48)
        | ~ rinvS(X48,X49)
        | ~ ca(X49) )
      & ( rinvR(X50,esk6_1(X50))
        | cc(X50) )
      & ( rinvP(esk6_1(X50),esk7_1(X50))
        | cc(X50) )
      & ( rinvS(esk7_1(X50),esk8_1(X50))
        | cc(X50) )
      & ( ca(esk8_1(X50))
        | cc(X50) ) ),
    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_7])])])])])]) ).

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

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

fof(c_0_13,plain,
    ! [X45] :
      ( ~ cUnsatisfiable(X45)
      | ca(X45) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])]) ).

cnf(c_0_14,plain,
    ( ~ cc(X1)
    | ~ rinvR(X1,X2)
    | ~ rinvP(X2,X3)
    | ~ rinvS(X3,X4)
    | ~ ca(X4) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,plain,
    ( rinvS(esk1_1(X1),X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

fof(c_0_17,plain,
    ! [X54,X55] :
      ( ( ~ rinvP(X54,X55)
        | rp(X55,X54) )
      & ( ~ rp(X55,X54)
        | rinvP(X54,X55) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])]) ).

cnf(c_0_18,plain,
    ( ~ rinvP(X1,esk1_1(X2))
    | ~ rinvR(X3,X1)
    | ~ cc(X3)
    | ~ cUnsatisfiable(X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).

cnf(c_0_19,plain,
    ( rinvP(X2,X1)
    | ~ rp(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_20,plain,
    ( ~ rinvR(X1,X2)
    | ~ cc(X1)
    | ~ rp(esk1_1(X3),X2)
    | ~ cUnsatisfiable(X3) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_21,plain,
    ( rp(esk1_1(X1),esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_22,plain,
    ! [X56,X57] :
      ( ( ~ rinvR(X56,X57)
        | rr(X57,X56) )
      & ( ~ rr(X57,X56)
        | rinvR(X56,X57) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).

cnf(c_0_23,plain,
    ( cc(X3)
    | ~ rp(esk1_1(X1),X2)
    | ~ rr(X2,X3)
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_24,plain,
    ( ~ rinvR(X1,esk2_1(X2))
    | ~ cc(X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,plain,
    ( rinvR(X2,X1)
    | ~ rr(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_26,plain,
    ( cc(X1)
    | ~ rr(esk2_1(X2),X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_23,c_0_21]) ).

cnf(c_0_27,plain,
    ( ~ rr(esk2_1(X1),X2)
    | ~ cUnsatisfiable(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).

cnf(c_0_28,plain,
    ( rr(X1,esk3_2(X2,X1))
    | ~ rp(esk1_1(X2),X1)
    | ~ cUnsatisfiable(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_29,plain,
    ( ~ rp(esk1_1(X1),esk2_1(X2))
    | ~ cUnsatisfiable(X2)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_30,plain,
    cUnsatisfiable(i2003_11_14_17_19_28752),
    inference(split_conjunct,[status(thm)],[axiom_9]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : KRS082+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.06/0.24  % Computer : n024.cluster.edu
% 0.06/0.24  % Model    : x86_64 x86_64
% 0.06/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24  % Memory   : 8042.1875MB
% 0.06/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24  % CPULimit   : 300
% 0.06/0.24  % WCLimit    : 300
% 0.06/0.24  % DateTime   : Mon May  4 15:36:56 EDT 2026
% 0.06/0.24  % CPUTime    : 
% 0.06/0.25  % start to proof: theBenchmark
% 1.11/1.61  % Version  : CSE_E---1.7
% 1.11/1.61  % Problem  : theBenchmark.p
% 1.11/1.61  % SZS status Unsatisfiable for theBenchmark.p
% 1.11/1.61  % SZS output start CNFRefutation
% See solution above
% 1.11/1.61  % Total time : 1.362s
%------------------------------------------------------------------------------