↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n005.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:24 PM UTC 2026

% Result   : Theorem 0.14s 0.40s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   8 unt;   0 def)
%            Number of atoms       :   28 (  27 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   19 (   9   ~;   4   |;   3   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   31 (  25   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ! [A,B,C] :
      ( singleton(A) = unordered_pair(B,C)
     => A = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,conjecture,
    ! [A,B,C] :
      ( singleton(A) = unordered_pair(B,C)
     => B = C ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f6,negated_conjecture,
    ~ ! [A,B,C] :
        ( singleton(A) = unordered_pair(B,C)
       => B = C ),
    inference(negated_conjecture,[status(cth)],[f5]) ).

fof(f7,plain,
    ! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f8,plain,
    ! [A,B,C] :
      ( A = B
      | singleton(A) != unordered_pair(B,C) ),
    inference(pre_NNF_transformation,[status(thm)],[f4]) ).

fof(f9,plain,
    ! [A,B] :
      ( A = B
      | ! [C] : singleton(A) != unordered_pair(B,C) ),
    inference(miniscoping,[status(thm)],[f8]) ).

fof(f10,plain,
    ! [X0,X1,X2] :
      ( X0 = X1
      | singleton(X0) != unordered_pair(X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f9]) ).

fof(f11,plain,
    ? [A,B,C] :
      ( B != C
      & singleton(A) = unordered_pair(B,C) ),
    inference(pre_NNF_transformation,[status(thm)],[f6]) ).

fof(f12,plain,
    ? [B,C] :
      ( B != C
      & ? [A] : singleton(A) = unordered_pair(B,C) ),
    inference(miniscoping,[status(thm)],[f11]) ).

fof(f13,plain,
    ( sK0_skl != sK1_skl
    & singleton(sK2_skl) = unordered_pair(sK0_skl,sK1_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl,sK2_skl]),skolemize(B,sK0_skl),skolemize(C,sK1_skl),skolemize(A,sK2_skl)],[f12]) ).

fof(f14,plain,
    singleton(sK2_skl) = unordered_pair(sK0_skl,sK1_skl),
    inference(cnf_transformation,[status(thm)],[f13]) ).

fof(f15,plain,
    sK0_skl != sK1_skl,
    inference(cnf_transformation,[status(thm)],[f13]) ).

fof(f20,plain,
    ! [X0,X1,X2] :
      ( X0 = X2
      | singleton(X0) != unordered_pair(X1,X2) ),
    inference(paramodulation,[status(thm)],[f7,f10]) ).

fof(f24,plain,
    sK2_skl = sK1_skl,
    inference(resolution,[status(thm)],[f14,f20]) ).

fof(f25,plain,
    sK2_skl = sK0_skl,
    inference(resolution,[status(thm)],[f14,f10]) ).

fof(f29,plain,
    sK0_skl = sK1_skl,
    inference(forward_demodulation,[status(thm)],[f25,f24]) ).

fof(f30,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f29,f15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU150+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n005.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:53:03 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.37  % Drodi V4.1.1
% 0.14/0.40  % Refutation found
% 0.14/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.42  % Elapsed time: 0.048102 seconds
% 0.14/0.42  % CPU time: 0.138176 seconds
% 0.14/0.42  % Total memory used: 66.226 MB
% 0.14/0.42  % Net memory used: 65.626 MB
%------------------------------------------------------------------------------