↑ Up

Z3---4.15.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : LCL197-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : NO INFORMATION
% Format   : NO INFORMATION
% Command  : run_E %s %d THM

% Computer : n020.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:32 PM UTC 2026

% Result   : Unsatisfiable 0.22s 0.50s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   42
% Syntax   : Number of formulae    :  108 (  47 unt;   0 typ;   0 def)
%            Number of atoms       :  309 (  23 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  361 ( 167   ~; 158   |;   0   &)
%                                         (  36 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of FOOLs       :    7 (   7 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :  172 ( 158   !;   0   ?; 172   :)

% Comments : 
%------------------------------------------------------------------------------
tff(theorem_type,type,
    theorem: $i > $o ).

tff(implies_type,type,
    implies: ( $i * $i ) > $i ).

tff(or_type,type,
    or: ( $i * $i ) > $i ).

tff(q_type,type,
    q: $i ).

tff(p_type,type,
    p: $i ).

tff(not_type,type,
    not: $i > $i ).

tff(axiom_type,type,
    axiom: $i > $o ).

tff(1,plain,
    ^ [Y: $i,X: $i] :
      refl(( ( implies(X,Y) = or(not(X),Y) )
      <=> ( implies(X,Y) = or(not(X),Y) ) )),
    inference(bind,[status(th)],[]) ).

tff(2,plain,
    ( ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
  <=> ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ) ),
    inference(quant_intro,[status(thm)],[1]) ).

tff(3,plain,
    ( ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
  <=> ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(4,axiom,
    ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

tff(5,plain,
    ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ),
    inference(modus_ponens,[status(thm)],[4,3]) ).

tff(6,plain,
    ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ),
    inference(skolemize,[status(sab)],[5]) ).

tff(7,plain,
    ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) ),
    inference(modus_ponens,[status(thm)],[6,2]) ).

tff(8,plain,
    ( ~ ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
    | ( implies(or(p,or(q,q)),or(p,q)) = or(not(or(p,or(q,q))),or(p,q)) ) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(9,plain,
    implies(or(p,or(q,q)),or(p,q)) = or(not(or(p,or(q,q))),or(p,q)),
    inference(unit_resolution,[status(thm)],[8,7]) ).

tff(10,plain,
    implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))) = implies(or(not(or(p,or(q,q))),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))),
    inference(monotonicity,[status(thm)],[9]) ).

tff(11,plain,
    ( theorem(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))))
  <=> theorem(implies(or(not(or(p,or(q,q))),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))) ),
    inference(monotonicity,[status(thm)],[10]) ).

tff(12,plain,
    ^ [B: $i,A: $i,C: $i] :
      refl(( axiom(implies(implies(A,B),implies(or(C,A),or(C,B))))
      <=> axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) )),
    inference(bind,[status(th)],[]) ).

tff(13,plain,
    ( ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B))))
  <=> ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) ),
    inference(quant_intro,[status(thm)],[12]) ).

tff(14,plain,
    ( ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B))))
  <=> ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) ),
    inference(rewrite,[status(thm)],[]) ).

tff(15,axiom,
    ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).

tff(16,plain,
    ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
    inference(modus_ponens,[status(thm)],[15,14]) ).

tff(17,plain,
    ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
    inference(skolemize,[status(sab)],[16]) ).

tff(18,plain,
    ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
    inference(modus_ponens,[status(thm)],[17,13]) ).

tff(19,plain,
    ( ~ ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B))))
    | axiom(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(20,plain,
    axiom(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))),
    inference(unit_resolution,[status(thm)],[19,18]) ).

tff(21,plain,
    ^ [X: $i] :
      refl(( ( theorem(X)
          | ~ axiom(X) )
      <=> ( theorem(X)
          | ~ axiom(X) ) )),
    inference(bind,[status(th)],[]) ).

tff(22,plain,
    ( ! [X: $i] :
        ( theorem(X)
        | ~ axiom(X) )
  <=> ! [X: $i] :
        ( theorem(X)
        | ~ axiom(X) ) ),
    inference(quant_intro,[status(thm)],[21]) ).

tff(23,plain,
    ( ! [X: $i] :
        ( theorem(X)
        | ~ axiom(X) )
  <=> ! [X: $i] :
        ( theorem(X)
        | ~ axiom(X) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(24,axiom,
    ! [X: $i] :
      ( theorem(X)
      | ~ axiom(X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).

tff(25,plain,
    ! [X: $i] :
      ( theorem(X)
      | ~ axiom(X) ),
    inference(modus_ponens,[status(thm)],[24,23]) ).

tff(26,plain,
    ! [X: $i] :
      ( theorem(X)
      | ~ axiom(X) ),
    inference(skolemize,[status(sab)],[25]) ).

tff(27,plain,
    ! [X: $i] :
      ( theorem(X)
      | ~ axiom(X) ),
    inference(modus_ponens,[status(thm)],[26,22]) ).

tff(28,plain,
    ( ( ~ ! [X: $i] :
            ( theorem(X)
            | ~ axiom(X) )
      | theorem(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))))
      | ~ axiom(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))) )
  <=> ( ~ ! [X: $i] :
            ( theorem(X)
            | ~ axiom(X) )
      | theorem(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))))
      | ~ axiom(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(29,plain,
    ( ~ ! [X: $i] :
          ( theorem(X)
          | ~ axiom(X) )
    | theorem(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))))
    | ~ axiom(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(30,plain,
    ( ~ ! [X: $i] :
          ( theorem(X)
          | ~ axiom(X) )
    | theorem(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))))
    | ~ axiom(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))) ),
    inference(modus_ponens,[status(thm)],[29,28]) ).

tff(31,plain,
    theorem(implies(implies(or(p,or(q,q)),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))),
    inference(unit_resolution,[status(thm)],[30,27,20]) ).

tff(32,plain,
    theorem(implies(or(not(or(p,or(q,q))),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))),
    inference(modus_ponens,[status(thm)],[31,11]) ).

tff(33,plain,
    or(not(or(p,or(q,q))),or(p,q)) = implies(or(p,or(q,q)),or(p,q)),
    inference(symmetry,[status(thm)],[9]) ).

tff(34,plain,
    ( theorem(or(not(or(p,or(q,q))),or(p,q)))
  <=> theorem(implies(or(p,or(q,q)),or(p,q))) ),
    inference(monotonicity,[status(thm)],[33]) ).

tff(35,plain,
    ( theorem(implies(or(p,or(q,q)),or(p,q)))
  <=> theorem(or(not(or(p,or(q,q))),or(p,q))) ),
    inference(symmetry,[status(thm)],[34]) ).

tff(36,plain,
    ^ [A: $i] :
      refl(( axiom(implies(or(A,A),A))
      <=> axiom(implies(or(A,A),A)) )),
    inference(bind,[status(th)],[]) ).

tff(37,plain,
    ( ! [A: $i] : axiom(implies(or(A,A),A))
  <=> ! [A: $i] : axiom(implies(or(A,A),A)) ),
    inference(quant_intro,[status(thm)],[36]) ).

tff(38,plain,
    ( ! [A: $i] : axiom(implies(or(A,A),A))
  <=> ! [A: $i] : axiom(implies(or(A,A),A)) ),
    inference(rewrite,[status(thm)],[]) ).

tff(39,axiom,
    ! [A: $i] : axiom(implies(or(A,A),A)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).

tff(40,plain,
    ! [A: $i] : axiom(implies(or(A,A),A)),
    inference(modus_ponens,[status(thm)],[39,38]) ).

tff(41,plain,
    ! [A: $i] : axiom(implies(or(A,A),A)),
    inference(skolemize,[status(sab)],[40]) ).

tff(42,plain,
    ! [A: $i] : axiom(implies(or(A,A),A)),
    inference(modus_ponens,[status(thm)],[41,37]) ).

tff(43,plain,
    ( ~ ! [A: $i] : axiom(implies(or(A,A),A))
    | axiom(implies(or(q,q),q)) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(44,plain,
    axiom(implies(or(q,q),q)),
    inference(unit_resolution,[status(thm)],[43,42]) ).

tff(45,plain,
    ( ( ~ ! [X: $i] :
            ( theorem(X)
            | ~ axiom(X) )
      | theorem(implies(or(q,q),q))
      | ~ axiom(implies(or(q,q),q)) )
  <=> ( ~ ! [X: $i] :
            ( theorem(X)
            | ~ axiom(X) )
      | theorem(implies(or(q,q),q))
      | ~ axiom(implies(or(q,q),q)) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(46,plain,
    ( ~ ! [X: $i] :
          ( theorem(X)
          | ~ axiom(X) )
    | theorem(implies(or(q,q),q))
    | ~ axiom(implies(or(q,q),q)) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(47,plain,
    ( ~ ! [X: $i] :
          ( theorem(X)
          | ~ axiom(X) )
    | theorem(implies(or(q,q),q))
    | ~ axiom(implies(or(q,q),q)) ),
    inference(modus_ponens,[status(thm)],[46,45]) ).

tff(48,plain,
    theorem(implies(or(q,q),q)),
    inference(unit_resolution,[status(thm)],[47,27,44]) ).

tff(49,plain,
    ( ~ ! [B: $i,A: $i,C: $i] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B))))
    | axiom(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q)))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(50,plain,
    axiom(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q)))),
    inference(unit_resolution,[status(thm)],[49,18]) ).

tff(51,plain,
    ( ( ~ ! [X: $i] :
            ( theorem(X)
            | ~ axiom(X) )
      | theorem(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q))))
      | ~ axiom(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q)))) )
  <=> ( ~ ! [X: $i] :
            ( theorem(X)
            | ~ axiom(X) )
      | theorem(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q))))
      | ~ axiom(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q)))) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(52,plain,
    ( ~ ! [X: $i] :
          ( theorem(X)
          | ~ axiom(X) )
    | theorem(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q))))
    | ~ axiom(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q)))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(53,plain,
    ( ~ ! [X: $i] :
          ( theorem(X)
          | ~ axiom(X) )
    | theorem(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q))))
    | ~ axiom(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q)))) ),
    inference(modus_ponens,[status(thm)],[52,51]) ).

tff(54,plain,
    theorem(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q)))),
    inference(unit_resolution,[status(thm)],[53,27,50]) ).

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

tff(56,plain,
    ( ! [Y: $i,X: $i] :
        ( theorem(X)
        | ~ theorem(Y)
        | ~ theorem(implies(Y,X)) )
  <=> ! [Y: $i,X: $i] :
        ( theorem(X)
        | ~ theorem(Y)
        | ~ theorem(implies(Y,X)) ) ),
    inference(quant_intro,[status(thm)],[55]) ).

tff(57,plain,
    ( ! [Y: $i,X: $i] :
        ( theorem(X)
        | ~ theorem(Y)
        | ~ theorem(implies(Y,X)) )
  <=> ! [Y: $i,X: $i] :
        ( theorem(X)
        | ~ theorem(Y)
        | ~ theorem(implies(Y,X)) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(58,plain,
    ^ [Y: $i,X: $i] :
      rewrite(( ( theorem(X)
          | ~ theorem(implies(Y,X))
          | ~ theorem(Y) )
      <=> ( theorem(X)
          | ~ theorem(Y)
          | ~ theorem(implies(Y,X)) ) )),
    inference(bind,[status(th)],[]) ).

tff(59,plain,
    ( ! [Y: $i,X: $i] :
        ( theorem(X)
        | ~ theorem(implies(Y,X))
        | ~ theorem(Y) )
  <=> ! [Y: $i,X: $i] :
        ( theorem(X)
        | ~ theorem(Y)
        | ~ theorem(implies(Y,X)) ) ),
    inference(quant_intro,[status(thm)],[58]) ).

tff(60,axiom,
    ! [Y: $i,X: $i] :
      ( theorem(X)
      | ~ theorem(implies(Y,X))
      | ~ theorem(Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).

tff(61,plain,
    ! [Y: $i,X: $i] :
      ( theorem(X)
      | ~ theorem(Y)
      | ~ theorem(implies(Y,X)) ),
    inference(modus_ponens,[status(thm)],[60,59]) ).

tff(62,plain,
    ! [Y: $i,X: $i] :
      ( theorem(X)
      | ~ theorem(Y)
      | ~ theorem(implies(Y,X)) ),
    inference(modus_ponens,[status(thm)],[61,57]) ).

tff(63,plain,
    ! [Y: $i,X: $i] :
      ( theorem(X)
      | ~ theorem(Y)
      | ~ theorem(implies(Y,X)) ),
    inference(skolemize,[status(sab)],[62]) ).

tff(64,plain,
    ! [Y: $i,X: $i] :
      ( theorem(X)
      | ~ theorem(Y)
      | ~ theorem(implies(Y,X)) ),
    inference(modus_ponens,[status(thm)],[63,56]) ).

tff(65,plain,
    ( ( ~ ! [Y: $i,X: $i] :
            ( theorem(X)
            | ~ theorem(Y)
            | ~ theorem(implies(Y,X)) )
      | theorem(implies(or(p,or(q,q)),or(p,q)))
      | ~ theorem(implies(or(q,q),q))
      | ~ theorem(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q)))) )
  <=> ( ~ ! [Y: $i,X: $i] :
            ( theorem(X)
            | ~ theorem(Y)
            | ~ theorem(implies(Y,X)) )
      | theorem(implies(or(p,or(q,q)),or(p,q)))
      | ~ theorem(implies(or(q,q),q))
      | ~ theorem(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q)))) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(66,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( theorem(X)
          | ~ theorem(Y)
          | ~ theorem(implies(Y,X)) )
    | theorem(implies(or(p,or(q,q)),or(p,q)))
    | ~ theorem(implies(or(q,q),q))
    | ~ theorem(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q)))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(67,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( theorem(X)
          | ~ theorem(Y)
          | ~ theorem(implies(Y,X)) )
    | theorem(implies(or(p,or(q,q)),or(p,q)))
    | ~ theorem(implies(or(q,q),q))
    | ~ theorem(implies(implies(or(q,q),q),implies(or(p,or(q,q)),or(p,q)))) ),
    inference(modus_ponens,[status(thm)],[66,65]) ).

tff(68,plain,
    theorem(implies(or(p,or(q,q)),or(p,q))),
    inference(unit_resolution,[status(thm)],[67,64,54,48]) ).

tff(69,plain,
    theorem(or(not(or(p,or(q,q))),or(p,q))),
    inference(modus_ponens,[status(thm)],[68,35]) ).

tff(70,plain,
    ( ~ ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
    | ( implies(or(q,or(p,q)),or(p,or(q,q))) = or(not(or(q,or(p,q))),or(p,or(q,q))) ) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(71,plain,
    implies(or(q,or(p,q)),or(p,or(q,q))) = or(not(or(q,or(p,q))),or(p,or(q,q))),
    inference(unit_resolution,[status(thm)],[70,7]) ).

tff(72,plain,
    or(not(or(q,or(p,q))),or(p,or(q,q))) = implies(or(q,or(p,q)),or(p,or(q,q))),
    inference(symmetry,[status(thm)],[71]) ).

tff(73,plain,
    ( theorem(or(not(or(q,or(p,q))),or(p,or(q,q))))
  <=> theorem(implies(or(q,or(p,q)),or(p,or(q,q)))) ),
    inference(monotonicity,[status(thm)],[72]) ).

tff(74,plain,
    ( theorem(implies(or(q,or(p,q)),or(p,or(q,q))))
  <=> theorem(or(not(or(q,or(p,q))),or(p,or(q,q)))) ),
    inference(symmetry,[status(thm)],[73]) ).

tff(75,plain,
    ^ [B: $i,A: $i,C: $i] :
      refl(( axiom(implies(or(A,or(B,C)),or(B,or(A,C))))
      <=> axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) )),
    inference(bind,[status(th)],[]) ).

tff(76,plain,
    ( ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C))))
  <=> ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) ),
    inference(quant_intro,[status(thm)],[75]) ).

tff(77,plain,
    ( ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C))))
  <=> ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) ),
    inference(rewrite,[status(thm)],[]) ).

tff(78,axiom,
    ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).

tff(79,plain,
    ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
    inference(modus_ponens,[status(thm)],[78,77]) ).

tff(80,plain,
    ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
    inference(skolemize,[status(sab)],[79]) ).

tff(81,plain,
    ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
    inference(modus_ponens,[status(thm)],[80,76]) ).

tff(82,plain,
    ( ~ ! [B: $i,A: $i,C: $i] : axiom(implies(or(A,or(B,C)),or(B,or(A,C))))
    | axiom(implies(or(q,or(p,q)),or(p,or(q,q)))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(83,plain,
    axiom(implies(or(q,or(p,q)),or(p,or(q,q)))),
    inference(unit_resolution,[status(thm)],[82,81]) ).

tff(84,plain,
    ( ( ~ ! [X: $i] :
            ( theorem(X)
            | ~ axiom(X) )
      | theorem(implies(or(q,or(p,q)),or(p,or(q,q))))
      | ~ axiom(implies(or(q,or(p,q)),or(p,or(q,q)))) )
  <=> ( ~ ! [X: $i] :
            ( theorem(X)
            | ~ axiom(X) )
      | theorem(implies(or(q,or(p,q)),or(p,or(q,q))))
      | ~ axiom(implies(or(q,or(p,q)),or(p,or(q,q)))) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(85,plain,
    ( ~ ! [X: $i] :
          ( theorem(X)
          | ~ axiom(X) )
    | theorem(implies(or(q,or(p,q)),or(p,or(q,q))))
    | ~ axiom(implies(or(q,or(p,q)),or(p,or(q,q)))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(86,plain,
    ( ~ ! [X: $i] :
          ( theorem(X)
          | ~ axiom(X) )
    | theorem(implies(or(q,or(p,q)),or(p,or(q,q))))
    | ~ axiom(implies(or(q,or(p,q)),or(p,or(q,q)))) ),
    inference(modus_ponens,[status(thm)],[85,84]) ).

tff(87,plain,
    theorem(implies(or(q,or(p,q)),or(p,or(q,q)))),
    inference(unit_resolution,[status(thm)],[86,27,83]) ).

tff(88,plain,
    theorem(or(not(or(q,or(p,q))),or(p,or(q,q)))),
    inference(modus_ponens,[status(thm)],[87,74]) ).

tff(89,plain,
    ( ~ ! [Y: $i,X: $i] : ( implies(X,Y) = or(not(X),Y) )
    | ( implies(or(q,or(p,q)),or(p,q)) = or(not(or(q,or(p,q))),or(p,q)) ) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(90,plain,
    implies(or(q,or(p,q)),or(p,q)) = or(not(or(q,or(p,q))),or(p,q)),
    inference(unit_resolution,[status(thm)],[89,7]) ).

tff(91,plain,
    or(not(or(q,or(p,q))),or(p,q)) = implies(or(q,or(p,q)),or(p,q)),
    inference(symmetry,[status(thm)],[90]) ).

tff(92,plain,
    ( theorem(or(not(or(q,or(p,q))),or(p,q)))
  <=> theorem(implies(or(q,or(p,q)),or(p,q))) ),
    inference(monotonicity,[status(thm)],[91]) ).

tff(93,plain,
    ( theorem(implies(or(q,or(p,q)),or(p,q)))
  <=> theorem(or(not(or(q,or(p,q))),or(p,q))) ),
    inference(symmetry,[status(thm)],[92]) ).

tff(94,plain,
    ( ~ theorem(implies(or(q,or(p,q)),or(p,q)))
  <=> ~ theorem(or(not(or(q,or(p,q))),or(p,q))) ),
    inference(monotonicity,[status(thm)],[93]) ).

tff(95,plain,
    ( ~ theorem(implies(or(q,or(p,q)),or(p,q)))
  <=> ~ theorem(implies(or(q,or(p,q)),or(p,q))) ),
    inference(rewrite,[status(thm)],[]) ).

tff(96,axiom,
    ~ theorem(implies(or(q,or(p,q)),or(p,q))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

tff(97,plain,
    ~ theorem(implies(or(q,or(p,q)),or(p,q))),
    inference(modus_ponens,[status(thm)],[96,95]) ).

tff(98,plain,
    ~ theorem(or(not(or(q,or(p,q))),or(p,q))),
    inference(modus_ponens,[status(thm)],[97,94]) ).

tff(99,plain,
    ( ( ~ ! [Y: $i,X: $i] :
            ( theorem(X)
            | ~ theorem(Y)
            | ~ theorem(implies(Y,X)) )
      | theorem(or(not(or(q,or(p,q))),or(p,q)))
      | ~ theorem(or(not(or(q,or(p,q))),or(p,or(q,q))))
      | ~ theorem(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))) )
  <=> ( ~ ! [Y: $i,X: $i] :
            ( theorem(X)
            | ~ theorem(Y)
            | ~ theorem(implies(Y,X)) )
      | theorem(or(not(or(q,or(p,q))),or(p,q)))
      | ~ theorem(or(not(or(q,or(p,q))),or(p,or(q,q))))
      | ~ theorem(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(100,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( theorem(X)
          | ~ theorem(Y)
          | ~ theorem(implies(Y,X)) )
    | theorem(or(not(or(q,or(p,q))),or(p,q)))
    | ~ theorem(or(not(or(q,or(p,q))),or(p,or(q,q))))
    | ~ theorem(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(101,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( theorem(X)
          | ~ theorem(Y)
          | ~ theorem(implies(Y,X)) )
    | theorem(or(not(or(q,or(p,q))),or(p,q)))
    | ~ theorem(or(not(or(q,or(p,q))),or(p,or(q,q))))
    | ~ theorem(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))) ),
    inference(modus_ponens,[status(thm)],[100,99]) ).

tff(102,plain,
    ( ~ theorem(or(not(or(q,or(p,q))),or(p,or(q,q))))
    | ~ theorem(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))) ),
    inference(unit_resolution,[status(thm)],[101,64,98]) ).

tff(103,plain,
    ~ theorem(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q)))),
    inference(unit_resolution,[status(thm)],[102,88]) ).

tff(104,plain,
    ( ( ~ ! [Y: $i,X: $i] :
            ( theorem(X)
            | ~ theorem(Y)
            | ~ theorem(implies(Y,X)) )
      | theorem(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))
      | ~ theorem(or(not(or(p,or(q,q))),or(p,q)))
      | ~ theorem(implies(or(not(or(p,or(q,q))),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))) )
  <=> ( ~ ! [Y: $i,X: $i] :
            ( theorem(X)
            | ~ theorem(Y)
            | ~ theorem(implies(Y,X)) )
      | theorem(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))
      | ~ theorem(or(not(or(p,or(q,q))),or(p,q)))
      | ~ theorem(implies(or(not(or(p,or(q,q))),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(105,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( theorem(X)
          | ~ theorem(Y)
          | ~ theorem(implies(Y,X)) )
    | theorem(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))
    | ~ theorem(or(not(or(p,or(q,q))),or(p,q)))
    | ~ theorem(implies(or(not(or(p,or(q,q))),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(106,plain,
    ( ~ ! [Y: $i,X: $i] :
          ( theorem(X)
          | ~ theorem(Y)
          | ~ theorem(implies(Y,X)) )
    | theorem(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))
    | ~ theorem(or(not(or(p,or(q,q))),or(p,q)))
    | ~ theorem(implies(or(not(or(p,or(q,q))),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))) ),
    inference(modus_ponens,[status(thm)],[105,104]) ).

tff(107,plain,
    ( theorem(implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))
    | ~ theorem(or(not(or(p,or(q,q))),or(p,q)))
    | ~ theorem(implies(or(not(or(p,or(q,q))),or(p,q)),implies(or(not(or(q,or(p,q))),or(p,or(q,q))),or(not(or(q,or(p,q))),or(p,q))))) ),
    inference(unit_resolution,[status(thm)],[106,64]) ).

tff(108,plain,
    $false,
    inference(unit_resolution,[status(thm)],[107,103,69,32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem    : LCL197-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03  % Command    : run_E %s %d THM
% 0.02/0.36  % Computer : n020.cluster.edu
% 0.02/0.36  % Model    : x86_64 x86_64
% 0.02/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.36  % Memory   : 8046.5625MB
% 0.02/0.36  % OS       : Linux 6.8.0-71-generic
% 0.02/0.36  % CPULimit   : 300
% 0.02/0.36  % WCLimit    : 300
% 0.02/0.36  % DateTime   : Sat Sep  5 13:35:59 UTC 2026
% 0.02/0.36  % CPUTime    : 
% 0.22/0.50  % SZS status Unsatisfiable
% 0.22/0.50  % SZS output start Proof
% See solution above
% 0.22/0.51  % E exiting
%------------------------------------------------------------------------------