↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SET081+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% 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 : Thu Sep 24 02:09:14 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [U,X,Y] :
      ( member(U,unordered_pair(X,Y))
    <=> ( ( U = Y
          | U = X )
        & member(U,universal_class) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f6,axiom,
    ! [X] : singleton(X) = unordered_pair(X,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f44,conjecture,
    ! [X,Y] :
      ( member(Y,singleton(X))
     => Y = X ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f45,negated_conjecture,
    ~ ! [X,Y] :
        ( member(Y,singleton(X))
       => Y = X ),
    inference(negated_conjecture,[status(cth)],[f44]) ).

fof(f59,plain,
    ! [U,X,Y] :
      ( ( ( U != Y
          & U != X )
        | ~ member(U,universal_class)
        | member(U,unordered_pair(X,Y)) )
      & ( ( ( U = Y
            | U = X )
          & member(U,universal_class) )
        | ~ member(U,unordered_pair(X,Y)) ) ),
    inference(NNF_transformation,[status(thm)],[f4]) ).

fof(f60,plain,
    ( ! [U,X,Y] :
        ( ( U != Y
          & U != X )
        | ~ member(U,universal_class)
        | member(U,unordered_pair(X,Y)) )
    & ! [U,X,Y] :
        ( ( ( U = Y
            | U = X )
          & member(U,universal_class) )
        | ~ member(U,unordered_pair(X,Y)) ) ),
    inference(miniscoping,[status(thm)],[f59]) ).

fof(f62,plain,
    ! [X0,X1,X2] :
      ( X0 = X2
      | X0 = X1
      | ~ member(X0,unordered_pair(X1,X2)) ),
    inference(cnf_transformation,[status(thm)],[f60]) ).

fof(f66,plain,
    ! [X0] : singleton(X0) = unordered_pair(X0,X0),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f191,plain,
    ? [X,Y] :
      ( Y != X
      & member(Y,singleton(X)) ),
    inference(pre_NNF_transformation,[status(thm)],[f45]) ).

fof(f192,plain,
    ( sK8_skl != sK7_skl
    & member(sK8_skl,singleton(sK7_skl)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK7_skl,sK8_skl]),skolemize(X,sK7_skl),skolemize(Y,sK8_skl)],[f191]) ).

fof(f193,plain,
    member(sK8_skl,singleton(sK7_skl)),
    inference(cnf_transformation,[status(thm)],[f192]) ).

fof(f194,plain,
    sK8_skl != sK7_skl,
    inference(cnf_transformation,[status(thm)],[f192]) ).

fof(f210,plain,
    ! [X0,X1] :
      ( X0 = X1
      | X0 = X1
      | ~ member(X0,singleton(X1)) ),
    inference(paramodulation,[status(thm)],[f66,f62]) ).

fof(f211,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ~ member(X0,singleton(X1)) ),
    inference(duplicate_literals_removal,[status(thm)],[f210]) ).

fof(f234,plain,
    sK8_skl = sK7_skl,
    inference(resolution,[status(thm)],[f211,f193]) ).

fof(f236,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f234,f194]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET081+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n019.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 04:50:52 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.39  % Drodi V4.1.1
% 0.10/0.39  % Refutation found
% 0.10/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.42  % Elapsed time: 0.036992 seconds
% 0.10/0.42  % CPU time: 0.081009 seconds
% 0.10/0.42  % Total memory used: 9.870 MB
% 0.10/0.42  % Net memory used: 9.861 MB
%------------------------------------------------------------------------------