↑ Up

Z3---4.15.1.UNS-Prf.s

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

% Computer : n016.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:30:55 AM UTC 2025

% Result   : Unsatisfiable 0.20s 0.46s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   32
% Syntax   : Number of formulae    :   89 (  23 unt;   0 typ;   0 def)
%            Number of atoms       :  396 (  10 equ)
%            Maximal formula atoms :   20 (   4 avg)
%            Number of connectives :  577 ( 284   ~; 248   |;   0   &)
%                                         (  45 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   14 (  14 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   17 (  15   !;   0   ?;  17   :)

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

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

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

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

tff(totalorderedP_type,type,
    totalorderedP: $i > $o ).

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

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

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

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

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

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

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

tff(4,plain,
    sk3 = sk1,
    inference(symmetry,[status(thm)],[3]) ).

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

tff(6,plain,
    ( neq(sk1,sk5)
  <=> neq(sk3,sk5) ),
    inference(symmetry,[status(thm)],[5]) ).

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

tff(8,plain,
    ( totalorderedP(sk3)
  <=> totalorderedP(sk1) ),
    inference(symmetry,[status(thm)],[7]) ).

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

tff(10,axiom,
    totalorderedP(sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

tff(11,plain,
    totalorderedP(sk3),
    inference(modus_ponens,[status(thm)],[10,9]) ).

tff(12,plain,
    totalorderedP(sk1),
    inference(modus_ponens,[status(thm)],[11,8]) ).

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

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

tff(15,plain,
    sk2 = sk4,
    inference(modus_ponens,[status(thm)],[14,13]) ).

tff(16,plain,
    ( segmentP(sk2,sk1)
  <=> segmentP(sk4,sk3) ),
    inference(monotonicity,[status(thm)],[15,3]) ).

tff(17,plain,
    ( segmentP(sk4,sk3)
  <=> segmentP(sk2,sk1) ),
    inference(symmetry,[status(thm)],[16]) ).

tff(18,plain,
    ( segmentP(sk4,sk3)
  <=> segmentP(sk4,sk3) ),
    inference(rewrite,[status(thm)],[]) ).

tff(19,axiom,
    segmentP(sk4,sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

tff(20,plain,
    segmentP(sk4,sk3),
    inference(modus_ponens,[status(thm)],[19,18]) ).

tff(21,plain,
    segmentP(sk2,sk1),
    inference(modus_ponens,[status(thm)],[20,17]) ).

tff(22,plain,
    ( ( ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1)
      | neq(sk1,sk5) )
  <=> ( ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1)
      | neq(sk1,sk5) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(23,plain,
    ( ( ~ segmentP(sk2,sk1)
      | neq(sk1,sk5)
      | ~ totalorderedP(sk1) )
  <=> ( ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1)
      | neq(sk1,sk5) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(24,plain,
    ( ( neq(sk1,sk5)
      | ~ segmentP(sk2,sk1) )
  <=> ( ~ segmentP(sk2,sk1)
      | neq(sk1,sk5) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(25,plain,
    ( ( neq(sk1,sk5)
      | ~ segmentP(sk2,sk1)
      | ~ totalorderedP(sk1) )
  <=> ( ~ segmentP(sk2,sk1)
      | neq(sk1,sk5)
      | ~ totalorderedP(sk1) ) ),
    inference(monotonicity,[status(thm)],[24]) ).

tff(26,plain,
    ( ( neq(sk1,sk5)
      | ~ segmentP(sk2,sk1)
      | ~ totalorderedP(sk1) )
  <=> ( ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1)
      | neq(sk1,sk5) ) ),
    inference(transitivity,[status(thm)],[25,23]) ).

tff(27,axiom,
    ( neq(sk1,sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

tff(28,plain,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | neq(sk1,sk5) ),
    inference(modus_ponens,[status(thm)],[27,26]) ).

tff(29,plain,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | neq(sk1,sk5) ),
    inference(modus_ponens,[status(thm)],[28,22]) ).

tff(30,plain,
    neq(sk1,sk5),
    inference(unit_resolution,[status(thm)],[29,21,12]) ).

tff(31,plain,
    neq(sk3,sk5),
    inference(modus_ponens,[status(thm)],[30,6]) ).

tff(32,plain,
    ( segmentP(sk5,sk3)
  <=> segmentP(sk5,sk1) ),
    inference(monotonicity,[status(thm)],[4]) ).

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

tff(34,plain,
    ( ( ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1)
      | segmentP(sk5,sk1) )
  <=> ( ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1)
      | segmentP(sk5,sk1) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(35,plain,
    ( ( ~ segmentP(sk2,sk1)
      | segmentP(sk5,sk1)
      | ~ totalorderedP(sk1) )
  <=> ( ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1)
      | segmentP(sk5,sk1) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(36,plain,
    ( ( segmentP(sk5,sk1)
      | ~ segmentP(sk2,sk1) )
  <=> ( ~ segmentP(sk2,sk1)
      | segmentP(sk5,sk1) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(37,plain,
    ( ( segmentP(sk5,sk1)
      | ~ segmentP(sk2,sk1)
      | ~ totalorderedP(sk1) )
  <=> ( ~ segmentP(sk2,sk1)
      | segmentP(sk5,sk1)
      | ~ totalorderedP(sk1) ) ),
    inference(monotonicity,[status(thm)],[36]) ).

tff(38,plain,
    ( ( segmentP(sk5,sk1)
      | ~ segmentP(sk2,sk1)
      | ~ totalorderedP(sk1) )
  <=> ( ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1)
      | segmentP(sk5,sk1) ) ),
    inference(transitivity,[status(thm)],[37,35]) ).

tff(39,axiom,
    ( segmentP(sk5,sk1)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

tff(40,plain,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | segmentP(sk5,sk1) ),
    inference(modus_ponens,[status(thm)],[39,38]) ).

tff(41,plain,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | segmentP(sk5,sk1) ),
    inference(modus_ponens,[status(thm)],[40,34]) ).

tff(42,plain,
    segmentP(sk5,sk1),
    inference(unit_resolution,[status(thm)],[41,21,12]) ).

tff(43,plain,
    segmentP(sk5,sk3),
    inference(modus_ponens,[status(thm)],[42,33]) ).

tff(44,plain,
    sk4 = sk2,
    inference(symmetry,[status(thm)],[15]) ).

tff(45,plain,
    ( segmentP(sk4,sk5)
  <=> segmentP(sk2,sk5) ),
    inference(monotonicity,[status(thm)],[44]) ).

tff(46,plain,
    ( segmentP(sk2,sk5)
  <=> segmentP(sk4,sk5) ),
    inference(symmetry,[status(thm)],[45]) ).

tff(47,plain,
    ( ( segmentP(sk2,sk5)
      | ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1) )
  <=> ( segmentP(sk2,sk5)
      | ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(48,plain,
    ( ( segmentP(sk2,sk5)
      | ~ segmentP(sk2,sk1)
      | ~ totalorderedP(sk1) )
  <=> ( segmentP(sk2,sk5)
      | ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(49,plain,
    ( ( segmentP(sk2,sk5)
      | ~ segmentP(sk2,sk1) )
  <=> ( segmentP(sk2,sk5)
      | ~ segmentP(sk2,sk1) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(50,plain,
    ( ( segmentP(sk2,sk5)
      | ~ segmentP(sk2,sk1)
      | ~ totalorderedP(sk1) )
  <=> ( segmentP(sk2,sk5)
      | ~ segmentP(sk2,sk1)
      | ~ totalorderedP(sk1) ) ),
    inference(monotonicity,[status(thm)],[49]) ).

tff(51,plain,
    ( ( segmentP(sk2,sk5)
      | ~ segmentP(sk2,sk1)
      | ~ totalorderedP(sk1) )
  <=> ( segmentP(sk2,sk5)
      | ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1) ) ),
    inference(transitivity,[status(thm)],[50,48]) ).

tff(52,axiom,
    ( segmentP(sk2,sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

tff(53,plain,
    ( segmentP(sk2,sk5)
    | ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1) ),
    inference(modus_ponens,[status(thm)],[52,51]) ).

tff(54,plain,
    ( segmentP(sk2,sk5)
    | ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1) ),
    inference(modus_ponens,[status(thm)],[53,47]) ).

tff(55,plain,
    ( segmentP(sk2,sk5)
    | ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1) ),
    inference(modus_ponens,[status(thm)],[54,47]) ).

tff(56,plain,
    ( segmentP(sk2,sk5)
    | ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1) ),
    inference(modus_ponens,[status(thm)],[55,47]) ).

tff(57,plain,
    ( segmentP(sk2,sk5)
    | ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1) ),
    inference(modus_ponens,[status(thm)],[56,47]) ).

tff(58,plain,
    segmentP(sk2,sk5),
    inference(unit_resolution,[status(thm)],[57,21,12]) ).

tff(59,plain,
    segmentP(sk4,sk5),
    inference(modus_ponens,[status(thm)],[58,46]) ).

tff(60,plain,
    ( ( ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1)
      | totalorderedP(sk5) )
  <=> ( ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1)
      | totalorderedP(sk5) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(61,plain,
    ( ( totalorderedP(sk5)
      | ~ segmentP(sk2,sk1)
      | ~ totalorderedP(sk1) )
  <=> ( ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1)
      | totalorderedP(sk5) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(62,axiom,
    ( totalorderedP(sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

tff(63,plain,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | totalorderedP(sk5) ),
    inference(modus_ponens,[status(thm)],[62,61]) ).

tff(64,plain,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | totalorderedP(sk5) ),
    inference(modus_ponens,[status(thm)],[63,60]) ).

tff(65,plain,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | totalorderedP(sk5) ),
    inference(modus_ponens,[status(thm)],[64,60]) ).

tff(66,plain,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | totalorderedP(sk5) ),
    inference(modus_ponens,[status(thm)],[65,60]) ).

tff(67,plain,
    ( ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1)
    | totalorderedP(sk5) ),
    inference(modus_ponens,[status(thm)],[66,60]) ).

tff(68,plain,
    totalorderedP(sk5),
    inference(unit_resolution,[status(thm)],[67,21,12]) ).

tff(69,plain,
    ( ( ssList(sk5)
      | ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1) )
  <=> ( ssList(sk5)
      | ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(70,plain,
    ( ( ssList(sk5)
      | ~ segmentP(sk2,sk1)
      | ~ totalorderedP(sk1) )
  <=> ( ssList(sk5)
      | ~ totalorderedP(sk1)
      | ~ segmentP(sk2,sk1) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(71,axiom,
    ( ssList(sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

tff(72,plain,
    ( ssList(sk5)
    | ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1) ),
    inference(modus_ponens,[status(thm)],[71,70]) ).

tff(73,plain,
    ( ssList(sk5)
    | ~ totalorderedP(sk1)
    | ~ segmentP(sk2,sk1) ),
    inference(modus_ponens,[status(thm)],[72,69]) ).

tff(74,plain,
    ssList(sk5),
    inference(unit_resolution,[status(thm)],[73,12,21]) ).

tff(75,plain,
    ^ [A: $i] :
      refl(( ( ~ ssList(A)
          | ~ segmentP(A,sk3)
          | ~ segmentP(sk4,A)
          | ~ totalorderedP(A)
          | ~ neq(sk3,A) )
      <=> ( ~ ssList(A)
          | ~ segmentP(A,sk3)
          | ~ segmentP(sk4,A)
          | ~ totalorderedP(A)
          | ~ neq(sk3,A) ) )),
    inference(bind,[status(th)],[]) ).

tff(76,plain,
    ( ! [A: $i] :
        ( ~ ssList(A)
        | ~ segmentP(A,sk3)
        | ~ segmentP(sk4,A)
        | ~ totalorderedP(A)
        | ~ neq(sk3,A) )
  <=> ! [A: $i] :
        ( ~ ssList(A)
        | ~ segmentP(A,sk3)
        | ~ segmentP(sk4,A)
        | ~ totalorderedP(A)
        | ~ neq(sk3,A) ) ),
    inference(quant_intro,[status(thm)],[75]) ).

tff(77,plain,
    ( ! [A: $i] :
        ( ~ ssList(A)
        | ~ segmentP(A,sk3)
        | ~ segmentP(sk4,A)
        | ~ totalorderedP(A)
        | ~ neq(sk3,A) )
  <=> ! [A: $i] :
        ( ~ ssList(A)
        | ~ segmentP(A,sk3)
        | ~ segmentP(sk4,A)
        | ~ totalorderedP(A)
        | ~ neq(sk3,A) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(78,plain,
    ^ [A: $i] :
      trans(monotonicity(trans(monotonicity(rewrite(( ( ~ ssList(A)
                  | ~ neq(sk3,A)
                  | ~ segmentP(sk4,A) )
              <=> ( ~ ssList(A)
                  | ~ segmentP(sk4,A)
                  | ~ neq(sk3,A) ) )),
              ( ( ~ ssList(A)
                | ~ neq(sk3,A)
                | ~ segmentP(sk4,A)
                | ~ segmentP(A,sk3) )
            <=> ( ~ ssList(A)
                | ~ segmentP(sk4,A)
                | ~ neq(sk3,A)
                | ~ segmentP(A,sk3) ) )),
            rewrite(( ( ~ ssList(A)
                | ~ segmentP(sk4,A)
                | ~ neq(sk3,A)
                | ~ segmentP(A,sk3) )
            <=> ( ~ ssList(A)
                | ~ segmentP(A,sk3)
                | ~ segmentP(sk4,A)
                | ~ neq(sk3,A) ) )),
            ( ( ~ ssList(A)
              | ~ neq(sk3,A)
              | ~ segmentP(sk4,A)
              | ~ segmentP(A,sk3) )
          <=> ( ~ ssList(A)
              | ~ segmentP(A,sk3)
              | ~ segmentP(sk4,A)
              | ~ neq(sk3,A) ) )),
          ( ( ~ ssList(A)
            | ~ neq(sk3,A)
            | ~ segmentP(sk4,A)
            | ~ segmentP(A,sk3)
            | ~ totalorderedP(A) )
        <=> ( ~ ssList(A)
            | ~ segmentP(A,sk3)
            | ~ segmentP(sk4,A)
            | ~ neq(sk3,A)
            | ~ totalorderedP(A) ) )),
        rewrite(( ( ~ ssList(A)
            | ~ segmentP(A,sk3)
            | ~ segmentP(sk4,A)
            | ~ neq(sk3,A)
            | ~ totalorderedP(A) )
        <=> ( ~ ssList(A)
            | ~ segmentP(A,sk3)
            | ~ segmentP(sk4,A)
            | ~ totalorderedP(A)
            | ~ neq(sk3,A) ) )),
        ( ( ~ ssList(A)
          | ~ neq(sk3,A)
          | ~ segmentP(sk4,A)
          | ~ segmentP(A,sk3)
          | ~ totalorderedP(A) )
      <=> ( ~ ssList(A)
          | ~ segmentP(A,sk3)
          | ~ segmentP(sk4,A)
          | ~ totalorderedP(A)
          | ~ neq(sk3,A) ) )),
    inference(bind,[status(th)],[]) ).

tff(79,plain,
    ( ! [A: $i] :
        ( ~ ssList(A)
        | ~ neq(sk3,A)
        | ~ segmentP(sk4,A)
        | ~ segmentP(A,sk3)
        | ~ totalorderedP(A) )
  <=> ! [A: $i] :
        ( ~ ssList(A)
        | ~ segmentP(A,sk3)
        | ~ segmentP(sk4,A)
        | ~ totalorderedP(A)
        | ~ neq(sk3,A) ) ),
    inference(quant_intro,[status(thm)],[78]) ).

tff(80,axiom,
    ! [A: $i] :
      ( ~ ssList(A)
      | ~ neq(sk3,A)
      | ~ segmentP(sk4,A)
      | ~ segmentP(A,sk3)
      | ~ totalorderedP(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

tff(81,plain,
    ! [A: $i] :
      ( ~ ssList(A)
      | ~ segmentP(A,sk3)
      | ~ segmentP(sk4,A)
      | ~ totalorderedP(A)
      | ~ neq(sk3,A) ),
    inference(modus_ponens,[status(thm)],[80,79]) ).

tff(82,plain,
    ! [A: $i] :
      ( ~ ssList(A)
      | ~ segmentP(A,sk3)
      | ~ segmentP(sk4,A)
      | ~ totalorderedP(A)
      | ~ neq(sk3,A) ),
    inference(modus_ponens,[status(thm)],[81,77]) ).

tff(83,plain,
    ! [A: $i] :
      ( ~ ssList(A)
      | ~ segmentP(A,sk3)
      | ~ segmentP(sk4,A)
      | ~ totalorderedP(A)
      | ~ neq(sk3,A) ),
    inference(skolemize,[status(sab)],[82]) ).

tff(84,plain,
    ! [A: $i] :
      ( ~ ssList(A)
      | ~ segmentP(A,sk3)
      | ~ segmentP(sk4,A)
      | ~ totalorderedP(A)
      | ~ neq(sk3,A) ),
    inference(modus_ponens,[status(thm)],[83,76]) ).

tff(85,plain,
    ( ( ~ ! [A: $i] :
            ( ~ ssList(A)
            | ~ segmentP(A,sk3)
            | ~ segmentP(sk4,A)
            | ~ totalorderedP(A)
            | ~ neq(sk3,A) )
      | ~ ssList(sk5)
      | ~ segmentP(sk5,sk3)
      | ~ segmentP(sk4,sk5)
      | ~ totalorderedP(sk5)
      | ~ neq(sk3,sk5) )
  <=> ( ~ ! [A: $i] :
            ( ~ ssList(A)
            | ~ segmentP(A,sk3)
            | ~ segmentP(sk4,A)
            | ~ totalorderedP(A)
            | ~ neq(sk3,A) )
      | ~ ssList(sk5)
      | ~ segmentP(sk5,sk3)
      | ~ segmentP(sk4,sk5)
      | ~ totalorderedP(sk5)
      | ~ neq(sk3,sk5) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(86,plain,
    ( ~ ! [A: $i] :
          ( ~ ssList(A)
          | ~ segmentP(A,sk3)
          | ~ segmentP(sk4,A)
          | ~ totalorderedP(A)
          | ~ neq(sk3,A) )
    | ~ ssList(sk5)
    | ~ segmentP(sk5,sk3)
    | ~ segmentP(sk4,sk5)
    | ~ totalorderedP(sk5)
    | ~ neq(sk3,sk5) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(87,plain,
    ( ~ ! [A: $i] :
          ( ~ ssList(A)
          | ~ segmentP(A,sk3)
          | ~ segmentP(sk4,A)
          | ~ totalorderedP(A)
          | ~ neq(sk3,A) )
    | ~ ssList(sk5)
    | ~ segmentP(sk5,sk3)
    | ~ segmentP(sk4,sk5)
    | ~ totalorderedP(sk5)
    | ~ neq(sk3,sk5) ),
    inference(modus_ponens,[status(thm)],[86,85]) ).

tff(88,plain,
    ( ~ segmentP(sk5,sk3)
    | ~ segmentP(sk4,sk5)
    | ~ neq(sk3,sk5) ),
    inference(unit_resolution,[status(thm)],[87,84,74,68]) ).

tff(89,plain,
    $false,
    inference(unit_resolution,[status(thm)],[88,59,43,31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SWC333-1 : TPTP v9.0.0. Released v2.4.0.
% 0.11/0.12  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n016.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Fri Jun 20 09:03:17 EDT 2025
% 0.12/0.34  % CPUTime    : 
% 0.20/0.46  % SZS status Unsatisfiable
% 0.20/0.46  % SZS output start Proof
% See solution above
% 0.20/0.48  % E exiting
%------------------------------------------------------------------------------