↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : LCL194-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 : n001.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.13s 0.63s
% Output   : CNFRefutation 1.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   38 (  21 unt;   0 def)
%            Number of atoms       :   58 (   2 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   48 (  28   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   79 (  79   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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(implies(implies(q,r),implies(or(q,p),or(p,r)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

fof(f35,plain,
    ! [X0,X1,X2] : axiom(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
    inference(paramodulation,[status(thm)],[f15,f13]) ).

fof(f39,plain,
    ! [X0,X1,X2] : axiom(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
    inference(forward_demodulation,[status(thm)],[f15,f35]) ).

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

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

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

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

fof(f89,plain,
    ! [X0,X1,X2] :
      ( ~ theorem(implies(X1,or(X0,X2)))
      | theorem(or(X0,implies(X1,X2))) ),
    inference(forward_demodulation,[status(thm)],[f15,f87]) ).

fof(f96,plain,
    ! [X0,X1,X2] : axiom(implies(implies(X0,implies(X1,X2)),or(not(X1),implies(X0,X2)))),
    inference(paramodulation,[status(thm)],[f15,f39]) ).

fof(f98,plain,
    ! [X0,X1,X2] : axiom(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
    inference(forward_demodulation,[status(thm)],[f15,f96]) ).

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

fof(f131,plain,
    ! [X0,X1,X2] :
      ( ~ theorem(implies(X1,X2))
      | theorem(implies(implies(X0,X1),implies(X0,X2))) ),
    inference(forward_demodulation,[status(thm)],[f15,f129]) ).

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

fof(f199,plain,
    ! [X0] :
      ( ~ axiom(implies(X0,implies(implies(q,r),implies(or(q,p),or(p,r)))))
      | ~ theorem(X0) ),
    inference(resolution,[status(thm)],[f179,f16]) ).

fof(f330,plain,
    ~ theorem(implies(or(q,p),implies(implies(q,r),or(p,r)))),
    inference(resolution,[status(thm)],[f98,f199]) ).

fof(f366,plain,
    ! [X0] :
      ( ~ theorem(X0)
      | ~ theorem(implies(X0,implies(or(q,p),implies(implies(q,r),or(p,r))))) ),
    inference(resolution,[status(thm)],[f330,f18]) ).

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

fof(f394,plain,
    ! [X0,X1,X2] :
      ( ~ theorem(implies(X1,implies(X0,X2)))
      | theorem(implies(X0,implies(X1,X2))) ),
    inference(forward_demodulation,[status(thm)],[f15,f393]) ).

fof(f395,plain,
    ! [X0] :
      ( ~ theorem(implies(or(q,p),X0))
      | ~ theorem(implies(X0,implies(implies(q,r),or(p,r)))) ),
    inference(resolution,[status(thm)],[f131,f366]) ).

fof(f466,plain,
    ~ theorem(implies(or(p,q),implies(implies(q,r),or(p,r)))),
    inference(resolution,[status(thm)],[f395,f31]) ).

fof(f603,plain,
    ! [X0,X1,X2] : theorem(implies(or(X0,X1),implies(implies(X1,X2),or(X0,X2)))),
    inference(resolution,[status(thm)],[f394,f43]) ).

fof(f610,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f466,f603]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL194-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n001.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 00:15:28 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.13/0.37  % Drodi V4.1.1
% 0.13/0.63  % Refutation found
% 0.13/0.63  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.63  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.66/0.67  % Elapsed time: 0.294114 seconds
% 1.66/0.67  % CPU time: 2.009326 seconds
% 1.66/0.67  % Total memory used: 91.730 MB
% 1.66/0.67  % Net memory used: 89.187 MB
%------------------------------------------------------------------------------