↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.27s 0.64s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   35 (  22 unt;   0 def)
%            Number of atoms       :   52 (   2 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   40 (  23   ~;  17   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   65 (  65   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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(f5,axiom,
    ! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
    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,negated_conjecture,
    ~ theorem(or(implies(p,q),implies(q,p))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

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

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

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

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

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

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

fof(f22,plain,
    ! [X0,X1] : theorem(implies(X0,or(X1,X0))),
    inference(resolution,[status(thm)],[f11,f16]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ~ theorem(X1)
      | theorem(or(X0,X1)) ),
    inference(resolution,[status(thm)],[f22,f18]) ).

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

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

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

fof(f29,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[status(thm)],[f26,f18]) ).

fof(f34,plain,
    ! [X0,X1,X2] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[status(thm)],[f27,f18]) ).

fof(f35,plain,
    ! [X0,X1,X2] :
      ( ~ theorem(implies(X1,X2))
      | theorem(implies(or(X0,X1),or(X0,X2))) ),
    inference(resolution,[status(thm)],[f28,f18]) ).

fof(f45,plain,
    ! [X0,X1] :
      ( ~ theorem(implies(X1,X0))
      | theorem(or(X0,not(X1))) ),
    inference(paramodulation,[status(thm)],[f15,f29]) ).

fof(f46,plain,
    ! [X0,X1] : theorem(implies(or(X0,not(X1)),implies(X1,X0))),
    inference(paramodulation,[status(thm)],[f15,f26]) ).

fof(f55,plain,
    ! [X0,X1] : theorem(implies(X0,implies(X1,X0))),
    inference(paramodulation,[status(thm)],[f15,f22]) ).

fof(f95,plain,
    ! [X0,X1,X2] :
      ( ~ theorem(or(X0,X2))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[status(thm)],[f34,f23]) ).

fof(f100,plain,
    ! [X0,X1,X2] :
      ( ~ theorem(or(X2,X0))
      | theorem(or(X2,X1))
      | ~ theorem(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[f35,f18]) ).

fof(f384,plain,
    ! [X0] :
      ( ~ theorem(or(implies(p,q),X0))
      | ~ theorem(implies(X0,implies(q,p))) ),
    inference(resolution,[status(thm)],[f100,f19]) ).

fof(f393,plain,
    ~ theorem(or(implies(p,q),or(p,not(q)))),
    inference(resolution,[status(thm)],[f384,f46]) ).

fof(f405,plain,
    ~ theorem(or(implies(p,q),not(q))),
    inference(resolution,[status(thm)],[f95,f393]) ).

fof(f430,plain,
    ~ theorem(implies(q,implies(p,q))),
    inference(resolution,[status(thm)],[f405,f45]) ).

fof(f432,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f430,f55]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL322-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44  % Computer : n013.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Mon Sep 21 00:20:20 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.45  % Drodi V4.1.1
% 0.27/0.64  % Refutation found
% 0.27/0.64  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.27/0.64  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.27/0.65  % Elapsed time: 0.204490 seconds
% 0.27/0.65  % CPU time: 1.198609 seconds
% 0.27/0.65  % Total memory used: 82.833 MB
% 0.27/0.65  % Net memory used: 81.439 MB
%------------------------------------------------------------------------------