↑ Up

Z3---4.15.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SWC037-1 : TPTP v9.0.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_E %s %d THM

% 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 : Sat Jun 21 05:29:59 AM UTC 2025

% Result   : Unsatisfiable 0.20s 0.45s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   39
% Syntax   : Number of formulae    :   93 (  28 unt;   0 typ;   0 def)
%            Number of atoms       :  468 (  94 equ)
%            Maximal formula atoms :   20 (   5 avg)
%            Number of connectives :  694 ( 343   ~; 299   |;   0   &)
%                                         (  52 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   24 (  24 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   95 (  86   !;   0   ?;  95   :)

% Comments : 
%------------------------------------------------------------------------------
tff(neq_type,type,
    neq: ( $i * $i ) > $o ).

tff(nil_type,type,
    nil: $i ).

tff(sk5_type,type,
    sk5: $i ).

tff(segmentP_type,type,
    segmentP: ( $i * $i ) > $o ).

tff(ssList_type,type,
    ssList: $i > $o ).

tff(sk3_type,type,
    sk3: $i ).

tff(sk1_type,type,
    sk1: $i ).

tff(sk4_type,type,
    sk4: $i ).

tff(sk2_type,type,
    sk2: $i ).

tff(1,plain,
    ( ( sk1 = sk3 )
  <=> ( sk1 = sk3 ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(2,axiom,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

tff(3,plain,
    sk1 = sk3,
    inference(modus_ponens,[status(thm)],[2,1]) ).

tff(4,plain,
    ( ( nil = sk1 )
  <=> ( nil = sk3 ) ),
    inference(monotonicity,[status(thm)],[3]) ).

tff(5,plain,
    ( ( nil != sk1 )
  <=> ( nil != sk3 ) ),
    inference(monotonicity,[status(thm)],[4]) ).

tff(6,plain,
    ( ( nil != sk1 )
  <=> ( nil != sk1 ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(7,axiom,
    nil != sk1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

tff(8,plain,
    nil != sk1,
    inference(modus_ponens,[status(thm)],[7,6]) ).

tff(9,plain,
    nil != sk3,
    inference(modus_ponens,[status(thm)],[8,5]) ).

tff(10,plain,
    ( ( ssList(sk5)
      | ( nil = sk3 ) )
  <=> ( ssList(sk5)
      | ( nil = sk3 ) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(11,axiom,
    ( ssList(sk5)
    | ( nil = sk3 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

tff(12,plain,
    ( ssList(sk5)
    | ( nil = sk3 ) ),
    inference(modus_ponens,[status(thm)],[11,10]) ).

tff(13,plain,
    ssList(sk5),
    inference(unit_resolution,[status(thm)],[12,9]) ).

tff(14,plain,
    ^ [U: $i] :
      refl(( ( ~ ssList(U)
          | segmentP(U,nil) )
      <=> ( ~ ssList(U)
          | segmentP(U,nil) ) )),
    inference(bind,[status(th)],[]) ).

tff(15,plain,
    ( ! [U: $i] :
        ( ~ ssList(U)
        | segmentP(U,nil) )
  <=> ! [U: $i] :
        ( ~ ssList(U)
        | segmentP(U,nil) ) ),
    inference(quant_intro,[status(thm)],[14]) ).

tff(16,plain,
    ( ! [U: $i] :
        ( ~ ssList(U)
        | segmentP(U,nil) )
  <=> ! [U: $i] :
        ( ~ ssList(U)
        | segmentP(U,nil) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(17,axiom,
    ! [U: $i] :
      ( ~ ssList(U)
      | segmentP(U,nil) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).

tff(18,plain,
    ! [U: $i] :
      ( ~ ssList(U)
      | segmentP(U,nil) ),
    inference(modus_ponens,[status(thm)],[17,16]) ).

tff(19,plain,
    ! [U: $i] :
      ( ~ ssList(U)
      | segmentP(U,nil) ),
    inference(skolemize,[status(sab)],[18]) ).

tff(20,plain,
    ! [U: $i] :
      ( ~ ssList(U)
      | segmentP(U,nil) ),
    inference(modus_ponens,[status(thm)],[19,15]) ).

tff(21,plain,
    ( ( ~ ! [U: $i] :
            ( ~ ssList(U)
            | segmentP(U,nil) )
      | ~ ssList(sk5)
      | segmentP(sk5,nil) )
  <=> ( ~ ! [U: $i] :
            ( ~ ssList(U)
            | segmentP(U,nil) )
      | ~ ssList(sk5)
      | segmentP(sk5,nil) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(22,plain,
    ( ~ ! [U: $i] :
          ( ~ ssList(U)
          | segmentP(U,nil) )
    | ~ ssList(sk5)
    | segmentP(sk5,nil) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(23,plain,
    ( ~ ! [U: $i] :
          ( ~ ssList(U)
          | segmentP(U,nil) )
    | ~ ssList(sk5)
    | segmentP(sk5,nil) ),
    inference(modus_ponens,[status(thm)],[22,21]) ).

tff(24,plain,
    segmentP(sk5,nil),
    inference(unit_resolution,[status(thm)],[23,20,13]) ).

tff(25,plain,
    ( ( sk2 = sk4 )
  <=> ( sk2 = sk4 ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(26,axiom,
    sk2 = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).

tff(27,plain,
    sk2 = sk4,
    inference(modus_ponens,[status(thm)],[26,25]) ).

tff(28,plain,
    ( ( nil = sk2 )
  <=> ( nil = sk2 ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(29,axiom,
    nil = sk2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).

tff(30,plain,
    nil = sk2,
    inference(modus_ponens,[status(thm)],[29,28]) ).

tff(31,plain,
    nil = sk4,
    inference(transitivity,[status(thm)],[30,27]) ).

tff(32,plain,
    ( segmentP(nil,sk5)
  <=> segmentP(sk4,sk5) ),
    inference(monotonicity,[status(thm)],[31]) ).

tff(33,plain,
    ( segmentP(sk4,sk5)
  <=> segmentP(nil,sk5) ),
    inference(symmetry,[status(thm)],[32]) ).

tff(34,plain,
    ( ( ( nil = sk3 )
      | segmentP(sk4,sk5) )
  <=> ( ( nil = sk3 )
      | segmentP(sk4,sk5) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(35,plain,
    ( ( segmentP(sk4,sk5)
      | ( nil = sk3 ) )
  <=> ( ( nil = sk3 )
      | segmentP(sk4,sk5) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(36,axiom,
    ( segmentP(sk4,sk5)
    | ( nil = sk3 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).

tff(37,plain,
    ( ( nil = sk3 )
    | segmentP(sk4,sk5) ),
    inference(modus_ponens,[status(thm)],[36,35]) ).

tff(38,plain,
    ( ( nil = sk3 )
    | segmentP(sk4,sk5) ),
    inference(modus_ponens,[status(thm)],[37,34]) ).

tff(39,plain,
    segmentP(sk4,sk5),
    inference(unit_resolution,[status(thm)],[38,9]) ).

tff(40,plain,
    segmentP(nil,sk5),
    inference(modus_ponens,[status(thm)],[39,33]) ).

tff(41,plain,
    ^ [V: $i,U: $i] :
      refl(( ( ~ ssList(U)
          | ~ ssList(V)
          | ( V = U )
          | ~ segmentP(V,U)
          | ~ segmentP(U,V) )
      <=> ( ~ ssList(U)
          | ~ ssList(V)
          | ( V = U )
          | ~ segmentP(V,U)
          | ~ segmentP(U,V) ) )),
    inference(bind,[status(th)],[]) ).

tff(42,plain,
    ( ! [V: $i,U: $i] :
        ( ~ ssList(U)
        | ~ ssList(V)
        | ( V = U )
        | ~ segmentP(V,U)
        | ~ segmentP(U,V) )
  <=> ! [V: $i,U: $i] :
        ( ~ ssList(U)
        | ~ ssList(V)
        | ( V = U )
        | ~ segmentP(V,U)
        | ~ segmentP(U,V) ) ),
    inference(quant_intro,[status(thm)],[41]) ).

tff(43,plain,
    ( ! [V: $i,U: $i] :
        ( ~ ssList(U)
        | ~ ssList(V)
        | ( V = U )
        | ~ segmentP(V,U)
        | ~ segmentP(U,V) )
  <=> ! [V: $i,U: $i] :
        ( ~ ssList(U)
        | ~ ssList(V)
        | ( V = U )
        | ~ segmentP(V,U)
        | ~ segmentP(U,V) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(44,plain,
    ^ [V: $i,U: $i] :
      trans(monotonicity(trans(monotonicity(rewrite(( ( ~ segmentP(U,V)
                  | ~ segmentP(V,U)
                  | ~ ssList(U) )
              <=> ( ~ ssList(U)
                  | ~ segmentP(V,U)
                  | ~ segmentP(U,V) ) )),
              ( ( ~ segmentP(U,V)
                | ~ segmentP(V,U)
                | ~ ssList(U)
                | ~ ssList(V) )
            <=> ( ~ ssList(U)
                | ~ segmentP(V,U)
                | ~ segmentP(U,V)
                | ~ ssList(V) ) )),
            rewrite(( ( ~ ssList(U)
                | ~ segmentP(V,U)
                | ~ segmentP(U,V)
                | ~ ssList(V) )
            <=> ( ~ ssList(U)
                | ~ ssList(V)
                | ~ segmentP(V,U)
                | ~ segmentP(U,V) ) )),
            ( ( ~ segmentP(U,V)
              | ~ segmentP(V,U)
              | ~ ssList(U)
              | ~ ssList(V) )
          <=> ( ~ ssList(U)
              | ~ ssList(V)
              | ~ segmentP(V,U)
              | ~ segmentP(U,V) ) )),
          ( ( ~ segmentP(U,V)
            | ~ segmentP(V,U)
            | ~ ssList(U)
            | ~ ssList(V)
            | ( V = U ) )
        <=> ( ~ ssList(U)
            | ~ ssList(V)
            | ~ segmentP(V,U)
            | ~ segmentP(U,V)
            | ( V = U ) ) )),
        rewrite(( ( ~ ssList(U)
            | ~ ssList(V)
            | ~ segmentP(V,U)
            | ~ segmentP(U,V)
            | ( V = U ) )
        <=> ( ~ ssList(U)
            | ~ ssList(V)
            | ( V = U )
            | ~ segmentP(V,U)
            | ~ segmentP(U,V) ) )),
        ( ( ~ segmentP(U,V)
          | ~ segmentP(V,U)
          | ~ ssList(U)
          | ~ ssList(V)
          | ( V = U ) )
      <=> ( ~ ssList(U)
          | ~ ssList(V)
          | ( V = U )
          | ~ segmentP(V,U)
          | ~ segmentP(U,V) ) )),
    inference(bind,[status(th)],[]) ).

tff(45,plain,
    ( ! [V: $i,U: $i] :
        ( ~ segmentP(U,V)
        | ~ segmentP(V,U)
        | ~ ssList(U)
        | ~ ssList(V)
        | ( V = U ) )
  <=> ! [V: $i,U: $i] :
        ( ~ ssList(U)
        | ~ ssList(V)
        | ( V = U )
        | ~ segmentP(V,U)
        | ~ segmentP(U,V) ) ),
    inference(quant_intro,[status(thm)],[44]) ).

tff(46,axiom,
    ! [V: $i,U: $i] :
      ( ~ segmentP(U,V)
      | ~ segmentP(V,U)
      | ~ ssList(U)
      | ~ ssList(V)
      | ( V = U ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause127) ).

tff(47,plain,
    ! [V: $i,U: $i] :
      ( ~ ssList(U)
      | ~ ssList(V)
      | ( V = U )
      | ~ segmentP(V,U)
      | ~ segmentP(U,V) ),
    inference(modus_ponens,[status(thm)],[46,45]) ).

tff(48,plain,
    ! [V: $i,U: $i] :
      ( ~ ssList(U)
      | ~ ssList(V)
      | ( V = U )
      | ~ segmentP(V,U)
      | ~ segmentP(U,V) ),
    inference(modus_ponens,[status(thm)],[47,43]) ).

tff(49,plain,
    ! [V: $i,U: $i] :
      ( ~ ssList(U)
      | ~ ssList(V)
      | ( V = U )
      | ~ segmentP(V,U)
      | ~ segmentP(U,V) ),
    inference(skolemize,[status(sab)],[48]) ).

tff(50,plain,
    ! [V: $i,U: $i] :
      ( ~ ssList(U)
      | ~ ssList(V)
      | ( V = U )
      | ~ segmentP(V,U)
      | ~ segmentP(U,V) ),
    inference(modus_ponens,[status(thm)],[49,42]) ).

tff(51,plain,
    ( ssList(nil)
  <=> ssList(nil) ),
    inference(rewrite,[status(thm)],[]) ).

tff(52,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).

tff(53,plain,
    ssList(nil),
    inference(modus_ponens,[status(thm)],[52,51]) ).

tff(54,plain,
    ( ( ~ ! [V: $i,U: $i] :
            ( ~ ssList(U)
            | ~ ssList(V)
            | ( V = U )
            | ~ segmentP(V,U)
            | ~ segmentP(U,V) )
      | ~ ssList(nil)
      | ~ ssList(sk5)
      | ~ segmentP(nil,sk5)
      | ~ segmentP(sk5,nil)
      | ( nil = sk5 ) )
  <=> ( ~ ! [V: $i,U: $i] :
            ( ~ ssList(U)
            | ~ ssList(V)
            | ( V = U )
            | ~ segmentP(V,U)
            | ~ segmentP(U,V) )
      | ~ ssList(nil)
      | ~ ssList(sk5)
      | ~ segmentP(nil,sk5)
      | ~ segmentP(sk5,nil)
      | ( nil = sk5 ) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(55,plain,
    ( ( ~ ssList(sk5)
      | ~ ssList(nil)
      | ( nil = sk5 )
      | ~ segmentP(nil,sk5)
      | ~ segmentP(sk5,nil) )
  <=> ( ~ ssList(nil)
      | ~ ssList(sk5)
      | ~ segmentP(nil,sk5)
      | ~ segmentP(sk5,nil)
      | ( nil = sk5 ) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(56,plain,
    ( ( ~ ! [V: $i,U: $i] :
            ( ~ ssList(U)
            | ~ ssList(V)
            | ( V = U )
            | ~ segmentP(V,U)
            | ~ segmentP(U,V) )
      | ~ ssList(sk5)
      | ~ ssList(nil)
      | ( nil = sk5 )
      | ~ segmentP(nil,sk5)
      | ~ segmentP(sk5,nil) )
  <=> ( ~ ! [V: $i,U: $i] :
            ( ~ ssList(U)
            | ~ ssList(V)
            | ( V = U )
            | ~ segmentP(V,U)
            | ~ segmentP(U,V) )
      | ~ ssList(nil)
      | ~ ssList(sk5)
      | ~ segmentP(nil,sk5)
      | ~ segmentP(sk5,nil)
      | ( nil = sk5 ) ) ),
    inference(monotonicity,[status(thm)],[55]) ).

tff(57,plain,
    ( ( ~ ! [V: $i,U: $i] :
            ( ~ ssList(U)
            | ~ ssList(V)
            | ( V = U )
            | ~ segmentP(V,U)
            | ~ segmentP(U,V) )
      | ~ ssList(sk5)
      | ~ ssList(nil)
      | ( nil = sk5 )
      | ~ segmentP(nil,sk5)
      | ~ segmentP(sk5,nil) )
  <=> ( ~ ! [V: $i,U: $i] :
            ( ~ ssList(U)
            | ~ ssList(V)
            | ( V = U )
            | ~ segmentP(V,U)
            | ~ segmentP(U,V) )
      | ~ ssList(nil)
      | ~ ssList(sk5)
      | ~ segmentP(nil,sk5)
      | ~ segmentP(sk5,nil)
      | ( nil = sk5 ) ) ),
    inference(transitivity,[status(thm)],[56,54]) ).

tff(58,plain,
    ( ~ ! [V: $i,U: $i] :
          ( ~ ssList(U)
          | ~ ssList(V)
          | ( V = U )
          | ~ segmentP(V,U)
          | ~ segmentP(U,V) )
    | ~ ssList(sk5)
    | ~ ssList(nil)
    | ( nil = sk5 )
    | ~ segmentP(nil,sk5)
    | ~ segmentP(sk5,nil) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(59,plain,
    ( ~ ! [V: $i,U: $i] :
          ( ~ ssList(U)
          | ~ ssList(V)
          | ( V = U )
          | ~ segmentP(V,U)
          | ~ segmentP(U,V) )
    | ~ ssList(nil)
    | ~ ssList(sk5)
    | ~ segmentP(nil,sk5)
    | ~ segmentP(sk5,nil)
    | ( nil = sk5 ) ),
    inference(modus_ponens,[status(thm)],[58,57]) ).

tff(60,plain,
    nil = sk5,
    inference(unit_resolution,[status(thm)],[59,53,50,13,40,24]) ).

tff(61,plain,
    sk5 = nil,
    inference(symmetry,[status(thm)],[60]) ).

tff(62,plain,
    ( neq(sk5,nil)
  <=> neq(nil,nil) ),
    inference(monotonicity,[status(thm)],[61]) ).

tff(63,plain,
    ( neq(nil,nil)
  <=> neq(sk5,nil) ),
    inference(symmetry,[status(thm)],[62]) ).

tff(64,plain,
    ( ~ neq(nil,nil)
  <=> ~ neq(sk5,nil) ),
    inference(monotonicity,[status(thm)],[63]) ).

tff(65,plain,
    ^ [V: $i] :
      refl(( ( ~ ssList(V)
          | ~ neq(V,V) )
      <=> ( ~ ssList(V)
          | ~ neq(V,V) ) )),
    inference(bind,[status(th)],[]) ).

tff(66,plain,
    ( ! [V: $i] :
        ( ~ ssList(V)
        | ~ neq(V,V) )
  <=> ! [V: $i] :
        ( ~ ssList(V)
        | ~ neq(V,V) ) ),
    inference(quant_intro,[status(thm)],[65]) ).

tff(67,plain,
    ( ! [V: $i] :
        ( ~ ssList(V)
        | ~ neq(V,V) )
  <=> ! [V: $i] :
        ( ~ ssList(V)
        | ~ neq(V,V) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(68,plain,
    ^ [V: $i] :
      rewrite(( ( ~ neq(V,V)
          | ~ ssList(V)
          | ~ ssList(V) )
      <=> ( ~ ssList(V)
          | ~ neq(V,V) ) )),
    inference(bind,[status(th)],[]) ).

tff(69,plain,
    ( ! [V: $i] :
        ( ~ neq(V,V)
        | ~ ssList(V)
        | ~ ssList(V) )
  <=> ! [V: $i] :
        ( ~ ssList(V)
        | ~ neq(V,V) ) ),
    inference(quant_intro,[status(thm)],[68]) ).

tff(70,plain,
    ( ! [V: $i,U: $i] :
        ( ~ neq(V,V)
        | ~ ssList(V)
        | ~ ssList(V) )
  <=> ! [V: $i] :
        ( ~ neq(V,V)
        | ~ ssList(V)
        | ~ ssList(V) ) ),
    inference(elim_unused_vars,[status(thm)],[]) ).

tff(71,plain,
    ( ! [V: $i,U: $i] :
        ( ~ ssList(U)
        | ~ ssList(V)
        | ( U != V )
        | ~ neq(U,V) )
  <=> ! [V: $i,U: $i] :
        ( ~ neq(V,V)
        | ~ ssList(V)
        | ~ ssList(V) ) ),
    inference(destructive_equality_resolution,[status(thm)],[]) ).

tff(72,plain,
    ( ! [V: $i,U: $i] :
        ( ~ ssList(U)
        | ~ ssList(V)
        | ( U != V )
        | ~ neq(U,V) )
  <=> ! [V: $i] :
        ( ~ neq(V,V)
        | ~ ssList(V)
        | ~ ssList(V) ) ),
    inference(transitivity,[status(thm)],[71,70]) ).

tff(73,plain,
    ( ! [V: $i,U: $i] :
        ( ~ ssList(U)
        | ~ ssList(V)
        | ( U != V )
        | ~ neq(U,V) )
  <=> ! [V: $i] :
        ( ~ ssList(V)
        | ~ neq(V,V) ) ),
    inference(transitivity,[status(thm)],[72,69]) ).

tff(74,plain,
    ^ [V: $i,U: $i] :
      trans(monotonicity(rewrite(( ( ( U != V )
              | ~ neq(U,V)
              | ~ ssList(V) )
          <=> ( ~ ssList(V)
              | ( U != V )
              | ~ neq(U,V) ) )),
          ( ( ( U != V )
            | ~ neq(U,V)
            | ~ ssList(V)
            | ~ ssList(U) )
        <=> ( ~ ssList(V)
            | ( U != V )
            | ~ neq(U,V)
            | ~ ssList(U) ) )),
        rewrite(( ( ~ ssList(V)
            | ( U != V )
            | ~ neq(U,V)
            | ~ ssList(U) )
        <=> ( ~ ssList(U)
            | ~ ssList(V)
            | ( U != V )
            | ~ neq(U,V) ) )),
        ( ( ( U != V )
          | ~ neq(U,V)
          | ~ ssList(V)
          | ~ ssList(U) )
      <=> ( ~ ssList(U)
          | ~ ssList(V)
          | ( U != V )
          | ~ neq(U,V) ) )),
    inference(bind,[status(th)],[]) ).

tff(75,plain,
    ( ! [V: $i,U: $i] :
        ( ( U != V )
        | ~ neq(U,V)
        | ~ ssList(V)
        | ~ ssList(U) )
  <=> ! [V: $i,U: $i] :
        ( ~ ssList(U)
        | ~ ssList(V)
        | ( U != V )
        | ~ neq(U,V) ) ),
    inference(quant_intro,[status(thm)],[74]) ).

tff(76,plain,
    ( ! [V: $i,U: $i] :
        ( ( U != V )
        | ~ neq(U,V)
        | ~ ssList(V)
        | ~ ssList(U) )
  <=> ! [V: $i] :
        ( ~ ssList(V)
        | ~ neq(V,V) ) ),
    inference(transitivity,[status(thm)],[75,73]) ).

tff(77,axiom,
    ! [V: $i,U: $i] :
      ( ( U != V )
      | ~ neq(U,V)
      | ~ ssList(V)
      | ~ ssList(U) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).

tff(78,plain,
    ! [V: $i] :
      ( ~ ssList(V)
      | ~ neq(V,V) ),
    inference(modus_ponens,[status(thm)],[77,76]) ).

tff(79,plain,
    ! [V: $i] :
      ( ~ ssList(V)
      | ~ neq(V,V) ),
    inference(modus_ponens,[status(thm)],[78,67]) ).

tff(80,plain,
    ! [V: $i] :
      ( ~ ssList(V)
      | ~ neq(V,V) ),
    inference(skolemize,[status(sab)],[79]) ).

tff(81,plain,
    ! [V: $i] :
      ( ~ ssList(V)
      | ~ neq(V,V) ),
    inference(modus_ponens,[status(thm)],[80,66]) ).

tff(82,plain,
    ( ( ~ ! [V: $i] :
            ( ~ ssList(V)
            | ~ neq(V,V) )
      | ~ ssList(nil)
      | ~ neq(nil,nil) )
  <=> ( ~ ! [V: $i] :
            ( ~ ssList(V)
            | ~ neq(V,V) )
      | ~ ssList(nil)
      | ~ neq(nil,nil) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(83,plain,
    ( ~ ! [V: $i] :
          ( ~ ssList(V)
          | ~ neq(V,V) )
    | ~ ssList(nil)
    | ~ neq(nil,nil) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(84,plain,
    ( ~ ! [V: $i] :
          ( ~ ssList(V)
          | ~ neq(V,V) )
    | ~ ssList(nil)
    | ~ neq(nil,nil) ),
    inference(modus_ponens,[status(thm)],[83,82]) ).

tff(85,plain,
    ~ neq(nil,nil),
    inference(unit_resolution,[status(thm)],[84,53,81]) ).

tff(86,plain,
    ~ neq(sk5,nil),
    inference(modus_ponens,[status(thm)],[85,64]) ).

tff(87,plain,
    ( ( ( nil = sk3 )
      | neq(sk5,nil) )
  <=> ( ( nil = sk3 )
      | neq(sk5,nil) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(88,plain,
    ( ( neq(sk5,nil)
      | ( nil = sk3 ) )
  <=> ( ( nil = sk3 )
      | neq(sk5,nil) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(89,axiom,
    ( neq(sk5,nil)
    | ( nil = sk3 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

tff(90,plain,
    ( ( nil = sk3 )
    | neq(sk5,nil) ),
    inference(modus_ponens,[status(thm)],[89,88]) ).

tff(91,plain,
    ( ( nil = sk3 )
    | neq(sk5,nil) ),
    inference(modus_ponens,[status(thm)],[90,87]) ).

tff(92,plain,
    neq(sk5,nil),
    inference(unit_resolution,[status(thm)],[91,9]) ).

tff(93,plain,
    $false,
    inference(unit_resolution,[status(thm)],[92,86]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWC037-1 : TPTP v9.0.0. Released v2.4.0.
% 0.03/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n008.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Fri Jun 20 08:05:33 EDT 2025
% 0.12/0.33  % CPUTime    : 
% 0.20/0.45  % SZS status Unsatisfiable
% 0.20/0.45  % SZS output start Proof
% See solution above
% 0.20/0.47  % E exiting
%------------------------------------------------------------------------------