↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : KRS136+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 : n002.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.11s 0.37s
% Output   : Proof 0.11s
% 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(the_axiom,conjecture,
    ( ! [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,negated_conjecture,
    ~ ( ! [X] :
          ( xsd_string(X)
        <=> ~ xsd_integer(X) )
      & ! [X] :
          ( ~ cowlNothing(X)
          & cowlThing(X) ) ),
    inference(negate,[status(cth)],[the_axiom]) ).

fof(f_3_2,negated_conjecture,
    ( ? [X] :
        ( ( ~ xsd_string(X)
          & ~ xsd_integer(X) )
        | ( xsd_integer(X)
          & xsd_string(X) ) )
    | ? [X] :
        ( cowlNothing(X)
        | ~ cowlThing(X) ) ),
    inference(fof_nnf,[status(thm)],[f_3_1]) ).

fof(f_3_3,negated_conjecture,
    ( ? [U_7] :
        ( ( ~ xsd_string(U_7)
          & ~ xsd_integer(U_7) )
        | ( xsd_integer(U_7)
          & xsd_string(U_7) ) )
    | ? [U_6] :
        ( cowlNothing(U_6)
        | ~ cowlThing(U_6) ) ),
    inference(variable_rename,[status(thm)],[f_3_2]) ).

fof(f_3_4,negated_conjecture,
    ( ? [U_11] :
        ( ~ xsd_string(U_11)
        & ~ xsd_integer(U_11) )
    | ? [U_10] :
        ( xsd_integer(U_10)
        & xsd_string(U_10) )
    | ? [U_9] : cowlNothing(U_9)
    | ? [U_8] : ~ cowlThing(U_8) ),
    inference(miniscope,[status(thm)],[f_3_3]) ).

fof(f_3_5,negated_conjecture,
    ( ? [U_11] :
        ( ~ xsd_string(U_11)
        & ~ xsd_integer(U_11) )
    | ? [U_10] :
        ( xsd_integer(U_10)
        & xsd_string(U_10) )
    | ? [U_9] : cowlNothing(U_9)
    | ~ cowlThing(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_8,sK1)],[f_3_4]) ).

fof(f_3_6,negated_conjecture,
    ( ? [U_11] :
        ( ~ xsd_string(U_11)
        & ~ xsd_integer(U_11) )
    | ? [U_10] :
        ( xsd_integer(U_10)
        & xsd_string(U_10) )
    | cowlNothing(sK2)
    | ~ cowlThing(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_9,sK2)],[f_3_5]) ).

fof(f_3_7,negated_conjecture,
    ( ? [U_11] :
        ( ~ xsd_string(U_11)
        & ~ xsd_integer(U_11) )
    | ( xsd_integer(sK3)
      & xsd_string(sK3) )
    | cowlNothing(sK2)
    | ~ cowlThing(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_10,sK3)],[f_3_6]) ).

fof(f_3_8,negated_conjecture,
    ( ( ~ 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_11,sK4)],[f_3_7]) ).

fof(f_3_9,negated_conjecture,
    ( ( ~ xsd_string(sK4)
      | ~ sP1 )
    & ( ~ xsd_integer(sK4)
      | ~ sP1 )
    & ( xsd_integer(sK3)
      | ~ sP0 )
    & ( xsd_string(sK3)
      | ~ sP0 )
    & ( sP1
      | sP0
      | cowlNothing(sK2)
      | ~ cowlThing(sK1) ) ),
    inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_3_8]) ).

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

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

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

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

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

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

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