↑ Up

ConnectPP---0.7.2.THM-Prf.s

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

% Result   : Theorem 0.15s 5.40s
% Output   : Proof 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   18 (   6 unt;   0 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   24 (  12   ~;   4   |;   5   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   17 (   0 sgn  10   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t92_zfmisc_1,conjecture,
    ! [A,B] :
      ( in(A,B)
     => subset(A,union(B)) ),
    file('theBenchmark.p',t92_zfmisc_1) ).

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

fof(f_5_1,negated_conjecture,
    ~ ! [A,B] :
        ( in(A,B)
       => subset(A,union(B)) ),
    inference(negate,[status(cth)],[t92_zfmisc_1]) ).

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

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

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

fof(f_5_5,negated_conjecture,
    ( ~ subset(sK3,union(sK4))
    & in(sK3,sK4) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_6,sK4)],[f_5_4]) ).

fof(f_5_6,negated_conjecture,
    ( ~ subset(sK3,union(sK4))
    & in(sK3,sK4) ),
    inference(definitional_conversion,[status(esa)],[f_5_5]) ).

cnf(f_5_7,negated_conjecture,
    in(sK3,sK4),
    inference(clausify,[status(thm)],[f_5_6]) ).

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

fof(f_6_1,plain,
    ! [A,B] :
      ( subset(A,union(B))
      | ~ in(A,B) ),
    inference(fof_nnf,[status(thm)],[l50_zfmisc_1]) ).

fof(f_6_2,plain,
    ! [U_9,U_8] :
      ( subset(U_9,union(U_8))
      | ~ in(U_9,U_8) ),
    inference(variable_rename,[status(thm)],[f_6_1]) ).

cnf(f_6_3,plain,
    ( subset(U_9,union(U_8))
    | ~ in(U_9,U_8) ),
    inference(clausify,[status(thm)],[f_6_2]) ).

cnf(t1,plain,
    ~ subset(sK3,union(sK4)),
    inference(start,[status(thm),parent(0:0)],[f_5_8]) ).

cnf(t2,plain,
    ( ~ in(sK3,sK4)
    | subset(sK3,union(sK4)) ),
    inference(extension,[status(thm),parent(t1:1)],[f_6_3]) ).

cnf(t3,plain,
    $false,
    inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).

cnf(t4,plain,
    in(sK3,sK4),
    inference(extension,[status(thm),parent(t2:2)],[f_5_7]) ).

cnf(t5,plain,
    $false,
    inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU163+3 : 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/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/5.38  % Computer : n001.cluster.edu
% 0.12/5.38  % Model    : x86_64 x86_64
% 0.12/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38  % Memory   : 8046.5625MB
% 0.12/5.38  % OS       : Linux 6.8.0-71-generic
% 0.12/5.38  % CPULimit : 300
% 0.12/5.38  % WCLimit  : 300
% 0.12/5.38  % DateTime : Sat Sep 19 23:30:16 UTC 2026
% 0.12/5.38  % CPUTime  : 
% 0.15/5.40  % SZS status Theorem for theBenchmark
% 0.15/5.40  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------