↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : KRS135+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 08:47:21 AM UTC 2026

% Result   : Theorem 0.09s 0.39s
% Output   : Proof 0.09s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
    ! [X] :
      ( ~ cowlNothing(X)
      & cowlThing(X) ),
    file('theBenchmark.p',axiom_0) ).

fof(axiom_1,axiom,
    ! [X] :
      ( xsd_string(X)
    <=> ~ xsd_integer(X) ),
    file('theBenchmark.p',axiom_1) ).

fof(axiom_2,axiom,
    ! [X] :
      ( cowlThing(X)
     => ! [Y] :
          ( rprop(X,Y)
         => cA(Y) ) ),
    file('theBenchmark.p',axiom_2) ).

fof(the_axiom,conjecture,
    ( ! [X,Y] :
        ( rprop(X,Y)
       => cA(Y) )
    & ! [X] :
        ( xsd_string(X)
      <=> ~ xsd_integer(X) )
    & ! [X] :
        ( ~ cowlNothing(X)
        & cowlThing(X) ) ),
    file('theBenchmark.p',the_axiom) ).

fof(f_1_1,plain,
    ! [X] :
      ( ~ cowlNothing(X)
      & cowlThing(X) ),
    inference(fof_nnf,[status(thm)],[axiom_0]) ).

fof(f_1_2,plain,
    ! [U_0] :
      ( ~ cowlNothing(U_0)
      & cowlThing(U_0) ),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

fof(f_1_3,plain,
    ( ! [U_2] : ~ cowlNothing(U_2)
    & ! [U_1] : cowlThing(U_1) ),
    inference(miniscope,[status(thm)],[f_1_2]) ).

cnf(f_1_4,plain,
    cowlThing(U_1),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_5,plain,
    ~ cowlNothing(U_2),
    inference(clausify,[status(thm)],[f_1_3]) ).

fof(f_2_1,plain,
    ! [X] :
      ( ( xsd_string(X)
        | xsd_integer(X) )
      & ( ~ xsd_integer(X)
        | ~ xsd_string(X) ) ),
    inference(fof_nnf,[status(thm)],[axiom_1]) ).

fof(f_2_2,plain,
    ! [U_3] :
      ( ( xsd_string(U_3)
        | xsd_integer(U_3) )
      & ( ~ xsd_integer(U_3)
        | ~ xsd_string(U_3) ) ),
    inference(variable_rename,[status(thm)],[f_2_1]) ).

fof(f_2_3,plain,
    ( ! [U_5] :
        ( xsd_string(U_5)
        | xsd_integer(U_5) )
    & ! [U_4] :
        ( ~ xsd_integer(U_4)
        | ~ xsd_string(U_4) ) ),
    inference(miniscope,[status(thm)],[f_2_2]) ).

cnf(f_2_4,plain,
    ( ~ xsd_integer(U_4)
    | ~ xsd_string(U_4) ),
    inference(clausify,[status(thm)],[f_2_3]) ).

cnf(f_2_5,plain,
    ( xsd_string(U_5)
    | xsd_integer(U_5) ),
    inference(clausify,[status(thm)],[f_2_3]) ).

fof(f_3_1,plain,
    ! [X] :
      ( ! [Y] :
          ( cA(Y)
          | ~ rprop(X,Y) )
      | ~ cowlThing(X) ),
    inference(fof_nnf,[status(thm)],[axiom_2]) ).

fof(f_3_2,plain,
    ! [U_7] :
      ( ! [U_6] :
          ( cA(U_6)
          | ~ rprop(U_7,U_6) )
      | ~ cowlThing(U_7) ),
    inference(variable_rename,[status(thm)],[f_3_1]) ).

cnf(f_3_3,plain,
    ( cA(U_6)
    | ~ rprop(U_7,U_6)
    | ~ cowlThing(U_7) ),
    inference(clausify,[status(thm)],[f_3_2]) ).

fof(f_4_1,negated_conjecture,
    ~ ( ! [X,Y] :
          ( rprop(X,Y)
         => cA(Y) )
      & ! [X] :
          ( xsd_string(X)
        <=> ~ xsd_integer(X) )
      & ! [X] :
          ( ~ cowlNothing(X)
          & cowlThing(X) ) ),
    inference(negate,[status(cth)],[the_axiom]) ).

fof(f_4_2,negated_conjecture,
    ( ? [X,Y] :
        ( ~ cA(Y)
        & rprop(X,Y) )
    | ? [X] :
        ( ( ~ xsd_string(X)
          & ~ xsd_integer(X) )
        | ( xsd_integer(X)
          & xsd_string(X) ) )
    | ? [X] :
        ( cowlNothing(X)
        | ~ cowlThing(X) ) ),
    inference(fof_nnf,[status(thm)],[f_4_1]) ).

fof(f_4_3,negated_conjecture,
    ( ? [U_11,U_10] :
        ( ~ cA(U_10)
        & rprop(U_11,U_10) )
    | ? [U_9] :
        ( ( ~ xsd_string(U_9)
          & ~ xsd_integer(U_9) )
        | ( xsd_integer(U_9)
          & xsd_string(U_9) ) )
    | ? [U_8] :
        ( cowlNothing(U_8)
        | ~ cowlThing(U_8) ) ),
    inference(variable_rename,[status(thm)],[f_4_2]) ).

fof(f_4_4,negated_conjecture,
    ( ? [U_11,U_10] :
        ( ~ cA(U_10)
        & rprop(U_11,U_10) )
    | ? [U_15] :
        ( ~ xsd_string(U_15)
        & ~ xsd_integer(U_15) )
    | ? [U_14] :
        ( xsd_integer(U_14)
        & xsd_string(U_14) )
    | ? [U_13] : cowlNothing(U_13)
    | ? [U_12] : ~ cowlThing(U_12) ),
    inference(miniscope,[status(thm)],[f_4_3]) ).

fof(f_4_5,negated_conjecture,
    ( ? [U_11,U_10] :
        ( ~ cA(U_10)
        & rprop(U_11,U_10) )
    | ? [U_15] :
        ( ~ xsd_string(U_15)
        & ~ xsd_integer(U_15) )
    | ? [U_14] :
        ( xsd_integer(U_14)
        & xsd_string(U_14) )
    | ? [U_13] : cowlNothing(U_13)
    | ~ cowlThing(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_12,sK1)],[f_4_4]) ).

fof(f_4_6,negated_conjecture,
    ( ? [U_11,U_10] :
        ( ~ cA(U_10)
        & rprop(U_11,U_10) )
    | ? [U_15] :
        ( ~ xsd_string(U_15)
        & ~ xsd_integer(U_15) )
    | ? [U_14] :
        ( xsd_integer(U_14)
        & xsd_string(U_14) )
    | cowlNothing(sK2)
    | ~ cowlThing(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_13,sK2)],[f_4_5]) ).

fof(f_4_7,negated_conjecture,
    ( ? [U_11,U_10] :
        ( ~ cA(U_10)
        & rprop(U_11,U_10) )
    | ? [U_15] :
        ( ~ xsd_string(U_15)
        & ~ xsd_integer(U_15) )
    | ( xsd_integer(sK3)
      & xsd_string(sK3) )
    | cowlNothing(sK2)
    | ~ cowlThing(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_14,sK3)],[f_4_6]) ).

fof(f_4_8,negated_conjecture,
    ( ? [U_11,U_10] :
        ( ~ cA(U_10)
        & rprop(U_11,U_10) )
    | ( ~ xsd_string(sK4)
      & ~ xsd_integer(sK4) )
    | ( xsd_integer(sK3)
      & xsd_string(sK3) )
    | cowlNothing(sK2)
    | ~ cowlThing(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_15,sK4)],[f_4_7]) ).

fof(f_4_9,negated_conjecture,
    ( ? [U_10] :
        ( ~ cA(U_10)
        & rprop(sK5,U_10) )
    | ( ~ xsd_string(sK4)
      & ~ xsd_integer(sK4) )
    | ( xsd_integer(sK3)
      & xsd_string(sK3) )
    | cowlNothing(sK2)
    | ~ cowlThing(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_11,sK5)],[f_4_8]) ).

fof(f_4_10,negated_conjecture,
    ( ( ~ cA(sK6)
      & rprop(sK5,sK6) )
    | ( ~ xsd_string(sK4)
      & ~ xsd_integer(sK4) )
    | ( xsd_integer(sK3)
      & xsd_string(sK3) )
    | cowlNothing(sK2)
    | ~ cowlThing(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_10,sK6)],[f_4_9]) ).

fof(f_4_11,negated_conjecture,
    ( ( ~ cA(sK6)
      | ~ sP2 )
    & ( rprop(sK5,sK6)
      | ~ sP2 )
    & ( ~ xsd_string(sK4)
      | ~ sP1 )
    & ( ~ xsd_integer(sK4)
      | ~ sP1 )
    & ( xsd_integer(sK3)
      | ~ sP0 )
    & ( xsd_string(sK3)
      | ~ sP0 )
    & ( sP2
      | sP1
      | sP0
      | cowlNothing(sK2)
      | ~ cowlThing(sK1) ) ),
    inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1,sP2])],[f_4_10]) ).

cnf(f_4_12,negated_conjecture,
    ( sP2
    | sP1
    | sP0
    | cowlNothing(sK2)
    | ~ cowlThing(sK1) ),
    inference(clausify,[status(thm)],[f_4_11]) ).

cnf(f_4_13,negated_conjecture,
    ( xsd_string(sK3)
    | ~ sP0 ),
    inference(clausify,[status(thm)],[f_4_11]) ).

cnf(f_4_14,negated_conjecture,
    ( xsd_integer(sK3)
    | ~ sP0 ),
    inference(clausify,[status(thm)],[f_4_11]) ).

cnf(f_4_15,negated_conjecture,
    ( ~ xsd_integer(sK4)
    | ~ sP1 ),
    inference(clausify,[status(thm)],[f_4_11]) ).

cnf(f_4_16,negated_conjecture,
    ( ~ xsd_string(sK4)
    | ~ sP1 ),
    inference(clausify,[status(thm)],[f_4_11]) ).

cnf(f_4_17,negated_conjecture,
    ( rprop(sK5,sK6)
    | ~ sP2 ),
    inference(clausify,[status(thm)],[f_4_11]) ).

cnf(f_4_18,negated_conjecture,
    ( ~ cA(sK6)
    | ~ sP2 ),
    inference(clausify,[status(thm)],[f_4_11]) ).

cnf(sat_proved,plain,
    $false,
    inference(cadical,[status(thm)],[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KRS135+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03  This is a FOF_THM_RFO_NEQ problem
% 0.00/0.03  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n015.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 19 12:19:03 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.39  % SZS status Theorem for theBenchmark
% 0.09/0.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------