↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n026.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:13 PM UTC 2026

% Result   : Unsatisfiable 6.77s 1.43s
% Output   : CNFRefutation 6.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   43 (  19 unt;   0 def)
%            Number of atoms       :   75 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   70 (  38   ~;  32   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   85 (  85   !;   0   ?)

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

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

fof(f3,axiom,
    ! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p') ).

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

fof(f7,axiom,
    ! [X,Y] :
      ( ~ theorem(Y)
      | ~ axiom(or(not(Y),X))
      | theorem(X) ),
    file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p') ).

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

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

fof(f11,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f12,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(cnf_transformation,[status(thm)],[f3]) ).

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(not(p),or(not(q),r))),or(not(or(not(p),q)),or(not(p),r)))),
    inference(cnf_transformation,[status(thm)],[f9]) ).

fof(f21,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[status(thm)],[f10,f17]) ).

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

fof(f47,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[status(thm)],[f12,f17]) ).

fof(f48,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[status(thm)],[f12,f15]) ).

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

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

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

fof(f64,plain,
    ! [X0,X1] :
      ( theorem(or(X0,X1))
      | ~ theorem(or(X0,or(or(X0,X1),X1))) ),
    inference(resolution,[status(thm)],[f59,f21]) ).

fof(f69,plain,
    ! [X0,X1] :
      ( ~ theorem(or(or(X0,X1),X1))
      | theorem(or(X0,X1)) ),
    inference(resolution,[status(thm)],[f64,f36]) ).

fof(f70,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(f73,plain,
    ! [X0,X1,X2,X3] :
      ( ~ axiom(or(not(X2),or(X3,X0)))
      | theorem(or(not(X2),or(X3,X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[status(thm)],[f70,f19]) ).

fof(f90,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,or(X0,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[status(thm)],[f69,f47]) ).

fof(f94,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,or(X1,X1)))
      | theorem(or(X0,X1)) ),
    inference(resolution,[status(thm)],[f90,f59]) ).

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

fof(f168,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[status(thm)],[f52,f11]) ).

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

fof(f241,plain,
    ! [X0,X1,X2] :
      ( theorem(or(not(or(X0,X2)),or(X2,X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[status(thm)],[f73,f12]) ).

fof(f346,plain,
    ~ theorem(or(or(not(or(not(p),q)),or(not(p),r)),not(or(not(q),or(not(p),r))))),
    inference(resolution,[status(thm)],[f117,f20]) ).

fof(f820,plain,
    ! [X0,X1] :
      ( theorem(or(not(or(X0,X1)),X1))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[status(thm)],[f241,f94]) ).

fof(f1376,plain,
    ~ theorem(or(not(or(not(q),or(not(p),r))),or(not(or(not(p),q)),or(not(p),r)))),
    inference(resolution,[status(thm)],[f346,f47]) ).

fof(f2457,plain,
    ~ theorem(or(not(or(not(p),or(not(p),r))),or(not(p),r))),
    inference(resolution,[status(thm)],[f1376,f239]) ).

fof(f2475,plain,
    ~ theorem(or(not(not(p)),or(not(p),r))),
    inference(resolution,[status(thm)],[f2457,f820]) ).

fof(f2484,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f2475,f168]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL225-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.07  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.45  % Computer : n026.cluster.edu
% 0.17/0.45  % Model    : x86_64 x86_64
% 0.17/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.45  % Memory   : 8046.5625MB
% 0.17/0.45  % OS       : Linux 6.8.0-71-generic
% 0.17/0.45  % CPULimit : 300
% 0.17/0.45  % WCLimit  : 300
% 0.17/0.45  % DateTime : Mon Sep 21 00:15:37 UTC 2026
% 0.17/0.45  % CPUTime  : 
% 0.17/0.48  % Drodi V4.1.1
% 6.77/1.43  % Refutation found
% 6.77/1.43  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 6.77/1.43  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 6.63/1.49  % Elapsed time: 1.011078 seconds
% 6.63/1.49  % CPU time: 7.589923 seconds
% 6.63/1.49  % Total memory used: 143.460 MB
% 6.63/1.49  % Net memory used: 138.908 MB
%------------------------------------------------------------------------------