↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n015.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:46 PM UTC 2026

% Result   : Theorem 0.09s 0.40s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   30 (  16 unt;   0 def)
%            Number of atoms       :   52 (   9 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   40 (  18   ~;  14   |;   4   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    7 (   5 usr;   5 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   38 (  34   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f10,axiom,
    ( or_1
  <=> ! [X,Y] : is_a_theorem(implies(X,or(X,Y))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f20,axiom,
    ( cn2
  <=> ! [P,Q] : is_a_theorem(implies(P,implies(not(P),Q))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f27,axiom,
    ( op_or
   => ! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f29,axiom,
    ( op_implies_and
   => ! [X,Y] : implies(X,Y) = not(and(X,not(Y))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f32,axiom,
    op_or,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f33,axiom,
    op_implies_and,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f43,axiom,
    or_1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f53,conjecture,
    cn2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ cn2,
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f97,plain,
    ( ( ? [X,Y] : ~ is_a_theorem(implies(X,or(X,Y)))
      | or_1 )
    & ( ! [X,Y] : is_a_theorem(implies(X,or(X,Y)))
      | ~ or_1 ) ),
    inference(NNF_transformation,[status(thm)],[f10]) ).

fof(f98,plain,
    ( ( ~ is_a_theorem(implies(sK19_skl,or(sK19_skl,sK20_skl)))
      | or_1 )
    & ( ! [X,Y] : is_a_theorem(implies(X,or(X,Y)))
      | ~ or_1 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK19_skl,sK20_skl]),skolemize(X,sK19_skl),skolemize(Y,sK20_skl)],[f97]) ).

fof(f99,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(X0,or(X0,X1)))
      | ~ or_1 ),
    inference(cnf_transformation,[status(thm)],[f98]) ).

fof(f137,plain,
    ( ( ? [P,Q] : ~ is_a_theorem(implies(P,implies(not(P),Q)))
      | cn2 )
    & ( ! [P,Q] : is_a_theorem(implies(P,implies(not(P),Q)))
      | ~ cn2 ) ),
    inference(NNF_transformation,[status(thm)],[f20]) ).

fof(f138,plain,
    ( ( ~ is_a_theorem(implies(sK41_skl,implies(not(sK41_skl),sK42_skl)))
      | cn2 )
    & ( ! [P,Q] : is_a_theorem(implies(P,implies(not(P),Q)))
      | ~ cn2 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK41_skl,sK42_skl]),skolemize(P,sK41_skl),skolemize(Q,sK42_skl)],[f137]) ).

fof(f140,plain,
    ( ~ is_a_theorem(implies(sK41_skl,implies(not(sK41_skl),sK42_skl)))
    | cn2 ),
    inference(cnf_transformation,[status(thm)],[f138]) ).

fof(f165,plain,
    ( ! [X,Y] : or(X,Y) = not(and(not(X),not(Y)))
    | ~ op_or ),
    inference(pre_NNF_transformation,[status(thm)],[f27]) ).

fof(f166,plain,
    ! [X0,X1] :
      ( or(X0,X1) = not(and(not(X0),not(X1)))
      | ~ op_or ),
    inference(cnf_transformation,[status(thm)],[f165]) ).

fof(f169,plain,
    ( ! [X,Y] : implies(X,Y) = not(and(X,not(Y)))
    | ~ op_implies_and ),
    inference(pre_NNF_transformation,[status(thm)],[f29]) ).

fof(f170,plain,
    ! [X0,X1] :
      ( implies(X0,X1) = not(and(X0,not(X1)))
      | ~ op_implies_and ),
    inference(cnf_transformation,[status(thm)],[f169]) ).

fof(f175,plain,
    op_or,
    inference(cnf_transformation,[status(thm)],[f32]) ).

fof(f176,plain,
    op_implies_and,
    inference(cnf_transformation,[status(thm)],[f33]) ).

fof(f186,plain,
    or_1,
    inference(cnf_transformation,[status(thm)],[f43]) ).

fof(f196,plain,
    ~ cn2,
    inference(cnf_transformation,[status(thm)],[f54]) ).

fof(f207,plain,
    ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))),
    inference(backward_subsumption_resolution,[status(thm)],[f99,f186]) ).

fof(f215,plain,
    ~ is_a_theorem(implies(sK41_skl,implies(not(sK41_skl),sK42_skl))),
    inference(forward_subsumption_resolution,[status(thm)],[f140,f196]) ).

fof(f218,plain,
    ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
    inference(forward_subsumption_resolution,[status(thm)],[f166,f175]) ).

fof(f223,plain,
    ! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
    inference(backward_demodulation,[status(thm)],[f224,f218]) ).

fof(f224,plain,
    ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
    inference(forward_subsumption_resolution,[status(thm)],[f170,f176]) ).

fof(f261,plain,
    ~ is_a_theorem(implies(sK41_skl,or(sK41_skl,sK42_skl))),
    inference(backward_demodulation,[status(thm)],[f223,f215]) ).

fof(f288,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f261,f207]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL452+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n015.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:36:51 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.38  % Drodi V4.1.1
% 0.09/0.40  % Refutation found
% 0.09/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.42  % Elapsed time: 0.051305 seconds
% 0.09/0.42  % CPU time: 0.158917 seconds
% 0.09/0.42  % Total memory used: 78.528 MB
% 0.09/0.42  % Net memory used: 78.449 MB
%------------------------------------------------------------------------------