↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : LCL042-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 : n015.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 54.55s 7.66s
% Output   : CNFRefutation 56.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   31 (  16 unt;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   48 (  26   ~;  22   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   65 (  65   !;   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(f5,axiom,
    ! [Y,Z,X] : is_a_theorem(implies(implies(Y,Z),implies(implies(X,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(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
    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(f13,plain,
    ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
    inference(cnf_transformation,[status(thm)],[f5]) ).

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(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
    inference(cnf_transformation,[status(thm)],[f7]) ).

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

fof(f21,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(f22,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(implies(implies(X2,X0),implies(X2,X1)))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[f13,f9]) ).

fof(f26,plain,
    ! [X0,X1,X2] :
      ( ~ is_a_theorem(implies(X0,X2))
      | is_a_theorem(implies(X0,implies(X1,X2))) ),
    inference(resolution,[status(thm)],[f21,f16]) ).

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

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

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

fof(f86,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(f89,plain,
    ! [X0,X1] :
      ( is_a_theorem(X1)
      | ~ is_a_theorem(implies(not(X0),X1))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[f86,f9]) ).

fof(f122,plain,
    ! [X0,X1,X2] :
      ( ~ is_a_theorem(implies(not(X0),X2))
      | is_a_theorem(implies(X1,X2))
      | ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
    inference(resolution,[status(thm)],[f89,f26]) ).

fof(f143,plain,
    ! [X0,X1,X2] :
      ( is_a_theorem(implies(not(X0),X2))
      | ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
    inference(resolution,[status(thm)],[f49,f54]) ).

fof(f514,plain,
    ! [X0,X1,X2] :
      ( ~ is_a_theorem(implies(X1,X2))
      | ~ is_a_theorem(implies(not(X0),X2))
      | is_a_theorem(implies(implies(X0,X1),X2)) ),
    inference(resolution,[status(thm)],[f122,f47]) ).

fof(f590,plain,
    ! [X0,X1,X2] : is_a_theorem(implies(not(X0),implies(X1,implies(X0,X2)))),
    inference(resolution,[status(thm)],[f143,f12]) ).

fof(f9959,plain,
    ( ~ is_a_theorem(implies(implies(b,c),implies(implies(a,b),implies(a,c))))
    | ~ is_a_theorem(implies(not(a),implies(implies(a,b),implies(a,c)))) ),
    inference(resolution,[status(thm)],[f514,f15]) ).

fof(f10045,plain,
    ~ is_a_theorem(implies(implies(b,c),implies(implies(a,b),implies(a,c)))),
    inference(forward_subsumption_resolution,[status(thm)],[f9959,f590]) ).

fof(f10860,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f10045,f13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL042-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n015.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:07 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 54.55/7.66  % Refutation found
% 54.55/7.66  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 54.55/7.66  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 5.87/7.75  % Elapsed time: 7.370553 seconds
% 5.87/7.75  % CPU time: 57.711816 seconds
% 5.87/7.75  % Total memory used: 391.952 MB
% 5.87/7.75  % Net memory used: 325.736 MB
%------------------------------------------------------------------------------