↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n026.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:44:18 PM UTC 2026

% Result   : Theorem 3.60s 0.98s
% Output   : Proof 3.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   17 (   5 unt;   0 def)
%            Number of atoms       :   37 (  18 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   35 (  15   ~;  11   |;   6   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn  10   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [A,B] :
      ( set_difference(singleton(A),B) = empty_set
    <=> in(A,B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l36_zfmisc_1) ).

fof(f5_nnf,plain,
    ! [A,B] :
      ( ( ~ in(A,B)
        | set_difference(singleton(A),B) = empty_set )
      & ( in(A,B)
        | set_difference(singleton(A),B) != empty_set ) ),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ! [A,B] :
      ( ( ~ in(A,B)
        | set_difference(singleton(A),B) = empty_set )
      & ( in(A,B)
        | set_difference(singleton(A),B) != empty_set ) ),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c9,plain,
    ( ~ in(X0,X1)
    | set_difference(singleton(X0),X1) = empty_set ),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(c8,plain,
    ( in(X0,X1)
    | set_difference(singleton(X0),X1) != empty_set ),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

fof(f4,conjecture,
    ! [A,B] :
      ( set_difference(singleton(A),B) = empty_set
    <=> in(A,B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t68_zfmisc_1) ).

fof(f4_neg,negated_conjecture,
    ~ ! [A,B] :
        ( set_difference(singleton(A),B) = empty_set
      <=> in(A,B) ),
    inference(negated_conjecture,[status(cth)],[f4]) ).

fof(f4_nnf,plain,
    ? [A,B] :
      ( ( in(A,B)
        & set_difference(singleton(A),B) != empty_set )
      | ( ~ in(A,B)
        & set_difference(singleton(A),B) = empty_set ) ),
    inference(nnf_transformation,[status(thm)],[f4_neg]) ).

fof(f4_sk,plain,
    ( ( in(sk2,sk3)
      & set_difference(singleton(sk2),sk3) != empty_set )
    | ( ~ in(sk2,sk3)
      & set_difference(singleton(sk2),sk3) = empty_set ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk2,sk3])],[f4_nnf]) ).

cnf(c5,plain,
    ( in(sk2,sk3)
    | set_difference(singleton(sk2),sk3) = empty_set ),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(p11,plain,
    ( in(sk2,sk3)
    | in(sk2,sk3) ),
    inference(resolution,[status(thm)],[c8,c5]) ).

cnf(p12,plain,
    in(sk2,sk3),
    inference(factoring,[status(thm)],[p11]) ).

cnf(p15,plain,
    set_difference(singleton(sk2),sk3) = empty_set,
    inference(resolution,[status(thm)],[c9,p12]) ).

cnf(c6,plain,
    ( set_difference(singleton(sk2),sk3) != empty_set
    | ~ in(sk2,sk3) ),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(p13,plain,
    set_difference(singleton(sk2),sk3) != empty_set,
    inference(resolution,[status(thm)],[p12,c6]) ).

cnf(p16,plain,
    empty_set != empty_set,
    inference(demodulation,[status(thm)],[p15,p13]) ).

cnf(p17,plain,
    $false,
    inference(equality_resolution,[status(thm)],[p16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET925+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36  % Computer : n026.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Thu Sep 24 12:25:54 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.60/0.98  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.60/0.98  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------