↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n001.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:39 PM UTC 2026

% Result   : Unsatisfiable 0.12s 0.39s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   20 (  13 unt;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   24 (  13   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   36 (  36   !;   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] : is_a_theorem(implies(X,implies(not(X),Y))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

fof(f7,negated_conjecture,
    ~ is_a_theorem(implies(a,not(not(a)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

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

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

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

fof(f15,plain,
    ~ is_a_theorem(implies(a,not(not(a)))),
    inference(cnf_transformation,[status(thm)],[f7]) ).

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

fof(f22,plain,
    ! [X0,X1] :
      ( is_a_theorem(X1)
      | ~ is_a_theorem(implies(not(X0),X1))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[f21,f9]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(X1,not(X0)))
      | ~ is_a_theorem(implies(X0,implies(X1,not(X0)))) ),
    inference(resolution,[status(thm)],[f22,f11]) ).

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

fof(f34,plain,
    ! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
    inference(resolution,[status(thm)],[f27,f10]) ).

fof(f253,plain,
    ! [X0] : is_a_theorem(implies(X0,not(not(X0)))),
    inference(resolution,[status(thm)],[f25,f34]) ).

fof(f275,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f15,f253]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL044-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.34  % Computer : n001.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Mon Sep 21 00:07:13 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  % Drodi V4.1.1
% 0.12/0.39  % Refutation found
% 0.12/0.39  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.42  % Elapsed time: 0.063209 seconds
% 0.12/0.42  % CPU time: 0.225063 seconds
% 0.12/0.42  % Total memory used: 39.065 MB
% 0.12/0.42  % Net memory used: 38.356 MB
%------------------------------------------------------------------------------