↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 4.03s 0.94s
% Output   : Proof 4.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   20 (  12 unt;   0 def)
%            Number of atoms       :   42 (   8 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   36 (  14   ~;   8   |;  11   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-4 aty)
%            Number of variables   :   25 (   0 sgn  14   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,conjecture,
    ! [B,C,D] :
      ( ( member(B,D)
        & member(B,C) )
     => intersect(C,D) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th13) ).

fof(f2_neg,negated_conjecture,
    ~ ! [B,C,D] :
        ( ( member(B,D)
          & member(B,C) )
       => intersect(C,D) ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

fof(f2_nnf,plain,
    ? [B,C,D] :
      ( ~ intersect(C,D)
      & member(B,D)
      & member(B,C) ),
    inference(nnf_transformation,[status(thm)],[f2_neg]) ).

fof(f2_sk,plain,
    ( ~ intersect(sk2,sk3)
    & member(sk1,sk3)
    & member(sk1,sk2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk1,sk2,sk3])],[f2_nnf]) ).

cnf(c5,plain,
    member(sk1,sk3),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi5,negated_conjecture,
    member(sk1,sk3) = true,
    inference(equality_encoding,[status(esa)],[c5]) ).

cnf(h0,plain,
    member(sk1,sk3) = true,
    inference(hyper_resolution,[status(thm)],[hi5]) ).

fof(f0,axiom,
    ! [B,C] :
      ( intersect(B,C)
    <=> ? [D] :
          ( member(D,C)
          & member(D,B) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).

fof(f0_nnf,plain,
    ! [B,C] :
      ( ( ! [D] :
            ( ~ member(D,C)
            | ~ member(D,B) )
        | intersect(B,C) )
      & ( ? [D] :
            ( member(D,C)
            & member(D,B) )
        | ~ intersect(B,C) ) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

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

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

cnf(hi2,axiom,
    ifeq(member(X0,X1),true,ifeq(member(X0,X2),true,intersect(X1,X2),true),true) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(c4,plain,
    member(sk1,sk2),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi4,negated_conjecture,
    member(sk1,sk2) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(t0,plain,
    intersect(sk2,sk3) = true,
    inference(hyper_resolution,[status(thm)],[hi2,hi4,h0]) ).

cnf(t11,plain,
    intersect(sk2,sk3) = true,
    inference(orient,[status(thm)],[t0]) ).

cnf(c6,plain,
    ~ intersect(sk2,sk3),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(goal_0,negated_conjecture,
    intersect(sk2,sk3) != true,
    inference(equality_encoding,[status(esa)],[c6]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t11]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET574+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n019.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 11:19:33 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.03/0.94  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.03/0.94  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------