↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 2.35s 0.79s
% Output   : Proof 2.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (   7 unt;   0 def)
%            Number of atoms       :   67 (   6 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :   77 (  29   ~;  27   |;  17   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-3 aty)
%            Number of variables   :   47 (   3 sgn  25   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [A,B,C] :
      ( C = set_difference(A,B)
    <=> ! [D] :
          ( in(D,C)
        <=> ( ~ in(D,B)
            & in(D,A) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).

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

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

cnf(c4,plain,
    ( in(X3,X0)
    | ~ in(X3,X2)
    | X2 != set_difference(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p32,plain,
    ( in(X0,X1)
    | ~ in(X0,set_difference(X1,X2)) ),
    inference(equality_resolution,[status(thm)],[c4]) ).

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(c2,plain,
    ( in(sk0(X0,X1),X0)
    | subset(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p38,plain,
    ( subset(set_difference(X0,X1),X2)
    | in(sk0(set_difference(X0,X1),X2),X0) ),
    inference(resolution,[status(thm)],[p32,c2]) ).

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

cnf(p48,plain,
    ( subset(set_difference(X0,X1),X0)
    | subset(set_difference(X0,X1),X0) ),
    inference(resolution,[status(thm)],[p38,c3]) ).

cnf(p51,plain,
    subset(set_difference(X0,X1),X0),
    inference(factoring,[status(thm)],[p48]) ).

fof(f9,conjecture,
    ! [A,B] : subset(set_difference(A,B),A),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t36_xboole_1) ).

fof(f9_neg,negated_conjecture,
    ~ ! [A,B] : subset(set_difference(A,B),A),
    inference(negated_conjecture,[status(cth)],[f9]) ).

fof(f9_nnf,plain,
    ? [A,B] : ~ subset(set_difference(A,B),A),
    inference(nnf_transformation,[status(thm)],[f9_neg]) ).

fof(f9_sk,plain,
    ~ subset(set_difference(sk4,sk5),sk4),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk4,sk5])],[f9_nnf]) ).

cnf(c19,plain,
    ~ subset(set_difference(sk4,sk5),sk4),
    inference(cnf_transformation,[status(esa)],[f9_sk]) ).

cnf(p52,plain,
    $false,
    inference(resolution,[status(thm)],[p51,c19]) ).

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