↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 0.15s 6.01s
% Output   : Proof 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   7 unt;   0 def)
%            Number of atoms       :   47 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   48 (  19   ~;  17   |;   9   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   39 (   2 sgn  22   !;   3   ?)

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

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

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

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

fof(f0,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(f0_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)],[f0]) ).

fof(f0_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)],[f0_nnf]) ).

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

cnf(p8,plain,
    ( member(sk0(difference(X0,X1),X2),X0)
    | subset(difference(X0,X1),X2) ),
    inference(resolution,[status(thm)],[c4,c0]) ).

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

cnf(p14,plain,
    ( subset(difference(X0,X1),X0)
    | subset(difference(X0,X1),X0) ),
    inference(resolution,[status(thm)],[p8,c5]) ).

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

fof(f3,conjecture,
    ! [B,C] : subset(difference(B,C),B),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th49) ).

fof(f3_neg,negated_conjecture,
    ~ ! [B,C] : subset(difference(B,C),B),
    inference(negated_conjecture,[status(cth)],[f3]) ).

fof(f3_nnf,plain,
    ? [B,C] : ~ subset(difference(B,C),B),
    inference(nnf_transformation,[status(thm)],[f3_neg]) ).

fof(f3_sk,plain,
    ~ subset(difference(sk1,sk2),sk1),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk1,sk2])],[f3_nnf]) ).

cnf(c7,plain,
    ~ subset(difference(sk1,sk2),sk1),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

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

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