↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n007.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:32 PM UTC 2026

% Result   : Theorem 3.10s 0.89s
% Output   : Proof 3.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   31 (  15 unt;   0 def)
%            Number of atoms       :   62 (  11 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   52 (  21   ~;  15   |;   8   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-4 aty)
%            Number of variables   :   62 (   4 sgn  38   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f13,axiom,
    ! [A,B,C] :
      ( relation_of2_as_subset(C,A,B)
     => ( subset(relation_rng(C),B)
        & subset(relation_dom(C),A) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_relset_1) ).

fof(f13_nnf,plain,
    ! [A,B,C] :
      ( ( subset(relation_rng(C),B)
        & subset(relation_dom(C),A) )
      | ~ relation_of2_as_subset(C,A,B) ),
    inference(nnf_transformation,[status(thm)],[f13]) ).

fof(f13_sk,plain,
    ! [C,A,B] :
      ( ( subset(relation_rng(C),B)
        & subset(relation_dom(C),A) )
      | ~ relation_of2_as_subset(C,A,B) ),
    inference(skolemisation,[status(esa)],[f13_nnf]) ).

cnf(c15,plain,
    ( subset(relation_rng(X2),X1)
    | ~ relation_of2_as_subset(X2,X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(hi9,axiom,
    ifeq(relation_of2_as_subset(X0,X1,X2),true,subset(relation_rng(X0),X2),true) = true,
    inference(equality_encoding,[status(esa)],[c15]) ).

fof(f15,conjecture,
    ! [A,B,C,D] :
      ( relation_of2_as_subset(D,C,A)
     => ( subset(A,B)
       => relation_of2_as_subset(D,C,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_relset_1) ).

fof(f15_neg,negated_conjecture,
    ~ ! [A,B,C,D] :
        ( relation_of2_as_subset(D,C,A)
       => ( subset(A,B)
         => relation_of2_as_subset(D,C,B) ) ),
    inference(negated_conjecture,[status(cth)],[f15]) ).

fof(f15_nnf,plain,
    ? [A,B,C,D] :
      ( ~ relation_of2_as_subset(D,C,B)
      & subset(A,B)
      & relation_of2_as_subset(D,C,A) ),
    inference(nnf_transformation,[status(thm)],[f15_neg]) ).

fof(f15_sk,plain,
    ( ~ relation_of2_as_subset(sk6,sk5,sk4)
    & subset(sk3,sk4)
    & relation_of2_as_subset(sk6,sk5,sk3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk3,sk4,sk5,sk6])],[f15_nnf]) ).

cnf(c17,plain,
    relation_of2_as_subset(sk6,sk5,sk3),
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

cnf(hi11,negated_conjecture,
    relation_of2_as_subset(sk6,sk5,sk3) = true,
    inference(equality_encoding,[status(esa)],[c17]) ).

cnf(h0,plain,
    subset(relation_rng(sk6),sk3) = true,
    inference(hyper_resolution,[status(thm)],[hi9,hi11]) ).

fof(f16,axiom,
    ! [A,B,C] :
      ( ( subset(B,C)
        & subset(A,B) )
     => subset(A,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).

fof(f16_nnf,plain,
    ! [A,B,C] :
      ( subset(A,C)
      | ~ subset(B,C)
      | ~ subset(A,B) ),
    inference(nnf_transformation,[status(thm)],[f16]) ).

fof(f16_sk,plain,
    ! [A,B,C] :
      ( subset(A,C)
      | ~ subset(B,C)
      | ~ subset(A,B) ),
    inference(skolemisation,[status(esa)],[f16_nnf]) ).

cnf(c20,plain,
    ( subset(X0,X2)
    | ~ subset(X1,X2)
    | ~ subset(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f16_sk]) ).

cnf(hi13,axiom,
    ifeq(subset(X0,X1),true,ifeq(subset(X1,X2),true,subset(X0,X2),true),true) = true,
    inference(equality_encoding,[status(esa)],[c20]) ).

cnf(c18,plain,
    subset(sk3,sk4),
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

cnf(hi12,negated_conjecture,
    subset(sk3,sk4) = true,
    inference(equality_encoding,[status(esa)],[c18]) ).

cnf(h1,plain,
    subset(relation_rng(sk6),sk4) = true,
    inference(hyper_resolution,[status(thm)],[hi13,h0,hi12]) ).

fof(f14,axiom,
    ! [A,B,C,D] :
      ( relation_of2_as_subset(D,C,A)
     => ( subset(relation_rng(D),B)
       => relation_of2_as_subset(D,C,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_relset_1) ).

fof(f14_nnf,plain,
    ! [A,B,C,D] :
      ( relation_of2_as_subset(D,C,B)
      | ~ subset(relation_rng(D),B)
      | ~ relation_of2_as_subset(D,C,A) ),
    inference(nnf_transformation,[status(thm)],[f14]) ).

fof(f14_sk,plain,
    ! [D,C,A,B] :
      ( relation_of2_as_subset(D,C,B)
      | ~ subset(relation_rng(D),B)
      | ~ relation_of2_as_subset(D,C,A) ),
    inference(skolemisation,[status(esa)],[f14_nnf]) ).

cnf(c16,plain,
    ( relation_of2_as_subset(X3,X2,X1)
    | ~ subset(relation_rng(X3),X1)
    | ~ relation_of2_as_subset(X3,X2,X0) ),
    inference(cnf_transformation,[status(esa)],[f14_sk]) ).

cnf(hi10,axiom,
    ifeq(relation_of2_as_subset(X0,X1,X2),true,ifeq(subset(relation_rng(X0),X3),true,relation_of2_as_subset(X0,X1,X3),true),true) = true,
    inference(equality_encoding,[status(esa)],[c16]) ).

cnf(t4,plain,
    relation_of2_as_subset(sk6,sk5,sk4) = true,
    inference(hyper_resolution,[status(thm)],[hi10,hi11,h1]) ).

cnf(t52,plain,
    relation_of2_as_subset(sk6,sk5,sk4) = true,
    inference(orient,[status(thm)],[t4]) ).

cnf(c19,plain,
    ~ relation_of2_as_subset(sk6,sk5,sk4),
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

cnf(goal_0,negated_conjecture,
    relation_of2_as_subset(sk6,sk5,sk4) != true,
    inference(equality_encoding,[status(esa)],[c19]) ).

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

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

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