↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SET786+1 : TPTP v9.3.1. Released v2.5.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 : n026.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:57:26 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(thm25,conjecture,
    ~ ? [Y] :
      ! [X] :
        ( element(X,Y)
      <=> ~ ? [Z] :
              ( element(Z,X)
              & element(X,Z) ) ),
    file('theBenchmark.p',thm25) ).

fof(f_1_1,negated_conjecture,
    ? [Y] :
    ! [X] :
      ( element(X,Y)
    <=> ~ ? [Z] :
            ( element(Z,X)
            & element(X,Z) ) ),
    inference(negate,[status(cth)],[thm25]) ).

fof(f_1_2,negated_conjecture,
    ? [Y] :
    ! [X] :
      ( ( element(X,Y)
        | ? [Z] :
            ( element(Z,X)
            & element(X,Z) ) )
      & ( ! [Z] :
            ( ~ element(Z,X)
            | ~ element(X,Z) )
        | ~ element(X,Y) ) ),
    inference(fof_nnf,[status(thm)],[f_1_1]) ).

fof(f_1_3,negated_conjecture,
    ? [U_3] :
    ! [U_2] :
      ( ( element(U_2,U_3)
        | ? [U_1] :
            ( element(U_1,U_2)
            & element(U_2,U_1) ) )
      & ( ! [U_0] :
            ( ~ element(U_0,U_2)
            | ~ element(U_2,U_0) )
        | ~ element(U_2,U_3) ) ),
    inference(variable_rename,[status(thm)],[f_1_2]) ).

fof(f_1_4,negated_conjecture,
    ? [U_3] :
      ( ! [U_5] :
          ( element(U_5,U_3)
          | ? [U_1] :
              ( element(U_1,U_5)
              & element(U_5,U_1) ) )
      & ! [U_4] :
          ( ! [U_0] :
              ( ~ element(U_0,U_4)
              | ~ element(U_4,U_0) )
          | ~ element(U_4,U_3) ) ),
    inference(miniscope,[status(thm)],[f_1_3]) ).

fof(f_1_5,negated_conjecture,
    ( ! [U_5] :
        ( element(U_5,sK1)
        | ? [U_1] :
            ( element(U_1,U_5)
            & element(U_5,U_1) ) )
    & ! [U_4] :
        ( ! [U_0] :
            ( ~ element(U_0,U_4)
            | ~ element(U_4,U_0) )
        | ~ element(U_4,sK1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_3,sK1)],[f_1_4]) ).

fof(f_1_6,negated_conjecture,
    ( ! [U_5] :
        ( element(U_5,sK1)
        | ( element(sK2(U_5),U_5)
          & element(U_5,sK2(U_5)) ) )
    & ! [U_4] :
        ( ! [U_0] :
            ( ~ element(U_0,U_4)
            | ~ element(U_4,U_0) )
        | ~ element(U_4,sK1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_1,sK2(U_5))],[f_1_5]) ).

fof(f_1_7,negated_conjecture,
    ( ! [U_5] :
        ( element(sK2(U_5),U_5)
        | ~ sP0(U_5) )
    & ! [U_5] :
        ( element(U_5,sK2(U_5))
        | ~ sP0(U_5) )
    & ! [U_5] :
        ( element(U_5,sK1)
        | sP0(U_5) )
    & ! [U_0,U_4] :
        ( ~ element(U_0,U_4)
        | ~ element(U_4,U_0)
        | ~ element(U_4,sK1) ) ),
    inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0])],[f_1_6]) ).

cnf(f_1_8,negated_conjecture,
    ( ~ element(U_0,U_4)
    | ~ element(U_4,U_0)
    | ~ element(U_4,sK1) ),
    inference(clausify,[status(thm)],[f_1_7]) ).

cnf(f_1_9,negated_conjecture,
    ( element(U_5,sK1)
    | sP0(U_5) ),
    inference(clausify,[status(thm)],[f_1_7]) ).

cnf(f_1_10,negated_conjecture,
    ( element(U_5,sK2(U_5))
    | ~ sP0(U_5) ),
    inference(clausify,[status(thm)],[f_1_7]) ).

cnf(f_1_11,negated_conjecture,
    ( element(sK2(U_5),U_5)
    | ~ sP0(U_5) ),
    inference(clausify,[status(thm)],[f_1_7]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET786+1 : TPTP v9.3.1. Released v2.5.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.10/0.36  % Computer : n026.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep 19 23:01:06 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.38  % SZS status Theorem for theBenchmark
% 0.10/0.38  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------