↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n003.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:51:04 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f6,conjecture,
    ! [A] : singleton(A) != empty_set,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1_zfmisc_1) ).

fof(f6_neg,negated_conjecture,
    ~ ! [A] : singleton(A) != empty_set,
    inference(negated_conjecture,[status(cth)],[f6]) ).

fof(f6_nnf,plain,
    ? [A] : singleton(A) = empty_set,
    inference(nnf_transformation,[status(thm)],[f6_neg]) ).

fof(f6_sk,plain,
    singleton(sk2) = empty_set,
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk2])],[f6_nnf]) ).

cnf(c12,plain,
    singleton(sk2) = empty_set,
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

fof(f1,axiom,
    ! [A,B] :
      ( B = singleton(A)
    <=> ! [C] :
          ( in(C,B)
        <=> C = A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).

fof(f1_nnf,plain,
    ! [A,B] :
      ( ( ? [C] :
            ( ( C = A
              & ~ in(C,B) )
            | ( C != A
              & in(C,B) ) )
        | B = singleton(A) )
      & ( ! [C] :
            ( ( C != A
              | in(C,B) )
            & ( C = A
              | ~ in(C,B) ) )
        | B != singleton(A) ) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [B,A,C] :
      ( ( ( sk0(A,B) = A
          & ~ in(sk0(A,B),B) )
        | ( sk0(A,B) != A
          & in(sk0(A,B),B) )
        | B = singleton(A) )
      & ( ( ( C != A
            | in(C,B) )
          & ( C = A
            | ~ in(C,B) ) )
        | B != singleton(A) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f1_nnf]) ).

cnf(c2,plain,
    ( X2 != X0
    | in(X2,X1)
    | X1 != singleton(X0) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p20,plain,
    ( X0 != X1
    | in(X0,singleton(X1)) ),
    inference(equality_resolution,[status(thm)],[c2]) ).

cnf(p23,plain,
    in(X0,singleton(X0)),
    inference(equality_resolution,[status(thm)],[p20]) ).

cnf(p25,plain,
    in(sk2,empty_set),
    inference(superposition,[status(thm)],[c12,p23]) ).

fof(f2,axiom,
    ! [A] :
      ( A = empty_set
    <=> ! [B] : ~ in(B,A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).

fof(f2_nnf,plain,
    ! [A] :
      ( ( ? [B] : in(B,A)
        | A = empty_set )
      & ( ! [B] : ~ in(B,A)
        | A != empty_set ) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [A,B] :
      ( ( in(sk1(A),A)
        | A = empty_set )
      & ( ~ in(B,A)
        | A != empty_set ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f2_nnf]) ).

cnf(c7,plain,
    ( ~ in(X1,X0)
    | X0 != empty_set ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p16,plain,
    ~ in(X0,empty_set),
    inference(equality_resolution,[status(thm)],[c7]) ).

cnf(p27,plain,
    $false,
    inference(resolution,[status(thm)],[p25,p16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU143+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.36  % Computer : n003.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:57:21 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.63/0.78  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.63/0.78  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------