↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : LCL362-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox/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:07:29 PM UTC 2026

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

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

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

fof(f3,axiom,
    ! [X] : is_a_theorem(implies(implies(not(X),X),X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ! [X,Y] : is_a_theorem(implies(X,implies(not(X),Y))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,negated_conjecture,
    ~ is_a_theorem(implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

fof(f8,plain,
    ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f9,plain,
    ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f10,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f11,plain,
    ~ is_a_theorem(implies(implies(x,implies(implies(not(y),y),y)),implies(implies(not(y),y),y))),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f12,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[f8,f7]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(not(X0),X1))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[status(thm)],[f10,f7]) ).

fof(f15,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(implies(X0,X2))
      | ~ is_a_theorem(implies(X1,X2))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[f12,f7]) ).

fof(f19,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(X0,implies(implies(not(y),y),y)))
      | ~ is_a_theorem(implies(implies(x,implies(implies(not(y),y),y)),X0)) ),
    inference(resolution,[status(thm)],[f15,f11]) ).

fof(f27,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(X0,x))
      | ~ is_a_theorem(implies(implies(X0,implies(implies(not(y),y),y)),implies(implies(not(y),y),y))) ),
    inference(resolution,[status(thm)],[f19,f12]) ).

fof(f40,plain,
    ~ is_a_theorem(implies(not(implies(implies(not(y),y),y)),x)),
    inference(resolution,[status(thm)],[f27,f9]) ).

fof(f44,plain,
    ~ is_a_theorem(implies(implies(not(y),y),y)),
    inference(resolution,[status(thm)],[f40,f14]) ).

fof(f46,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f44,f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL362-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.42  % Computer : n010.cluster.edu
% 0.17/0.42  % Model    : x86_64 x86_64
% 0.17/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42  % Memory   : 8046.5625MB
% 0.17/0.42  % OS       : Linux 6.8.0-71-generic
% 0.17/0.42  % CPULimit : 300
% 0.17/0.42  % WCLimit  : 300
% 0.17/0.42  % DateTime : Mon Sep 21 00:24:11 UTC 2026
% 0.17/0.42  % CPUTime  : 
% 0.17/0.43  % Drodi V4.1.1
% 0.17/0.46  % Refutation found
% 0.17/0.46  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.17/0.46  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.51  % Elapsed time: 0.076782 seconds
% 0.17/0.51  % CPU time: 0.145354 seconds
% 0.17/0.51  % Total memory used: 25.083 MB
% 0.17/0.51  % Net memory used: 24.830 MB
%------------------------------------------------------------------------------