TSTP Solution File: SWC333-1 by Drodi---3.5.1

View Problem - Process Solution

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

% Computer : n013.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:40:05 EDT 2023

% Result   : Unsatisfiable 0.06s 0.27s
% Output   : CNFRefutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   54 (  17 unt;   0 def)
%            Number of atoms       :  127 (   4 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  142 (  69   ~;  65   |;   0   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   14 (  12 usr;   9 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    5 (;   5   !;   0   ?)

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

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

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

fof(f192,negated_conjecture,
    segmentP(sk4,sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f193,negated_conjecture,
    totalorderedP(sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f194,negated_conjecture,
    ! [A] :
      ( ~ ssList(A)
      | ~ neq(sk3,A)
      | ~ segmentP(sk4,A)
      | ~ segmentP(A,sk3)
      | ~ totalorderedP(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f195,negated_conjecture,
    ( ssList(sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f196,negated_conjecture,
    ( neq(sk1,sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f197,negated_conjecture,
    ( segmentP(sk2,sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f198,negated_conjecture,
    ( segmentP(sk5,sk1)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f199,negated_conjecture,
    ( totalorderedP(sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

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

fof(f436,plain,
    segmentP(sk4,sk3),
    inference(cnf_transformation,[status(esa)],[f192]) ).

fof(f437,plain,
    totalorderedP(sk3),
    inference(cnf_transformation,[status(esa)],[f193]) ).

fof(f438,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ neq(sk3,X0)
      | ~ segmentP(sk4,X0)
      | ~ segmentP(X0,sk3)
      | ~ totalorderedP(X0) ),
    inference(cnf_transformation,[status(esa)],[f194]) ).

fof(f439,plain,
    ( ssList(sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    inference(cnf_transformation,[status(esa)],[f195]) ).

fof(f440,plain,
    ( neq(sk1,sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    inference(cnf_transformation,[status(esa)],[f196]) ).

fof(f441,plain,
    ( segmentP(sk2,sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    inference(cnf_transformation,[status(esa)],[f197]) ).

fof(f442,plain,
    ( segmentP(sk5,sk1)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    inference(cnf_transformation,[status(esa)],[f198]) ).

fof(f443,plain,
    ( totalorderedP(sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    inference(cnf_transformation,[status(esa)],[f199]) ).

fof(f451,plain,
    ( spl0_2
  <=> ssList(sk5) ),
    introduced(split_symbol_definition) ).

fof(f454,plain,
    ( spl0_3
  <=> segmentP(sk2,sk1) ),
    introduced(split_symbol_definition) ).

fof(f456,plain,
    ( ~ segmentP(sk2,sk1)
    | spl0_3 ),
    inference(component_clause,[status(thm)],[f454]) ).

fof(f457,plain,
    ( spl0_4
  <=> totalorderedP(sk1) ),
    introduced(split_symbol_definition) ).

fof(f459,plain,
    ( ~ totalorderedP(sk1)
    | spl0_4 ),
    inference(component_clause,[status(thm)],[f457]) ).

fof(f460,plain,
    ( spl0_2
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(split_clause,[status(thm)],[f439,f451,f454,f457]) ).

fof(f461,plain,
    ( spl0_5
  <=> neq(sk1,sk5) ),
    introduced(split_symbol_definition) ).

fof(f462,plain,
    ( neq(sk1,sk5)
    | ~ spl0_5 ),
    inference(component_clause,[status(thm)],[f461]) ).

fof(f464,plain,
    ( spl0_5
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(split_clause,[status(thm)],[f440,f461,f454,f457]) ).

fof(f465,plain,
    ( spl0_6
  <=> segmentP(sk2,sk5) ),
    introduced(split_symbol_definition) ).

fof(f468,plain,
    ( spl0_6
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(split_clause,[status(thm)],[f441,f465,f454,f457]) ).

fof(f469,plain,
    ( spl0_7
  <=> segmentP(sk5,sk1) ),
    introduced(split_symbol_definition) ).

fof(f472,plain,
    ( spl0_7
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(split_clause,[status(thm)],[f442,f469,f454,f457]) ).

fof(f473,plain,
    ( spl0_8
  <=> totalorderedP(sk5) ),
    introduced(split_symbol_definition) ).

fof(f476,plain,
    ( spl0_8
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(split_clause,[status(thm)],[f443,f473,f454,f457]) ).

fof(f508,plain,
    totalorderedP(sk1),
    inference(forward_demodulation,[status(thm)],[f435,f437]) ).

fof(f509,plain,
    segmentP(sk2,sk3),
    inference(forward_demodulation,[status(thm)],[f434,f436]) ).

fof(f510,plain,
    segmentP(sk2,sk1),
    inference(forward_demodulation,[status(thm)],[f435,f509]) ).

fof(f511,plain,
    ( spl0_9
  <=> ssList(nil) ),
    introduced(split_symbol_definition) ).

fof(f513,plain,
    ( ~ ssList(nil)
    | spl0_9 ),
    inference(component_clause,[status(thm)],[f511]) ).

fof(f531,plain,
    ( $false
    | spl0_4 ),
    inference(forward_subsumption_resolution,[status(thm)],[f459,f508]) ).

fof(f532,plain,
    spl0_4,
    inference(contradiction_clause,[status(thm)],[f531]) ).

fof(f533,plain,
    ( $false
    | spl0_3 ),
    inference(forward_subsumption_resolution,[status(thm)],[f456,f510]) ).

fof(f534,plain,
    spl0_3,
    inference(contradiction_clause,[status(thm)],[f533]) ).

fof(f535,plain,
    ( $false
    | spl0_9 ),
    inference(forward_subsumption_resolution,[status(thm)],[f513,f207]) ).

fof(f536,plain,
    spl0_9,
    inference(contradiction_clause,[status(thm)],[f535]) ).

fof(f545,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ neq(sk1,X0)
      | ~ segmentP(sk4,X0)
      | ~ segmentP(X0,sk3)
      | ~ totalorderedP(X0) ),
    inference(forward_demodulation,[status(thm)],[f435,f438]) ).

fof(f546,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ neq(sk1,X0)
      | ~ segmentP(sk2,X0)
      | ~ segmentP(X0,sk3)
      | ~ totalorderedP(X0) ),
    inference(forward_demodulation,[status(thm)],[f434,f545]) ).

fof(f547,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ neq(sk1,X0)
      | ~ segmentP(sk2,X0)
      | ~ segmentP(X0,sk1)
      | ~ totalorderedP(X0) ),
    inference(forward_demodulation,[status(thm)],[f435,f546]) ).

fof(f548,plain,
    ( ~ ssList(sk5)
    | ~ segmentP(sk2,sk5)
    | ~ segmentP(sk5,sk1)
    | ~ totalorderedP(sk5)
    | ~ spl0_5 ),
    inference(resolution,[status(thm)],[f547,f462]) ).

fof(f549,plain,
    ( ~ spl0_2
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_5 ),
    inference(split_clause,[status(thm)],[f548,f451,f465,f469,f473,f461]) ).

fof(f558,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f460,f464,f468,f472,f476,f532,f534,f536,f549]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem  : SWC333-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.07  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.26  % Computer : n013.cluster.edu
% 0.06/0.26  % Model    : x86_64 x86_64
% 0.06/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26  % Memory   : 8042.1875MB
% 0.06/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26  % CPULimit : 300
% 0.06/0.26  % WCLimit  : 300
% 0.06/0.26  % DateTime : Tue May 30 11:18:19 EDT 2023
% 0.06/0.26  % CPUTime  : 
% 0.06/0.27  % Drodi V3.5.1
% 0.06/0.27  % Refutation found
% 0.06/0.27  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.06/0.27  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.06/0.28  % Elapsed time: 0.018424 seconds
% 0.06/0.28  % CPU time: 0.029974 seconds
% 0.06/0.28  % Memory used: 18.011 MB
%------------------------------------------------------------------------------