↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n002.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:43:34 PM UTC 2026

% Result   : Theorem 13.03s 17.31s
% Output   : Proof 13.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   34 (  14 unt;   0 def)
%            Number of atoms       :   85 (  14 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   85 (  34   ~;  33   |;  14   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   62 (   3 sgn  29   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [B,C,D] :
      ( member(D,difference(B,C))
    <=> ( ~ member(D,C)
        & member(D,B) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).

fof(f1_nnf,plain,
    ! [B,C,D] :
      ( ( member(D,C)
        | ~ member(D,B)
        | member(D,difference(B,C)) )
      & ( ( ~ member(D,C)
          & member(D,B) )
        | ~ member(D,difference(B,C)) ) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [D,B,C] :
      ( ( member(D,C)
        | ~ member(D,B)
        | member(D,difference(B,C)) )
      & ( ( ~ member(D,C)
          & member(D,B) )
        | ~ member(D,difference(B,C)) ) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c6,plain,
    ( member(X2,X1)
    | ~ member(X2,X0)
    | member(X2,difference(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

fof(f5,axiom,
    ! [B,C] :
      ( subset(B,C)
    <=> ! [D] :
          ( member(D,B)
         => member(D,C) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).

fof(f5_nnf,plain,
    ! [B,C] :
      ( ( ? [D] :
            ( ~ member(D,C)
            & member(D,B) )
        | subset(B,C) )
      & ( ! [D] :
            ( member(D,C)
            | ~ member(D,B) )
        | ~ subset(B,C) ) ),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ! [B,C,D] :
      ( ( ( ~ member(sk2(B,C),C)
          & member(sk2(B,C),B) )
        | subset(B,C) )
      & ( member(D,C)
        | ~ member(D,B)
        | ~ subset(B,C) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk2])],[f5_nnf]) ).

cnf(c18,plain,
    ( member(sk2(X0,X1),X0)
    | subset(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(p44,plain,
    ( subset(X0,X1)
    | member(sk2(X0,X1),X2)
    | member(sk2(X0,X1),difference(X0,X2)) ),
    inference(resolution,[status(thm)],[c6,c18]) ).

cnf(c19,plain,
    ( ~ member(sk2(X0,X1),X1)
    | subset(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(p129,plain,
    ( subset(X0,difference(X0,X1))
    | subset(X0,difference(X0,X1))
    | member(sk2(X0,difference(X0,X1)),X1) ),
    inference(resolution,[status(thm)],[p44,c19]) ).

cnf(p218,plain,
    ( subset(X0,difference(X0,X1))
    | member(sk2(X0,difference(X0,X1)),X1) ),
    inference(factoring,[status(thm)],[p129]) ).

fof(f2,axiom,
    ! [B] : ~ member(B,empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).

fof(f2_nnf,plain,
    ! [B] : ~ member(B,empty_set),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [B] : ~ member(B,empty_set),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c7,plain,
    ~ member(X0,empty_set),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p219,plain,
    subset(X0,difference(X0,empty_set)),
    inference(resolution,[status(thm)],[p218,c7]) ).

cnf(c4,plain,
    ( member(X2,X0)
    | ~ member(X2,difference(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p34,plain,
    ( member(sk2(difference(X0,X1),X2),X0)
    | subset(difference(X0,X1),X2) ),
    inference(resolution,[status(thm)],[c18,c4]) ).

cnf(p81,plain,
    ( subset(difference(X0,X1),X0)
    | subset(difference(X0,X1),X0) ),
    inference(resolution,[status(thm)],[p34,c19]) ).

cnf(p83,plain,
    subset(difference(X0,X1),X0),
    inference(factoring,[status(thm)],[p81]) ).

fof(f3,axiom,
    ! [B,C] :
      ( B = C
    <=> ( subset(C,B)
        & subset(B,C) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).

fof(f3_nnf,plain,
    ! [B,C] :
      ( ( ~ subset(C,B)
        | ~ subset(B,C)
        | B = C )
      & ( ( subset(C,B)
          & subset(B,C) )
        | B != C ) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [B,C] :
      ( ( ~ subset(C,B)
        | ~ subset(B,C)
        | B = C )
      & ( ( subset(C,B)
          & subset(B,C) )
        | B != C ) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c10,plain,
    ( ~ subset(X1,X0)
    | ~ subset(X0,X1)
    | X0 = X1 ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(p84,plain,
    ( ~ subset(X0,difference(X0,X1))
    | difference(X0,X1) = X0 ),
    inference(resolution,[status(thm)],[p83,c10]) ).

cnf(p233,plain,
    difference(X0,empty_set) = X0,
    inference(resolution,[status(thm)],[p219,p84]) ).

fof(f8,conjecture,
    ! [B] : difference(B,empty_set) = B,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th74) ).

fof(f8_neg,negated_conjecture,
    ~ ! [B] : difference(B,empty_set) = B,
    inference(negated_conjecture,[status(cth)],[f8]) ).

fof(f8_nnf,plain,
    ? [B] : difference(B,empty_set) != B,
    inference(nnf_transformation,[status(thm)],[f8_neg]) ).

fof(f8_sk,plain,
    difference(sk4,empty_set) != sk4,
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk4])],[f8_nnf]) ).

cnf(c23,plain,
    difference(sk4,empty_set) != sk4,
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(p234,plain,
    sk4 != sk4,
    inference(demodulation,[status(thm)],[p233,c23]) ).

cnf(p235,plain,
    $false,
    inference(equality_resolution,[status(thm)],[p234]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET603+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/15.38  % Computer : n002.cluster.edu
% 0.10/15.38  % Model    : x86_64 x86_64
% 0.10/15.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/15.38  % Memory   : 8046.5625MB
% 0.10/15.38  % OS       : Linux 6.8.0-71-generic
% 0.10/15.38  % CPULimit : 300
% 0.10/15.38  % WCLimit  : 300
% 0.10/15.38  % DateTime : Thu Sep 24 11:28:06 UTC 2026
% 0.10/15.38  % CPUTime  : 
% 0.10/15.38  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 13.03/17.31  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.03/17.31  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------