↑ Up

Z3---4.15.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : LCL117-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : NO INFORMATION
% Format   : NO INFORMATION
% Command  : run_E %s %d THM

% Computer : n031.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 02:59:21 PM UTC 2026

% Result   : Unsatisfiable 0.22s 0.51s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   44 (  17 unt;   0 typ;   0 def)
%            Number of atoms       :  193 (   0 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :  271 ( 131   ~; 124   |;   0   &)
%                                         (  16 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of FOOLs       :    9 (   9 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   97 (  90   !;   0   ?;  97   :)

% Comments : 
%------------------------------------------------------------------------------
tff(is_a_theorem_type,type,
    is_a_theorem: $i > $o ).

tff(equivalent_type,type,
    equivalent: ( $i * $i ) > $i ).

tff(c_type,type,
    c: $i ).

tff(a_type,type,
    a: $i ).

tff(b_type,type,
    b: $i ).

tff(1,plain,
    ^ [Z: $i,Y: $i,X: $i] :
      refl(( is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X))))
      <=> is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X)))) )),
    inference(bind,[status(th)],[]) ).

tff(2,plain,
    ( ! [Z: $i,Y: $i,X: $i] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X))))
  <=> ! [Z: $i,Y: $i,X: $i] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X)))) ),
    inference(quant_intro,[status(thm)],[1]) ).

tff(3,plain,
    ( ! [Z: $i,Y: $i,X: $i] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X))))
  <=> ! [Z: $i,Y: $i,X: $i] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X)))) ),
    inference(rewrite,[status(thm)],[]) ).

tff(4,axiom,
    ! [Z: $i,Y: $i,X: $i] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yqm) ).

tff(5,plain,
    ! [Z: $i,Y: $i,X: $i] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X)))),
    inference(modus_ponens,[status(thm)],[4,3]) ).

tff(6,plain,
    ! [Z: $i,Y: $i,X: $i] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X)))),
    inference(skolemize,[status(sab)],[5]) ).

tff(7,plain,
    ! [Z: $i,Y: $i,X: $i] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X)))),
    inference(modus_ponens,[status(thm)],[6,2]) ).

tff(8,plain,
    ( ~ ! [Z: $i,Y: $i,X: $i] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X))))
    | is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c)))))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(9,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c)))))),
    inference(unit_resolution,[status(thm)],[8,7]) ).

tff(10,plain,
    ( ~ ! [Z: $i,Y: $i,X: $i] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X))))
    | is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b))))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(11,plain,
    is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b))))),
    inference(unit_resolution,[status(thm)],[10,7]) ).

tff(12,plain,
    ^ [Y: $i,X: $i] :
      refl(( ( is_a_theorem(Y)
          | ~ is_a_theorem(X)
          | ~ is_a_theorem(equivalent(X,Y)) )
      <=> ( is_a_theorem(Y)
          | ~ is_a_theorem(X)
          | ~ is_a_theorem(equivalent(X,Y)) ) )),
    inference(bind,[status(th)],[]) ).

tff(13,plain,
    ( ! [Y: $i,X: $i] :
        ( is_a_theorem(Y)
        | ~ is_a_theorem(X)
        | ~ is_a_theorem(equivalent(X,Y)) )
  <=> ! [Y: $i,X: $i] :
        ( is_a_theorem(Y)
        | ~ is_a_theorem(X)
        | ~ is_a_theorem(equivalent(X,Y)) ) ),
    inference(quant_intro,[status(thm)],[12]) ).

tff(14,plain,
    ( ! [Y: $i,X: $i] :
        ( is_a_theorem(Y)
        | ~ is_a_theorem(X)
        | ~ is_a_theorem(equivalent(X,Y)) )
  <=> ! [Y: $i,X: $i] :
        ( is_a_theorem(Y)
        | ~ is_a_theorem(X)
        | ~ is_a_theorem(equivalent(X,Y)) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(15,plain,
    ^ [Y: $i,X: $i] :
      trans(monotonicity(rewrite(( ( ~ is_a_theorem(equivalent(X,Y))
              | ~ is_a_theorem(X) )
          <=> ( ~ is_a_theorem(X)
              | ~ is_a_theorem(equivalent(X,Y)) ) )),
          ( ( ~ is_a_theorem(equivalent(X,Y))
            | ~ is_a_theorem(X)
            | is_a_theorem(Y) )
        <=> ( ~ is_a_theorem(X)
            | ~ is_a_theorem(equivalent(X,Y))
            | is_a_theorem(Y) ) )),
        rewrite(( ( ~ is_a_theorem(X)
            | ~ is_a_theorem(equivalent(X,Y))
            | is_a_theorem(Y) )
        <=> ( is_a_theorem(Y)
            | ~ is_a_theorem(X)
            | ~ is_a_theorem(equivalent(X,Y)) ) )),
        ( ( ~ is_a_theorem(equivalent(X,Y))
          | ~ is_a_theorem(X)
          | is_a_theorem(Y) )
      <=> ( is_a_theorem(Y)
          | ~ is_a_theorem(X)
          | ~ is_a_theorem(equivalent(X,Y)) ) )),
    inference(bind,[status(th)],[]) ).

tff(16,plain,
    ( ! [Y: $i,X: $i] :
        ( ~ is_a_theorem(equivalent(X,Y))
        | ~ is_a_theorem(X)
        | is_a_theorem(Y) )
  <=> ! [Y: $i,X: $i] :
        ( is_a_theorem(Y)
        | ~ is_a_theorem(X)
        | ~ is_a_theorem(equivalent(X,Y)) ) ),
    inference(quant_intro,[status(thm)],[15]) ).

tff(17,axiom,
    ! [Y: $i,X: $i] :
      ( ~ is_a_theorem(equivalent(X,Y))
      | ~ is_a_theorem(X)
      | is_a_theorem(Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

tff(18,plain,
    ! [Y: $i,X: $i] :
      ( is_a_theorem(Y)
      | ~ is_a_theorem(X)
      | ~ is_a_theorem(equivalent(X,Y)) ),
    inference(modus_ponens,[status(thm)],[17,16]) ).

tff(19,plain,
    ! [Y: $i,X: $i] :
      ( is_a_theorem(Y)
      | ~ is_a_theorem(X)
      | ~ is_a_theorem(equivalent(X,Y)) ),
    inference(modus_ponens,[status(thm)],[18,14]) ).

tff(20,plain,
    ! [Y: $i,X: $i] :
      ( is_a_theorem(Y)
      | ~ is_a_theorem(X)
      | ~ is_a_theorem(equivalent(X,Y)) ),
    inference(skolemize,[status(sab)],[19]) ).

tff(21,plain,
    ! [Y: $i,X: $i] :
      ( is_a_theorem(Y)
      | ~ is_a_theorem(X)
      | ~ is_a_theorem(equivalent(X,Y)) ),
    inference(modus_ponens,[status(thm)],[20,13]) ).

tff(22,plain,
    ( ( ~ ! [Y: $i,X: $i] :
            ( is_a_theorem(Y)
            | ~ is_a_theorem(X)
            | ~ is_a_theorem(equivalent(X,Y)) )
      | is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c)))))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c)))))) )
  <=> ( ~ ! [Y: $i,X: $i] :
            ( is_a_theorem(Y)
            | ~ is_a_theorem(X)
            | ~ is_a_theorem(equivalent(X,Y)) )
      | is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c)))))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c)))))) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(23,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( is_a_theorem(Y)
          | ~ is_a_theorem(X)
          | ~ is_a_theorem(equivalent(X,Y)) )
    | is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c)))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c)))))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(24,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( is_a_theorem(Y)
          | ~ is_a_theorem(X)
          | ~ is_a_theorem(equivalent(X,Y)) )
    | is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c)))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c)))))) ),
    inference(modus_ponens,[status(thm)],[23,22]) ).

tff(25,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))))),
    inference(unit_resolution,[status(thm)],[24,21,11,9]) ).

tff(26,plain,
    ( ~ ! [Z: $i,Y: $i,X: $i] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X))))
    | is_a_theorem(equivalent(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(27,plain,
    is_a_theorem(equivalent(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))))),
    inference(unit_resolution,[status(thm)],[26,7]) ).

tff(28,plain,
    ( ~ ! [Z: $i,Y: $i,X: $i] : is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(Z,X))))
    | is_a_theorem(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c)))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(29,plain,
    is_a_theorem(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c)))),
    inference(unit_resolution,[status(thm)],[28,7]) ).

tff(30,plain,
    ( ( ~ ! [Y: $i,X: $i] :
            ( is_a_theorem(Y)
            | ~ is_a_theorem(X)
            | ~ is_a_theorem(equivalent(X,Y)) )
      | is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))))
      | ~ is_a_theorem(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c))))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))))) )
  <=> ( ~ ! [Y: $i,X: $i] :
            ( is_a_theorem(Y)
            | ~ is_a_theorem(X)
            | ~ is_a_theorem(equivalent(X,Y)) )
      | is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))))
      | ~ is_a_theorem(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c))))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))))) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(31,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( is_a_theorem(Y)
          | ~ is_a_theorem(X)
          | ~ is_a_theorem(equivalent(X,Y)) )
    | is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))))
    | ~ is_a_theorem(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(32,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( is_a_theorem(Y)
          | ~ is_a_theorem(X)
          | ~ is_a_theorem(equivalent(X,Y)) )
    | is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))))
    | ~ is_a_theorem(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(c,b),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))))) ),
    inference(modus_ponens,[status(thm)],[31,30]) ).

tff(33,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b)))),
    inference(unit_resolution,[status(thm)],[32,21,29,27]) ).

tff(34,plain,
    ( ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b)))
  <=> ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))) ),
    inference(rewrite,[status(thm)],[]) ).

tff(35,axiom,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_qyf) ).

tff(36,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b))),
    inference(modus_ponens,[status(thm)],[35,34]) ).

tff(37,plain,
    ( ( ~ ! [Y: $i,X: $i] :
            ( is_a_theorem(Y)
            | ~ is_a_theorem(X)
            | ~ is_a_theorem(equivalent(X,Y)) )
      | is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b)))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b)))) )
  <=> ( ~ ! [Y: $i,X: $i] :
            ( is_a_theorem(Y)
            | ~ is_a_theorem(X)
            | ~ is_a_theorem(equivalent(X,Y)) )
      | is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b)))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b)))) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(38,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( is_a_theorem(Y)
          | ~ is_a_theorem(X)
          | ~ is_a_theorem(equivalent(X,Y)) )
    | is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b)))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b)))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(39,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( is_a_theorem(Y)
          | ~ is_a_theorem(X)
          | ~ is_a_theorem(equivalent(X,Y)) )
    | is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b)))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(c,b)))) ),
    inference(modus_ponens,[status(thm)],[38,37]) ).

tff(40,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c)))),
    inference(unit_resolution,[status(thm)],[39,21,36,33]) ).

tff(41,plain,
    ( ( ~ ! [Y: $i,X: $i] :
            ( is_a_theorem(Y)
            | ~ is_a_theorem(X)
            | ~ is_a_theorem(equivalent(X,Y)) )
      | is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))))) )
  <=> ( ~ ! [Y: $i,X: $i] :
            ( is_a_theorem(Y)
            | ~ is_a_theorem(X)
            | ~ is_a_theorem(equivalent(X,Y)) )
      | is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))))
      | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))))) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(42,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( is_a_theorem(Y)
          | ~ is_a_theorem(X)
          | ~ is_a_theorem(equivalent(X,Y)) )
    | is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(43,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( is_a_theorem(Y)
          | ~ is_a_theorem(X)
          | ~ is_a_theorem(equivalent(X,Y)) )
    | is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,b)))),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(a,b),equivalent(a,c))))) ),
    inference(modus_ponens,[status(thm)],[42,41]) ).

tff(44,plain,
    $false,
    inference(unit_resolution,[status(thm)],[43,21,11,40,25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem    : LCL117-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command    : run_E %s %d THM
% 0.06/0.34  % Computer : n031.cluster.edu
% 0.06/0.34  % Model    : x86_64 x86_64
% 0.06/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.34  % Memory   : 8046.5625MB
% 0.06/0.34  % OS       : Linux 6.8.0-71-generic
% 0.06/0.34  % CPULimit   : 300
% 0.06/0.34  % WCLimit    : 300
% 0.06/0.34  % DateTime   : Fri Sep  4 21:14:56 UTC 2026
% 0.06/0.34  % CPUTime    : 
% 0.22/0.51  % SZS status Unsatisfiable
% 0.22/0.51  % SZS output start Proof
% See solution above
% 0.22/0.53  % E exiting
%------------------------------------------------------------------------------