↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SEU116+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 : n013.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:04 AM UTC 2026

% Result   : Theorem 0.22s 0.47s
% Output   : Proof 0.22s
% 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 (   1 sgn  10   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(cc3_finsub_1,axiom,
    ! [A,B] :
      ( element(B,finite_subsets(A))
     => finite(B) ),
    file('theBenchmark.p',cc3_finsub_1) ).

fof(t30_finsub_1,conjecture,
    ! [A,B] :
      ( element(B,finite_subsets(A))
     => finite(B) ),
    file('theBenchmark.p',t30_finsub_1) ).

fof(f_21_1,plain,
    ! [A,B] :
      ( finite(B)
      | ~ element(B,finite_subsets(A)) ),
    inference(fof_nnf,[status(thm)],[cc3_finsub_1]) ).

fof(f_21_2,plain,
    ! [U_45,U_44] :
      ( finite(U_44)
      | ~ element(U_44,finite_subsets(U_45)) ),
    inference(variable_rename,[status(thm)],[f_21_1]) ).

cnf(f_21_3,plain,
    ( finite(U_44)
    | ~ element(U_44,finite_subsets(U_45)) ),
    inference(clausify,[status(thm)],[f_21_2]) ).

fof(f_31_1,negated_conjecture,
    ~ ! [A,B] :
        ( element(B,finite_subsets(A))
       => finite(B) ),
    inference(negate,[status(cth)],[t30_finsub_1]) ).

fof(f_31_2,negated_conjecture,
    ? [A,B] :
      ( ~ finite(B)
      & element(B,finite_subsets(A)) ),
    inference(fof_nnf,[status(thm)],[f_31_1]) ).

fof(f_31_3,negated_conjecture,
    ? [U_61,U_60] :
      ( ~ finite(U_60)
      & element(U_60,finite_subsets(U_61)) ),
    inference(variable_rename,[status(thm)],[f_31_2]) ).

fof(f_31_4,negated_conjecture,
    ? [U_60] :
      ( ~ finite(U_60)
      & element(U_60,finite_subsets(sK11)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(U_61,sK11)],[f_31_3]) ).

fof(f_31_5,negated_conjecture,
    ( ~ finite(sK12)
    & element(sK12,finite_subsets(sK11)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(U_60,sK12)],[f_31_4]) ).

fof(f_31_6,negated_conjecture,
    ( ~ finite(sK12)
    & element(sK12,finite_subsets(sK11)) ),
    inference(definitional_conversion,[status(esa)],[f_31_5]) ).

cnf(f_31_7,negated_conjecture,
    element(sK12,finite_subsets(sK11)),
    inference(clausify,[status(thm)],[f_31_6]) ).

cnf(f_31_8,negated_conjecture,
    ~ finite(sK12),
    inference(clausify,[status(thm)],[f_31_6]) ).

cnf(t1,plain,
    ~ finite(sK12),
    inference(start,[status(thm),parent(0:0)],[f_31_8]) ).

cnf(t2,plain,
    ( ~ element(sK12,finite_subsets(sK11))
    | finite(sK12) ),
    inference(extension,[status(thm),parent(t1:1)],[f_21_3]) ).

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

cnf(t4,plain,
    element(sK12,finite_subsets(sK11)),
    inference(extension,[status(thm),parent(t2:2)],[f_31_7]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU116+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03  This is a FOF_THM_RFO_SEQ problem
% 0.00/0.03  % 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 : n013.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 23:18:50 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.22/0.47  % SZS status Theorem for theBenchmark
% 0.22/0.47  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------