↑ Up

Drodi---4.1.1.UNS-CRf.s

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

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [X,Y] :
      ( X = Y
      | there_exists(f1(X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f16,axiom,
    ! [X,Y] :
      ( X = Y
      | Y = f1(X,Y)
      | X = f1(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f18,hypothesis,
    ! [Z] :
      ( b = Z
      | a != Z
      | ~ there_exists(Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f19,hypothesis,
    ! [Z] :
      ( b != Z
      | a = Z
      | ~ there_exists(Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f20,negated_conjecture,
    a != b,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f39,plain,
    ! [X0,X1] :
      ( X0 = X1
      | there_exists(f1(X0,X1)) ),
    inference(cnf_transformation,[status(thm)],[f15]) ).

fof(f40,plain,
    ! [X0,X1] :
      ( X0 = X1
      | X1 = f1(X0,X1)
      | X0 = f1(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f16]) ).

fof(f42,plain,
    ! [X0] :
      ( b = X0
      | a != X0
      | ~ there_exists(X0) ),
    inference(cnf_transformation,[status(thm)],[f18]) ).

fof(f43,plain,
    ! [X0] :
      ( b != X0
      | a = X0
      | ~ there_exists(X0) ),
    inference(cnf_transformation,[status(thm)],[f19]) ).

fof(f44,plain,
    a != b,
    inference(cnf_transformation,[status(thm)],[f20]) ).

fof(f48,plain,
    ( b = a
    | ~ there_exists(a) ),
    inference(destructive_equality_resolution,[status(thm)],[f42]) ).

fof(f49,plain,
    ( a = b
    | ~ there_exists(b) ),
    inference(destructive_equality_resolution,[status(thm)],[f43]) ).

fof(f50,plain,
    ~ there_exists(a),
    inference(forward_subsumption_resolution,[status(thm)],[f48,f44]) ).

fof(f51,plain,
    ~ there_exists(b),
    inference(forward_subsumption_resolution,[status(thm)],[f49,f44]) ).

fof(f82,plain,
    ! [X0,X1] :
      ( X1 = X0
      | X1 = f1(X1,X0)
      | X1 = X0
      | there_exists(X0) ),
    inference(paramodulation,[status(thm)],[f40,f39]) ).

fof(f84,plain,
    ! [X0,X1] :
      ( X1 = f1(X1,X0)
      | X1 = X0
      | there_exists(X0) ),
    inference(duplicate_literals_removal,[status(thm)],[f82]) ).

fof(f90,plain,
    ! [X0] :
      ( X0 = f1(X0,b)
      | X0 = b ),
    inference(resolution,[status(thm)],[f84,f51]) ).

fof(f95,plain,
    ! [X0] :
      ( X0 = b
      | X0 = b
      | there_exists(X0) ),
    inference(paramodulation,[status(thm)],[f90,f39]) ).

fof(f98,plain,
    ! [X0] :
      ( X0 = b
      | there_exists(X0) ),
    inference(duplicate_literals_removal,[status(thm)],[f95]) ).

fof(f105,plain,
    a = b,
    inference(resolution,[status(thm)],[f98,f50]) ).

fof(f107,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f105,f44]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CAT019-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n016.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 14:01:08 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.13/0.38  % Drodi V4.1.1
% 0.13/0.38  % Refutation found
% 0.13/0.38  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.40  % Elapsed time: 0.032533 seconds
% 0.13/0.40  % CPU time: 0.071336 seconds
% 0.13/0.40  % Total memory used: 9.617 MB
% 0.13/0.40  % Net memory used: 9.590 MB
%------------------------------------------------------------------------------