↑ Up

ConnectPP---0.7.2.THM-Prf.s

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

% Computer : n012.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:58:15 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(reflexivity_r1_tarski,axiom,
    ! [A,B] : subset(A,A),
    file('theBenchmark.p',reflexivity_r1_tarski) ).

fof(antisymmetry_r2_hidden,axiom,
    ! [A,B] :
      ( in(A,B)
     => ~ in(B,A) ),
    file('theBenchmark.p',antisymmetry_r2_hidden) ).

fof(dt_k1_tarski,axiom,
    $true,
    file('theBenchmark.p',dt_k1_tarski) ).

fof(t37_zfmisc_1,conjecture,
    ! [A,B] :
      ( subset(singleton(A),B)
    <=> in(A,B) ),
    file('theBenchmark.p',t37_zfmisc_1) ).

fof(l2_zfmisc_1,axiom,
    ! [A,B] :
      ( subset(singleton(A),B)
    <=> in(A,B) ),
    file('theBenchmark.p',l2_zfmisc_1) ).

fof(f_1_1,plain,
    ! [A,B] : subset(A,A),
    inference(fof_nnf,[status(thm)],[reflexivity_r1_tarski]) ).

fof(f_1_2,plain,
    ! [U_1,U_0] : subset(U_1,U_1),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

fof(f_1_3,plain,
    ! [U_1] : subset(U_1,U_1),
    inference(miniscope,[status(thm)],[f_1_2]) ).

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

fof(f_2_1,plain,
    ! [A,B] :
      ( ~ in(B,A)
      | ~ in(A,B) ),
    inference(fof_nnf,[status(thm)],[antisymmetry_r2_hidden]) ).

fof(f_2_2,plain,
    ! [U_3,U_2] :
      ( ~ in(U_2,U_3)
      | ~ in(U_3,U_2) ),
    inference(variable_rename,[status(thm)],[f_2_1]) ).

cnf(f_2_3,plain,
    ( ~ in(U_2,U_3)
    | ~ in(U_3,U_2) ),
    inference(clausify,[status(thm)],[f_2_2]) ).

fof(f_3_1,plain,
    $true,
    inference(fof_nnf,[status(thm)],[dt_k1_tarski]) ).

cnf(f_3_2,plain,
    $true,
    inference(clausify,[status(thm)],[f_3_1]) ).

fof(f_4_1,negated_conjecture,
    ~ ! [A,B] :
        ( subset(singleton(A),B)
      <=> in(A,B) ),
    inference(negate,[status(cth)],[t37_zfmisc_1]) ).

fof(f_4_2,negated_conjecture,
    ? [A,B] :
      ( ( ~ subset(singleton(A),B)
        & in(A,B) )
      | ( ~ in(A,B)
        & subset(singleton(A),B) ) ),
    inference(fof_nnf,[status(thm)],[f_4_1]) ).

fof(f_4_3,negated_conjecture,
    ? [U_5,U_4] :
      ( ( ~ subset(singleton(U_5),U_4)
        & in(U_5,U_4) )
      | ( ~ in(U_5,U_4)
        & subset(singleton(U_5),U_4) ) ),
    inference(variable_rename,[status(thm)],[f_4_2]) ).

fof(f_4_4,negated_conjecture,
    ( ? [U_9,U_7] :
        ( ~ subset(singleton(U_9),U_7)
        & in(U_9,U_7) )
    | ? [U_8,U_6] :
        ( ~ in(U_8,U_6)
        & subset(singleton(U_8),U_6) ) ),
    inference(miniscope,[status(thm)],[f_4_3]) ).

fof(f_4_5,negated_conjecture,
    ( ? [U_9,U_7] :
        ( ~ subset(singleton(U_9),U_7)
        & in(U_9,U_7) )
    | ? [U_6] :
        ( ~ in(sK1,U_6)
        & subset(singleton(sK1),U_6) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_8,sK1)],[f_4_4]) ).

fof(f_4_6,negated_conjecture,
    ( ? [U_9,U_7] :
        ( ~ subset(singleton(U_9),U_7)
        & in(U_9,U_7) )
    | ( ~ in(sK1,sK2)
      & subset(singleton(sK1),sK2) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_6,sK2)],[f_4_5]) ).

fof(f_4_7,negated_conjecture,
    ( ? [U_7] :
        ( ~ subset(singleton(sK3),U_7)
        & in(sK3,U_7) )
    | ( ~ in(sK1,sK2)
      & subset(singleton(sK1),sK2) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_9,sK3)],[f_4_6]) ).

fof(f_4_8,negated_conjecture,
    ( ( ~ subset(singleton(sK3),sK4)
      & in(sK3,sK4) )
    | ( ~ in(sK1,sK2)
      & subset(singleton(sK1),sK2) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_7,sK4)],[f_4_7]) ).

fof(f_4_9,negated_conjecture,
    ( ( ~ subset(singleton(sK3),sK4)
      | ~ sP1 )
    & ( in(sK3,sK4)
      | ~ sP1 )
    & ( ~ in(sK1,sK2)
      | ~ sP0 )
    & ( subset(singleton(sK1),sK2)
      | ~ sP0 )
    & ( sP1
      | sP0 ) ),
    inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_4_8]) ).

cnf(f_4_10,negated_conjecture,
    ( sP1
    | sP0 ),
    inference(clausify,[status(thm)],[f_4_9]) ).

cnf(f_4_11,negated_conjecture,
    ( subset(singleton(sK1),sK2)
    | ~ sP0 ),
    inference(clausify,[status(thm)],[f_4_9]) ).

cnf(f_4_12,negated_conjecture,
    ( ~ in(sK1,sK2)
    | ~ sP0 ),
    inference(clausify,[status(thm)],[f_4_9]) ).

cnf(f_4_13,negated_conjecture,
    ( in(sK3,sK4)
    | ~ sP1 ),
    inference(clausify,[status(thm)],[f_4_9]) ).

cnf(f_4_14,negated_conjecture,
    ( ~ subset(singleton(sK3),sK4)
    | ~ sP1 ),
    inference(clausify,[status(thm)],[f_4_9]) ).

fof(f_5_1,plain,
    ! [A,B] :
      ( ( subset(singleton(A),B)
        | ~ in(A,B) )
      & ( in(A,B)
        | ~ subset(singleton(A),B) ) ),
    inference(fof_nnf,[status(thm)],[l2_zfmisc_1]) ).

fof(f_5_2,plain,
    ! [U_11,U_10] :
      ( ( subset(singleton(U_11),U_10)
        | ~ in(U_11,U_10) )
      & ( in(U_11,U_10)
        | ~ subset(singleton(U_11),U_10) ) ),
    inference(variable_rename,[status(thm)],[f_5_1]) ).

fof(f_5_3,plain,
    ( ! [U_15,U_13] :
        ( subset(singleton(U_15),U_13)
        | ~ in(U_15,U_13) )
    & ! [U_14,U_12] :
        ( in(U_14,U_12)
        | ~ subset(singleton(U_14),U_12) ) ),
    inference(miniscope,[status(thm)],[f_5_2]) ).

cnf(f_5_4,plain,
    ( in(U_14,U_12)
    | ~ subset(singleton(U_14),U_12) ),
    inference(clausify,[status(thm)],[f_5_3]) ).

cnf(f_5_5,plain,
    ( subset(singleton(U_15),U_13)
    | ~ in(U_15,U_13) ),
    inference(clausify,[status(thm)],[f_5_3]) ).

cnf(f_3_2_true,plain,
    $true,
    inference(clause_is_true,[status(thm)],[f_3_2]) ).

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

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