↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : LCL065-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 : n009.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:43 PM UTC 2026

% Result   : Unsatisfiable 0.12s 0.50s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   30 (  21 unt;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  14   ~;  12   |;   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   :   61 (  61   !;   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(Y,X))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

fof(f5,negated_conjecture,
    ~ is_a_theorem(implies(implies(not(a),a),a)),
    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] : is_a_theorem(implies(X0,implies(X1,X0))),
    inference(cnf_transformation,[status(thm)],[f2]) ).

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

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

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

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

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

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

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

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

fof(f23,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(X0,X0))),
    inference(resolution,[status(thm)],[f16,f8]) ).

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

fof(f30,plain,
    ! [X0] : is_a_theorem(implies(X0,X0)),
    inference(resolution,[status(thm)],[f25,f13]) ).

fof(f35,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X1))),
    inference(resolution,[status(thm)],[f30,f12]) ).

fof(f39,plain,
    ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,implies(not(X1),not(X2))),implies(X0,implies(X2,X1)))),
    inference(resolution,[status(thm)],[f19,f16]) ).

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

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

fof(f126,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
    inference(resolution,[status(thm)],[f46,f35]) ).

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

fof(f262,plain,
    ! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
    inference(resolution,[status(thm)],[f67,f8]) ).

fof(f274,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(not(X0),X0),implies(not(X0),X1))),
    inference(resolution,[status(thm)],[f262,f16]) ).

fof(f2613,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(not(X0),X0),implies(X1,X0))),
    inference(resolution,[status(thm)],[f274,f67]) ).

fof(f2712,plain,
    ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
    inference(resolution,[status(thm)],[f2613,f197]) ).

fof(f2752,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f11,f2712]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL065-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.35  % Computer : n009.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 00:03:12 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.36  % Drodi V4.1.1
% 0.12/0.50  % Refutation found
% 0.12/0.50  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.50  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.53  % Elapsed time: 0.173430 seconds
% 0.12/0.53  % CPU time: 0.981631 seconds
% 0.12/0.53  % Total memory used: 70.440 MB
% 0.12/0.53  % Net memory used: 68.298 MB
%------------------------------------------------------------------------------