↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : LCL506+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 : n008.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:52 PM UTC 2026

% Result   : Theorem 0.03s 0.39s
% Output   : CNFRefutation 0.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   8 unt;   0 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   29 (  13   ~;  10   |;   4   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   3 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   20 (  16   !;   4   ?)

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

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

fof(f37,axiom,
    kn2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f43,conjecture,
    and_1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f44,negated_conjecture,
    ~ and_1,
    inference(negated_conjecture,[status(cth)],[f43]) ).

fof(f75,plain,
    ( ( ? [X,Y] : ~ is_a_theorem(implies(and(X,Y),X))
      | and_1 )
    & ( ! [X,Y] : is_a_theorem(implies(and(X,Y),X))
      | ~ and_1 ) ),
    inference(NNF_transformation,[status(thm)],[f7]) ).

fof(f76,plain,
    ( ( ~ is_a_theorem(implies(and(sK13_skl,sK14_skl),sK13_skl))
      | and_1 )
    & ( ! [X,Y] : is_a_theorem(implies(and(X,Y),X))
      | ~ and_1 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK13_skl,sK14_skl]),skolemize(X,sK13_skl),skolemize(Y,sK14_skl)],[f75]) ).

fof(f78,plain,
    ( ~ is_a_theorem(implies(and(sK13_skl,sK14_skl),sK13_skl))
    | and_1 ),
    inference(cnf_transformation,[status(thm)],[f76]) ).

fof(f115,plain,
    ( ( ? [P,Q] : ~ is_a_theorem(implies(and(P,Q),P))
      | kn2 )
    & ( ! [P,Q] : is_a_theorem(implies(and(P,Q),P))
      | ~ kn2 ) ),
    inference(NNF_transformation,[status(thm)],[f17]) ).

fof(f116,plain,
    ( ( ~ is_a_theorem(implies(and(sK33_skl,sK34_skl),sK33_skl))
      | kn2 )
    & ( ! [P,Q] : is_a_theorem(implies(and(P,Q),P))
      | ~ kn2 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK33_skl,sK34_skl]),skolemize(P,sK33_skl),skolemize(Q,sK34_skl)],[f115]) ).

fof(f117,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(and(X0,X1),X0))
      | ~ kn2 ),
    inference(cnf_transformation,[status(thm)],[f116]) ).

fof(f170,plain,
    kn2,
    inference(cnf_transformation,[status(thm)],[f37]) ).

fof(f176,plain,
    ~ and_1,
    inference(cnf_transformation,[status(thm)],[f44]) ).

fof(f181,plain,
    ~ is_a_theorem(implies(and(sK13_skl,sK14_skl),sK13_skl)),
    inference(forward_subsumption_resolution,[status(thm)],[f78,f176]) ).

fof(f184,plain,
    ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
    inference(forward_subsumption_resolution,[status(thm)],[f117,f170]) ).

fof(f185,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f181,f184]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL506+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n008.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.03/0.36  % CPULimit : 300
% 0.03/0.36  % WCLimit  : 300
% 0.03/0.36  % DateTime : Mon Sep 21 00:36:40 UTC 2026
% 0.03/0.36  % CPUTime  : 
% 0.03/0.37  % Drodi V4.1.1
% 0.03/0.39  % Refutation found
% 0.03/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.03/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.03/0.41  % Elapsed time: 0.048095 seconds
% 0.03/0.41  % CPU time: 0.133840 seconds
% 0.03/0.41  % Total memory used: 62.309 MB
% 0.03/0.41  % Net memory used: 62.279 MB
%------------------------------------------------------------------------------