↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SEU148+2 : 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:05 PM UTC 2026

% Result   : Theorem 26.33s 4.81s
% Output   : Proof 26.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   5 unt;   0 def)
%            Number of atoms       :   53 (  23 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   57 (  22   ~;  18   |;  12   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   29 (   0 sgn  19   !;   3   ?)

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

fof(f6_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)],[f6]) ).

fof(f6_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])],[f6_nnf]) ).

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

cnf(p152,plain,
    ( X0 = X1
    | ~ in(X0,singleton(X1)) ),
    inference(equality_resolution,[status(thm)],[c8]) ).

fof(f30,lemma,
    ! [A,B] :
      ( subset(singleton(A),B)
    <=> in(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).

fof(f30_nnf,plain,
    ! [A,B] :
      ( ( ~ in(A,B)
        | subset(singleton(A),B) )
      & ( in(A,B)
        | ~ subset(singleton(A),B) ) ),
    inference(nnf_transformation,[status(thm)],[f30]) ).

fof(f30_sk,plain,
    ! [A,B] :
      ( ( ~ in(A,B)
        | subset(singleton(A),B) )
      & ( in(A,B)
        | ~ subset(singleton(A),B) ) ),
    inference(skolemisation,[status(esa)],[f30_nnf]) ).

cnf(c80,plain,
    ( in(X0,X1)
    | ~ subset(singleton(X0),X1) ),
    inference(cnf_transformation,[status(esa)],[f30_sk]) ).

fof(f65,conjecture,
    ! [A,B] :
      ( subset(singleton(A),singleton(B))
     => A = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_zfmisc_1) ).

fof(f65_neg,negated_conjecture,
    ~ ! [A,B] :
        ( subset(singleton(A),singleton(B))
       => A = B ),
    inference(negated_conjecture,[status(cth)],[f65]) ).

fof(f65_nnf,plain,
    ? [A,B] :
      ( A != B
      & subset(singleton(A),singleton(B)) ),
    inference(nnf_transformation,[status(thm)],[f65_neg]) ).

fof(f65_sk,plain,
    ( sk13 != sk14
    & subset(singleton(sk13),singleton(sk14)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk13,sk14])],[f65_nnf]) ).

cnf(c126,plain,
    subset(singleton(sk13),singleton(sk14)),
    inference(cnf_transformation,[status(esa)],[f65_sk]) ).

cnf(p179,plain,
    in(sk13,singleton(sk14)),
    inference(resolution,[status(thm)],[c80,c126]) ).

cnf(p207,plain,
    sk13 = sk14,
    inference(resolution,[status(thm)],[p152,p179]) ).

cnf(c127,plain,
    sk13 != sk14,
    inference(cnf_transformation,[status(esa)],[f65_sk]) ).

cnf(p209,plain,
    $false,
    inference(resolution,[status(thm)],[p207,c127]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU148+2 : 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.33  % Computer : n003.cluster.edu
% 0.10/0.33  % Model    : x86_64 x86_64
% 0.10/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33  % Memory   : 8046.5625MB
% 0.10/0.33  % OS       : Linux 6.8.0-71-generic
% 0.10/0.33  % CPULimit : 300
% 0.10/0.34  % WCLimit  : 300
% 0.10/0.34  % DateTime : Thu Sep 24 12:58:50 UTC 2026
% 0.10/0.34  % CPUTime  : 
% 0.10/0.34  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 26.33/4.81  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.33/4.81  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------