%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SWV405+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Apr 30 20:46:56 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f10,axiom,
    ! [U,V] : ~ pair_in_list(create_slb,U,V),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f24,axiom,
    ! [U,V] : check_cpq(triple(U,create_slb,V)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f42,conjecture,
    ! [U,V] :
      ( check_cpq(triple(U,create_slb,V))
    <=> ! [W,X] :
          ( pair_in_list(create_slb,W,X)
         => less_than(X,W) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f43,negated_conjecture,
    ~ ! [U,V] :
        ( check_cpq(triple(U,create_slb,V))
      <=> ! [W,X] :
            ( pair_in_list(create_slb,W,X)
           => less_than(X,W) ) ),
    inference(negated_conjecture,[status(cth)],[f42]) ).

fof(f63,plain,
    ! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
    inference(cnf_transformation,[status(esa)],[f10]) ).

fof(f96,plain,
    ! [X0,X1] : check_cpq(triple(X0,create_slb,X1)),
    inference(cnf_transformation,[status(esa)],[f24]) ).

fof(f144,plain,
    ? [U,V] :
      ( check_cpq(triple(U,create_slb,V))
    <~> ! [W,X] :
          ( ~ pair_in_list(create_slb,W,X)
          | less_than(X,W) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f43]) ).

fof(f145,plain,
    ? [U,V] :
      ( ( check_cpq(triple(U,create_slb,V))
        | ! [W,X] :
            ( ~ pair_in_list(create_slb,W,X)
            | less_than(X,W) ) )
      & ( ~ check_cpq(triple(U,create_slb,V))
        | ? [W,X] :
            ( pair_in_list(create_slb,W,X)
            & ~ less_than(X,W) ) ) ),
    inference(NNF_transformation,[status(esa)],[f144]) ).

fof(f146,plain,
    ( ( check_cpq(triple(sk0_0,create_slb,sk0_1))
      | ! [W,X] :
          ( ~ pair_in_list(create_slb,W,X)
          | less_than(X,W) ) )
    & ( ~ check_cpq(triple(sk0_0,create_slb,sk0_1))
      | ( pair_in_list(create_slb,sk0_2,sk0_3)
        & ~ less_than(sk0_3,sk0_2) ) ) ),
    inference(skolemization,[status(esa)],[f145]) ).

fof(f148,plain,
    ( ~ check_cpq(triple(sk0_0,create_slb,sk0_1))
    | pair_in_list(create_slb,sk0_2,sk0_3) ),
    inference(cnf_transformation,[status(esa)],[f146]) ).

fof(f150,plain,
    ( spl0_0
  <=> check_cpq(triple(sk0_0,create_slb,sk0_1)) ),
    introduced(split_symbol_definition) ).

fof(f152,plain,
    ( ~ check_cpq(triple(sk0_0,create_slb,sk0_1))
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f150]) ).

fof(f157,plain,
    ( spl0_2
  <=> pair_in_list(create_slb,sk0_2,sk0_3) ),
    introduced(split_symbol_definition) ).

fof(f158,plain,
    ( pair_in_list(create_slb,sk0_2,sk0_3)
    | ~ spl0_2 ),
    inference(component_clause,[status(thm)],[f157]) ).

fof(f160,plain,
    ( ~ spl0_0
    | spl0_2 ),
    inference(split_clause,[status(thm)],[f148,f150,f157]) ).

fof(f178,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f158,f63]) ).

fof(f179,plain,
    ~ spl0_2,
    inference(contradiction_clause,[status(thm)],[f178]) ).

fof(f180,plain,
    ( $false
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f152,f96]) ).

fof(f181,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f180]) ).

fof(f182,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f160,f179,f181]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV405+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.33  % Computer : n008.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Tue Apr 30 00:49:27 EDT 2024
% 0.14/0.34  % CPUTime  : 
% 0.14/0.35  % Drodi V3.6.0
% 0.20/0.36  % Refutation found
% 0.20/0.36  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.36  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.38  % Elapsed time: 0.031253 seconds
% 0.20/0.38  % CPU time: 0.038091 seconds
% 0.20/0.38  % Total memory used: 11.175 MB
% 0.20/0.38  % Net memory used: 11.140 MB
%------------------------------------------------------------------------------