↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SEU121+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 : n010.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.42s 11.11s
% Output   : Proof 3.42s
% 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(f7,conjecture,
    ! [A,B,C] :
      ( ( subset(B,C)
        & subset(A,B) )
     => subset(A,C) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).

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

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

fof(f7_sk,plain,
    ( ~ subset(sk3,sk5)
    & subset(sk4,sk5)
    & subset(sk3,sk4) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk3,sk4,sk5])],[f7_nnf]) ).

cnf(c9,plain,
    subset(sk3,sk4),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

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

fof(f1_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)],[f1]) ).

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

cnf(c1,plain,
    ( in(X2,X1)
    | ~ in(X2,X0)
    | ~ subset(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p17,plain,
    ( in(X0,sk4)
    | ~ in(X0,sk3) ),
    inference(resolution,[status(thm)],[c9,c1]) ).

cnf(c2,plain,
    ( in(sk0(X0,X1),X0)
    | subset(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p22,plain,
    ( subset(sk3,X0)
    | in(sk0(sk3,X0),sk4) ),
    inference(resolution,[status(thm)],[p17,c2]) ).

cnf(c10,plain,
    subset(sk4,sk5),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(p18,plain,
    ( in(X0,sk5)
    | ~ in(X0,sk4) ),
    inference(resolution,[status(thm)],[c10,c1]) ).

cnf(p27,plain,
    ( in(sk0(sk3,X0),sk5)
    | subset(sk3,X0) ),
    inference(resolution,[status(thm)],[p22,p18]) ).

cnf(c3,plain,
    ( ~ in(sk0(X0,X1),X1)
    | subset(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p32,plain,
    ( subset(sk3,sk5)
    | subset(sk3,sk5) ),
    inference(resolution,[status(thm)],[p27,c3]) ).

cnf(p34,plain,
    subset(sk3,sk5),
    inference(factoring,[status(thm)],[p32]) ).

cnf(c11,plain,
    ~ subset(sk3,sk5),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(p36,plain,
    $false,
    inference(resolution,[status(thm)],[p34,c11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU121+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/10.37  % Computer : n010.cluster.edu
% 0.08/10.37  % Model    : x86_64 x86_64
% 0.08/10.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/10.37  % Memory   : 8046.5625MB
% 0.08/10.37  % OS       : Linux 6.8.0-71-generic
% 0.08/10.37  % CPULimit : 300
% 0.08/10.37  % WCLimit  : 300
% 0.08/10.37  % DateTime : Thu Sep 24 12:48:41 UTC 2026
% 0.08/10.37  % CPUTime  : 
% 0.08/10.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.42/11.11  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.42/11.11  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------