↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n008.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:05 PM UTC 2026

% Result   : Unsatisfiable 0.09s 0.38s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (  12 unt;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   36 (  20   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   39 (  39   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [A] : axiom(or(not(or(A,A)),A)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f6,axiom,
    ! [X] :
      ( ~ axiom(X)
      | theorem(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f7,axiom,
    ! [X,Y] :
      ( ~ theorem(Y)
      | ~ axiom(or(not(Y),X))
      | theorem(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f8,axiom,
    ! [X,Z,Y] :
      ( ~ theorem(or(not(Y),Z))
      | ~ axiom(or(not(X),Y))
      | theorem(or(not(X),Z)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f9,negated_conjecture,
    ~ theorem(or(not(or(q,or(p,q))),or(p,q))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f10,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f13,plain,
    ! [X0,X1,X2] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(cnf_transformation,[status(thm)],[f4]) ).

fof(f14,plain,
    ! [X0,X1,X2] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(cnf_transformation,[status(thm)],[f5]) ).

fof(f15,plain,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f16,plain,
    ! [Y] :
      ( ~ theorem(Y)
      | ! [X] :
          ( ~ axiom(or(not(Y),X))
          | theorem(X) ) ),
    inference(miniscoping,[status(thm)],[f7]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ~ theorem(X1)
      | ~ axiom(or(not(X1),X0))
      | theorem(X0) ),
    inference(cnf_transformation,[status(thm)],[f16]) ).

fof(f18,plain,
    ! [Z,Y] :
      ( ~ theorem(or(not(Y),Z))
      | ! [X] :
          ( ~ axiom(or(not(X),Y))
          | theorem(or(not(X),Z)) ) ),
    inference(miniscoping,[status(thm)],[f8]) ).

fof(f19,plain,
    ! [X0,X1,X2] :
      ( ~ theorem(or(not(X2),X1))
      | ~ axiom(or(not(X0),X2))
      | theorem(or(not(X0),X1)) ),
    inference(cnf_transformation,[status(thm)],[f18]) ).

fof(f20,plain,
    ~ theorem(or(not(or(q,or(p,q))),or(p,q))),
    inference(cnf_transformation,[status(thm)],[f9]) ).

fof(f23,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[status(thm)],[f10,f15]) ).

fof(f32,plain,
    ! [X0,X1,X2,X3] :
      ( ~ theorem(or(not(or(X1,or(X0,X2))),X3))
      | theorem(or(not(or(X0,or(X1,X2))),X3)) ),
    inference(resolution,[status(thm)],[f13,f19]) ).

fof(f36,plain,
    ! [X0,X1,X2] :
      ( ~ theorem(or(not(X1),X2))
      | theorem(or(not(or(X0,X1)),or(X0,X2))) ),
    inference(resolution,[status(thm)],[f14,f17]) ).

fof(f66,plain,
    ~ theorem(or(not(or(p,or(q,q))),or(p,q))),
    inference(resolution,[status(thm)],[f32,f20]) ).

fof(f108,plain,
    ~ theorem(or(not(or(q,q)),q)),
    inference(resolution,[status(thm)],[f36,f66]) ).

fof(f113,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f108,f23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL197-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n008.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:11:24 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.09/0.38  % Refutation found
% 0.09/0.38  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.09/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.41  % Elapsed time: 0.037055 seconds
% 0.14/0.41  % CPU time: 0.087912 seconds
% 0.14/0.41  % Total memory used: 11.337 MB
% 0.14/0.41  % Net memory used: 11.285 MB
%------------------------------------------------------------------------------