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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : SWC277-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 : Tue Apr 30 20:45:11 EDT 2024

% Result   : Unsatisfiable 2.86s 0.77s
% Output   : CNFRefutation 3.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   26
% Syntax   : Number of formulae    :   83 (  27 unt;   0 def)
%            Number of atoms       :  166 (  20 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  151 (  68   ~;  72   |;   0   &)
%                                         (  11 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   19 (  17 usr;  12 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   17 (  17   !;   0   ?)

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

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

fof(f47,axiom,
    ! [U] : ssItem(skaf44(U)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f56,axiom,
    ! [U] :
      ( ~ ssList(U)
      | segmentP(U,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f67,axiom,
    ! [U] :
      ( ~ ssItem(U)
      | totalorderedP(cons(U,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(f101,axiom,
    ! [U] :
      ( ~ singletonP(U)
      | ~ ssList(U)
      | cons(skaf44(U),nil) = U ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f186,negated_conjecture,
    ssList(sk1),
    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(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(sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f198,plain,
    totalorderedP(nil),
    inference(cnf_transformation,[status(esa)],[f4]) ).

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

fof(f241,plain,
    ! [X0] : ssItem(skaf44(X0)),
    inference(cnf_transformation,[status(esa)],[f47]) ).

fof(f250,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | segmentP(X0,nil) ),
    inference(cnf_transformation,[status(esa)],[f56]) ).

fof(f261,plain,
    ! [X0] :
      ( ~ ssItem(X0)
      | totalorderedP(cons(X0,nil)) ),
    inference(cnf_transformation,[status(esa)],[f67]) ).

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

fof(f298,plain,
    ! [X0] :
      ( ~ singletonP(X0)
      | ~ ssList(X0)
      | cons(skaf44(X0),nil) = X0 ),
    inference(cnf_transformation,[status(esa)],[f101]) ).

fof(f334,plain,
    ! [X0,X1] :
      ( ~ segmentP(X0,X1)
      | ~ segmentP(X1,X0)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | X1 = X0 ),
    inference(cnf_transformation,[status(esa)],[f127]) ).

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

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

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

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

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

fof(f432,plain,
    ~ totalorderedP(sk1),
    inference(cnf_transformation,[status(esa)],[f193]) ).

fof(f433,plain,
    ( singletonP(sk3)
    | ~ neq(sk4,nil) ),
    inference(cnf_transformation,[status(esa)],[f194]) ).

fof(f441,plain,
    ( spl0_2
  <=> singletonP(sk3) ),
    introduced(split_symbol_definition) ).

fof(f442,plain,
    ( singletonP(sk3)
    | ~ spl0_2 ),
    inference(component_clause,[status(thm)],[f441]) ).

fof(f444,plain,
    ( spl0_3
  <=> neq(sk4,nil) ),
    introduced(split_symbol_definition) ).

fof(f446,plain,
    ( ~ neq(sk4,nil)
    | spl0_3 ),
    inference(component_clause,[status(thm)],[f444]) ).

fof(f447,plain,
    ( spl0_2
    | ~ spl0_3 ),
    inference(split_clause,[status(thm)],[f433,f441,f444]) ).

fof(f479,plain,
    segmentP(sk2,sk3),
    inference(forward_demodulation,[status(thm)],[f429,f431]) ).

fof(f480,plain,
    segmentP(sk2,sk1),
    inference(forward_demodulation,[status(thm)],[f430,f479]) ).

fof(f481,plain,
    ( ~ neq(sk2,nil)
    | spl0_3 ),
    inference(forward_demodulation,[status(thm)],[f429,f446]) ).

fof(f482,plain,
    ( spl0_4
  <=> ssList(nil) ),
    introduced(split_symbol_definition) ).

fof(f484,plain,
    ( ~ ssList(nil)
    | spl0_4 ),
    inference(component_clause,[status(thm)],[f482]) ).

fof(f492,plain,
    ( $false
    | spl0_4 ),
    inference(forward_subsumption_resolution,[status(thm)],[f484,f202]) ).

fof(f493,plain,
    spl0_4,
    inference(contradiction_clause,[status(thm)],[f492]) ).

fof(f496,plain,
    ! [X0] :
      ( ~ segmentP(X0,sk1)
      | ~ segmentP(sk1,X0)
      | ~ ssList(X0)
      | sk1 = X0 ),
    inference(resolution,[status(thm)],[f334,f425]) ).

fof(f500,plain,
    ( spl0_7
  <=> ssList(sk2) ),
    introduced(split_symbol_definition) ).

fof(f502,plain,
    ( ~ ssList(sk2)
    | spl0_7 ),
    inference(component_clause,[status(thm)],[f500]) ).

fof(f508,plain,
    ( $false
    | spl0_7 ),
    inference(forward_subsumption_resolution,[status(thm)],[f502,f426]) ).

fof(f509,plain,
    spl0_7,
    inference(contradiction_clause,[status(thm)],[f508]) ).

fof(f514,plain,
    ( spl0_9
  <=> segmentP(nil,sk1) ),
    introduced(split_symbol_definition) ).

fof(f516,plain,
    ( ~ segmentP(nil,sk1)
    | spl0_9 ),
    inference(component_clause,[status(thm)],[f514]) ).

fof(f517,plain,
    ( spl0_10
  <=> sk1 = nil ),
    introduced(split_symbol_definition) ).

fof(f518,plain,
    ( sk1 = nil
    | ~ spl0_10 ),
    inference(component_clause,[status(thm)],[f517]) ).

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

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

fof(f523,plain,
    ( ~ segmentP(nil,sk1)
    | ~ ssList(nil)
    | sk1 = nil
    | ~ ssList(sk1) ),
    inference(resolution,[status(thm)],[f496,f250]) ).

fof(f524,plain,
    ( ~ spl0_9
    | ~ spl0_4
    | spl0_10
    | ~ spl0_11 ),
    inference(split_clause,[status(thm)],[f523,f514,f482,f517,f520]) ).

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

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

fof(f569,plain,
    ( spl0_18
  <=> sk2 = nil ),
    introduced(split_symbol_definition) ).

fof(f570,plain,
    ( sk2 = nil
    | ~ spl0_18 ),
    inference(component_clause,[status(thm)],[f569]) ).

fof(f572,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk2)
    | sk2 = nil
    | spl0_3 ),
    inference(resolution,[status(thm)],[f297,f481]) ).

fof(f573,plain,
    ( ~ spl0_4
    | ~ spl0_7
    | spl0_18
    | spl0_3 ),
    inference(split_clause,[status(thm)],[f572,f482,f500,f569,f444]) ).

fof(f574,plain,
    ( singletonP(sk1)
    | ~ spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f430,f442]) ).

fof(f584,plain,
    ( segmentP(nil,sk1)
    | ~ spl0_18 ),
    inference(backward_demodulation,[status(thm)],[f570,f480]) ).

fof(f585,plain,
    ( $false
    | spl0_9
    | ~ spl0_18 ),
    inference(forward_subsumption_resolution,[status(thm)],[f584,f516]) ).

fof(f586,plain,
    ( spl0_9
    | ~ spl0_18 ),
    inference(contradiction_clause,[status(thm)],[f585]) ).

fof(f1005,plain,
    ( spl0_83
  <=> cons(skaf44(sk1),nil) = sk1 ),
    introduced(split_symbol_definition) ).

fof(f1006,plain,
    ( cons(skaf44(sk1),nil) = sk1
    | ~ spl0_83 ),
    inference(component_clause,[status(thm)],[f1005]) ).

fof(f1008,plain,
    ( ~ ssList(sk1)
    | cons(skaf44(sk1),nil) = sk1
    | ~ spl0_2 ),
    inference(resolution,[status(thm)],[f298,f574]) ).

fof(f1009,plain,
    ( ~ spl0_11
    | spl0_83
    | ~ spl0_2 ),
    inference(split_clause,[status(thm)],[f1008,f520,f1005,f441]) ).

fof(f1010,plain,
    ( spl0_84
  <=> ssItem(skaf44(sk1)) ),
    introduced(split_symbol_definition) ).

fof(f1012,plain,
    ( ~ ssItem(skaf44(sk1))
    | spl0_84 ),
    inference(component_clause,[status(thm)],[f1010]) ).

fof(f1021,plain,
    ( spl0_87
  <=> totalorderedP(sk1) ),
    introduced(split_symbol_definition) ).

fof(f1022,plain,
    ( totalorderedP(sk1)
    | ~ spl0_87 ),
    inference(component_clause,[status(thm)],[f1021]) ).

fof(f1024,plain,
    ( ~ ssItem(skaf44(sk1))
    | totalorderedP(sk1)
    | ~ spl0_83 ),
    inference(paramodulation,[status(thm)],[f1006,f261]) ).

fof(f1025,plain,
    ( ~ spl0_84
    | spl0_87
    | ~ spl0_83 ),
    inference(split_clause,[status(thm)],[f1024,f1010,f1021,f1005]) ).

fof(f2837,plain,
    ( $false
    | spl0_84 ),
    inference(backward_subsumption_resolution,[status(thm)],[f1012,f241]) ).

fof(f2838,plain,
    spl0_84,
    inference(contradiction_clause,[status(thm)],[f2837]) ).

fof(f2851,plain,
    ( $false
    | ~ spl0_87 ),
    inference(forward_subsumption_resolution,[status(thm)],[f1022,f432]) ).

fof(f2852,plain,
    ~ spl0_87,
    inference(contradiction_clause,[status(thm)],[f2851]) ).

fof(f2858,plain,
    ( ~ totalorderedP(nil)
    | ~ spl0_10 ),
    inference(backward_demodulation,[status(thm)],[f518,f432]) ).

fof(f2859,plain,
    ( $false
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[status(thm)],[f2858,f198]) ).

fof(f2860,plain,
    ~ spl0_10,
    inference(contradiction_clause,[status(thm)],[f2859]) ).

fof(f2861,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f447,f493,f509,f524,f537,f573,f586,f1009,f1025,f2838,f2852,f2860]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SWC277-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.33  % Computer : n008.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Tue Apr 30 00:05:42 EDT 2024
% 0.11/0.33  % CPUTime  : 
% 0.11/0.34  % Drodi V3.6.0
% 2.86/0.77  % Refutation found
% 2.86/0.77  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 2.86/0.77  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 3.41/0.80  % Elapsed time: 0.456504 seconds
% 3.41/0.80  % CPU time: 3.480686 seconds
% 3.41/0.80  % Total memory used: 98.201 MB
% 3.41/0.80  % Net memory used: 95.803 MB
%------------------------------------------------------------------------------