%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SWC130-1 : TPTP v8.1.2. Released v2.4.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 : Wed May 31 12:39:22 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(f7,axiom,
    cyclefreeP(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f100,axiom,
    ! [U,V] :
      ( ~ ssList(U)
      | ~ ssList(V)
      | neq(V,U)
      | V = U ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f187,negated_conjecture,
    ssList(sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f190,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f192,negated_conjecture,
    ~ neq(sk4,nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f193,negated_conjecture,
    ~ cyclefreeP(sk2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f200,plain,
    cyclefreeP(nil),
    inference(cnf_transformation,[status(esa)],[f7]) ).

fof(f201,plain,
    ssList(nil),
    inference(cnf_transformation,[status(esa)],[f8]) ).

fof(f296,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | neq(X1,X0)
      | X1 = X0 ),
    inference(cnf_transformation,[status(esa)],[f100]) ).

fof(f425,plain,
    ssList(sk2),
    inference(cnf_transformation,[status(esa)],[f187]) ).

fof(f428,plain,
    sk2 = sk4,
    inference(cnf_transformation,[status(esa)],[f190]) ).

fof(f430,plain,
    ~ neq(sk4,nil),
    inference(cnf_transformation,[status(esa)],[f192]) ).

fof(f431,plain,
    ~ cyclefreeP(sk2),
    inference(cnf_transformation,[status(esa)],[f193]) ).

fof(f470,plain,
    ~ neq(sk2,nil),
    inference(forward_demodulation,[status(thm)],[f428,f430]) ).

fof(f471,plain,
    ( spl0_2
  <=> ssList(nil) ),
    introduced(split_symbol_definition) ).

fof(f473,plain,
    ( ~ ssList(nil)
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f471]) ).

fof(f474,plain,
    ( spl0_3
  <=> ssList(sk2) ),
    introduced(split_symbol_definition) ).

fof(f476,plain,
    ( ~ ssList(sk2)
    | spl0_3 ),
    inference(component_clause,[status(thm)],[f474]) ).

fof(f477,plain,
    ( spl0_4
  <=> sk2 = nil ),
    introduced(split_symbol_definition) ).

fof(f478,plain,
    ( sk2 = nil
    | ~ spl0_4 ),
    inference(component_clause,[status(thm)],[f477]) ).

fof(f480,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk2)
    | sk2 = nil ),
    inference(resolution,[status(thm)],[f296,f470]) ).

fof(f481,plain,
    ( ~ spl0_2
    | ~ spl0_3
    | spl0_4 ),
    inference(split_clause,[status(thm)],[f480,f471,f474,f477]) ).

fof(f482,plain,
    ( $false
    | spl0_3 ),
    inference(forward_subsumption_resolution,[status(thm)],[f476,f425]) ).

fof(f483,plain,
    spl0_3,
    inference(contradiction_clause,[status(thm)],[f482]) ).

fof(f484,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f473,f201]) ).

fof(f485,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f484]) ).

fof(f495,plain,
    ( ~ cyclefreeP(nil)
    | ~ spl0_4 ),
    inference(backward_demodulation,[status(thm)],[f478,f431]) ).

fof(f496,plain,
    ( $false
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[status(thm)],[f495,f200]) ).

fof(f497,plain,
    ~ spl0_4,
    inference(contradiction_clause,[status(thm)],[f496]) ).

fof(f498,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f481,f483,f485,f497]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : SWC130-1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.09  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.29  % Computer : n008.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 300
% 0.09/0.29  % DateTime : Tue May 30 11:22:53 EDT 2023
% 0.09/0.29  % CPUTime  : 
% 0.09/0.30  % Drodi V3.5.1
% 0.14/0.53  % Refutation found
% 0.14/0.53  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.53  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.53  % Elapsed time: 0.017212 seconds
% 0.14/0.53  % CPU time: 0.016773 seconds
% 0.14/0.53  % Memory used: 4.015 MB
%------------------------------------------------------------------------------