↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SEU134+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 : n005.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 35.09s 4.96s
% Output   : Proof 35.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   17 (   4 unt;   0 def)
%            Number of atoms       :   38 (  17 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   37 (  16   ~;  12   |;   6   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn  10   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f36,conjecture,
    ! [A,B] :
      ( set_difference(A,B) = empty_set
    <=> subset(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_xboole_1) ).

fof(f36_neg,negated_conjecture,
    ~ ! [A,B] :
        ( set_difference(A,B) = empty_set
      <=> subset(A,B) ),
    inference(negated_conjecture,[status(cth)],[f36]) ).

fof(f36_nnf,plain,
    ? [A,B] :
      ( ( subset(A,B)
        & set_difference(A,B) != empty_set )
      | ( ~ subset(A,B)
        & set_difference(A,B) = empty_set ) ),
    inference(nnf_transformation,[status(thm)],[f36_neg]) ).

fof(f36_sk,plain,
    ( ( subset(sk8,sk9)
      & set_difference(sk8,sk9) != empty_set )
    | ( ~ subset(sk8,sk9)
      & set_difference(sk8,sk9) = empty_set ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk8,sk9])],[f36_nnf]) ).

cnf(c71,plain,
    ( subset(sk8,sk9)
    | set_difference(sk8,sk9) = empty_set ),
    inference(cnf_transformation,[status(esa)],[f36_sk]) ).

fof(f19,lemma,
    ! [A,B] :
      ( set_difference(A,B) = empty_set
    <=> subset(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_xboole_1) ).

fof(f19_nnf,plain,
    ! [A,B] :
      ( ( ~ subset(A,B)
        | set_difference(A,B) = empty_set )
      & ( subset(A,B)
        | set_difference(A,B) != empty_set ) ),
    inference(nnf_transformation,[status(thm)],[f19]) ).

fof(f19_sk,plain,
    ! [A,B] :
      ( ( ~ subset(A,B)
        | set_difference(A,B) = empty_set )
      & ( subset(A,B)
        | set_difference(A,B) != empty_set ) ),
    inference(skolemisation,[status(esa)],[f19_nnf]) ).

cnf(c49,plain,
    ( subset(X0,X1)
    | set_difference(X0,X1) != empty_set ),
    inference(cnf_transformation,[status(esa)],[f19_sk]) ).

cnf(p164,plain,
    ( subset(sk8,sk9)
    | subset(sk8,sk9) ),
    inference(resolution,[status(thm)],[c71,c49]) ).

cnf(p165,plain,
    subset(sk8,sk9),
    inference(factoring,[status(thm)],[p164]) ).

cnf(c50,plain,
    ( ~ subset(X0,X1)
    | set_difference(X0,X1) = empty_set ),
    inference(cnf_transformation,[status(esa)],[f19_sk]) ).

cnf(p167,plain,
    set_difference(sk8,sk9) = empty_set,
    inference(resolution,[status(thm)],[p165,c50]) ).

cnf(c72,plain,
    ( set_difference(sk8,sk9) != empty_set
    | ~ subset(sk8,sk9) ),
    inference(cnf_transformation,[status(esa)],[f36_sk]) ).

cnf(p168,plain,
    ( empty_set != empty_set
    | ~ subset(sk8,sk9) ),
    inference(demodulation,[status(thm)],[p167,c72]) ).

cnf(p180,plain,
    ~ subset(sk8,sk9),
    inference(equality_resolution,[status(thm)],[p168]) ).

cnf(p181,plain,
    $false,
    inference(resolution,[status(thm)],[p180,p165]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU134+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n005.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:53:02 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 35.09/4.96  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 35.09/4.96  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------