↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SEU115+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n017.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 : Fri Sep 25 02:50:58 PM UTC 2026

% Result   : Theorem 30.17s 4.30s
% Output   : Proof 30.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   23 (  15 unt;   0 def)
%            Number of atoms       :   31 (  14 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   19 (  11   ~;   6   |;   0   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :    8 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f33,axiom,
    ! [A] :
      ( finite(A)
     => finite_subsets(A) = powerset(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t27_finsub_1) ).

fof(f33_nnf,plain,
    ! [A] :
      ( finite_subsets(A) = powerset(A)
      | ~ finite(A) ),
    inference(nnf_transformation,[status(thm)],[f33]) ).

fof(f33_sk,plain,
    ! [A] :
      ( finite_subsets(A) = powerset(A)
      | ~ finite(A) ),
    inference(skolemisation,[status(esa)],[f33_nnf]) ).

cnf(c62,plain,
    ( finite_subsets(X0) = powerset(X0)
    | ~ finite(X0) ),
    inference(cnf_transformation,[status(esa)],[f33_sk]) ).

fof(f9,axiom,
    ! [A] :
      ( empty(A)
     => finite(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_finset_1) ).

fof(f9_nnf,plain,
    ! [A] :
      ( finite(A)
      | ~ empty(A) ),
    inference(nnf_transformation,[status(thm)],[f9]) ).

fof(f9_sk,plain,
    ! [A] :
      ( finite(A)
      | ~ empty(A) ),
    inference(skolemisation,[status(esa)],[f9_nnf]) ).

cnf(c10,plain,
    ( finite(X0)
    | ~ empty(X0) ),
    inference(cnf_transformation,[status(esa)],[f9_sk]) ).

fof(f28,axiom,
    empty(empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).

fof(f28_nnf,plain,
    empty(empty_set),
    inference(nnf_transformation,[status(thm)],[f28]) ).

cnf(c57,plain,
    empty(empty_set),
    inference(cnf_transformation,[status(esa)],[f28_nnf]) ).

cnf(p65,plain,
    finite(empty_set),
    inference(resolution,[status(thm)],[c10,c57]) ).

cnf(p118,plain,
    finite_subsets(empty_set) = powerset(empty_set),
    inference(resolution,[status(thm)],[c62,p65]) ).

fof(f32,conjecture,
    finite_subsets(empty_set) = singleton(empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_finsub_1) ).

fof(f32_neg,negated_conjecture,
    finite_subsets(empty_set) != singleton(empty_set),
    inference(negated_conjecture,[status(cth)],[f32]) ).

fof(f32_nnf,plain,
    finite_subsets(empty_set) != singleton(empty_set),
    inference(nnf_transformation,[status(thm)],[f32_neg]) ).

fof(f32_sk,plain,
    finite_subsets(empty_set) != singleton(empty_set),
    inference(skolemisation,[status(esa)],[f32_nnf]) ).

cnf(c61,plain,
    finite_subsets(empty_set) != singleton(empty_set),
    inference(cnf_transformation,[status(esa)],[f32_sk]) ).

cnf(p119,plain,
    powerset(empty_set) != singleton(empty_set),
    inference(demodulation,[status(thm)],[p118,c61]) ).

fof(f34,axiom,
    powerset(empty_set) = singleton(empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_zfmisc_1) ).

fof(f34_nnf,plain,
    powerset(empty_set) = singleton(empty_set),
    inference(nnf_transformation,[status(thm)],[f34]) ).

cnf(c63,plain,
    powerset(empty_set) = singleton(empty_set),
    inference(cnf_transformation,[status(esa)],[f34_nnf]) ).

cnf(p128,plain,
    $false,
    inference(resolution,[status(thm)],[p119,c63]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU115+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.36  % Computer : n017.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 : Thu Sep 24 12:42:15 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 30.17/4.30  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.17/4.30  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------