↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SEU139+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n017.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 : Thu Sep 24 02:19:21 PM UTC 2026

% Result   : Theorem 0.14s 0.39s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (   7 unt;   0 def)
%            Number of atoms       :   54 (  14 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   56 (  23   ~;  17   |;  14   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   29 (  27   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [A,B] :
      ( A = B
    <=> ( subset(B,A)
        & subset(A,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f50,conjecture,
    ! [A,B] :
      ~ ( proper_subset(B,A)
        & subset(A,B) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f51,negated_conjecture,
    ~ ! [A,B] :
        ~ ( proper_subset(B,A)
          & subset(A,B) ),
    inference(negated_conjecture,[status(cth)],[f50]) ).

fof(f63,plain,
    ! [A,B] :
      ( ( ~ subset(B,A)
        | ~ subset(A,B)
        | A = B )
      & ( ( subset(B,A)
          & subset(A,B) )
        | A != B ) ),
    inference(NNF_transformation,[status(thm)],[f5]) ).

fof(f64,plain,
    ( ! [A,B] :
        ( ~ subset(B,A)
        | ~ subset(A,B)
        | A = B )
    & ! [A,B] :
        ( ( subset(B,A)
          & subset(A,B) )
        | A != B ) ),
    inference(miniscoping,[status(thm)],[f63]) ).

fof(f67,plain,
    ! [X0,X1] :
      ( ~ subset(X1,X0)
      | ~ subset(X0,X1)
      | X0 = X1 ),
    inference(cnf_transformation,[status(thm)],[f64]) ).

fof(f111,plain,
    ! [A,B] :
      ( ( A = B
        | ~ subset(A,B)
        | proper_subset(A,B) )
      & ( ( A != B
          & subset(A,B) )
        | ~ proper_subset(A,B) ) ),
    inference(NNF_transformation,[status(thm)],[f12]) ).

fof(f112,plain,
    ( ! [A,B] :
        ( A = B
        | ~ subset(A,B)
        | proper_subset(A,B) )
    & ! [A,B] :
        ( ( A != B
          & subset(A,B) )
        | ~ proper_subset(A,B) ) ),
    inference(miniscoping,[status(thm)],[f111]) ).

fof(f113,plain,
    ! [X0,X1] :
      ( subset(X0,X1)
      | ~ proper_subset(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f112]) ).

fof(f114,plain,
    ! [X0,X1] :
      ( X0 != X1
      | ~ proper_subset(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f112]) ).

fof(f190,plain,
    ? [A,B] :
      ( proper_subset(B,A)
      & subset(A,B) ),
    inference(pre_NNF_transformation,[status(thm)],[f51]) ).

fof(f191,plain,
    ( proper_subset(sK11_skl,sK10_skl)
    & subset(sK10_skl,sK11_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK10_skl,sK11_skl]),skolemize(A,sK10_skl),skolemize(B,sK11_skl)],[f190]) ).

fof(f192,plain,
    subset(sK10_skl,sK11_skl),
    inference(cnf_transformation,[status(thm)],[f191]) ).

fof(f193,plain,
    proper_subset(sK11_skl,sK10_skl),
    inference(cnf_transformation,[status(thm)],[f191]) ).

fof(f217,plain,
    ! [X0] : ~ proper_subset(X0,X0),
    inference(destructive_equality_resolution,[status(thm)],[f114]) ).

fof(f219,plain,
    ( ~ subset(sK11_skl,sK10_skl)
    | sK11_skl = sK10_skl ),
    inference(resolution,[status(thm)],[f67,f192]) ).

fof(f231,plain,
    subset(sK11_skl,sK10_skl),
    inference(resolution,[status(thm)],[f113,f193]) ).

fof(f232,plain,
    sK11_skl = sK10_skl,
    inference(backward_subsumption_resolution,[status(thm)],[f219,f231]) ).

fof(f237,plain,
    proper_subset(sK10_skl,sK10_skl),
    inference(backward_demodulation,[status(thm)],[f232,f193]) ).

fof(f239,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f237,f217]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU139+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n017.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 05:47:41 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.14/0.38  % Drodi V4.1.1
% 0.14/0.39  % Refutation found
% 0.14/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.41  % Elapsed time: 0.038949 seconds
% 0.14/0.41  % CPU time: 0.072637 seconds
% 0.14/0.41  % Total memory used: 9.774 MB
% 0.14/0.41  % Net memory used: 9.770 MB
%------------------------------------------------------------------------------