TSTP Solution File: SWC051-1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SWC051-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n025.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:44:19 EDT 2024

% Result   : Unsatisfiable 0.15s 0.33s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   45 (  11 unt;   0 def)
%            Number of atoms       :   88 (   4 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   81 (  38   ~;  37   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   7 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    4 (   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f59,axiom,
    ! [U] :
      ( ~ ssList(U)
      | rearsegP(U,U) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f186,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f191,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f192,negated_conjecture,
    neq(sk2,nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f193,negated_conjecture,
    ! [A] :
      ( ~ ssList(A)
      | ~ neq(A,nil)
      | ~ rearsegP(sk2,A)
      | ~ rearsegP(sk1,A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f195,negated_conjecture,
    ( ~ neq(sk4,nil)
    | neq(sk3,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f196,negated_conjecture,
    ( ~ neq(sk4,nil)
    | rearsegP(sk4,sk3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f255,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | rearsegP(X0,X0) ),
    inference(cnf_transformation,[status(esa)],[f59]) ).

fof(f427,plain,
    ssList(sk1),
    inference(cnf_transformation,[status(esa)],[f186]) ).

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

fof(f432,plain,
    sk1 = sk3,
    inference(cnf_transformation,[status(esa)],[f191]) ).

fof(f433,plain,
    neq(sk2,nil),
    inference(cnf_transformation,[status(esa)],[f192]) ).

fof(f434,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ neq(X0,nil)
      | ~ rearsegP(sk2,X0)
      | ~ rearsegP(sk1,X0) ),
    inference(cnf_transformation,[status(esa)],[f193]) ).

fof(f436,plain,
    ( ~ neq(sk4,nil)
    | neq(sk3,nil) ),
    inference(cnf_transformation,[status(esa)],[f195]) ).

fof(f437,plain,
    ( ~ neq(sk4,nil)
    | rearsegP(sk4,sk3) ),
    inference(cnf_transformation,[status(esa)],[f196]) ).

fof(f452,plain,
    ( spl0_4
  <=> neq(sk4,nil) ),
    introduced(split_symbol_definition) ).

fof(f454,plain,
    ( ~ neq(sk4,nil)
    | spl0_4 ),
    inference(component_clause,[status(thm)],[f452]) ).

fof(f455,plain,
    ( spl0_5
  <=> neq(sk3,nil) ),
    introduced(split_symbol_definition) ).

fof(f456,plain,
    ( neq(sk3,nil)
    | ~ spl0_5 ),
    inference(component_clause,[status(thm)],[f455]) ).

fof(f458,plain,
    ( ~ spl0_4
    | spl0_5 ),
    inference(split_clause,[status(thm)],[f436,f452,f455]) ).

fof(f459,plain,
    ( spl0_6
  <=> rearsegP(sk4,sk3) ),
    introduced(split_symbol_definition) ).

fof(f460,plain,
    ( rearsegP(sk4,sk3)
    | ~ spl0_6 ),
    inference(component_clause,[status(thm)],[f459]) ).

fof(f462,plain,
    ( ~ spl0_4
    | spl0_6 ),
    inference(split_clause,[status(thm)],[f437,f452,f459]) ).

fof(f513,plain,
    ( ~ neq(sk2,nil)
    | spl0_4 ),
    inference(forward_demodulation,[status(thm)],[f431,f454]) ).

fof(f514,plain,
    ( $false
    | spl0_4 ),
    inference(forward_subsumption_resolution,[status(thm)],[f513,f433]) ).

fof(f515,plain,
    spl0_4,
    inference(contradiction_clause,[status(thm)],[f514]) ).

fof(f516,plain,
    ( neq(sk1,nil)
    | ~ spl0_5 ),
    inference(forward_demodulation,[status(thm)],[f432,f456]) ).

fof(f517,plain,
    ( rearsegP(sk2,sk3)
    | ~ spl0_6 ),
    inference(forward_demodulation,[status(thm)],[f431,f460]) ).

fof(f518,plain,
    ( rearsegP(sk2,sk1)
    | ~ spl0_6 ),
    inference(forward_demodulation,[status(thm)],[f432,f517]) ).

fof(f523,plain,
    ( spl0_11
  <=> ssList(sk1) ),
    introduced(split_symbol_definition) ).

fof(f525,plain,
    ( ~ ssList(sk1)
    | spl0_11 ),
    inference(component_clause,[status(thm)],[f523]) ).

fof(f536,plain,
    ( $false
    | spl0_11 ),
    inference(forward_subsumption_resolution,[status(thm)],[f525,f427]) ).

fof(f537,plain,
    spl0_11,
    inference(contradiction_clause,[status(thm)],[f536]) ).

fof(f545,plain,
    ( spl0_14
  <=> rearsegP(sk2,sk1) ),
    introduced(split_symbol_definition) ).

fof(f547,plain,
    ( ~ rearsegP(sk2,sk1)
    | spl0_14 ),
    inference(component_clause,[status(thm)],[f545]) ).

fof(f548,plain,
    ( spl0_15
  <=> rearsegP(sk1,sk1) ),
    introduced(split_symbol_definition) ).

fof(f550,plain,
    ( ~ rearsegP(sk1,sk1)
    | spl0_15 ),
    inference(component_clause,[status(thm)],[f548]) ).

fof(f551,plain,
    ( ~ ssList(sk1)
    | ~ rearsegP(sk2,sk1)
    | ~ rearsegP(sk1,sk1)
    | ~ spl0_5 ),
    inference(resolution,[status(thm)],[f434,f516]) ).

fof(f552,plain,
    ( ~ spl0_11
    | ~ spl0_14
    | ~ spl0_15
    | ~ spl0_5 ),
    inference(split_clause,[status(thm)],[f551,f523,f545,f548,f455]) ).

fof(f571,plain,
    ( $false
    | ~ spl0_6
    | spl0_14 ),
    inference(forward_subsumption_resolution,[status(thm)],[f547,f518]) ).

fof(f572,plain,
    ( ~ spl0_6
    | spl0_14 ),
    inference(contradiction_clause,[status(thm)],[f571]) ).

fof(f574,plain,
    ( ~ ssList(sk1)
    | spl0_15 ),
    inference(resolution,[status(thm)],[f550,f255]) ).

fof(f575,plain,
    ( ~ spl0_11
    | spl0_15 ),
    inference(split_clause,[status(thm)],[f574,f523,f548]) ).

fof(f576,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f458,f462,f515,f537,f552,f572,f575]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem  : SWC051-1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.11  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31  % Computer : n025.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Tue Apr 30 00:16:11 EDT 2024
% 0.10/0.31  % CPUTime  : 
% 0.15/0.32  % Drodi V3.6.0
% 0.15/0.33  % Refutation found
% 0.15/0.33  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.33  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.35  % Elapsed time: 0.026268 seconds
% 0.15/0.35  % CPU time: 0.032960 seconds
% 0.15/0.35  % Total memory used: 14.330 MB
% 0.15/0.35  % Net memory used: 14.306 MB
%------------------------------------------------------------------------------