↑ Up

FindProof---0.1.THM-Prf.s

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

% 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 : Fri Sep 25 02:50:59 PM UTC 2026

% Result   : Theorem 3.43s 1.31s
% Output   : Proof 3.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (   8 unt;   0 def)
%            Number of atoms       :   37 (   6 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   39 (  18   ~;  12   |;   6   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   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   :   26 (   3 sgn  17   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [A] :
      ( A = empty_set
    <=> ! [B] : ~ in(B,A) ),
    file('/export/starexec/sandbox2/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(sk0(A),A)
        | A = empty_set )
      & ( ~ in(B,A)
        | A != empty_set ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f2_nnf]) ).

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

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

fof(f3,axiom,
    ! [A,B] :
      ( subset(A,B)
    <=> ! [C] :
          ( in(C,A)
         => in(C,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).

fof(f3_nnf,plain,
    ! [A,B] :
      ( ( ? [C] :
            ( ~ in(C,B)
            & in(C,A) )
        | subset(A,B) )
      & ( ! [C] :
            ( in(C,B)
            | ~ in(C,A) )
        | ~ subset(A,B) ) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [A,B,C] :
      ( ( ( ~ in(sk1(A,B),B)
          & in(sk1(A,B),A) )
        | subset(A,B) )
      & ( in(C,B)
        | ~ in(C,A)
        | ~ subset(A,B) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f3_nnf]) ).

cnf(c5,plain,
    ( in(sk1(X0,X1),X0)
    | subset(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(p91,plain,
    subset(empty_set,X0),
    inference(resolution,[status(thm)],[p37,c5]) ).

fof(f15,conjecture,
    ! [A] : subset(empty_set,A),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_xboole_1) ).

fof(f15_neg,negated_conjecture,
    ~ ! [A] : subset(empty_set,A),
    inference(negated_conjecture,[status(cth)],[f15]) ).

fof(f15_nnf,plain,
    ? [A] : ~ subset(empty_set,A),
    inference(nnf_transformation,[status(thm)],[f15_neg]) ).

fof(f15_sk,plain,
    ~ subset(empty_set,sk5),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk5])],[f15_nnf]) ).

cnf(c27,plain,
    ~ subset(empty_set,sk5),
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

cnf(p174,plain,
    $false,
    inference(resolution,[status(thm)],[p91,c27]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU122+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.57  % Computer : n013.cluster.edu
% 0.10/0.57  % Model    : x86_64 x86_64
% 0.10/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57  % Memory   : 8046.5625MB
% 0.10/0.57  % OS       : Linux 6.8.0-71-generic
% 0.10/0.57  % CPULimit : 300
% 0.10/0.57  % WCLimit  : 300
% 0.10/0.57  % DateTime : Thu Sep 24 12:48:36 UTC 2026
% 0.10/0.57  % CPUTime  : 
% 0.10/0.57  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.43/1.31  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.43/1.31  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------