↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.26s 1.72s
% Output   : CNFRefutation 1.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (   5 unt;   0 def)
%            Number of atoms       :   77 (   6 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :   88 (  36   ~;  29   |;  18   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   44 (   2 sgn  20   !;   6   ?)

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

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

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

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

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

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

fof(c_0_6,plain,
    ! [X108,X109,X110] :
      ( ~ cowlThing(X108)
      | ~ rf(X108,X109)
      | ~ rf(X108,X110)
      | X109 = X110 ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).

fof(c_0_7,plain,
    ! [X98] :
      ( cowlThing(X98)
      & ~ cowlNothing(X98) ),
    inference(variable_rename,[status(thm)],[c_0_5]) ).

fof(c_0_8,plain,
    ! [X4] :
      ( cUnsatisfiable(X4)
    <=> ? [X5] :
          ( rf(X4,X5)
          & ? [X6] :
              ( rinvF(X5,X6)
              & ? [X7] :
                  ( rf(X6,X7)
                  & ~ cp1(X7) ) )
          & cp1(X5) ) ),
    inference(fof_simplification,[status(thm)],[axiom_2]) ).

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

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

fof(c_0_11,plain,
    ! [X100,X104,X105,X106,X107] :
      ( ( rf(X100,esk1_1(X100))
        | ~ cUnsatisfiable(X100) )
      & ( rinvF(esk1_1(X100),esk2_1(X100))
        | ~ cUnsatisfiable(X100) )
      & ( rf(esk2_1(X100),esk3_1(X100))
        | ~ cUnsatisfiable(X100) )
      & ( ~ cp1(esk3_1(X100))
        | ~ cUnsatisfiable(X100) )
      & ( cp1(esk1_1(X100))
        | ~ cUnsatisfiable(X100) )
      & ( ~ rf(X104,X105)
        | ~ rinvF(X105,X106)
        | ~ rf(X106,X107)
        | cp1(X107)
        | ~ cp1(X105)
        | cUnsatisfiable(X104) ) ),
    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_8])])])])])]) ).

fof(c_0_12,plain,
    ! [X111,X112] :
      ( ( ~ rinvF(X111,X112)
        | rf(X112,X111) )
      & ( ~ rf(X112,X111)
        | rinvF(X111,X112) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])]) ).

cnf(c_0_13,plain,
    ( X2 = X3
    | ~ rf(X1,X3)
    | ~ rf(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).

cnf(c_0_14,plain,
    ( rf(esk2_1(X1),esk3_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,plain,
    ( rf(X2,X1)
    | ~ rinvF(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,plain,
    ( rinvF(esk1_1(X1),esk2_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,plain,
    ( X1 = esk3_1(X2)
    | ~ rf(esk2_1(X2),X1)
    | ~ cUnsatisfiable(X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,plain,
    ( rf(esk2_1(X1),esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( ~ cp1(esk3_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_20,plain,
    ( esk3_1(X1) = esk1_1(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,plain,
    ( cp1(esk1_1(X1))
    | ~ cUnsatisfiable(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_22,plain,
    cUnsatisfiable(i2003_11_14_17_19_42328),
    inference(split_conjunct,[status(thm)],[axiom_7]) ).

cnf(c_0_23,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_24,plain,
    $false,
    inference(sr,[status(thm)],[c_0_22,c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : KRS086+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.15/0.33  % Computer : n029.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Mon May  4 20:36:59 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/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.372s
%------------------------------------------------------------------------------