↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n019.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:15 PM UTC 2026

% Result   : Unsatisfiable 0.21s 0.58s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   42 (  32 unt;   0 def)
%            Number of atoms       :   55 (   6 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  17   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   76 (  76   !;   0   ?)

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

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

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

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

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

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

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

fof(f9,axiom,
    ! [P,Q] : and(P,Q) = not(or(not(P),not(Q))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

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

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

fof(f16,plain,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    inference(cnf_transformation,[status(thm)],[f6]) ).

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

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

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

fof(f20,plain,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    inference(cnf_transformation,[status(thm)],[f9]) ).

fof(f21,plain,
    ~ theorem(implies(or(not(p),not(q)),not(and(p,q)))),
    inference(cnf_transformation,[status(thm)],[f10]) ).

fof(f22,plain,
    ~ theorem(implies(implies(p,not(q)),not(and(p,q)))),
    inference(backward_demodulation,[status(thm)],[f16,f21]) ).

fof(f23,plain,
    ! [X0,X1] : and(X0,X1) = not(implies(X0,not(X1))),
    inference(forward_demodulation,[status(thm)],[f16,f20]) ).

fof(f25,plain,
    ! [X0,X1,X2] : implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
    inference(paramodulation,[status(thm)],[f23,f16]) ).

fof(f29,plain,
    ~ theorem(or(and(p,q),not(and(p,q)))),
    inference(backward_demodulation,[status(thm)],[f25,f22]) ).

fof(f177,plain,
    ! [X0] : theorem(implies(or(X0,X0),X0)),
    inference(resolution,[status(thm)],[f11,f17]) ).

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

fof(f188,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[status(thm)],[f177,f19]) ).

fof(f193,plain,
    ! [X0,X1] :
      ( ~ theorem(X1)
      | theorem(or(X0,X1)) ),
    inference(resolution,[status(thm)],[f182,f19]) ).

fof(f251,plain,
    ! [X0,X1] : theorem(implies(or(X0,X1),or(X1,X0))),
    inference(resolution,[status(thm)],[f13,f17]) ).

fof(f301,plain,
    ! [X0,X1,X2] : theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    inference(resolution,[status(thm)],[f14,f17]) ).

fof(f333,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[status(thm)],[f251,f19]) ).

fof(f393,plain,
    ! [X0,X1] :
      ( ~ theorem(implies(X1,X0))
      | theorem(or(X0,not(X1))) ),
    inference(paramodulation,[status(thm)],[f16,f333]) ).

fof(f547,plain,
    ! [X0,X1,X2] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[status(thm)],[f301,f19]) ).

fof(f665,plain,
    ! [X0,X1] : theorem(or(or(X0,X1),not(X1))),
    inference(resolution,[status(thm)],[f393,f182]) ).

fof(f713,plain,
    ! [X0,X1,X2] : theorem(or(X0,or(or(X1,X2),not(X2)))),
    inference(resolution,[status(thm)],[f665,f193]) ).

fof(f1898,plain,
    ! [X0,X1,X2] : theorem(or(or(X0,X1),or(X2,not(X1)))),
    inference(resolution,[status(thm)],[f547,f713]) ).

fof(f1919,plain,
    ! [X0,X1,X2] : theorem(or(or(X0,not(X1)),or(X2,X1))),
    inference(resolution,[status(thm)],[f1898,f333]) ).

fof(f2197,plain,
    ! [X0,X1,X2] : theorem(or(X0,or(or(X1,not(X2)),X2))),
    inference(resolution,[status(thm)],[f1919,f547]) ).

fof(f2444,plain,
    ! [X0,X1] : theorem(or(or(X0,not(X1)),X1)),
    inference(resolution,[status(thm)],[f2197,f188]) ).

fof(f2461,plain,
    ! [X0,X1] : theorem(or(X0,or(X1,not(X0)))),
    inference(resolution,[status(thm)],[f2444,f333]) ).

fof(f2475,plain,
    ! [X0,X1] : theorem(or(X0,or(X1,not(X1)))),
    inference(resolution,[status(thm)],[f2461,f547]) ).

fof(f2510,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[status(thm)],[f2475,f188]) ).

fof(f2526,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f29,f2510]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL236-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.47  % Computer : n019.cluster.edu
% 0.15/0.47  % Model    : x86_64 x86_64
% 0.15/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.47  % Memory   : 8046.5625MB
% 0.15/0.47  % OS       : Linux 6.8.0-71-generic
% 0.15/0.47  % CPULimit : 300
% 0.15/0.47  % WCLimit  : 300
% 0.15/0.47  % DateTime : Mon Sep 21 00:13:19 UTC 2026
% 0.15/0.48  % CPUTime  : 
% 0.15/0.49  % Drodi V4.1.1
% 0.21/0.58  % Refutation found
% 0.21/0.58  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.21/0.58  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.64  % Elapsed time: 0.139260 seconds
% 0.21/0.64  % CPU time: 0.549307 seconds
% 0.21/0.64  % Total memory used: 54.439 MB
% 0.21/0.64  % Net memory used: 54.047 MB
%------------------------------------------------------------------------------