↑ Up

Z3---4.15.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SYN212-1 : TPTP v9.0.0. Released v1.1.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:38:30 AM UTC 2025

% Result   : Unsatisfiable 0.20s 0.47s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   41
% Syntax   : Number of formulae    :   91 (  22 unt;   0 typ;   0 def)
%            Number of atoms       :  381 (   0 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :  515 ( 239   ~; 235   |;   0   &)
%                                         (  41 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 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  :   14 (  13 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :  200 ( 181   !;   0   ?; 200   :)

% Comments : 
%------------------------------------------------------------------------------
tff(p3_type,type,
    p3: ( $i * $i * $i ) > $o ).

tff(e_type,type,
    e: $i ).

tff(n2_type,type,
    n2: $i > $o ).

tff(p1_type,type,
    p1: ( $i * $i * $i ) > $o ).

tff(k0_type,type,
    k0: $i > $o ).

tff(r0_type,type,
    r0: $i > $o ).

tff(k1_type,type,
    k1: $i > $o ).

tff(n0_type,type,
    n0: ( $i * $i ) > $o ).

tff(d_type,type,
    d: $i ).

tff(s4_type,type,
    s4: $i > $o ).

tff(l1_type,type,
    l1: ( $i * $i ) > $o ).

tff(1,plain,
    ^ [B: $i,A: $i,C: $i] :
      refl(( ( n2(A)
          | ~ p1(B,C,A) )
      <=> ( n2(A)
          | ~ p1(B,C,A) ) )),
    inference(bind,[status(th)],[]) ).

tff(2,plain,
    ( ! [B: $i,A: $i,C: $i] :
        ( n2(A)
        | ~ p1(B,C,A) )
  <=> ! [B: $i,A: $i,C: $i] :
        ( n2(A)
        | ~ p1(B,C,A) ) ),
    inference(quant_intro,[status(thm)],[1]) ).

tff(3,plain,
    ( ! [B: $i,A: $i,C: $i] :
        ( n2(A)
        | ~ p1(B,C,A) )
  <=> ! [B: $i,A: $i,C: $i] :
        ( n2(A)
        | ~ p1(B,C,A) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(4,axiom,
    ! [B: $i,A: $i,C: $i] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).

tff(5,plain,
    ! [B: $i,A: $i,C: $i] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    inference(modus_ponens,[status(thm)],[4,3]) ).

tff(6,plain,
    ! [B: $i,A: $i,C: $i] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    inference(skolemize,[status(sab)],[5]) ).

tff(7,plain,
    ! [B: $i,A: $i,C: $i] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    inference(modus_ponens,[status(thm)],[6,2]) ).

tff(8,plain,
    ( k0(e)
  <=> k0(e) ),
    inference(rewrite,[status(thm)],[]) ).

tff(9,axiom,
    k0(e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_28) ).

tff(10,plain,
    k0(e),
    inference(modus_ponens,[status(thm)],[9,8]) ).

tff(11,plain,
    ( r0(e)
  <=> r0(e) ),
    inference(rewrite,[status(thm)],[]) ).

tff(12,axiom,
    r0(e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_13) ).

tff(13,plain,
    r0(e),
    inference(modus_ponens,[status(thm)],[12,11]) ).

tff(14,plain,
    ( ( ~ r0(e)
      | ~ k0(e)
      | p1(e,e,e) )
  <=> ( ~ r0(e)
      | ~ k0(e)
      | p1(e,e,e) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(15,plain,
    ( ( ~ r0(e)
      | p1(e,e,e)
      | ~ k0(e) )
  <=> ( ~ r0(e)
      | ~ k0(e)
      | p1(e,e,e) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(16,plain,
    ( ( p1(e,e,e)
      | ~ r0(e) )
  <=> ( ~ r0(e)
      | p1(e,e,e) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(17,plain,
    ( ( p1(e,e,e)
      | ~ r0(e)
      | ~ k0(e) )
  <=> ( ~ r0(e)
      | p1(e,e,e)
      | ~ k0(e) ) ),
    inference(monotonicity,[status(thm)],[16]) ).

tff(18,plain,
    ( ( p1(e,e,e)
      | ~ r0(e)
      | ~ k0(e) )
  <=> ( ~ r0(e)
      | ~ k0(e)
      | p1(e,e,e) ) ),
    inference(transitivity,[status(thm)],[17,15]) ).

tff(19,axiom,
    ( p1(e,e,e)
    | ~ r0(e)
    | ~ k0(e) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_090) ).

tff(20,plain,
    ( ~ r0(e)
    | ~ k0(e)
    | p1(e,e,e) ),
    inference(modus_ponens,[status(thm)],[19,18]) ).

tff(21,plain,
    ( ~ r0(e)
    | ~ k0(e)
    | p1(e,e,e) ),
    inference(modus_ponens,[status(thm)],[20,14]) ).

tff(22,plain,
    ( ~ r0(e)
    | ~ k0(e)
    | p1(e,e,e) ),
    inference(modus_ponens,[status(thm)],[21,14]) ).

tff(23,plain,
    ( ~ r0(e)
    | ~ k0(e)
    | p1(e,e,e) ),
    inference(modus_ponens,[status(thm)],[22,14]) ).

tff(24,plain,
    ( ~ r0(e)
    | ~ k0(e)
    | p1(e,e,e) ),
    inference(modus_ponens,[status(thm)],[23,14]) ).

tff(25,plain,
    p1(e,e,e),
    inference(unit_resolution,[status(thm)],[24,13,10]) ).

tff(26,plain,
    ( ( ~ ! [B: $i,A: $i,C: $i] :
            ( n2(A)
            | ~ p1(B,C,A) )
      | n2(e)
      | ~ p1(e,e,e) )
  <=> ( ~ ! [B: $i,A: $i,C: $i] :
            ( n2(A)
            | ~ p1(B,C,A) )
      | n2(e)
      | ~ p1(e,e,e) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(27,plain,
    ( ~ ! [B: $i,A: $i,C: $i] :
          ( n2(A)
          | ~ p1(B,C,A) )
    | n2(e)
    | ~ p1(e,e,e) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(28,plain,
    ( ~ ! [B: $i,A: $i,C: $i] :
          ( n2(A)
          | ~ p1(B,C,A) )
    | n2(e)
    | ~ p1(e,e,e) ),
    inference(modus_ponens,[status(thm)],[27,26]) ).

tff(29,plain,
    n2(e),
    inference(unit_resolution,[status(thm)],[28,25,7]) ).

tff(30,plain,
    ^ [I: $i,J: $i] :
      refl(( ( k1(I)
          | ~ n0(J,I) )
      <=> ( k1(I)
          | ~ n0(J,I) ) )),
    inference(bind,[status(th)],[]) ).

tff(31,plain,
    ( ! [I: $i,J: $i] :
        ( k1(I)
        | ~ n0(J,I) )
  <=> ! [I: $i,J: $i] :
        ( k1(I)
        | ~ n0(J,I) ) ),
    inference(quant_intro,[status(thm)],[30]) ).

tff(32,plain,
    ( ! [I: $i,J: $i] :
        ( k1(I)
        | ~ n0(J,I) )
  <=> ! [I: $i,J: $i] :
        ( k1(I)
        | ~ n0(J,I) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(33,axiom,
    ! [I: $i,J: $i] :
      ( k1(I)
      | ~ n0(J,I) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).

tff(34,plain,
    ! [I: $i,J: $i] :
      ( k1(I)
      | ~ n0(J,I) ),
    inference(modus_ponens,[status(thm)],[33,32]) ).

tff(35,plain,
    ! [I: $i,J: $i] :
      ( k1(I)
      | ~ n0(J,I) ),
    inference(skolemize,[status(sab)],[34]) ).

tff(36,plain,
    ! [I: $i,J: $i] :
      ( k1(I)
      | ~ n0(J,I) ),
    inference(modus_ponens,[status(thm)],[35,31]) ).

tff(37,plain,
    ( n0(d,e)
  <=> n0(d,e) ),
    inference(rewrite,[status(thm)],[]) ).

tff(38,axiom,
    n0(d,e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_3) ).

tff(39,plain,
    n0(d,e),
    inference(modus_ponens,[status(thm)],[38,37]) ).

tff(40,plain,
    ( ( ~ ! [I: $i,J: $i] :
            ( k1(I)
            | ~ n0(J,I) )
      | k1(e)
      | ~ n0(d,e) )
  <=> ( ~ ! [I: $i,J: $i] :
            ( k1(I)
            | ~ n0(J,I) )
      | k1(e)
      | ~ n0(d,e) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(41,plain,
    ( ~ ! [I: $i,J: $i] :
          ( k1(I)
          | ~ n0(J,I) )
    | k1(e)
    | ~ n0(d,e) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(42,plain,
    ( ~ ! [I: $i,J: $i] :
          ( k1(I)
          | ~ n0(J,I) )
    | k1(e)
    | ~ n0(d,e) ),
    inference(modus_ponens,[status(thm)],[41,40]) ).

tff(43,plain,
    k1(e),
    inference(unit_resolution,[status(thm)],[42,39,36]) ).

tff(44,plain,
    ^ [H: $i] :
      refl(( ( ~ k1(H)
          | ~ n2(H)
          | p3(H,H,H) )
      <=> ( ~ k1(H)
          | ~ n2(H)
          | p3(H,H,H) ) )),
    inference(bind,[status(th)],[]) ).

tff(45,plain,
    ( ! [H: $i] :
        ( ~ k1(H)
        | ~ n2(H)
        | p3(H,H,H) )
  <=> ! [H: $i] :
        ( ~ k1(H)
        | ~ n2(H)
        | p3(H,H,H) ) ),
    inference(quant_intro,[status(thm)],[44]) ).

tff(46,plain,
    ( ! [H: $i] :
        ( ~ k1(H)
        | ~ n2(H)
        | p3(H,H,H) )
  <=> ! [H: $i] :
        ( ~ k1(H)
        | ~ n2(H)
        | p3(H,H,H) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(47,plain,
    ^ [H: $i] :
      trans(monotonicity(rewrite(( ( p3(H,H,H)
              | ~ k1(H) )
          <=> ( ~ k1(H)
              | p3(H,H,H) ) )),
          ( ( p3(H,H,H)
            | ~ k1(H)
            | ~ n2(H) )
        <=> ( ~ k1(H)
            | p3(H,H,H)
            | ~ n2(H) ) )),
        rewrite(( ( ~ k1(H)
            | p3(H,H,H)
            | ~ n2(H) )
        <=> ( ~ k1(H)
            | ~ n2(H)
            | p3(H,H,H) ) )),
        ( ( p3(H,H,H)
          | ~ k1(H)
          | ~ n2(H) )
      <=> ( ~ k1(H)
          | ~ n2(H)
          | p3(H,H,H) ) )),
    inference(bind,[status(th)],[]) ).

tff(48,plain,
    ( ! [H: $i] :
        ( p3(H,H,H)
        | ~ k1(H)
        | ~ n2(H) )
  <=> ! [H: $i] :
        ( ~ k1(H)
        | ~ n2(H)
        | p3(H,H,H) ) ),
    inference(quant_intro,[status(thm)],[47]) ).

tff(49,axiom,
    ! [H: $i] :
      ( p3(H,H,H)
      | ~ k1(H)
      | ~ n2(H) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_249) ).

tff(50,plain,
    ! [H: $i] :
      ( ~ k1(H)
      | ~ n2(H)
      | p3(H,H,H) ),
    inference(modus_ponens,[status(thm)],[49,48]) ).

tff(51,plain,
    ! [H: $i] :
      ( ~ k1(H)
      | ~ n2(H)
      | p3(H,H,H) ),
    inference(modus_ponens,[status(thm)],[50,46]) ).

tff(52,plain,
    ! [H: $i] :
      ( ~ k1(H)
      | ~ n2(H)
      | p3(H,H,H) ),
    inference(skolemize,[status(sab)],[51]) ).

tff(53,plain,
    ! [H: $i] :
      ( ~ k1(H)
      | ~ n2(H)
      | p3(H,H,H) ),
    inference(modus_ponens,[status(thm)],[52,45]) ).

tff(54,plain,
    ( ( ~ ! [H: $i] :
            ( ~ k1(H)
            | ~ n2(H)
            | p3(H,H,H) )
      | ~ k1(e)
      | ~ n2(e)
      | p3(e,e,e) )
  <=> ( ~ ! [H: $i] :
            ( ~ k1(H)
            | ~ n2(H)
            | p3(H,H,H) )
      | ~ k1(e)
      | ~ n2(e)
      | p3(e,e,e) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(55,plain,
    ( ~ ! [H: $i] :
          ( ~ k1(H)
          | ~ n2(H)
          | p3(H,H,H) )
    | ~ k1(e)
    | ~ n2(e)
    | p3(e,e,e) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(56,plain,
    ( ~ ! [H: $i] :
          ( ~ k1(H)
          | ~ n2(H)
          | p3(H,H,H) )
    | ~ k1(e)
    | ~ n2(e)
    | p3(e,e,e) ),
    inference(modus_ponens,[status(thm)],[55,54]) ).

tff(57,plain,
    p3(e,e,e),
    inference(unit_resolution,[status(thm)],[56,53,43,29]) ).

tff(58,plain,
    ( ~ s4(e)
  <=> ~ s4(e) ),
    inference(rewrite,[status(thm)],[]) ).

tff(59,axiom,
    ~ s4(e),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

tff(60,plain,
    ~ s4(e),
    inference(modus_ponens,[status(thm)],[59,58]) ).

tff(61,plain,
    ^ [B: $i,D: $i,A: $i,C: $i] :
      refl(( ( ~ l1(A,C)
          | ~ p3(B,C,D)
          | s4(A) )
      <=> ( ~ l1(A,C)
          | ~ p3(B,C,D)
          | s4(A) ) )),
    inference(bind,[status(th)],[]) ).

tff(62,plain,
    ( ! [B: $i,D: $i,A: $i,C: $i] :
        ( ~ l1(A,C)
        | ~ p3(B,C,D)
        | s4(A) )
  <=> ! [B: $i,D: $i,A: $i,C: $i] :
        ( ~ l1(A,C)
        | ~ p3(B,C,D)
        | s4(A) ) ),
    inference(quant_intro,[status(thm)],[61]) ).

tff(63,plain,
    ( ! [B: $i,D: $i,A: $i,C: $i] :
        ( ~ l1(A,C)
        | ~ p3(B,C,D)
        | s4(A) )
  <=> ! [B: $i,D: $i,A: $i,C: $i] :
        ( ~ l1(A,C)
        | ~ p3(B,C,D)
        | s4(A) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(64,plain,
    ^ [B: $i,D: $i,A: $i,C: $i] :
      rewrite(( ( s4(A)
          | ~ p3(B,C,D)
          | ~ l1(A,C) )
      <=> ( ~ l1(A,C)
          | ~ p3(B,C,D)
          | s4(A) ) )),
    inference(bind,[status(th)],[]) ).

tff(65,plain,
    ( ! [B: $i,D: $i,A: $i,C: $i] :
        ( s4(A)
        | ~ p3(B,C,D)
        | ~ l1(A,C) )
  <=> ! [B: $i,D: $i,A: $i,C: $i] :
        ( ~ l1(A,C)
        | ~ p3(B,C,D)
        | s4(A) ) ),
    inference(quant_intro,[status(thm)],[64]) ).

tff(66,axiom,
    ! [B: $i,D: $i,A: $i,C: $i] :
      ( s4(A)
      | ~ p3(B,C,D)
      | ~ l1(A,C) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_299) ).

tff(67,plain,
    ! [B: $i,D: $i,A: $i,C: $i] :
      ( ~ l1(A,C)
      | ~ p3(B,C,D)
      | s4(A) ),
    inference(modus_ponens,[status(thm)],[66,65]) ).

tff(68,plain,
    ! [B: $i,D: $i,A: $i,C: $i] :
      ( ~ l1(A,C)
      | ~ p3(B,C,D)
      | s4(A) ),
    inference(modus_ponens,[status(thm)],[67,63]) ).

tff(69,plain,
    ! [B: $i,D: $i,A: $i,C: $i] :
      ( ~ l1(A,C)
      | ~ p3(B,C,D)
      | s4(A) ),
    inference(skolemize,[status(sab)],[68]) ).

tff(70,plain,
    ! [B: $i,D: $i,A: $i,C: $i] :
      ( ~ l1(A,C)
      | ~ p3(B,C,D)
      | s4(A) ),
    inference(modus_ponens,[status(thm)],[69,62]) ).

tff(71,plain,
    ^ [H: $i,G: $i] :
      refl(( ( ~ n0(H,G)
          | l1(G,G) )
      <=> ( ~ n0(H,G)
          | l1(G,G) ) )),
    inference(bind,[status(th)],[]) ).

tff(72,plain,
    ( ! [H: $i,G: $i] :
        ( ~ n0(H,G)
        | l1(G,G) )
  <=> ! [H: $i,G: $i] :
        ( ~ n0(H,G)
        | l1(G,G) ) ),
    inference(quant_intro,[status(thm)],[71]) ).

tff(73,plain,
    ( ! [H: $i,G: $i] :
        ( ~ n0(H,G)
        | l1(G,G) )
  <=> ! [H: $i,G: $i] :
        ( ~ n0(H,G)
        | l1(G,G) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(74,plain,
    ^ [H: $i,G: $i] :
      rewrite(( ( l1(G,G)
          | ~ n0(H,G) )
      <=> ( ~ n0(H,G)
          | l1(G,G) ) )),
    inference(bind,[status(th)],[]) ).

tff(75,plain,
    ( ! [H: $i,G: $i] :
        ( l1(G,G)
        | ~ n0(H,G) )
  <=> ! [H: $i,G: $i] :
        ( ~ n0(H,G)
        | l1(G,G) ) ),
    inference(quant_intro,[status(thm)],[74]) ).

tff(76,axiom,
    ! [H: $i,G: $i] :
      ( l1(G,G)
      | ~ n0(H,G) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_002) ).

tff(77,plain,
    ! [H: $i,G: $i] :
      ( ~ n0(H,G)
      | l1(G,G) ),
    inference(modus_ponens,[status(thm)],[76,75]) ).

tff(78,plain,
    ! [H: $i,G: $i] :
      ( ~ n0(H,G)
      | l1(G,G) ),
    inference(modus_ponens,[status(thm)],[77,73]) ).

tff(79,plain,
    ! [H: $i,G: $i] :
      ( ~ n0(H,G)
      | l1(G,G) ),
    inference(skolemize,[status(sab)],[78]) ).

tff(80,plain,
    ! [H: $i,G: $i] :
      ( ~ n0(H,G)
      | l1(G,G) ),
    inference(modus_ponens,[status(thm)],[79,72]) ).

tff(81,plain,
    ( ( ~ ! [H: $i,G: $i] :
            ( ~ n0(H,G)
            | l1(G,G) )
      | ~ n0(d,e)
      | l1(e,e) )
  <=> ( ~ ! [H: $i,G: $i] :
            ( ~ n0(H,G)
            | l1(G,G) )
      | ~ n0(d,e)
      | l1(e,e) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(82,plain,
    ( ~ ! [H: $i,G: $i] :
          ( ~ n0(H,G)
          | l1(G,G) )
    | ~ n0(d,e)
    | l1(e,e) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(83,plain,
    ( ~ ! [H: $i,G: $i] :
          ( ~ n0(H,G)
          | l1(G,G) )
    | ~ n0(d,e)
    | l1(e,e) ),
    inference(modus_ponens,[status(thm)],[82,81]) ).

tff(84,plain,
    l1(e,e),
    inference(unit_resolution,[status(thm)],[83,39,80]) ).

tff(85,plain,
    ( ( ~ ! [B: $i,D: $i,A: $i,C: $i] :
            ( ~ l1(A,C)
            | ~ p3(B,C,D)
            | s4(A) )
      | ~ l1(e,e)
      | s4(e)
      | ~ p3(e,e,e) )
  <=> ( ~ ! [B: $i,D: $i,A: $i,C: $i] :
            ( ~ l1(A,C)
            | ~ p3(B,C,D)
            | s4(A) )
      | ~ l1(e,e)
      | s4(e)
      | ~ p3(e,e,e) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(86,plain,
    ( ( ~ l1(e,e)
      | ~ p3(e,e,e)
      | s4(e) )
  <=> ( ~ l1(e,e)
      | s4(e)
      | ~ p3(e,e,e) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(87,plain,
    ( ( ~ ! [B: $i,D: $i,A: $i,C: $i] :
            ( ~ l1(A,C)
            | ~ p3(B,C,D)
            | s4(A) )
      | ~ l1(e,e)
      | ~ p3(e,e,e)
      | s4(e) )
  <=> ( ~ ! [B: $i,D: $i,A: $i,C: $i] :
            ( ~ l1(A,C)
            | ~ p3(B,C,D)
            | s4(A) )
      | ~ l1(e,e)
      | s4(e)
      | ~ p3(e,e,e) ) ),
    inference(monotonicity,[status(thm)],[86]) ).

tff(88,plain,
    ( ( ~ ! [B: $i,D: $i,A: $i,C: $i] :
            ( ~ l1(A,C)
            | ~ p3(B,C,D)
            | s4(A) )
      | ~ l1(e,e)
      | ~ p3(e,e,e)
      | s4(e) )
  <=> ( ~ ! [B: $i,D: $i,A: $i,C: $i] :
            ( ~ l1(A,C)
            | ~ p3(B,C,D)
            | s4(A) )
      | ~ l1(e,e)
      | s4(e)
      | ~ p3(e,e,e) ) ),
    inference(transitivity,[status(thm)],[87,85]) ).

tff(89,plain,
    ( ~ ! [B: $i,D: $i,A: $i,C: $i] :
          ( ~ l1(A,C)
          | ~ p3(B,C,D)
          | s4(A) )
    | ~ l1(e,e)
    | ~ p3(e,e,e)
    | s4(e) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(90,plain,
    ( ~ ! [B: $i,D: $i,A: $i,C: $i] :
          ( ~ l1(A,C)
          | ~ p3(B,C,D)
          | s4(A) )
    | ~ l1(e,e)
    | s4(e)
    | ~ p3(e,e,e) ),
    inference(modus_ponens,[status(thm)],[89,88]) ).

tff(91,plain,
    $false,
    inference(unit_resolution,[status(thm)],[90,84,70,60,57]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYN212-1 : TPTP v9.0.0. Released v1.1.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n016.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Fri Jun 20 12:29:47 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 0.20/0.47  % SZS status Unsatisfiable
% 0.20/0.47  % SZS output start Proof
% See solution above
% 0.20/0.49  % E exiting
%------------------------------------------------------------------------------