↑ Up

CSE_E---1.7.SAT-Sat.s

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

% Result   : Satisfiable 1.24s 1.71s
% Output   : Saturation 1.24s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
    ! [X1] :
      ( xsd_string(X1)
    <=> ~ xsd_integer(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).

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

fof(axiom_2,axiom,
    ! [X1] :
      ( ~ ( cD(X1)
          & cC(X1) )
      & ~ ( cD(X1)
          & cE(X1) )
      & ~ ( cD(X1)
          & cA(X1) )
      & ~ ( cD(X1)
          & cB(X1) )
      & ~ ( cC(X1)
          & cE(X1) )
      & ~ ( cC(X1)
          & cA(X1) )
      & ~ ( cC(X1)
          & cB(X1) )
      & ~ ( cE(X1)
          & cA(X1) )
      & ~ ( cE(X1)
          & cB(X1) )
      & ~ ( cA(X1)
          & cB(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(c_0_3,plain,
    ! [X1] :
      ( xsd_string(X1)
    <=> ~ xsd_integer(X1) ),
    inference(fof_simplification,[status(thm)],[axiom_1]) ).

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

fof(c_0_5,plain,
    ! [X7] :
      ( ( ~ cD(X7)
        | ~ cC(X7) )
      & ( ~ cD(X7)
        | ~ cE(X7) )
      & ( ~ cD(X7)
        | ~ cA(X7) )
      & ( ~ cD(X7)
        | ~ cB(X7) )
      & ( ~ cC(X7)
        | ~ cE(X7) )
      & ( ~ cC(X7)
        | ~ cA(X7) )
      & ( ~ cC(X7)
        | ~ cB(X7) )
      & ( ~ cE(X7)
        | ~ cA(X7) )
      & ( ~ cE(X7)
        | ~ cB(X7) )
      & ( ~ cA(X7)
        | ~ cB(X7) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])]) ).

fof(c_0_6,plain,
    ! [X6] :
      ( ( ~ xsd_string(X6)
        | ~ xsd_integer(X6) )
      & ( xsd_integer(X6)
        | xsd_string(X6) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).

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

cnf(c_0_8,plain,
    ( ~ cA(X1)
    | ~ cB(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]),
    [final] ).

cnf(c_0_9,plain,
    ( ~ cE(X1)
    | ~ cB(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]),
    [final] ).

cnf(c_0_10,plain,
    ( ~ cE(X1)
    | ~ cA(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]),
    [final] ).

cnf(c_0_11,plain,
    ( ~ cC(X1)
    | ~ cB(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]),
    [final] ).

cnf(c_0_12,plain,
    ( ~ cC(X1)
    | ~ cA(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]),
    [final] ).

cnf(c_0_13,plain,
    ( ~ cC(X1)
    | ~ cE(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]),
    [final] ).

cnf(c_0_14,plain,
    ( ~ cD(X1)
    | ~ cB(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]),
    [final] ).

cnf(c_0_15,plain,
    ( ~ cD(X1)
    | ~ cA(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]),
    [final] ).

cnf(c_0_16,plain,
    ( xsd_integer(X1)
    | xsd_string(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]),
    [final] ).

cnf(c_0_17,plain,
    ( ~ cD(X1)
    | ~ cE(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]),
    [final] ).

cnf(c_0_18,plain,
    ( ~ cD(X1)
    | ~ cC(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]),
    [final] ).

cnf(c_0_19,plain,
    ( ~ xsd_string(X1)
    | ~ xsd_integer(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]),
    [final] ).

cnf(c_0_20,plain,
    ~ cowlNothing(X1),
    inference(split_conjunct,[status(thm)],[c_0_7]),
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : KRS053+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.13/0.32  % Computer : n004.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit   : 300
% 0.13/0.32  % WCLimit    : 300
% 0.13/0.32  % DateTime   : Mon May  4 20:36:32 EDT 2026
% 0.13/0.32  % CPUTime    : 
% 0.13/0.33  % start to proof: theBenchmark
% 1.24/1.71  % Version  : CSE_E---1.7
% 1.24/1.71  % Problem  : theBenchmark.p
% 1.24/1.71  % SZS status Satisfiable for theBenchmark.p
% 1.24/1.71  % SZS output start Saturation
% See solution above
% 1.24/1.71  % Total time : 1.370s
%------------------------------------------------------------------------------