TSTP Solution File: SYN945+1 by Drodi---3.6.0

View Problem - Process Solution

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

% Computer : n011.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:53:41 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X] : p(X)
   => ! [A,B] :
        ( p(A)
        & p(B) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    ~ ( ! [X] : p(X)
     => ! [A,B] :
          ( p(A)
          & p(B) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ! [X] : p(X)
    & ? [A,B] :
        ( ~ p(A)
        | ~ p(B) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

fof(f4,plain,
    ( ! [X] : p(X)
    & ( ? [A] : ~ p(A)
      | ? [B] : ~ p(B) ) ),
    inference(miniscoping,[status(esa)],[f3]) ).

fof(f5,plain,
    ( ! [X] : p(X)
    & ( ~ p(sk0_0)
      | ~ p(sk0_1) ) ),
    inference(skolemization,[status(esa)],[f4]) ).

fof(f6,plain,
    ! [X0] : p(X0),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f7,plain,
    ( ~ p(sk0_0)
    | ~ p(sk0_1) ),
    inference(cnf_transformation,[status(esa)],[f5]) ).

fof(f8,plain,
    ( spl0_0
  <=> p(sk0_0) ),
    introduced(split_symbol_definition) ).

fof(f10,plain,
    ( ~ p(sk0_0)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f8]) ).

fof(f11,plain,
    ( spl0_1
  <=> p(sk0_1) ),
    introduced(split_symbol_definition) ).

fof(f13,plain,
    ( ~ p(sk0_1)
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f11]) ).

fof(f14,plain,
    ( ~ spl0_0
    | ~ spl0_1 ),
    inference(split_clause,[status(thm)],[f7,f8,f11]) ).

fof(f15,plain,
    ( $false
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f10,f6]) ).

fof(f16,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f15]) ).

fof(f17,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f13,f6]) ).

fof(f18,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f17]) ).

fof(f19,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f14,f16,f18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN945+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon Apr 29 22:03:31 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  % Drodi V3.6.0
% 0.13/0.37  % Refutation found
% 0.13/0.37  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38  % Elapsed time: 0.017300 seconds
% 0.13/0.38  % CPU time: 0.017852 seconds
% 0.13/0.38  % Total memory used: 3.642 MB
% 0.13/0.38  % Net memory used: 3.526 MB
%------------------------------------------------------------------------------