↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n010.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 01:06:48 PM UTC 2026

% Result   : Unsatisfiable 0.09s 0.40s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (  17 unt;   0 def)
%            Number of atoms       :   34 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  12   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   77 (  77   !;   0   ?)

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

fof(f2,axiom,
    ! [X,Y,Z,U] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U),U)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [X,Y,Z,U] : is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(equivalent(Y,Z),equivalent(Y,U)),equivalent(Z,U)),X))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,plain,
    ! [Y] :
      ( is_a_theorem(Y)
      | ! [X] :
          ( ~ is_a_theorem(X)
          | ~ is_a_theorem(equivalent(X,Y)) ) ),
    inference(miniscoping,[status(thm)],[f1]) ).

fof(f6,plain,
    ! [X0,X1] :
      ( is_a_theorem(X1)
      | ~ is_a_theorem(X0)
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f7,plain,
    ! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f8,plain,
    ! [X0,X1,X2,X3] : is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X0))),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f9,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f10,plain,
    ! [X0,X1,X2,X3] :
      ( is_a_theorem(X3)
      | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3)) ),
    inference(resolution,[status(thm)],[f7,f6]) ).

fof(f11,plain,
    ! [X0,X1,X2,X3] :
      ( is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X0))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[status(thm)],[f8,f6]) ).

fof(f12,plain,
    ! [X0,X1,X2,X3,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X5)),equivalent(X4,X5)))),
    inference(resolution,[status(thm)],[f10,f8]) ).

fof(f14,plain,
    ! [X0,X1,X2,X3,X4,X5,X6] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),equivalent(X3,equivalent(equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),equivalent(X5,X6)),X3)))),
    inference(resolution,[status(thm)],[f11,f8]) ).

fof(f15,plain,
    ! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
    inference(resolution,[status(thm)],[f12,f10]) ).

fof(f32,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(equivalent(X1,X2))
      | ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X2))) ),
    inference(resolution,[status(thm)],[f15,f6]) ).

fof(f38,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
    inference(resolution,[status(thm)],[f32,f12]) ).

fof(f41,plain,
    ! [X0,X1,X2,X3,X4,X5] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),equivalent(equivalent(X5,X0),equivalent(X5,X1))))),
    inference(resolution,[status(thm)],[f14,f32]) ).

fof(f49,plain,
    ! [X0] : is_a_theorem(equivalent(X0,X0)),
    inference(resolution,[status(thm)],[f38,f32]) ).

fof(f55,plain,
    ! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),equivalent(X3,X3))),
    inference(resolution,[status(thm)],[f49,f11]) ).

fof(f67,plain,
    ! [X0,X1,X2] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
    inference(resolution,[status(thm)],[f55,f32]) ).

fof(f74,plain,
    ! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3)))),
    inference(resolution,[status(thm)],[f67,f10]) ).

fof(f116,plain,
    ! [X0,X1,X2,X3] :
      ( is_a_theorem(equivalent(X0,equivalent(X2,X3)))
      | ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3)))) ),
    inference(resolution,[status(thm)],[f74,f6]) ).

fof(f253,plain,
    ! [X0,X1,X2,X3] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))),
    inference(resolution,[status(thm)],[f41,f116]) ).

fof(f545,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f9,f253]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL101-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n010.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 00:05:11 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.09/0.40  % Refutation found
% 0.09/0.40  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.45  % Elapsed time: 0.070659 seconds
% 0.09/0.45  % CPU time: 0.282381 seconds
% 0.09/0.45  % Total memory used: 38.775 MB
% 0.09/0.45  % Net memory used: 38.358 MB
%------------------------------------------------------------------------------