↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SET899+1 : TPTP v9.3.1. Released v3.2.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 : n018.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:45 AM UTC 2026

% Result   : Theorem 0.10s 5.39s
% Output   : Proof 0.10s
% 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(rc1_xboole_0,axiom,
    ? [A] : empty(A),
    file('theBenchmark.p',rc1_xboole_0) ).

fof(rc2_xboole_0,axiom,
    ? [A] : ~ empty(A),
    file('theBenchmark.p',rc2_xboole_0) ).

fof(t40_zfmisc_1,conjecture,
    ! [A,B,C] :
      ( subset(A,B)
     => ( subset(A,set_difference(B,singleton(C)))
        | in(C,A) ) ),
    file('theBenchmark.p',t40_zfmisc_1) ).

fof(l3_zfmisc_1,axiom,
    ! [A,B,C] :
      ( subset(A,B)
     => ( subset(A,set_difference(B,singleton(C)))
        | in(C,A) ) ),
    file('theBenchmark.p',l3_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,
    ? [A] : empty(A),
    inference(fof_nnf,[status(thm)],[rc1_xboole_0]) ).

fof(f_3_2,plain,
    ? [U_4] : empty(U_4),
    inference(variable_rename,[status(thm)],[f_3_1]) ).

fof(f_3_3,plain,
    empty(sK1),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_4,sK1)],[f_3_2]) ).

cnf(f_3_4,plain,
    empty(sK1),
    inference(clausify,[status(thm)],[f_3_3]) ).

fof(f_4_1,plain,
    ? [A] : ~ empty(A),
    inference(fof_nnf,[status(thm)],[rc2_xboole_0]) ).

fof(f_4_2,plain,
    ? [U_5] : ~ empty(U_5),
    inference(variable_rename,[status(thm)],[f_4_1]) ).

fof(f_4_3,plain,
    ~ empty(sK2),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_5,sK2)],[f_4_2]) ).

cnf(f_4_4,plain,
    ~ empty(sK2),
    inference(clausify,[status(thm)],[f_4_3]) ).

fof(f_5_1,negated_conjecture,
    ~ ! [A,B,C] :
        ( subset(A,B)
       => ( subset(A,set_difference(B,singleton(C)))
          | in(C,A) ) ),
    inference(negate,[status(cth)],[t40_zfmisc_1]) ).

fof(f_5_2,negated_conjecture,
    ? [A,B,C] :
      ( ~ subset(A,set_difference(B,singleton(C)))
      & ~ in(C,A)
      & subset(A,B) ),
    inference(fof_nnf,[status(thm)],[f_5_1]) ).

fof(f_5_3,negated_conjecture,
    ? [U_8,U_7,U_6] :
      ( ~ subset(U_8,set_difference(U_7,singleton(U_6)))
      & ~ in(U_6,U_8)
      & subset(U_8,U_7) ),
    inference(variable_rename,[status(thm)],[f_5_2]) ).

fof(f_5_4,negated_conjecture,
    ? [U_8,U_7] :
      ( ? [U_6] :
          ( ~ subset(U_8,set_difference(U_7,singleton(U_6)))
          & ~ in(U_6,U_8) )
      & subset(U_8,U_7) ),
    inference(miniscope,[status(thm)],[f_5_3]) ).

fof(f_5_5,negated_conjecture,
    ? [U_7] :
      ( ? [U_6] :
          ( ~ subset(sK3,set_difference(U_7,singleton(U_6)))
          & ~ in(U_6,sK3) )
      & subset(sK3,U_7) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_8,sK3)],[f_5_4]) ).

fof(f_5_6,negated_conjecture,
    ( ? [U_6] :
        ( ~ subset(sK3,set_difference(sK4,singleton(U_6)))
        & ~ in(U_6,sK3) )
    & subset(sK3,sK4) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_7,sK4)],[f_5_5]) ).

fof(f_5_7,negated_conjecture,
    ( ~ subset(sK3,set_difference(sK4,singleton(sK5)))
    & ~ in(sK5,sK3)
    & subset(sK3,sK4) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_6,sK5)],[f_5_6]) ).

fof(f_5_8,negated_conjecture,
    ( ~ subset(sK3,set_difference(sK4,singleton(sK5)))
    & ~ in(sK5,sK3)
    & subset(sK3,sK4) ),
    inference(definitional_conversion,[status(esa)],[f_5_7]) ).

cnf(f_5_9,negated_conjecture,
    subset(sK3,sK4),
    inference(clausify,[status(thm)],[f_5_8]) ).

cnf(f_5_10,negated_conjecture,
    ~ in(sK5,sK3),
    inference(clausify,[status(thm)],[f_5_8]) ).

cnf(f_5_11,negated_conjecture,
    ~ subset(sK3,set_difference(sK4,singleton(sK5))),
    inference(clausify,[status(thm)],[f_5_8]) ).

fof(f_6_1,plain,
    ! [A,B,C] :
      ( subset(A,set_difference(B,singleton(C)))
      | in(C,A)
      | ~ subset(A,B) ),
    inference(fof_nnf,[status(thm)],[l3_zfmisc_1]) ).

fof(f_6_2,plain,
    ! [U_11,U_10,U_9] :
      ( subset(U_11,set_difference(U_10,singleton(U_9)))
      | in(U_9,U_11)
      | ~ subset(U_11,U_10) ),
    inference(variable_rename,[status(thm)],[f_6_1]) ).

fof(f_6_3,plain,
    ! [U_11,U_10] :
      ( ! [U_9] :
          ( subset(U_11,set_difference(U_10,singleton(U_9)))
          | in(U_9,U_11) )
      | ~ subset(U_11,U_10) ),
    inference(miniscope,[status(thm)],[f_6_2]) ).

cnf(f_6_4,plain,
    ( subset(U_11,set_difference(U_10,singleton(U_9)))
    | in(U_9,U_11)
    | ~ subset(U_11,U_10) ),
    inference(clausify,[status(thm)],[f_6_3]) ).

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

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