↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n020.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:11 PM UTC 2026

% Result   : Theorem 0.11s 5.76s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   26 (  11 unt;   0 def)
%            Number of atoms       :   67 (  33 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   61 (  20   ~;  18   |;  20   &)
%                                         (   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;   4 con; 0-2 aty)
%            Number of variables   :   32 (  26   !;   6   ?)

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

fof(f44,conjecture,
    ! [X,Y,Z] :
      ( ( unordered_pair(X,Z) = unordered_pair(Y,Z)
        & member(Y,universal_class)
        & member(X,universal_class) )
     => X = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f45,negated_conjecture,
    ~ ! [X,Y,Z] :
        ( ( unordered_pair(X,Z) = unordered_pair(Y,Z)
          & member(Y,universal_class)
          & member(X,universal_class) )
       => X = Y ),
    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(f63,plain,
    ! [X0,X1,X2] :
      ( X0 != X1
      | ~ member(X0,universal_class)
      | member(X0,unordered_pair(X1,X2)) ),
    inference(cnf_transformation,[status(thm)],[f60]) ).

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

fof(f192,plain,
    ? [X,Y] :
      ( X != Y
      & ? [Z] : unordered_pair(X,Z) = unordered_pair(Y,Z)
      & member(Y,universal_class)
      & member(X,universal_class) ),
    inference(miniscoping,[status(thm)],[f191]) ).

fof(f193,plain,
    ( sK7_skl != sK8_skl
    & unordered_pair(sK7_skl,sK9_skl) = unordered_pair(sK8_skl,sK9_skl)
    & member(sK8_skl,universal_class)
    & member(sK7_skl,universal_class) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK7_skl,sK8_skl,sK9_skl]),skolemize(X,sK7_skl),skolemize(Y,sK8_skl),skolemize(Z,sK9_skl)],[f192]) ).

fof(f194,plain,
    member(sK7_skl,universal_class),
    inference(cnf_transformation,[status(thm)],[f193]) ).

fof(f195,plain,
    member(sK8_skl,universal_class),
    inference(cnf_transformation,[status(thm)],[f193]) ).

fof(f196,plain,
    unordered_pair(sK7_skl,sK9_skl) = unordered_pair(sK8_skl,sK9_skl),
    inference(cnf_transformation,[status(thm)],[f193]) ).

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

fof(f200,plain,
    ! [X0,X1] :
      ( ~ member(X0,universal_class)
      | member(X0,unordered_pair(X0,X1)) ),
    inference(destructive_equality_resolution,[status(thm)],[f63]) ).

fof(f207,plain,
    ( ~ member(sK8_skl,universal_class)
    | member(sK8_skl,unordered_pair(sK7_skl,sK9_skl)) ),
    inference(paramodulation,[status(thm)],[f196,f200]) ).

fof(f210,plain,
    member(sK8_skl,unordered_pair(sK7_skl,sK9_skl)),
    inference(forward_subsumption_resolution,[status(thm)],[f207,f195]) ).

fof(f213,plain,
    ( sK8_skl = sK9_skl
    | sK8_skl = sK7_skl ),
    inference(resolution,[status(thm)],[f210,f62]) ).

fof(f214,plain,
    sK8_skl = sK9_skl,
    inference(forward_subsumption_resolution,[status(thm)],[f213,f197]) ).

fof(f216,plain,
    unordered_pair(sK7_skl,sK9_skl) = unordered_pair(sK9_skl,sK9_skl),
    inference(backward_demodulation,[status(thm)],[f214,f196]) ).

fof(f218,plain,
    sK7_skl != sK9_skl,
    inference(backward_demodulation,[status(thm)],[f214,f197]) ).

fof(f220,plain,
    ( ~ member(sK7_skl,universal_class)
    | member(sK7_skl,unordered_pair(sK9_skl,sK9_skl)) ),
    inference(paramodulation,[status(thm)],[f216,f200]) ).

fof(f223,plain,
    member(sK7_skl,unordered_pair(sK9_skl,sK9_skl)),
    inference(forward_subsumption_resolution,[status(thm)],[f220,f194]) ).

fof(f226,plain,
    ( sK7_skl = sK9_skl
    | sK7_skl = sK9_skl ),
    inference(resolution,[status(thm)],[f223,f62]) ).

fof(f227,plain,
    sK7_skl = sK9_skl,
    inference(duplicate_literals_removal,[status(thm)],[f226]) ).

fof(f228,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f227,f218]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.22  % Problem  : SET072+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.23  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/5.73  % Computer : n020.cluster.edu
% 0.11/5.73  % Model    : x86_64 x86_64
% 0.11/5.73  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.73  % Memory   : 8046.5625MB
% 0.11/5.73  % OS       : Linux 6.8.0-71-generic
% 0.11/5.73  % CPULimit : 300
% 0.11/5.73  % WCLimit  : 300
% 0.11/5.73  % DateTime : Mon Sep 21 04:51:23 UTC 2026
% 0.11/5.73  % CPUTime  : 
% 0.11/5.74  % Drodi V4.1.1
% 0.11/5.76  % Refutation found
% 0.11/5.76  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/5.76  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/5.79  % Elapsed time: 0.052648 seconds
% 0.11/5.79  % CPU time: 0.147166 seconds
% 0.11/5.79  % Total memory used: 91.593 MB
% 0.11/5.79  % Net memory used: 91.520 MB
%------------------------------------------------------------------------------