↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 2.38s 0.79s
% Output   : Proof 2.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   20 (   5 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   44 (  15   ~;  15   |;  10   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   30 (   0 sgn  15   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [A,B] :
      ( subset(A,B)
    <=> ! [C] :
          ( in(C,A)
         => in(C,B) ) ),
    file('/export/starexec/sandbox/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(c4,plain,
    ( in(X2,X1)
    | ~ in(X2,X0)
    | ~ subset(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

fof(f14,conjecture,
    ! [A,B,C] :
      ( ( subset(B,C)
        & subset(A,B) )
     => subset(A,C) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).

fof(f14_neg,negated_conjecture,
    ~ ! [A,B,C] :
        ( ( subset(B,C)
          & subset(A,B) )
       => subset(A,C) ),
    inference(negated_conjecture,[status(cth)],[f14]) ).

fof(f14_nnf,plain,
    ? [A,B,C] :
      ( ~ subset(A,C)
      & subset(B,C)
      & subset(A,B) ),
    inference(nnf_transformation,[status(thm)],[f14_neg]) ).

fof(f14_sk,plain,
    ( ~ subset(sk5,sk7)
    & subset(sk6,sk7)
    & subset(sk5,sk6) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk5,sk6,sk7])],[f14_nnf]) ).

cnf(c26,plain,
    subset(sk5,sk6),
    inference(cnf_transformation,[status(esa)],[f14_sk]) ).

cnf(p44,plain,
    ( in(X0,sk6)
    | ~ in(X0,sk5) ),
    inference(resolution,[status(thm)],[c4,c26]) ).

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

cnf(p47,plain,
    ( subset(sk5,X0)
    | in(sk1(sk5,X0),sk6) ),
    inference(resolution,[status(thm)],[p44,c5]) ).

cnf(c27,plain,
    subset(sk6,sk7),
    inference(cnf_transformation,[status(esa)],[f14_sk]) ).

cnf(p45,plain,
    ( in(X0,sk7)
    | ~ in(X0,sk6) ),
    inference(resolution,[status(thm)],[c4,c27]) ).

cnf(p126,plain,
    ( in(sk1(sk5,X0),sk7)
    | subset(sk5,X0) ),
    inference(resolution,[status(thm)],[p47,p45]) ).

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

cnf(p227,plain,
    ( subset(sk5,sk7)
    | subset(sk5,sk7) ),
    inference(resolution,[status(thm)],[p126,c6]) ).

cnf(p231,plain,
    subset(sk5,sk7),
    inference(factoring,[status(thm)],[p227]) ).

cnf(c28,plain,
    ~ subset(sk5,sk7),
    inference(cnf_transformation,[status(esa)],[f14_sk]) ).

cnf(p232,plain,
    $false,
    inference(resolution,[status(thm)],[p231,c28]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU121+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n003.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Thu Sep 24 12:50:05 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.38/0.79  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.38/0.79  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------