TSTP Solution File: SYN117-1 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : SYN117-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n021.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 : Thu Sep 29 23:53:49 EDT 2022

% Result   : Unsatisfiable 0.19s 0.48s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   80
% Syntax   : Number of formulae    :  165 (  31 unt;  15 typ;   0 def)
%            Number of atoms       :  628 (   0 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :  846 ( 387   ~; 382   |;   0   &)
%                                         (  77 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   19 (  19 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   25 (  13   >;  12   *;   0   +;   0  <<)
%            Number of predicates  :   19 (  17 usr;   2 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :  348 ( 315   !;   0   ?; 348   :)

% Comments : 
%------------------------------------------------------------------------------
tff(r3_type,type,
    r3: ( $i * $i * $i ) > $o ).

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

tff(p2_type,type,
    p2: ( $i * $i * $i ) > $o ).

tff(m1_type,type,
    m1: ( $i * $i * $i ) > $o ).

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

tff(k5_type,type,
    k5: $i > $o ).

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

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

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

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

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

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

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

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

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

tff(1,plain,
    ^ [D: $i,E: $i] :
      refl(
        ( ( p2(D,E,D)
          | ~ m1(E,D,E) )
      <=> ( p2(D,E,D)
          | ~ m1(E,D,E) ) )),
    inference(bind,[status(th)],]) ).

tff(2,plain,
    ( ! [D: $i,E: $i] :
        ( p2(D,E,D)
        | ~ m1(E,D,E) )
  <=> ! [D: $i,E: $i] :
        ( p2(D,E,D)
        | ~ m1(E,D,E) ) ),
    inference(quant_intro,[status(thm)],[1]) ).

tff(3,plain,
    ( ! [D: $i,E: $i] :
        ( p2(D,E,D)
        | ~ m1(E,D,E) )
  <=> ! [D: $i,E: $i] :
        ( p2(D,E,D)
        | ~ m1(E,D,E) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(4,axiom,
    ! [D: $i,E: $i] :
      ( p2(D,E,D)
      | ~ m1(E,D,E) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_176) ).

tff(5,plain,
    ! [D: $i,E: $i] :
      ( p2(D,E,D)
      | ~ m1(E,D,E) ),
    inference(modus_ponens,[status(thm)],[4,3]) ).

tff(6,plain,
    ! [D: $i,E: $i] :
      ( p2(D,E,D)
      | ~ m1(E,D,E) ),
    inference(skolemize,[status(sab)],[5]) ).

tff(7,plain,
    ! [D: $i,E: $i] :
      ( p2(D,E,D)
      | ~ m1(E,D,E) ),
    inference(modus_ponens,[status(thm)],[6,2]) ).

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

tff(9,plain,
    ( ( $false
      | m1(e,e,e) )
  <=> m1(e,e,e) ),
    inference(rewrite,[status(thm)],]) ).

tff(10,plain,
    ( ~ $true
  <=> $false ),
    inference(rewrite,[status(thm)],]) ).

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

tff(12,plain,
    ( r0(e)
  <=> $true ),
    inference(iff_true,[status(thm)],[11]) ).

tff(13,plain,
    ( ~ r0(e)
  <=> ~ $true ),
    inference(monotonicity,[status(thm)],[12]) ).

tff(14,plain,
    ( ~ r0(e)
  <=> $false ),
    inference(transitivity,[status(thm)],[13,10]) ).

tff(15,plain,
    ( ( ~ r0(e)
      | m1(e,e,e) )
  <=> ( $false
      | m1(e,e,e) ) ),
    inference(monotonicity,[status(thm)],[14]) ).

tff(16,plain,
    ( ( ~ r0(e)
      | m1(e,e,e) )
  <=> m1(e,e,e) ),
    inference(transitivity,[status(thm)],[15,9]) ).

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

tff(18,axiom,
    ( m1(e,e,e)
    | ~ r0(e) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_012) ).

tff(19,plain,
    ( ~ r0(e)
    | m1(e,e,e) ),
    inference(modus_ponens,[status(thm)],[18,17]) ).

tff(20,plain,
    m1(e,e,e),
    inference(modus_ponens,[status(thm)],[19,16]) ).

tff(21,plain,
    m1(e,e,e),
    inference(modus_ponens,[status(thm)],[20,8]) ).

tff(22,plain,
    ( ( ~ ! [D: $i,E: $i] :
            ( p2(D,E,D)
            | ~ m1(E,D,E) )
      | ~ m1(e,e,e)
      | p2(e,e,e) )
  <=> ( ~ ! [D: $i,E: $i] :
            ( p2(D,E,D)
            | ~ m1(E,D,E) )
      | ~ m1(e,e,e)
      | p2(e,e,e) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(23,plain,
    ( ( p2(e,e,e)
      | ~ m1(e,e,e) )
  <=> ( ~ m1(e,e,e)
      | p2(e,e,e) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(24,plain,
    ( ( ~ ! [D: $i,E: $i] :
            ( p2(D,E,D)
            | ~ m1(E,D,E) )
      | p2(e,e,e)
      | ~ m1(e,e,e) )
  <=> ( ~ ! [D: $i,E: $i] :
            ( p2(D,E,D)
            | ~ m1(E,D,E) )
      | ~ m1(e,e,e)
      | p2(e,e,e) ) ),
    inference(monotonicity,[status(thm)],[23]) ).

tff(25,plain,
    ( ( ~ ! [D: $i,E: $i] :
            ( p2(D,E,D)
            | ~ m1(E,D,E) )
      | p2(e,e,e)
      | ~ m1(e,e,e) )
  <=> ( ~ ! [D: $i,E: $i] :
            ( p2(D,E,D)
            | ~ m1(E,D,E) )
      | ~ m1(e,e,e)
      | p2(e,e,e) ) ),
    inference(transitivity,[status(thm)],[24,22]) ).

tff(26,plain,
    ( ~ ! [D: $i,E: $i] :
          ( p2(D,E,D)
          | ~ m1(E,D,E) )
    | p2(e,e,e)
    | ~ m1(e,e,e) ),
    inference(quant_inst,[status(thm)],]) ).

tff(27,plain,
    ( ~ ! [D: $i,E: $i] :
          ( p2(D,E,D)
          | ~ m1(E,D,E) )
    | ~ m1(e,e,e)
    | p2(e,e,e) ),
    inference(modus_ponens,[status(thm)],[26,25]) ).

tff(28,plain,
    p2(e,e,e),
    inference(unit_resolution,[status(thm)],[27,21,7]) ).

tff(29,plain,
    ^ [B: $i,D: $i,C: $i] :
      refl(
        ( ( ~ p2(B,D,C)
          | r3(B,C,B) )
      <=> ( ~ p2(B,D,C)
          | r3(B,C,B) ) )),
    inference(bind,[status(th)],]) ).

tff(30,plain,
    ( ! [B: $i,D: $i,C: $i] :
        ( ~ p2(B,D,C)
        | r3(B,C,B) )
  <=> ! [B: $i,D: $i,C: $i] :
        ( ~ p2(B,D,C)
        | r3(B,C,B) ) ),
    inference(quant_intro,[status(thm)],[29]) ).

tff(31,plain,
    ( ! [B: $i,D: $i,C: $i] :
        ( ~ p2(B,D,C)
        | r3(B,C,B) )
  <=> ! [B: $i,D: $i,C: $i] :
        ( ~ p2(B,D,C)
        | r3(B,C,B) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(32,plain,
    ^ [B: $i,D: $i,C: $i] :
      rewrite(
        ( ( r3(B,C,B)
          | ~ p2(B,D,C) )
      <=> ( ~ p2(B,D,C)
          | r3(B,C,B) ) )),
    inference(bind,[status(th)],]) ).

tff(33,plain,
    ( ! [B: $i,D: $i,C: $i] :
        ( r3(B,C,B)
        | ~ p2(B,D,C) )
  <=> ! [B: $i,D: $i,C: $i] :
        ( ~ p2(B,D,C)
        | r3(B,C,B) ) ),
    inference(quant_intro,[status(thm)],[32]) ).

tff(34,axiom,
    ! [B: $i,D: $i,C: $i] :
      ( r3(B,C,B)
      | ~ p2(B,D,C) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_267) ).

tff(35,plain,
    ! [B: $i,D: $i,C: $i] :
      ( ~ p2(B,D,C)
      | r3(B,C,B) ),
    inference(modus_ponens,[status(thm)],[34,33]) ).

tff(36,plain,
    ! [B: $i,D: $i,C: $i] :
      ( ~ p2(B,D,C)
      | r3(B,C,B) ),
    inference(modus_ponens,[status(thm)],[35,31]) ).

tff(37,plain,
    ! [B: $i,D: $i,C: $i] :
      ( ~ p2(B,D,C)
      | r3(B,C,B) ),
    inference(skolemize,[status(sab)],[36]) ).

tff(38,plain,
    ! [B: $i,D: $i,C: $i] :
      ( ~ p2(B,D,C)
      | r3(B,C,B) ),
    inference(modus_ponens,[status(thm)],[37,30]) ).

tff(39,plain,
    ( ( ~ ! [B: $i,D: $i,C: $i] :
            ( ~ p2(B,D,C)
            | r3(B,C,B) )
      | ~ p2(e,e,e)
      | r3(e,e,e) )
  <=> ( ~ ! [B: $i,D: $i,C: $i] :
            ( ~ p2(B,D,C)
            | r3(B,C,B) )
      | ~ p2(e,e,e)
      | r3(e,e,e) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(40,plain,
    ( ~ ! [B: $i,D: $i,C: $i] :
          ( ~ p2(B,D,C)
          | r3(B,C,B) )
    | ~ p2(e,e,e)
    | r3(e,e,e) ),
    inference(quant_inst,[status(thm)],]) ).

tff(41,plain,
    ( ~ ! [B: $i,D: $i,C: $i] :
          ( ~ p2(B,D,C)
          | r3(B,C,B) )
    | ~ p2(e,e,e)
    | r3(e,e,e) ),
    inference(modus_ponens,[status(thm)],[40,39]) ).

tff(42,plain,
    r3(e,e,e),
    inference(unit_resolution,[status(thm)],[41,38,28]) ).

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

tff(44,axiom,
    ~ k5(e),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

tff(45,plain,
    ~ k5(e),
    inference(modus_ponens,[status(thm)],[44,43]) ).

tff(46,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(47,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)],[46]) ).

tff(48,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(49,axiom,
    ! [B: $i,A: $i,C: $i] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).

tff(50,plain,
    ! [B: $i,A: $i,C: $i] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    inference(modus_ponens,[status(thm)],[49,48]) ).

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

tff(52,plain,
    ! [B: $i,A: $i,C: $i] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    inference(modus_ponens,[status(thm)],[51,47]) ).

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

tff(54,plain,
    ( ( $false
      | $false
      | p1(e,e,e) )
  <=> p1(e,e,e) ),
    inference(rewrite,[status(thm)],]) ).

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

tff(56,plain,
    ( k0(e)
  <=> $true ),
    inference(iff_true,[status(thm)],[55]) ).

tff(57,plain,
    ( ~ k0(e)
  <=> ~ $true ),
    inference(monotonicity,[status(thm)],[56]) ).

tff(58,plain,
    ( ~ k0(e)
  <=> $false ),
    inference(transitivity,[status(thm)],[57,10]) ).

tff(59,plain,
    ( ( ~ r0(e)
      | ~ k0(e)
      | p1(e,e,e) )
  <=> ( $false
      | $false
      | p1(e,e,e) ) ),
    inference(monotonicity,[status(thm)],[14,58]) ).

tff(60,plain,
    ( ( ~ r0(e)
      | ~ k0(e)
      | p1(e,e,e) )
  <=> p1(e,e,e) ),
    inference(transitivity,[status(thm)],[59,54]) ).

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

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

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

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

tff(65,plain,
    ( ( p1(e,e,e)
      | ~ r0(e)
      | ~ k0(e) )
  <=> ( ~ r0(e)
      | ~ k0(e)
      | p1(e,e,e) ) ),
    inference(transitivity,[status(thm)],[64,62]) ).

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

tff(67,plain,
    ( ~ r0(e)
    | ~ k0(e)
    | p1(e,e,e) ),
    inference(modus_ponens,[status(thm)],[66,65]) ).

tff(68,plain,
    ( ~ r0(e)
    | ~ k0(e)
    | p1(e,e,e) ),
    inference(modus_ponens,[status(thm)],[67,61]) ).

tff(69,plain,
    p1(e,e,e),
    inference(modus_ponens,[status(thm)],[68,60]) ).

tff(70,plain,
    p1(e,e,e),
    inference(modus_ponens,[status(thm)],[69,53]) ).

tff(71,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(72,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(73,plain,
    ( ~ ! [B: $i,A: $i,C: $i] :
          ( n2(A)
          | ~ p1(B,C,A) )
    | n2(e)
    | ~ p1(e,e,e) ),
    inference(modus_ponens,[status(thm)],[72,71]) ).

tff(74,plain,
    n2(e),
    inference(unit_resolution,[status(thm)],[73,70,52]) ).

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

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

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

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

tff(79,plain,
    ! [I: $i,J: $i] :
      ( k1(I)
      | ~ n0(J,I) ),
    inference(modus_ponens,[status(thm)],[78,77]) ).

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

tff(81,plain,
    ! [I: $i,J: $i] :
      ( k1(I)
      | ~ n0(J,I) ),
    inference(modus_ponens,[status(thm)],[80,76]) ).

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

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

tff(84,plain,
    n0(d,e),
    inference(modus_ponens,[status(thm)],[83,82]) ).

tff(85,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(86,plain,
    ( ~ ! [I: $i,J: $i] :
          ( k1(I)
          | ~ n0(J,I) )
    | k1(e)
    | ~ n0(d,e) ),
    inference(quant_inst,[status(thm)],]) ).

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

tff(88,plain,
    k1(e),
    inference(unit_resolution,[status(thm)],[87,84,81]) ).

tff(89,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(90,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)],[89]) ).

tff(91,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(92,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(93,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)],[92]) ).

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

tff(95,plain,
    ! [H: $i] :
      ( ~ k1(H)
      | ~ n2(H)
      | p3(H,H,H) ),
    inference(modus_ponens,[status(thm)],[94,93]) ).

tff(96,plain,
    ! [H: $i] :
      ( ~ k1(H)
      | ~ n2(H)
      | p3(H,H,H) ),
    inference(modus_ponens,[status(thm)],[95,91]) ).

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

tff(98,plain,
    ! [H: $i] :
      ( ~ k1(H)
      | ~ n2(H)
      | p3(H,H,H) ),
    inference(modus_ponens,[status(thm)],[97,90]) ).

tff(99,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(100,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(101,plain,
    ( ~ ! [H: $i] :
          ( ~ k1(H)
          | ~ n2(H)
          | p3(H,H,H) )
    | ~ k1(e)
    | ~ n2(e)
    | p3(e,e,e) ),
    inference(modus_ponens,[status(thm)],[100,99]) ).

tff(102,plain,
    p3(e,e,e),
    inference(unit_resolution,[status(thm)],[101,98,88,74]) ).

tff(103,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(104,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)],[103]) ).

tff(105,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(106,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(107,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)],[106]) ).

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

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

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

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

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

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

tff(114,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)],[113]) ).

tff(115,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(116,plain,
    ^ [H: $i,G: $i] :
      rewrite(
        ( ( l1(G,G)
          | ~ n0(H,G) )
      <=> ( ~ n0(H,G)
          | l1(G,G) ) )),
    inference(bind,[status(th)],]) ).

tff(117,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)],[116]) ).

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

tff(119,plain,
    ! [H: $i,G: $i] :
      ( ~ n0(H,G)
      | l1(G,G) ),
    inference(modus_ponens,[status(thm)],[118,117]) ).

tff(120,plain,
    ! [H: $i,G: $i] :
      ( ~ n0(H,G)
      | l1(G,G) ),
    inference(modus_ponens,[status(thm)],[119,115]) ).

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

tff(122,plain,
    ! [H: $i,G: $i] :
      ( ~ n0(H,G)
      | l1(G,G) ),
    inference(modus_ponens,[status(thm)],[121,114]) ).

tff(123,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(124,plain,
    ( ~ ! [H: $i,G: $i] :
          ( ~ n0(H,G)
          | l1(G,G) )
    | ~ n0(d,e)
    | l1(e,e) ),
    inference(quant_inst,[status(thm)],]) ).

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

tff(126,plain,
    l1(e,e),
    inference(unit_resolution,[status(thm)],[125,84,122]) ).

tff(127,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(128,plain,
    ( ( ~ l1(e,e)
      | ~ p3(e,e,e)
      | s4(e) )
  <=> ( ~ l1(e,e)
      | s4(e)
      | ~ p3(e,e,e) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(129,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)],[128]) ).

tff(130,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)],[129,127]) ).

tff(131,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(132,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)],[131,130]) ).

tff(133,plain,
    s4(e),
    inference(unit_resolution,[status(thm)],[132,126,112,102]) ).

tff(134,plain,
    ^ [E: $i,F: $i,G: $i] :
      refl(
        ( ( ~ r3(G,E,E)
          | ~ s4(F)
          | k5(E) )
      <=> ( ~ r3(G,E,E)
          | ~ s4(F)
          | k5(E) ) )),
    inference(bind,[status(th)],]) ).

tff(135,plain,
    ( ! [E: $i,F: $i,G: $i] :
        ( ~ r3(G,E,E)
        | ~ s4(F)
        | k5(E) )
  <=> ! [E: $i,F: $i,G: $i] :
        ( ~ r3(G,E,E)
        | ~ s4(F)
        | k5(E) ) ),
    inference(quant_intro,[status(thm)],[134]) ).

tff(136,plain,
    ( ! [E: $i,F: $i,G: $i] :
        ( ~ r3(G,E,E)
        | ~ s4(F)
        | k5(E) )
  <=> ! [E: $i,F: $i,G: $i] :
        ( ~ r3(G,E,E)
        | ~ s4(F)
        | k5(E) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(137,plain,
    ^ [E: $i,F: $i,G: $i] :
      rewrite(
        ( ( k5(E)
          | ~ s4(F)
          | ~ r3(G,E,E) )
      <=> ( ~ r3(G,E,E)
          | ~ s4(F)
          | k5(E) ) )),
    inference(bind,[status(th)],]) ).

tff(138,plain,
    ( ! [E: $i,F: $i,G: $i] :
        ( k5(E)
        | ~ s4(F)
        | ~ r3(G,E,E) )
  <=> ! [E: $i,F: $i,G: $i] :
        ( ~ r3(G,E,E)
        | ~ s4(F)
        | k5(E) ) ),
    inference(quant_intro,[status(thm)],[137]) ).

tff(139,axiom,
    ! [E: $i,F: $i,G: $i] :
      ( k5(E)
      | ~ s4(F)
      | ~ r3(G,E,E) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_300) ).

tff(140,plain,
    ! [E: $i,F: $i,G: $i] :
      ( ~ r3(G,E,E)
      | ~ s4(F)
      | k5(E) ),
    inference(modus_ponens,[status(thm)],[139,138]) ).

tff(141,plain,
    ! [E: $i,F: $i,G: $i] :
      ( ~ r3(G,E,E)
      | ~ s4(F)
      | k5(E) ),
    inference(modus_ponens,[status(thm)],[140,136]) ).

tff(142,plain,
    ! [E: $i,F: $i,G: $i] :
      ( ~ r3(G,E,E)
      | ~ s4(F)
      | k5(E) ),
    inference(skolemize,[status(sab)],[141]) ).

tff(143,plain,
    ! [E: $i,F: $i,G: $i] :
      ( ~ r3(G,E,E)
      | ~ s4(F)
      | k5(E) ),
    inference(modus_ponens,[status(thm)],[142,135]) ).

tff(144,plain,
    ( ( ~ ! [E: $i,F: $i,G: $i] :
            ( ~ r3(G,E,E)
            | ~ s4(F)
            | k5(E) )
      | ~ s4(e)
      | k5(e)
      | ~ r3(e,e,e) )
  <=> ( ~ ! [E: $i,F: $i,G: $i] :
            ( ~ r3(G,E,E)
            | ~ s4(F)
            | k5(E) )
      | ~ s4(e)
      | k5(e)
      | ~ r3(e,e,e) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(145,plain,
    ( ( ~ r3(e,e,e)
      | ~ s4(e)
      | k5(e) )
  <=> ( ~ s4(e)
      | k5(e)
      | ~ r3(e,e,e) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(146,plain,
    ( ( ~ ! [E: $i,F: $i,G: $i] :
            ( ~ r3(G,E,E)
            | ~ s4(F)
            | k5(E) )
      | ~ r3(e,e,e)
      | ~ s4(e)
      | k5(e) )
  <=> ( ~ ! [E: $i,F: $i,G: $i] :
            ( ~ r3(G,E,E)
            | ~ s4(F)
            | k5(E) )
      | ~ s4(e)
      | k5(e)
      | ~ r3(e,e,e) ) ),
    inference(monotonicity,[status(thm)],[145]) ).

tff(147,plain,
    ( ( ~ ! [E: $i,F: $i,G: $i] :
            ( ~ r3(G,E,E)
            | ~ s4(F)
            | k5(E) )
      | ~ r3(e,e,e)
      | ~ s4(e)
      | k5(e) )
  <=> ( ~ ! [E: $i,F: $i,G: $i] :
            ( ~ r3(G,E,E)
            | ~ s4(F)
            | k5(E) )
      | ~ s4(e)
      | k5(e)
      | ~ r3(e,e,e) ) ),
    inference(transitivity,[status(thm)],[146,144]) ).

tff(148,plain,
    ( ~ ! [E: $i,F: $i,G: $i] :
          ( ~ r3(G,E,E)
          | ~ s4(F)
          | k5(E) )
    | ~ r3(e,e,e)
    | ~ s4(e)
    | k5(e) ),
    inference(quant_inst,[status(thm)],]) ).

tff(149,plain,
    ( ~ ! [E: $i,F: $i,G: $i] :
          ( ~ r3(G,E,E)
          | ~ s4(F)
          | k5(E) )
    | ~ s4(e)
    | k5(e)
    | ~ r3(e,e,e) ),
    inference(modus_ponens,[status(thm)],[148,147]) ).

tff(150,plain,
    $false,
    inference(unit_resolution,[status(thm)],[149,143,133,45,42]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SYN117-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.12  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.33  % Computer : n021.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 : Mon Sep  5 01:47:01 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.34  Usage: tptp [options] [-file:]file
% 0.12/0.34    -h, -?       prints this message.
% 0.12/0.34    -smt2        print SMT-LIB2 benchmark.
% 0.12/0.34    -m, -model   generate model.
% 0.12/0.34    -p, -proof   generate proof.
% 0.12/0.34    -c, -core    generate unsat core of named formulas.
% 0.12/0.34    -st, -statistics display statistics.
% 0.12/0.34    -t:timeout   set timeout (in second).
% 0.12/0.34    -smt2status  display status in smt2 format instead of SZS.
% 0.12/0.34    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.34    -<param>:<value> configuration parameter and value.
% 0.12/0.34    -o:<output-file> file to place output in.
% 0.19/0.48  % SZS status Unsatisfiable
% 0.19/0.48  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------