↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n020.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 02:47:30 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ! [U] : ~ contains_pq(create_pq,U),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f20,axiom,
    ! [U] : ~ contains_slb(create_slb,U),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f39,axiom,
    ! [U,V,W,X] :
      ( contains_cpq(triple(U,V,W),X)
    <=> contains_slb(V,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f54,axiom,
    ! [U,V] : i(triple(U,create_slb,V)) = create_pq,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f63,conjecture,
    ! [U,V,W] :
      ( contains_cpq(triple(U,create_slb,V),W)
    <=> contains_pq(i(triple(U,create_slb,V)),W) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f64,negated_conjecture,
    ~ ! [U,V,W] :
        ( contains_cpq(triple(U,create_slb,V),W)
      <=> contains_pq(i(triple(U,create_slb,V)),W) ),
    inference(negated_conjecture,[status(cth)],[f63]) ).

fof(f78,plain,
    ! [X0] : ~ contains_pq(create_pq,X0),
    inference(cnf_transformation,[status(thm)],[f8]) ).

fof(f105,plain,
    ! [X0] : ~ contains_slb(create_slb,X0),
    inference(cnf_transformation,[status(thm)],[f20]) ).

fof(f155,plain,
    ! [U,V,W,X] :
      ( ( ~ contains_slb(V,X)
        | contains_cpq(triple(U,V,W),X) )
      & ( contains_slb(V,X)
        | ~ contains_cpq(triple(U,V,W),X) ) ),
    inference(NNF_transformation,[status(thm)],[f39]) ).

fof(f156,plain,
    ( ! [V,X] :
        ( ~ contains_slb(V,X)
        | ! [U,W] : contains_cpq(triple(U,V,W),X) )
    & ! [V,X] :
        ( contains_slb(V,X)
        | ! [U,W] : ~ contains_cpq(triple(U,V,W),X) ) ),
    inference(miniscoping,[status(thm)],[f155]) ).

fof(f157,plain,
    ! [X0,X1,X2,X3] :
      ( contains_slb(X1,X3)
      | ~ contains_cpq(triple(X0,X1,X2),X3) ),
    inference(cnf_transformation,[status(thm)],[f156]) ).

fof(f192,plain,
    ! [X0,X1] : i(triple(X0,create_slb,X1)) = create_pq,
    inference(cnf_transformation,[status(thm)],[f54]) ).

fof(f229,plain,
    ? [U,V,W] :
      ( contains_cpq(triple(U,create_slb,V),W)
    <~> contains_pq(i(triple(U,create_slb,V)),W) ),
    inference(pre_NNF_transformation,[status(thm)],[f64]) ).

fof(f230,plain,
    ? [U,V,W] :
      ( ( ~ contains_pq(i(triple(U,create_slb,V)),W)
        | ~ contains_cpq(triple(U,create_slb,V),W) )
      & ( contains_pq(i(triple(U,create_slb,V)),W)
        | contains_cpq(triple(U,create_slb,V),W) ) ),
    inference(NNF_transformation,[status(thm)],[f229]) ).

fof(f231,plain,
    ( ( ~ contains_pq(i(triple(sK4_skl,create_slb,sK5_skl)),sK6_skl)
      | ~ contains_cpq(triple(sK4_skl,create_slb,sK5_skl),sK6_skl) )
    & ( contains_pq(i(triple(sK4_skl,create_slb,sK5_skl)),sK6_skl)
      | contains_cpq(triple(sK4_skl,create_slb,sK5_skl),sK6_skl) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4_skl,sK5_skl,sK6_skl]),skolemize(U,sK4_skl),skolemize(V,sK5_skl),skolemize(W,sK6_skl)],[f230]) ).

fof(f232,plain,
    ( contains_pq(i(triple(sK4_skl,create_slb,sK5_skl)),sK6_skl)
    | contains_cpq(triple(sK4_skl,create_slb,sK5_skl),sK6_skl) ),
    inference(cnf_transformation,[status(thm)],[f231]) ).

fof(f234,definition,
    ( sQ0_spl
  <=> contains_cpq(triple(sK4_skl,create_slb,sK5_skl),sK6_skl) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f235,plain,
    ( ~ sQ0_spl
    | contains_cpq(triple(sK4_skl,create_slb,sK5_skl),sK6_skl) ),
    inference(component_clause,[status(thm)],[f234]) ).

fof(f237,definition,
    ( sQ1_spl
  <=> contains_pq(i(triple(sK4_skl,create_slb,sK5_skl)),sK6_skl) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f238,plain,
    ( ~ sQ1_spl
    | contains_pq(i(triple(sK4_skl,create_slb,sK5_skl)),sK6_skl) ),
    inference(component_clause,[status(thm)],[f237]) ).

fof(f240,plain,
    ( sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f232,f234,f237]) ).

fof(f247,plain,
    ( ~ sQ1_spl
    | contains_pq(create_pq,sK6_skl) ),
    inference(forward_demodulation,[status(thm)],[f192,f238]) ).

fof(f248,plain,
    ( ~ sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f247,f78]) ).

fof(f249,plain,
    ~ sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f248]) ).

fof(f258,plain,
    ! [X0,X1,X2] : ~ contains_cpq(triple(X0,create_slb,X1),X2),
    inference(resolution,[status(thm)],[f105,f157]) ).

fof(f266,plain,
    ( ~ sQ0_spl
    | $false ),
    inference(backward_subsumption_resolution,[status(thm)],[f235,f258]) ).

fof(f267,plain,
    ~ sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f266]) ).

fof(f268,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f240,f249,f267]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV369+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36  % Computer : n020.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 21 08:44:32 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.14/0.38  % Drodi V4.1.1
% 0.14/0.39  % Refutation found
% 0.14/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.42  % Elapsed time: 0.051040 seconds
% 0.14/0.42  % CPU time: 0.137663 seconds
% 0.14/0.42  % Total memory used: 78.606 MB
% 0.14/0.42  % Net memory used: 78.534 MB
%------------------------------------------------------------------------------