%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL125-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n011.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 : Sun Sep 27 07:50:55 AM UTC 2026
% Result : Unsatisfiable 181.65s 50.58s
% Output : Refutation 171.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 51
% Number of leaves : 4
% Syntax : Number of formulae : 593 ( 196 unt; 0 typ; 0 def)
% Number of atoms : 1877 ( 568 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 14356 ( 995 ~; 662 |; 0 &;12699 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 10 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 2195 ( 0 ^;2195 !; 0 ?;2195 :)
% Comments :
%------------------------------------------------------------------------------
thf(is_a_theorem_decl,type,
is_a_theorem: $i > $o ).
thf(equivalent_decl,type,
equivalent: $i > $i > $i ).
thf(a_decl,type,
a: $i ).
thf(b_decl,type,
b: $i ).
thf(c_decl,type,
c: $i ).
thf(e_decl,type,
e: $i ).
thf(3,axiom,
! [C: $i,B: $i,A: $i] : ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_2) ).
thf(9,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_3) ).
thf(10,plain,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(2,axiom,
! [B: $i,A: $i] :
( ( B @ is_a_theorem )
| ~ ( A @ is_a_theorem )
| ~ ( B @ ( A @ equivalent ) @ is_a_theorem ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
thf(7,plain,
! [B: $i,A: $i] :
( ( B @ is_a_theorem )
| ~ ( A @ is_a_theorem )
| ~ ( B @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(8,plain,
! [B: $i,A: $i] :
( ( B @ is_a_theorem )
| ~ ( A @ is_a_theorem )
| ~ ( B @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(cnf,[status(esa)],[7]) ).
thf(20,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( E @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,8]) ).
thf(21,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( E @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[20]) ).
thf(22,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[21:[bind(A,$thf( H )),bind(B,$thf( M )),bind(C,$thf( L )),bind(D,$thf( H )),bind(E,$thf( M @ ( L @ equivalent ) @ ( L @ ( M @ equivalent ) @ ( H @ equivalent ) @ equivalent ) ))]]) ).
thf(35,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[22]) ).
thf(73,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[9,35]) ).
thf(74,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[73]) ).
thf(75,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[74:[bind(A,$thf( O )),bind(B,$thf( N )),bind(C,$thf( P )),bind(D,$thf( P @ ( O @ equivalent ) @ ( N @ ( P @ equivalent ) @ ( N @ ( O @ equivalent ) @ equivalent ) @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( F ))]]) ).
thf(91,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[75]) ).
thf(23,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true
| ~ ( E @ ( D @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[10,8]) ).
thf(24,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ ( E @ ( D @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[23]) ).
thf(25,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[24:[bind(A,$thf( J )),bind(B,$thf( O )),bind(C,$thf( N )),bind(D,$thf( O @ ( N @ equivalent ) @ ( N @ ( O @ equivalent ) @ ( J @ equivalent ) @ equivalent ) @ ( J @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(36,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[25]) ).
thf(382,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( H @ ( I @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[91,36]) ).
thf(383,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( H @ ( I @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[382]) ).
thf(384,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[383:[bind(A,$thf( ZZ @ ( ZZA @ equivalent ) )),bind(B,$thf( ZZA @ ( ZZ @ equivalent ) @ ( ZY @ ( ZX @ equivalent ) @ ( ZW @ ( ZY @ equivalent ) @ ( ZW @ ( ZX @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(C,$thf( ZW )),bind(D,$thf( ZX )),bind(E,$thf( ZY )),bind(F,$thf( ZZA @ ( ZZ @ equivalent ) @ ( ZY @ ( ZX @ equivalent ) @ ( ZW @ ( ZY @ equivalent ) @ ( ZW @ ( ZX @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( ZZ @ ( ZZA @ equivalent ) @ equivalent ) )),bind(G,$thf( ZY @ ( ZX @ equivalent ) @ ( ZW @ ( ZY @ equivalent ) @ ( ZW @ ( ZX @ equivalent ) @ equivalent ) @ equivalent ) )),bind(H,$thf( ZZA )),bind(I,$thf( ZZ ))]]) ).
thf(400,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[384]) ).
thf(441,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( H @ ( I @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[400,36]) ).
thf(442,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( H @ ( I @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[441]) ).
thf(443,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] : ( D @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[442:[bind(A,$thf( ZA )),bind(B,$thf( ZB )),bind(C,$thf( ZC )),bind(D,$thf( ZM @ ( ZL @ equivalent ) @ ( ZL @ ( ZM @ equivalent ) @ ( ZE @ equivalent ) @ equivalent ) )),bind(E,$thf( ZE )),bind(F,$thf( ZE @ ( ZM @ ( ZL @ equivalent ) @ ( ZL @ ( ZM @ equivalent ) @ ( ZE @ equivalent ) @ equivalent ) @ equivalent ) @ ( ZC @ ( ZB @ equivalent ) @ ( ZA @ ( ZC @ equivalent ) @ ( ZA @ ( ZB @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(G,$thf( ZE )),bind(H,$thf( ZL )),bind(I,$thf( ZM ))]]) ).
thf(454,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] : ( D @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[443]) ).
thf(26,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[9,8]) ).
thf(27,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[26]) ).
thf(28,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ is_a_theorem )
| ~ ( A @ ( C @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[27:[bind(A,$thf( L )),bind(B,$thf( K )),bind(C,$thf( M )),bind(D,$thf( K @ ( M @ equivalent ) @ ( K @ ( L @ equivalent ) @ equivalent ) )),bind(E,$thf( M @ ( L @ equivalent ) ))]]) ).
thf(37,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ is_a_theorem )
| ~ ( A @ ( C @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[28]) ).
thf(621,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( I @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( I @ ( H @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[454,37]) ).
thf(622,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( I @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( I @ ( H @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[621]) ).
thf(623,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( E @ equivalent ) @ ( A @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[622:[bind(A,$thf( O )),bind(B,$thf( Z )),bind(C,$thf( ZA )),bind(D,$thf( ZA @ ( Z @ equivalent ) )),bind(E,$thf( X )),bind(F,$thf( Y )),bind(G,$thf( ZA @ ( Z @ equivalent ) )),bind(H,$thf( O @ ( ZA @ equivalent ) @ ( O @ ( Z @ equivalent ) @ equivalent ) )),bind(I,$thf( Y @ ( X @ equivalent ) @ ( X @ ( Y @ equivalent ) @ ( ZA @ ( Z @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(634,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( E @ equivalent ) @ ( A @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[623]) ).
thf(635,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( E @ equivalent ) @ ( A @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( H @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[634,37]) ).
thf(636,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( E @ equivalent ) @ ( A @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( H @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[635]) ).
thf(637,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[636:[bind(A,$thf( Q )),bind(B,$thf( R )),bind(C,$thf( Q )),bind(D,$thf( O )),bind(E,$thf( R )),bind(F,$thf( Q @ ( R @ equivalent ) )),bind(G,$thf( Q @ ( O @ equivalent ) )),bind(H,$thf( R @ ( Q @ equivalent ) @ ( R @ ( O @ equivalent ) @ equivalent ) ))]]) ).
thf(688,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[637]) ).
thf(1,negated_conjecture,
~ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_2) ).
thf(5,plain,
~ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(6,plain,
~ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(692,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[688,6]) ).
thf(693,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[692]) ).
thf(730,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[693]) ).
thf(800,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( B @ ( A @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[730]) ).
thf(801,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) ) )
| ( ( C @ ( A @ equivalent ) )
!= a )
| ( ( B @ ( A @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[800]) ).
thf(803,plain,
! [C: $i,B: $i,A: $i] :
( ( C
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) ) )
| ( B
!= ( c @ ( b @ equivalent ) ) )
| ( ( C @ ( A @ equivalent ) )
!= a )
| ( ( B @ ( A @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[801]) ).
thf(806,plain,
! [A: $i] :
( ( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( A @ equivalent ) )
!= a )
| ( ( c @ ( b @ equivalent ) @ ( A @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[803]) ).
thf(808,plain,
! [A: $i] :
( ( a != a )
| ( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( A @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( A @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( A @ equivalent ) )
!= a ) ),
inference(eqfactor_ordered,[status(thm)],[806]) ).
thf(809,plain,
! [A: $i] :
( ( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( A @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( A @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( A @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[808]) ).
thf(124,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[91,35]) ).
thf(125,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[124]) ).
thf(126,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[125:[bind(A,$thf( Y )),bind(B,$thf( Z )),bind(C,$thf( T )),bind(D,$thf( U )),bind(E,$thf( V )),bind(F,$thf( Z @ ( Y @ equivalent ) @ ( Y @ ( Z @ equivalent ) @ ( V @ ( U @ equivalent ) @ ( T @ ( V @ equivalent ) @ ( T @ ( U @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(G,$thf( G )),bind(H,$thf( H ))]]) ).
thf(138,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[126]) ).
thf(62,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,35]) ).
thf(63,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[62]) ).
thf(64,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[63:[bind(A,$thf( K )),bind(B,$thf( P )),bind(C,$thf( O )),bind(D,$thf( P @ ( O @ equivalent ) @ ( O @ ( P @ equivalent ) @ ( K @ equivalent ) @ equivalent ) @ ( K @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( F ))]]) ).
thf(86,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[64]) ).
thf(29,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true
| ~ ( E @ ( D @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[9,8]) ).
thf(30,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ ( E @ ( D @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[29]) ).
thf(31,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( D @ ( C @ equivalent ) @ ( B @ ( D @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[30:[bind(A,$thf( N )),bind(B,$thf( M )),bind(C,$thf( O )),bind(D,$thf( O @ ( N @ equivalent ) @ ( M @ ( O @ equivalent ) @ ( M @ ( N @ equivalent ) @ equivalent ) @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(38,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( D @ ( C @ equivalent ) @ ( B @ ( D @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[31]) ).
thf(832,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( G @ ( I @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[86,38]) ).
thf(833,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( G @ ( I @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[832]) ).
thf(834,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[833:[bind(A,$thf( ZK @ ( ZJ @ equivalent ) @ ( ZJ @ ( ZK @ equivalent ) @ ( ZC @ equivalent ) @ equivalent ) )),bind(B,$thf( ZC )),bind(C,$thf( ZJ @ ( ZK @ equivalent ) @ ( ZC @ equivalent ) )),bind(D,$thf( ZK )),bind(E,$thf( ZJ )),bind(F,$thf( ZC @ ( ZK @ ( ZJ @ equivalent ) @ ( ZJ @ ( ZK @ equivalent ) @ ( ZC @ equivalent ) @ equivalent ) @ equivalent ) )),bind(G,$thf( ZJ @ ( ZK @ equivalent ) )),bind(H,$thf( ZC )),bind(I,$thf( ZK @ ( ZJ @ equivalent ) @ ( ZJ @ ( ZK @ equivalent ) @ ( ZC @ equivalent ) @ equivalent ) ))]]) ).
thf(854,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[834]) ).
thf(870,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[854,38]) ).
thf(871,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[870]) ).
thf(872,plain,
! [A: $i] : ( A @ ( A @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[871:[bind(A,$thf( K @ ( K @ equivalent ) )),bind(B,$thf( K )),bind(C,$thf( C )),bind(D,$thf( K @ ( K @ equivalent ) )),bind(E,$thf( K )),bind(F,$thf( K )),bind(G,$thf( C ))]]) ).
thf(911,plain,
! [A: $i] : ( A @ ( A @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[872]) ).
thf(79,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ ( D @ is_a_theorem )
| ~ $true
| ~ ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[35,8]) ).
thf(80,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ ( D @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[79]) ).
thf(81,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ is_a_theorem )
| ~ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[80:[bind(A,$thf( F )),bind(B,$thf( J )),bind(C,$thf( K )),bind(D,$thf( J @ ( K @ equivalent ) @ ( F @ equivalent ) )),bind(E,$thf( K @ ( J @ equivalent ) ))]]) ).
thf(87,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ is_a_theorem )
| ~ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[81]) ).
thf(1798,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[87,6]) ).
thf(1799,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[1798]) ).
thf(1800,plain,
! [A: $i] :
( ~ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[1799:[bind(A,$thf( A )),bind(B,$thf( a )),bind(C,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ))]]) ).
thf(2313,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( D @ is_a_theorem )
| ~ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[87,1800]) ).
thf(2314,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( D @ is_a_theorem )
| ~ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[2313]) ).
thf(2315,plain,
! [B: $i,A: $i] :
( ~ ( B @ is_a_theorem )
| ~ ( B @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[2314:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) )),bind(D,$thf( B ))]]) ).
thf(5124,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( E @ is_a_theorem )
| ~ $true
| ~ ( D @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[688,2315]) ).
thf(5125,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( E @ is_a_theorem )
| ~ ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[5124]) ).
thf(5126,plain,
! [A: $i] :
( ~ ( a @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[5125:[bind(A,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) )),bind(B,$thf( T )),bind(C,$thf( a )),bind(D,$thf( T @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) )),bind(E,$thf( a @ ( T @ equivalent ) ))]]) ).
thf(5236,plain,
! [A: $i] :
( ~ ( a @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[5126]) ).
thf(5396,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ ( D @ equivalent ) @ is_a_theorem )
| ~ $true
| ~ ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[35,5236]) ).
thf(5397,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ ( D @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[5396]) ).
thf(5398,plain,
( ~ ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( a @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[5397:[bind(A,$thf( a )),bind(B,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) )),bind(C,$thf( c @ ( b @ equivalent ) )),bind(D,$thf( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(5804,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ is_a_theorem )
!= ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( a @ is_a_theorem )
| ~ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[87,5398]) ).
thf(5805,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ is_a_theorem )
!= ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ is_a_theorem )
| ~ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[5804]) ).
thf(5806,plain,
! [A: $i] :
( ~ ( a @ is_a_theorem )
| ~ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[5805:[bind(A,$thf( A )),bind(B,$thf( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )),bind(C,$thf( a ))]]) ).
thf(9516,plain,
! [A: $i] :
( ~ $true
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ~ ( a @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(eqfactor_ordered,[status(thm)],[5806]) ).
thf(9520,plain,
! [A: $i] :
( ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( A @ equivalent ) )
!= a )
| ~ ( a @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[9516]) ).
thf(12495,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( B @ equivalent ) )
!= a )
| ~ ( a @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,9520]) ).
thf(12496,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( B @ equivalent ) )
!= a )
| ~ ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[12495]) ).
thf(12497,plain,
! [A: $i] :
( ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= a )
| ~ ( a @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[12496:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ equivalent ) ))]]) ).
thf(12731,plain,
! [A: $i] :
( ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= a )
| ~ ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[12497]) ).
thf(82,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true
| ~ ( E @ ( D @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[35,8]) ).
thf(83,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ ( E @ ( D @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[82]) ).
thf(84,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( B @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[83:[bind(A,$thf( H )),bind(B,$thf( L )),bind(C,$thf( M )),bind(D,$thf( M @ ( L @ equivalent ) @ ( L @ ( M @ equivalent ) @ ( H @ equivalent ) @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(88,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[84]) ).
thf(946,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,35]) ).
thf(947,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[946]) ).
thf(948,plain,
! [C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[947:[bind(A,$thf( F )),bind(B,$thf( F @ ( F @ equivalent ) )),bind(C,$thf( C )),bind(D,$thf( D ))]]) ).
thf(972,plain,
! [C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[948]) ).
thf(1079,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ equivalent ) @ equivalent ) @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[972,36]) ).
thf(1080,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ equivalent ) @ equivalent ) @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[1079]) ).
thf(1081,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1080:[bind(A,$thf( Z @ ( ZA @ equivalent ) )),bind(B,$thf( ZA @ ( Z @ equivalent ) @ ( Y @ ( Y @ equivalent ) @ equivalent ) )),bind(C,$thf( Y )),bind(D,$thf( ZA @ ( Z @ equivalent ) @ ( Y @ ( Y @ equivalent ) @ equivalent ) @ ( Z @ ( ZA @ equivalent ) @ equivalent ) )),bind(E,$thf( Y @ ( Y @ equivalent ) )),bind(F,$thf( ZA )),bind(G,$thf( Z ))]]) ).
thf(1096,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1081]) ).
thf(1111,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1096,38]) ).
thf(1112,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[1111]) ).
thf(1113,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( D @ ( B @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1112:[bind(A,$thf( S )),bind(B,$thf( ZB @ ( Z @ equivalent ) )),bind(C,$thf( ZC @ ( ZB @ equivalent ) @ ( ZC @ ( Z @ equivalent ) @ equivalent ) )),bind(D,$thf( ZC @ ( ZB @ equivalent ) @ ( ZC @ ( Z @ equivalent ) @ equivalent ) @ ( ZB @ ( Z @ equivalent ) @ equivalent ) @ ( S @ ( S @ equivalent ) @ equivalent ) )),bind(E,$thf( ZC )),bind(F,$thf( Z )),bind(G,$thf( ZB ))]]) ).
thf(1158,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( D @ ( B @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1113]) ).
thf(5001,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( C @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem ) )
| ~ ( C @ is_a_theorem )
| ~ $true
| ~ ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[911,2315]) ).
thf(5002,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( C @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem ) )
| ~ ( C @ is_a_theorem )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[5001]) ).
thf(5003,plain,
! [A: $i] :
( ~ ( A @ is_a_theorem )
| ~ ( A @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[5002:[bind(A,$thf( E @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )),bind(B,$thf( E @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )),bind(C,$thf( E ))]]) ).
thf(5292,plain,
! [A: $i] :
( ~ ( A @ is_a_theorem )
| ~ ( A @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[5003]) ).
thf(8959,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ~ $true
| ~ ( B @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[911,5292]) ).
thf(8960,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ~ ( B @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[8959]) ).
thf(8961,plain,
! [A: $i] :
~ ( A @ ( A @ equivalent ) @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[8960:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ equivalent ) ))]]) ).
thf(9141,plain,
! [A: $i] :
~ ( A @ ( A @ equivalent ) @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[8961]) ).
thf(10153,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ ( B @ equivalent ) @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,9141]) ).
thf(10154,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ ( B @ equivalent ) @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[10153]) ).
thf(10234,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) )
!= ( B @ ( B @ equivalent ) @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[10154]) ).
thf(127,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( F @ equivalent ) @ is_a_theorem ) )
| ( G @ is_a_theorem )
| ~ ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[91,8]) ).
thf(128,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( F @ equivalent ) @ is_a_theorem ) )
| ( G @ is_a_theorem )
| ~ ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[127]) ).
thf(129,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( E @ ( D @ equivalent ) @ is_a_theorem )
| ~ ( D @ ( E @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[128:[bind(A,$thf( V )),bind(B,$thf( W )),bind(C,$thf( Q )),bind(D,$thf( R )),bind(E,$thf( S )),bind(F,$thf( V @ ( W @ equivalent ) @ ( S @ ( R @ equivalent ) @ ( Q @ ( S @ equivalent ) @ ( Q @ ( R @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(G,$thf( W @ ( V @ equivalent ) ))]]) ).
thf(134,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( E @ ( D @ equivalent ) @ is_a_theorem )
| ~ ( D @ ( E @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[129]) ).
thf(11032,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( D @ ( F @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1096,134]) ).
thf(11033,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( D @ ( F @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[11032]) ).
thf(11034,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( D @ ( B @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[11033:[bind(A,$thf( R )),bind(B,$thf( ZA @ ( Y @ equivalent ) )),bind(C,$thf( ZB @ ( ZA @ equivalent ) @ ( ZB @ ( Y @ equivalent ) @ equivalent ) )),bind(D,$thf( ZB )),bind(E,$thf( Y )),bind(F,$thf( ZA )),bind(G,$thf( ZB @ ( ZA @ equivalent ) @ ( ZB @ ( Y @ equivalent ) @ equivalent ) @ ( ZA @ ( Y @ equivalent ) @ equivalent ) )),bind(H,$thf( R @ ( R @ equivalent ) ))]]) ).
thf(11277,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( D @ ( B @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[11034]) ).
thf(2243,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[911,1800]) ).
thf(2244,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[2243]) ).
thf(2245,plain,
~ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[2244:[bind(A,$thf( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) )),bind(B,$thf( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) ))]]) ).
thf(2459,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,2245]) ).
thf(2460,plain,
! [A: $i] :
( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[2459]) ).
thf(2527,plain,
! [A: $i] :
( ( A @ ( A @ equivalent ) )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[2460]) ).
thf(5359,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ ( D @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1096,5236]) ).
thf(5360,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ ( D @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[5359]) ).
thf(5361,plain,
! [A: $i] :
~ ( a @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[5360:[bind(A,$thf( R )),bind(B,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) )),bind(C,$thf( a )),bind(D,$thf( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( R @ ( R @ equivalent ) @ equivalent ) ))]]) ).
thf(5554,plain,
! [A: $i] :
~ ( a @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[5361]) ).
thf(6372,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,5554]) ).
thf(6373,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[6372]) ).
thf(6458,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) )
!= ( a @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[6373]) ).
thf(65,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[35,6]) ).
thf(66,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[65]) ).
thf(85,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[66]) ).
thf(165,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( B @ ( C @ equivalent ) @ ( A @ equivalent ) )
!= a )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[85]) ).
thf(190,plain,
! [C: $i,B: $i,A: $i] :
( ( C
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) ) )
| ( B != a )
| ( ( B @ ( C @ equivalent ) @ ( A @ equivalent ) )
!= a )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[165]) ).
thf(215,plain,
! [A: $i] :
( ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) )
!= a )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[190]) ).
thf(727,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) )
!= a )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[688,215]) ).
thf(728,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[727]) ).
thf(729,plain,
! [C: $i,B: $i,A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ),
inference(pattern_uni,[status(thm)],[728:[bind(A,$thf( K )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( N @ ( M @ equivalent ) @ ( N @ ( K @ equivalent ) @ equivalent ) @ ( M @ ( K @ equivalent ) @ equivalent ) ))]]) ).
thf(741,plain,
! [C: $i,B: $i,A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ),
inference(simp,[status(thm)],[729]) ).
thf(2273,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( D @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[35,1800]) ).
thf(2274,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( D @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[2273]) ).
thf(2275,plain,
! [A: $i] :
( ~ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[2274:[bind(A,$thf( E )),bind(B,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) )),bind(C,$thf( a )),bind(D,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( E @ equivalent ) ))]]) ).
thf(2434,plain,
! [A: $i] :
( ~ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[2275]) ).
thf(5855,plain,
( ~ $true
| ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ~ ( a @ is_a_theorem ) ),
inference(eqfactor_ordered,[status(thm)],[5398]) ).
thf(5901,plain,
( ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ~ ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[5855]) ).
thf(6624,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,5901]) ).
thf(6625,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) ) ),
inference(simp,[status(thm)],[6624]) ).
thf(6786,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= a )
| ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) ) ),
inference(simp,[status(thm)],[6625]) ).
thf(12325,plain,
! [A: $i] :
( ( a @ is_a_theorem )
| ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
| ( ( A @ ( A @ equivalent ) )
!= a ) ),
inference(bool_ext,[status(thm)],[6786]) ).
thf(16723,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( B @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( B @ is_a_theorem )
| ~ $true
| ( a @ is_a_theorem )
| ( ( A @ ( A @ equivalent ) )
!= a ) ),
inference(paramod_ordered,[status(thm)],[12325,38]) ).
thf(16724,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( B @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( B @ is_a_theorem )
| ( a @ is_a_theorem )
| ( ( A @ ( A @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[16723]) ).
thf(16725,plain,
! [A: $i] :
( ( a @ is_a_theorem )
| ( a @ is_a_theorem )
| ( ( A @ ( A @ equivalent ) )
!= a ) ),
inference(pattern_uni,[status(thm)],[16724:[bind(A,$thf( A )),bind(B,$thf( a )),bind(C,$thf( e )),bind(D,$thf( b )),bind(E,$thf( c ))]]) ).
thf(16965,plain,
! [A: $i] :
( ( a @ is_a_theorem )
| ( ( A @ ( A @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[16725]) ).
thf(2240,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ~ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,1800]) ).
thf(2241,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ~ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[2240]) ).
thf(2242,plain,
! [A: $i] :
~ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[2241:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ equivalent ) ))]]) ).
thf(2422,plain,
! [A: $i] :
~ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[2242]) ).
thf(3191,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,2422]) ).
thf(3192,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3191]) ).
thf(3249,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[3192]) ).
thf(5752,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( a @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[911,5398]) ).
thf(5753,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[5752]) ).
thf(5920,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[5753]) ).
thf(7173,plain,
! [A: $i] :
( ( A != a )
| ( A
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[5920]) ).
thf(7364,plain,
( ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )
!= a )
| ~ ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[7173]) ).
thf(1106,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1096,6]) ).
thf(1107,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1106]) ).
thf(1147,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[1107]) ).
thf(1402,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( B @ ( C @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[1147]) ).
thf(1520,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) ) )
| ( ( A @ ( A @ equivalent ) )
!= a )
| ( ( B @ ( C @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[1402]) ).
thf(1521,plain,
! [C: $i,B: $i,A: $i] :
( ( C
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) ) )
| ( B
!= ( c @ ( b @ equivalent ) ) )
| ( ( A @ ( A @ equivalent ) )
!= a )
| ( ( B @ ( C @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[1520]) ).
thf(1524,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= a )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[1521]) ).
thf(1526,plain,
! [A: $i] :
( ( a != a )
| ( ( A @ ( A @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(eqfactor_ordered,[status(thm)],[1524]) ).
thf(1528,plain,
! [A: $i] :
( ( A
!= ( c @ ( b @ equivalent ) ) )
| ( A
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[1526]) ).
thf(1529,plain,
( ( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) )
!= ( c @ ( b @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[1528]) ).
thf(175,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ is_a_theorem ) )
| ( ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[91,85]) ).
thf(176,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ is_a_theorem ) )
| ( ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ) ),
inference(simp,[status(thm)],[175]) ).
thf(177,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(pattern_uni,[status(thm)],[176:[bind(A,$thf( Y )),bind(B,$thf( Z )),bind(C,$thf( T )),bind(D,$thf( U )),bind(E,$thf( V )),bind(F,$thf( Z @ ( Y @ equivalent ) @ ( Y @ ( Z @ equivalent ) @ ( V @ ( U @ equivalent ) @ ( T @ ( V @ equivalent ) @ ( T @ ( U @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(G,$thf( G )),bind(H,$thf( H ))]]) ).
thf(184,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[177]) ).
thf(93,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[86,6]) ).
thf(94,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[93]) ).
thf(110,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[94]) ).
thf(2237,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( D @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[9,1800]) ).
thf(2238,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[2237]) ).
thf(2239,plain,
! [A: $i] :
~ ( A @ ( a @ equivalent ) @ ( A @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[2238:[bind(A,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) )),bind(B,$thf( J )),bind(C,$thf( a )),bind(D,$thf( J @ ( a @ equivalent ) @ ( J @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(2420,plain,
! [A: $i] :
~ ( A @ ( a @ equivalent ) @ ( A @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[2239]) ).
thf(2335,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( D @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[854,1800]) ).
thf(2336,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[2335]) ).
thf(2337,plain,
! [B: $i,A: $i] :
~ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[2336:[bind(A,$thf( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) )),bind(B,$thf( K )),bind(C,$thf( L )),bind(D,$thf( L @ ( K @ equivalent ) @ ( K @ ( L @ equivalent ) @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(2403,plain,
! [B: $i,A: $i] :
~ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[2337]) ).
thf(822,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[688,38]) ).
thf(823,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[822]) ).
thf(824,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ ( D @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[823:[bind(A,$thf( Y @ ( ZC @ equivalent ) @ ( Y @ ( ZB @ equivalent ) @ equivalent ) )),bind(B,$thf( ZC @ ( ZB @ equivalent ) )),bind(C,$thf( ZA )),bind(D,$thf( ZA @ ( ZC @ ( ZB @ equivalent ) @ equivalent ) @ ( ZA @ ( Y @ ( ZC @ equivalent ) @ ( Y @ ( ZB @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(E,$thf( Y )),bind(F,$thf( ZB )),bind(G,$thf( ZC ))]]) ).
thf(860,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ ( D @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[824]) ).
thf(1202,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ ( D @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[860,36]) ).
thf(1203,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ ( D @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[1202]) ).
thf(1204,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1203:[bind(A,$thf( ZP )),bind(B,$thf( ZT @ ( ZS @ equivalent ) @ ( ZS @ ( ZT @ equivalent ) @ ( ZP @ ( ZO @ equivalent ) @ ( ZP @ ( ZM @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(C,$thf( ZM )),bind(D,$thf( ZO )),bind(E,$thf( ZT @ ( ZS @ equivalent ) @ ( ZS @ ( ZT @ equivalent ) @ ( ZP @ ( ZO @ equivalent ) @ ( ZP @ ( ZM @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( ZO @ ( ZM @ equivalent ) @ equivalent ) )),bind(F,$thf( ZP @ ( ZO @ equivalent ) @ ( ZP @ ( ZM @ equivalent ) @ equivalent ) )),bind(G,$thf( ZS )),bind(H,$thf( ZT ))]]) ).
thf(1217,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1204]) ).
thf(4257,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( H @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1217,37]) ).
thf(4258,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( H @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4257]) ).
thf(4259,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( C @ ( D @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[4258:[bind(A,$thf( M )),bind(B,$thf( T @ ( S @ equivalent ) )),bind(C,$thf( P )),bind(D,$thf( S )),bind(E,$thf( T )),bind(F,$thf( T @ ( S @ equivalent ) )),bind(G,$thf( M )),bind(H,$thf( S @ ( T @ equivalent ) @ ( P @ ( T @ ( S @ equivalent ) @ equivalent ) @ ( P @ ( M @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(4354,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( C @ ( D @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[4259]) ).
thf(5569,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( D @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[4354,37]) ).
thf(5570,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( D @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[5569]) ).
thf(5571,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[5570:[bind(A,$thf( U @ ( T @ equivalent ) @ ( N @ equivalent ) )),bind(B,$thf( Q )),bind(C,$thf( U )),bind(D,$thf( T )),bind(E,$thf( U @ ( T @ equivalent ) )),bind(F,$thf( N )),bind(G,$thf( Q @ ( T @ ( U @ equivalent ) @ equivalent ) @ ( Q @ ( U @ ( T @ equivalent ) @ ( N @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(5682,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[5571]) ).
thf(11151,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( D @ ( F @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[688,134]) ).
thf(11152,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( D @ ( F @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[11151]) ).
thf(11153,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ ( D @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[11152:[bind(A,$thf( X @ ( ZB @ equivalent ) @ ( X @ ( ZA @ equivalent ) @ equivalent ) )),bind(B,$thf( ZB @ ( ZA @ equivalent ) )),bind(C,$thf( Z )),bind(D,$thf( X )),bind(E,$thf( ZA )),bind(F,$thf( ZB )),bind(G,$thf( Z @ ( ZB @ ( ZA @ equivalent ) @ equivalent ) )),bind(H,$thf( Z @ ( X @ ( ZB @ equivalent ) @ ( X @ ( ZA @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(11306,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ ( D @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[11153]) ).
thf(17345,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ ( D @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( F @ ( H @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[11306,38]) ).
thf(17346,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ ( D @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( F @ ( H @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[17345]) ).
thf(17347,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( A @ ( B @ ( D @ equivalent ) @ equivalent ) @ ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[17346:[bind(A,$thf( X )),bind(B,$thf( ZB @ ( ZA @ equivalent ) )),bind(C,$thf( Z @ ( ZA @ equivalent ) )),bind(D,$thf( Z @ ( ZB @ equivalent ) )),bind(E,$thf( ZB @ ( ZA @ equivalent ) @ ( X @ ( Z @ ( ZB @ equivalent ) @ equivalent ) @ ( X @ ( Z @ ( ZA @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(F,$thf( Z )),bind(G,$thf( ZA )),bind(H,$thf( ZB ))]]) ).
thf(17606,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( A @ ( B @ ( D @ equivalent ) @ equivalent ) @ ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[17347]) ).
thf(17950,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( A @ ( B @ ( D @ equivalent ) @ equivalent ) @ ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( E @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( E @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[17606,2434]) ).
thf(17951,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( A @ ( B @ ( D @ equivalent ) @ equivalent ) @ ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( E @ equivalent ) @ is_a_theorem ) )
| ~ ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[17950]) ).
thf(17952,plain,
! [B: $i,A: $i] :
~ ( A @ ( B @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( B @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[17951:[bind(A,$thf( M )),bind(B,$thf( O )),bind(C,$thf( a )),bind(D,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) )),bind(E,$thf( M @ ( O @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( M @ ( O @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(18232,plain,
! [B: $i,A: $i] :
~ ( A @ ( B @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( B @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[17952]) ).
thf(724,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ equivalent ) @ equivalent ) @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[688,36]) ).
thf(725,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ equivalent ) @ equivalent ) @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[724]) ).
thf(726,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[725:[bind(A,$thf( X )),bind(B,$thf( ZC @ ( ZB @ equivalent ) @ ( ZB @ ( ZC @ equivalent ) @ ( X @ equivalent ) @ equivalent ) )),bind(C,$thf( U )),bind(D,$thf( U @ ( ZC @ ( ZB @ equivalent ) @ ( ZB @ ( ZC @ equivalent ) @ ( X @ equivalent ) @ equivalent ) @ equivalent ) @ ( U @ ( X @ equivalent ) @ equivalent ) )),bind(E,$thf( X )),bind(F,$thf( ZB )),bind(G,$thf( ZC ))]]) ).
thf(739,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[726]) ).
thf(779,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[739,36]) ).
thf(780,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[779]) ).
thf(781,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[780:[bind(A,$thf( ZH @ ( ZG @ equivalent ) @ ( ZG @ ( ZH @ equivalent ) @ ( ZC @ equivalent ) @ equivalent ) )),bind(B,$thf( ZC )),bind(C,$thf( Y )),bind(D,$thf( Z )),bind(E,$thf( ZH @ ( ZG @ equivalent ) @ ( ZG @ ( ZH @ equivalent ) @ ( ZC @ equivalent ) @ equivalent ) @ ( Z @ ( Y @ equivalent ) @ ( Y @ ( Z @ equivalent ) @ ( ZC @ equivalent ) @ equivalent ) @ equivalent ) )),bind(F,$thf( ZC )),bind(G,$thf( ZG )),bind(H,$thf( ZH ))]]) ).
thf(791,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[781]) ).
thf(1411,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( G @ ( I @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[791,38]) ).
thf(1412,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( G @ ( I @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[1411]) ).
thf(1413,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1412:[bind(A,$thf( Q )),bind(B,$thf( B )),bind(C,$thf( Q @ ( Q @ equivalent ) )),bind(D,$thf( T )),bind(E,$thf( U )),bind(F,$thf( U @ ( T @ equivalent ) @ ( T @ ( U @ equivalent ) @ ( Q @ ( Q @ equivalent ) @ equivalent ) @ equivalent ) )),bind(G,$thf( Q )),bind(H,$thf( Q )),bind(I,$thf( B ))]]) ).
thf(1450,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1413]) ).
thf(865,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[854,6]) ).
thf(866,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[865]) ).
thf(905,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[866]) ).
thf(3459,plain,
! [A: $i] :
( ~ $true
| ( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( A @ is_a_theorem ) )
| ~ ( A @ is_a_theorem ) ),
inference(eqfactor_ordered,[status(thm)],[2434]) ).
thf(3462,plain,
! [A: $i] :
( ( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( A @ equivalent ) )
!= A )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[3459]) ).
thf(4133,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( B @ equivalent ) )
!= B )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,3462]) ).
thf(4134,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( B @ equivalent ) )
!= B ) ),
inference(simp,[status(thm)],[4133]) ).
thf(4135,plain,
! [A: $i] :
( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= ( A @ ( A @ equivalent ) ) ),
inference(pattern_uni,[status(thm)],[4134:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ equivalent ) ))]]) ).
thf(4230,plain,
! [A: $i] :
( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= ( A @ ( A @ equivalent ) ) ),
inference(simp,[status(thm)],[4135]) ).
thf(32,plain,
! [B: $i,A: $i] :
( ~ $true
| ( ( B @ ( A @ equivalent ) @ is_a_theorem )
!= ( A @ is_a_theorem ) )
| ( B @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(eqfactor_ordered,[status(thm)],[8]) ).
thf(33,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ is_a_theorem )
!= ( A @ is_a_theorem ) )
| ~ ( A @ is_a_theorem )
| ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[32]) ).
thf(98,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( F @ equivalent ) @ is_a_theorem ) )
| ~ ( F @ is_a_theorem )
| ~ ( F @ is_a_theorem )
| ( G @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[86,33]) ).
thf(99,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( F @ equivalent ) @ is_a_theorem ) )
| ~ ( F @ is_a_theorem )
| ( G @ is_a_theorem ) ),
inference(simp,[status(thm)],[98]) ).
thf(100,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( D @ ( E @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
| ( E @ ( D @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[99:[bind(A,$thf( V )),bind(B,$thf( W )),bind(C,$thf( N )),bind(D,$thf( R )),bind(E,$thf( S )),bind(F,$thf( V @ ( W @ equivalent ) @ ( S @ ( R @ equivalent ) @ ( R @ ( S @ equivalent ) @ ( N @ equivalent ) @ equivalent ) @ ( N @ equivalent ) @ equivalent ) )),bind(G,$thf( W @ ( V @ equivalent ) ))]]) ).
thf(112,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( D @ ( E @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
| ( E @ ( D @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[100]) ).
thf(8044,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ( H @ ( G @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[972,112]) ).
thf(8045,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[8044]) ).
thf(8046,plain,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[8045:[bind(A,$thf( Y @ ( Z @ equivalent ) )),bind(B,$thf( Z @ ( Y @ equivalent ) @ ( X @ ( X @ equivalent ) @ equivalent ) )),bind(C,$thf( X )),bind(D,$thf( X @ ( X @ equivalent ) )),bind(E,$thf( Z )),bind(F,$thf( Y )),bind(G,$thf( Z @ ( Y @ equivalent ) @ ( X @ ( X @ equivalent ) @ equivalent ) )),bind(H,$thf( Y @ ( Z @ equivalent ) ))]]) ).
thf(8094,plain,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[8046]) ).
thf(862,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( F @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[854,37]) ).
thf(863,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( F @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[862]) ).
thf(864,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[863:[bind(A,$thf( P @ ( O @ equivalent ) @ ( M @ equivalent ) )),bind(B,$thf( O )),bind(C,$thf( P )),bind(D,$thf( P @ ( O @ equivalent ) )),bind(E,$thf( O @ ( P @ equivalent ) @ ( P @ ( O @ equivalent ) @ ( M @ equivalent ) @ equivalent ) )),bind(F,$thf( M ))]]) ).
thf(907,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[864]) ).
thf(3383,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( D @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[907,2434]) ).
thf(3384,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[3383]) ).
thf(3385,plain,
! [B: $i,A: $i] :
~ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[3384:[bind(A,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) )),bind(B,$thf( L )),bind(C,$thf( K )),bind(D,$thf( L @ ( K @ equivalent ) @ ( K @ ( L @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(3492,plain,
! [B: $i,A: $i] :
~ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[3385]) ).
thf(9227,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ is_a_theorem )
| ~ $true
| ~ ( D @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[1450,5806]) ).
thf(9228,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ is_a_theorem )
| ~ ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[9227]) ).
thf(9229,plain,
! [A: $i] :
( ~ ( a @ is_a_theorem )
| ~ ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[9228:[bind(A,$thf( H )),bind(B,$thf( a )),bind(C,$thf( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )),bind(D,$thf( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( H @ ( H @ equivalent ) @ equivalent ) ))]]) ).
thf(9584,plain,
! [A: $i] :
( ~ ( a @ is_a_theorem )
| ~ ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[9229]) ).
thf(67,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ~ $true
| ( E @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[35,33]) ).
thf(68,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[67]) ).
thf(69,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem )
| ~ ( B @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[68:[bind(A,$thf( H )),bind(B,$thf( L )),bind(C,$thf( M )),bind(D,$thf( M @ ( L @ equivalent ) @ ( L @ ( M @ equivalent ) @ ( H @ equivalent ) @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(89,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[69]) ).
thf(116,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[91,6]) ).
thf(117,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[116]) ).
thf(133,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[117]) ).
thf(5421,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( D @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[907,5236]) ).
thf(5422,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( D @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[5421]) ).
thf(5423,plain,
! [B: $i,A: $i] :
~ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[5422:[bind(A,$thf( a )),bind(B,$thf( L )),bind(C,$thf( K )),bind(D,$thf( L @ ( K @ equivalent ) @ ( K @ ( L @ equivalent ) @ ( a @ equivalent ) @ equivalent ) ))]]) ).
thf(5545,plain,
! [B: $i,A: $i] :
~ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[5423]) ).
thf(1162,plain,
! [C: $i,B: $i,A: $i] :
( ( A
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[905]) ).
thf(1163,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ),
inference(simp,[status(thm)],[1162]) ).
thf(1067,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[972,35]) ).
thf(1068,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1067]) ).
thf(1069,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1068:[bind(A,$thf( O )),bind(B,$thf( P )),bind(C,$thf( L )),bind(D,$thf( P @ ( O @ equivalent ) @ ( O @ ( P @ equivalent ) @ ( L @ ( L @ equivalent ) @ equivalent ) @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( F ))]]) ).
thf(1091,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1069]) ).
thf(7971,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ( H @ ( G @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[688,112]) ).
thf(7972,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[7971]) ).
thf(7973,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ equivalent ) @ ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[7972:[bind(A,$thf( W )),bind(B,$thf( ZB @ ( ZA @ equivalent ) @ ( ZA @ ( ZB @ equivalent ) @ ( W @ equivalent ) @ equivalent ) )),bind(C,$thf( T )),bind(D,$thf( W )),bind(E,$thf( ZA )),bind(F,$thf( ZB )),bind(G,$thf( T @ ( ZB @ ( ZA @ equivalent ) @ ( ZA @ ( ZB @ equivalent ) @ ( W @ equivalent ) @ equivalent ) @ equivalent ) )),bind(H,$thf( T @ ( W @ equivalent ) ))]]) ).
thf(8075,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ equivalent ) @ ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[7973]) ).
thf(9658,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ equivalent ) @ ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( E @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( E @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[8075,2434]) ).
thf(9659,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ equivalent ) @ ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( E @ equivalent ) @ is_a_theorem ) )
| ~ ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[9658]) ).
thf(9660,plain,
! [B: $i,A: $i] :
~ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[9659:[bind(A,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) )),bind(B,$thf( a )),bind(C,$thf( N )),bind(D,$thf( O )),bind(E,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( O @ ( N @ equivalent ) @ ( N @ ( O @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(9849,plain,
! [B: $i,A: $i] :
~ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[9660]) ).
thf(76,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true
| ~ ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[35,35]) ).
thf(77,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[76]) ).
thf(78,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( C @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[77:[bind(A,$thf( I )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( N @ ( M @ equivalent ) @ ( M @ ( N @ equivalent ) @ ( I @ equivalent ) @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( F ))]]) ).
thf(92,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( C @ is_a_theorem ) ),
inference(simp,[status(thm)],[78]) ).
thf(2378,plain,
! [A: $i] :
( ~ $true
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( A @ is_a_theorem ) )
| ~ ( A @ is_a_theorem ) ),
inference(eqfactor_ordered,[status(thm)],[1800]) ).
thf(2383,plain,
! [A: $i] :
( ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( A @ is_a_theorem ) )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[2378]) ).
thf(4423,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,2383]) ).
thf(4424,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) ) ),
inference(simp,[status(thm)],[4423]) ).
thf(4425,plain,
! [A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[4424:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ equivalent ) ))]]) ).
thf(4616,plain,
! [A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4425]) ).
thf(10263,plain,
! [A: $i] :
( ( A @ ( A @ equivalent ) @ is_a_theorem )
| ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(bool_ext,[status(thm)],[4616]) ).
thf(95,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ is_a_theorem ) )
| ( ( G @ ( F @ equivalent ) @ is_a_theorem )
!= ( F @ is_a_theorem ) )
| ~ $true
| ( G @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[86,33]) ).
thf(96,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ is_a_theorem ) )
| ( ( G @ ( F @ equivalent ) @ is_a_theorem )
!= ( F @ is_a_theorem ) )
| ( G @ is_a_theorem ) ),
inference(simp,[status(thm)],[95]) ).
thf(97,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[96:[bind(A,$thf( X )),bind(B,$thf( Y )),bind(C,$thf( P )),bind(D,$thf( T )),bind(E,$thf( U )),bind(F,$thf( Y @ ( X @ equivalent ) @ ( X @ ( Y @ equivalent ) @ ( U @ ( T @ equivalent ) @ ( T @ ( U @ equivalent ) @ ( P @ equivalent ) @ equivalent ) @ ( P @ equivalent ) @ equivalent ) @ equivalent ) )),bind(G,$thf( G ))]]) ).
thf(111,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[97]) ).
thf(7555,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( A @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(rewrite,[status(thm)],[111,86]) ).
thf(1144,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) )
!= a )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1096,215]) ).
thf(1145,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[1144]) ).
thf(1146,plain,
! [C: $i,B: $i,A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ),
inference(pattern_uni,[status(thm)],[1145:[bind(A,$thf( L )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( N @ ( M @ equivalent ) @ ( L @ ( L @ equivalent ) @ equivalent ) @ ( M @ ( N @ equivalent ) @ equivalent ) ))]]) ).
thf(1159,plain,
! [C: $i,B: $i,A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ),
inference(simp,[status(thm)],[1146]) ).
thf(2364,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ ( D @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( E @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( E @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[860,1800]) ).
thf(2365,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ ( D @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( E @ equivalent ) @ is_a_theorem ) )
| ~ ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[2364]) ).
thf(2366,plain,
! [A: $i] :
~ ( a @ ( A @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[2365:[bind(A,$thf( M )),bind(B,$thf( a )),bind(C,$thf( a )),bind(D,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) )),bind(E,$thf( a @ ( M @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( M @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(2419,plain,
! [A: $i] :
~ ( a @ ( A @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[2366]) ).
thf(2991,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ ( B @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,2419]) ).
thf(2992,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ ( B @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[2991]) ).
thf(3050,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) )
!= ( a @ ( B @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[2992]) ).
thf(14,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,6]) ).
thf(15,plain,
! [C: $i,B: $i,A: $i] :
( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[14]) ).
thf(16,plain,
! [C: $i,B: $i,A: $i] :
( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[15]) ).
thf(39,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( A != a ) ),
inference(simp,[status(thm)],[16]) ).
thf(40,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( a @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[39]) ).
thf(41,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) ) )
| ( ( B @ ( A @ equivalent ) @ ( a @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[40]) ).
thf(140,plain,
! [B: $i,A: $i] :
( ( A
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) ) )
| ( B
!= ( c @ ( b @ equivalent ) ) )
| ( ( B @ ( A @ equivalent ) @ ( a @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[41]) ).
thf(141,plain,
( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) )
!= a ),
inference(simp,[status(thm)],[140]) ).
thf(9292,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ~ ( a @ is_a_theorem )
| ~ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,5806]) ).
thf(9293,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ~ ( a @ is_a_theorem )
| ~ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[9292]) ).
thf(9294,plain,
! [A: $i] :
( ~ ( a @ is_a_theorem )
| ~ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[9293:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ equivalent ) ))]]) ).
thf(9603,plain,
! [A: $i] :
( ~ ( a @ is_a_theorem )
| ~ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[9294]) ).
thf(391,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( H @ ( I @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[86,36]) ).
thf(392,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( H @ ( I @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[391]) ).
thf(393,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[392:[bind(A,$thf( ZZ @ ( ZZA @ equivalent ) )),bind(B,$thf( ZZA @ ( ZZ @ equivalent ) @ ( ZY @ ( ZX @ equivalent ) @ ( ZX @ ( ZY @ equivalent ) @ ( ZT @ equivalent ) @ equivalent ) @ ( ZT @ equivalent ) @ equivalent ) )),bind(C,$thf( ZT )),bind(D,$thf( ZX )),bind(E,$thf( ZY )),bind(F,$thf( ZZA @ ( ZZ @ equivalent ) @ ( ZY @ ( ZX @ equivalent ) @ ( ZX @ ( ZY @ equivalent ) @ ( ZT @ equivalent ) @ equivalent ) @ ( ZT @ equivalent ) @ equivalent ) @ ( ZZ @ ( ZZA @ equivalent ) @ equivalent ) )),bind(G,$thf( ZY @ ( ZX @ equivalent ) @ ( ZX @ ( ZY @ equivalent ) @ ( ZT @ equivalent ) @ equivalent ) @ ( ZT @ equivalent ) )),bind(H,$thf( ZZA )),bind(I,$thf( ZZ ))]]) ).
thf(403,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[393]) ).
thf(3461,plain,
! [A: $i] :
( ( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( A @ is_a_theorem ) )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[3459]) ).
thf(4693,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,3461]) ).
thf(4694,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) ) ),
inference(simp,[status(thm)],[4693]) ).
thf(4695,plain,
! [A: $i] :
( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[4694:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ equivalent ) ))]]) ).
thf(4889,plain,
! [A: $i] :
( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4695]) ).
thf(13355,plain,
! [A: $i] :
( ( A @ ( A @ equivalent ) @ is_a_theorem )
| ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(bool_ext,[status(thm)],[4889]) ).
thf(11,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[9,6]) ).
thf(12,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[11]) ).
thf(13,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[12]) ).
thf(9350,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ is_a_theorem )
| ~ $true
| ~ ( D @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[35,5806]) ).
thf(9351,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ is_a_theorem )
| ~ ( D @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[9350]) ).
thf(9352,plain,
! [A: $i] :
( ~ ( a @ is_a_theorem )
| ~ ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[9351:[bind(A,$thf( E )),bind(B,$thf( a )),bind(C,$thf( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )),bind(D,$thf( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( E @ equivalent ) ))]]) ).
thf(9614,plain,
! [A: $i] :
( ~ ( a @ is_a_theorem )
| ~ ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[9352]) ).
thf(15007,plain,
! [A: $i] :
( ~ $true
| ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ~ ( a @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(eqfactor_ordered,[status(thm)],[9614]) ).
thf(15039,plain,
! [A: $i] :
( ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) )
!= a )
| ~ ( a @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[15007]) ).
thf(12934,plain,
! [A: $i] :
( ~ $true
| ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ~ ( a @ is_a_theorem ) ),
inference(eqfactor_ordered,[status(thm)],[9584]) ).
thf(12938,plain,
! [A: $i] :
( ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= a )
| ~ ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[12934]) ).
thf(2216,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( D @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[1450,1800]) ).
thf(2217,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[2216]) ).
thf(2218,plain,
! [A: $i] :
~ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[2217:[bind(A,$thf( H )),bind(B,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) )),bind(C,$thf( a )),bind(D,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( H @ ( H @ equivalent ) @ equivalent ) ))]]) ).
thf(2408,plain,
! [A: $i] :
~ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[2218]) ).
thf(985,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[907,6]) ).
thf(986,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[985]) ).
thf(1026,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[986]) ).
thf(9295,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ is_a_theorem )
| ~ $true
| ~ ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[911,5806]) ).
thf(9296,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ is_a_theorem )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[9295]) ).
thf(9297,plain,
( ~ ( a @ is_a_theorem )
| ~ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[9296:[bind(A,$thf( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) )),bind(B,$thf( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ))]]) ).
thf(10041,plain,
( ~ $true
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ~ ( a @ is_a_theorem ) ),
inference(eqfactor_ordered,[status(thm)],[9297]) ).
thf(10115,plain,
( ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ~ ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[10041]) ).
thf(10407,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,10115]) ).
thf(10408,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) ) ),
inference(simp,[status(thm)],[10407]) ).
thf(10683,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= a )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) ) ),
inference(simp,[status(thm)],[10408]) ).
thf(1764,plain,
( ( ( e @ ( c @ equivalent ) )
!= c )
| ( ( e @ ( b @ equivalent ) )
!= b )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[1529]) ).
thf(6785,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[6625]) ).
thf(12233,plain,
! [A: $i] :
( ( a @ is_a_theorem )
| ( A @ ( A @ equivalent ) @ is_a_theorem )
| ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(bool_ext,[status(thm)],[6785]) ).
thf(34,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) )
!= A )
| ~ ( A @ is_a_theorem )
| ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[32]) ).
thf(17,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[13]) ).
thf(101,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[86,35]) ).
thf(102,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[101]) ).
thf(103,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[102:[bind(A,$thf( Y )),bind(B,$thf( Z )),bind(C,$thf( Q )),bind(D,$thf( U )),bind(E,$thf( V )),bind(F,$thf( Z @ ( Y @ equivalent ) @ ( Y @ ( Z @ equivalent ) @ ( V @ ( U @ equivalent ) @ ( U @ ( V @ equivalent ) @ ( Q @ equivalent ) @ equivalent ) @ ( Q @ equivalent ) @ equivalent ) @ equivalent ) )),bind(G,$thf( G )),bind(H,$thf( H ))]]) ).
thf(113,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[103]) ).
thf(147,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( I @ ( H @ equivalent ) @ is_a_theorem ) )
| ~ ( H @ is_a_theorem )
| ~ ( H @ is_a_theorem )
| ( I @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[113,33]) ).
thf(148,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( I @ ( H @ equivalent ) @ is_a_theorem ) )
| ~ ( H @ is_a_theorem )
| ( I @ is_a_theorem ) ),
inference(simp,[status(thm)],[147]) ).
thf(149,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
| ( G @ ( F @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[148:[bind(A,$thf( ZF )),bind(B,$thf( ZG )),bind(C,$thf( T )),bind(D,$thf( X )),bind(E,$thf( Y )),bind(F,$thf( ZB )),bind(G,$thf( ZC )),bind(H,$thf( ZF @ ( ZG @ equivalent ) @ ( ZC @ ( ZB @ equivalent ) @ ( ZB @ ( ZC @ equivalent ) @ ( Y @ ( X @ equivalent ) @ ( X @ ( Y @ equivalent ) @ ( T @ equivalent ) @ equivalent ) @ ( T @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(I,$thf( ZG @ ( ZF @ equivalent ) ))]]) ).
thf(161,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
| ( G @ ( F @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[149]) ).
thf(5902,plain,
( ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a )
| ~ ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[5855]) ).
thf(5949,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,5902]) ).
thf(5950,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[5949]) ).
thf(6001,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= a )
| ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[5950]) ).
thf(7198,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ( ( B @ ( B @ equivalent ) )
!= ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,5920]) ).
thf(7199,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ( ( B @ ( B @ equivalent ) )
!= ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[7198]) ).
thf(7295,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ( B != a )
| ( B
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[7199]) ).
thf(7395,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[7295]) ).
thf(7709,plain,
! [A: $i] :
( ( a @ is_a_theorem )
| ( A @ ( A @ equivalent ) @ is_a_theorem )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(bool_ext,[status(thm)],[7395]) ).
thf(9287,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ is_a_theorem )
| ~ $true
| ~ ( D @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[9,5806]) ).
thf(9288,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ is_a_theorem )
| ~ ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[9287]) ).
thf(9289,plain,
! [A: $i] :
( ~ ( a @ is_a_theorem )
| ~ ( A @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[9288:[bind(A,$thf( a )),bind(B,$thf( J )),bind(C,$thf( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )),bind(D,$thf( J @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( J @ ( a @ equivalent ) @ equivalent ) ))]]) ).
thf(9602,plain,
! [A: $i] :
( ~ ( a @ is_a_theorem )
| ~ ( A @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[9289]) ).
thf(819,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( F @ ( H @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[739,38]) ).
thf(820,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( F @ ( H @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[819]) ).
thf(821,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( E @ equivalent ) @ ( A @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[820:[bind(A,$thf( ZH @ ( ZG @ equivalent ) )),bind(B,$thf( ZB @ ( ZH @ equivalent ) @ ( ZB @ ( ZG @ equivalent ) @ equivalent ) )),bind(C,$thf( ZE )),bind(D,$thf( ZF )),bind(E,$thf( ZH @ ( ZG @ equivalent ) @ ( ZF @ ( ZE @ equivalent ) @ ( ZE @ ( ZF @ equivalent ) @ ( ZB @ ( ZH @ equivalent ) @ ( ZB @ ( ZG @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(F,$thf( ZB )),bind(G,$thf( ZG )),bind(H,$thf( ZH ))]]) ).
thf(859,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( E @ equivalent ) @ ( A @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[821]) ).
thf(1534,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( E @ equivalent ) @ ( A @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( H @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[859,37]) ).
thf(1535,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( E @ equivalent ) @ ( A @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( H @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1534]) ).
thf(1536,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( C @ ( D @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1535:[bind(A,$thf( P )),bind(B,$thf( U )),bind(C,$thf( V )),bind(D,$thf( M )),bind(E,$thf( V @ ( U @ equivalent ) )),bind(F,$thf( V @ ( U @ equivalent ) )),bind(G,$thf( U @ ( V @ equivalent ) @ ( P @ ( V @ ( U @ equivalent ) @ equivalent ) @ ( P @ ( M @ equivalent ) @ equivalent ) @ equivalent ) )),bind(H,$thf( M ))]]) ).
thf(1579,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( C @ ( D @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1536]) ).
thf(1592,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( D @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1579,37]) ).
thf(1593,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( D @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1592]) ).
thf(1594,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ ( D @ ( C @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1593:[bind(A,$thf( U @ ( T @ equivalent ) @ ( R @ equivalent ) )),bind(B,$thf( M )),bind(C,$thf( U )),bind(D,$thf( T )),bind(E,$thf( U @ ( T @ equivalent ) )),bind(F,$thf( M @ ( T @ ( U @ equivalent ) @ equivalent ) @ ( M @ ( U @ ( T @ equivalent ) @ ( R @ equivalent ) @ equivalent ) @ equivalent ) )),bind(G,$thf( R ))]]) ).
thf(1646,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ ( D @ ( C @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1594]) ).
thf(1649,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ ( D @ ( C @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1646,37]) ).
thf(1650,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ ( D @ ( C @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1649]) ).
thf(1651,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ ( D @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1650:[bind(A,$thf( U )),bind(B,$thf( U @ ( W @ ( V @ equivalent ) @ equivalent ) @ ( R @ equivalent ) )),bind(C,$thf( W )),bind(D,$thf( V )),bind(E,$thf( U @ ( W @ ( V @ equivalent ) @ equivalent ) )),bind(F,$thf( U @ ( V @ ( W @ equivalent ) @ ( U @ ( W @ ( V @ equivalent ) @ equivalent ) @ ( R @ equivalent ) @ equivalent ) @ equivalent ) )),bind(G,$thf( R ))]]) ).
thf(1701,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ ( D @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1651]) ).
thf(3319,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( D @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[9,2434]) ).
thf(3320,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[3319]) ).
thf(3321,plain,
! [A: $i] :
~ ( A @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( A @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[3320:[bind(A,$thf( a )),bind(B,$thf( J )),bind(C,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) )),bind(D,$thf( J @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( J @ ( a @ equivalent ) @ equivalent ) ))]]) ).
thf(3522,plain,
! [A: $i] :
~ ( A @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( A @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[3321]) ).
thf(3648,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( B @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,3522]) ).
thf(3649,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( B @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3648]) ).
thf(3700,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) )
!= ( B @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( B @ ( a @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[3649]) ).
thf(142,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[113,6]) ).
thf(143,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[142]) ).
thf(159,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[143]) ).
thf(810,plain,
! [A: $i] :
( ( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) )
!= ( c @ ( b @ equivalent ) ) )
| ( A != A )
| ( ( c @ ( b @ equivalent ) @ ( A @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[808]) ).
thf(811,plain,
! [A: $i] :
( ( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) )
!= ( c @ ( b @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( A @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[810]) ).
thf(979,plain,
! [A: $i] :
( ( ( e @ ( c @ equivalent ) )
!= c )
| ( ( e @ ( b @ equivalent ) )
!= b )
| ( ( c @ ( b @ equivalent ) @ ( A @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[811]) ).
thf(280,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) )
!= a )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,215]) ).
thf(281,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[280]) ).
thf(282,plain,
! [C: $i,B: $i,A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) )
!= a ),
inference(pattern_uni,[status(thm)],[281:[bind(A,$thf( I )),bind(B,$thf( N )),bind(C,$thf( M )),bind(D,$thf( N @ ( M @ equivalent ) @ ( M @ ( N @ equivalent ) @ ( I @ equivalent ) @ equivalent ) @ ( I @ equivalent ) ))]]) ).
thf(303,plain,
! [C: $i,B: $i,A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) )
!= a ),
inference(simp,[status(thm)],[282]) ).
thf(5337,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ ( D @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,5236]) ).
thf(5338,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ ( D @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[5337]) ).
thf(5339,plain,
! [B: $i,A: $i] :
~ ( a @ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[5338:[bind(A,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) )),bind(B,$thf( ZJ )),bind(C,$thf( ZI )),bind(D,$thf( ZJ @ ( ZI @ equivalent ) @ ( ZI @ ( ZJ @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(5552,plain,
! [B: $i,A: $i] :
~ ( a @ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[5339]) ).
thf(3091,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ ( a @ equivalent ) @ ( B @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,2420]) ).
thf(3092,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ ( a @ equivalent ) @ ( B @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3091]) ).
thf(3171,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) )
!= ( B @ ( a @ equivalent ) @ ( B @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[3092]) ).
thf(4102,plain,
! [B: $i,A: $i] :
( ( A
!= ( B @ ( a @ equivalent ) ) )
| ( A
!= ( B @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[3171]) ).
thf(4103,plain,
! [A: $i] :
( ( A @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) )
!= ( A @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[4102]) ).
thf(923,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,6]) ).
thf(924,plain,
! [A: $i] :
( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[923]) ).
thf(964,plain,
! [A: $i] :
( ( A @ ( A @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[924]) ).
thf(5750,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ~ ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,5398]) ).
thf(5751,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ~ ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[5750]) ).
thf(5885,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= a )
| ~ ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[5751]) ).
thf(2384,plain,
! [A: $i] :
( ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( A @ equivalent ) )
!= A )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[2378]) ).
thf(3760,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( B @ equivalent ) )
!= B )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,2384]) ).
thf(3761,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( B @ equivalent ) )
!= B ) ),
inference(simp,[status(thm)],[3760]) ).
thf(3762,plain,
! [A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= ( A @ ( A @ equivalent ) ) ),
inference(pattern_uni,[status(thm)],[3761:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ equivalent ) ))]]) ).
thf(3861,plain,
! [A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= ( A @ ( A @ equivalent ) ) ),
inference(simp,[status(thm)],[3762]) ).
thf(2635,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,2408]) ).
thf(2636,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[2635]) ).
thf(2710,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[2636]) ).
thf(902,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) )
!= a )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[854,215]) ).
thf(903,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[902]) ).
thf(904,plain,
! [C: $i,B: $i,A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ),
inference(pattern_uni,[status(thm)],[903:[bind(A,$thf( F )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( F @ ( N @ ( M @ equivalent ) @ ( M @ ( N @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(912,plain,
! [C: $i,B: $i,A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ),
inference(simp,[status(thm)],[904]) ).
thf(130,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ is_a_theorem ) )
| ( G @ is_a_theorem )
| ~ $true
| ~ ( G @ ( F @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[91,8]) ).
thf(131,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ is_a_theorem ) )
| ( G @ is_a_theorem )
| ~ ( G @ ( F @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[130]) ).
thf(132,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( B @ ( D @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[131:[bind(A,$thf( X )),bind(B,$thf( Y )),bind(C,$thf( S )),bind(D,$thf( T )),bind(E,$thf( U )),bind(F,$thf( Y @ ( X @ equivalent ) @ ( X @ ( Y @ equivalent ) @ ( U @ ( T @ equivalent ) @ ( S @ ( U @ equivalent ) @ ( S @ ( T @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(G,$thf( G ))]]) ).
thf(135,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( B @ ( D @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[132]) ).
thf(9922,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ~ $true
| ~ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[911,9297]) ).
thf(9923,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ~ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[9922]) ).
thf(10063,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= a )
| ~ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[9923]) ).
thf(289,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) )
!= a )
| ~ $true
| ~ ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[35,215]) ).
thf(290,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) )
!= a )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[289]) ).
thf(291,plain,
! [C: $i,B: $i,A: $i] :
( ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= a )
| ~ ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[290:[bind(A,$thf( G )),bind(B,$thf( K )),bind(C,$thf( L )),bind(D,$thf( L @ ( K @ equivalent ) @ ( K @ ( L @ equivalent ) @ ( G @ equivalent ) @ equivalent ) ))]]) ).
thf(299,plain,
! [C: $i,B: $i,A: $i] :
( ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= a )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[291]) ).
thf(150,plain,
! [J: $i,I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( H @ is_a_theorem ) )
| ( J @ ( I @ equivalent ) @ ( I @ ( J @ equivalent ) @ ( H @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[113,35]) ).
thf(151,plain,
! [J: $i,I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( H @ is_a_theorem ) )
| ( J @ ( I @ equivalent ) @ ( I @ ( J @ equivalent ) @ ( H @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[150]) ).
thf(152,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( I @ ( H @ equivalent ) @ ( H @ ( I @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[151:[bind(A,$thf( ZI )),bind(B,$thf( ZJ )),bind(C,$thf( W )),bind(D,$thf( ZA )),bind(E,$thf( ZB )),bind(F,$thf( ZE )),bind(G,$thf( ZF )),bind(H,$thf( ZJ @ ( ZI @ equivalent ) @ ( ZI @ ( ZJ @ equivalent ) @ ( ZF @ ( ZE @ equivalent ) @ ( ZE @ ( ZF @ equivalent ) @ ( ZB @ ( ZA @ equivalent ) @ ( ZA @ ( ZB @ equivalent ) @ ( W @ equivalent ) @ equivalent ) @ ( W @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(I,$thf( I )),bind(J,$thf( J ))]]) ).
thf(162,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( I @ ( H @ equivalent ) @ ( H @ ( I @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[152]) ).
thf(206,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( F @ ( E @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( E @ ( F @ equivalent ) @ ( D @ equivalent ) )
!= a )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[9,165]) ).
thf(207,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( F @ ( E @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( E @ ( F @ equivalent ) @ ( D @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[206]) ).
thf(208,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(pattern_uni,[status(thm)],[207:[bind(A,$thf( O )),bind(B,$thf( N )),bind(C,$thf( P )),bind(D,$thf( P @ ( O @ equivalent ) @ ( N @ ( P @ equivalent ) @ ( N @ ( O @ equivalent ) @ equivalent ) @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( F ))]]) ).
thf(209,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( E @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[208]) ).
thf(931,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( D @ ( C @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( C @ ( D @ equivalent ) @ ( B @ equivalent ) )
!= a )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,165]) ).
thf(932,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( D @ ( C @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( C @ ( D @ equivalent ) @ ( B @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[931]) ).
thf(933,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) )
!= a ) ),
inference(pattern_uni,[status(thm)],[932:[bind(A,$thf( F )),bind(B,$thf( F @ ( F @ equivalent ) )),bind(C,$thf( C )),bind(D,$thf( D ))]]) ).
thf(968,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[933]) ).
thf(14066,plain,
! [A: $i] :
( ~ $true
| ( ( A @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ~ ( a @ is_a_theorem ) ),
inference(eqfactor_ordered,[status(thm)],[9602]) ).
thf(14091,plain,
! [A: $i] :
( ( ( A @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( a @ equivalent ) @ equivalent ) )
!= a )
| ~ ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[14066]) ).
thf(7702,plain,
! [A: $i] :
( ( a != a )
| ( ( A @ ( A @ equivalent ) )
!= ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(eqfactor_ordered,[status(thm)],[6001]) ).
thf(7704,plain,
! [A: $i] :
( ( A != a )
| ( A
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[7702]) ).
thf(7705,plain,
( ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )
!= a )
| ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[7704]) ).
thf(943,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) )
!= a )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,299]) ).
thf(944,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[943]) ).
thf(945,plain,
! [C: $i,B: $i,A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ),
inference(pattern_uni,[status(thm)],[944:[bind(A,$thf( F )),bind(B,$thf( F @ ( F @ equivalent ) )),bind(C,$thf( C )),bind(D,$thf( D ))]]) ).
thf(971,plain,
! [C: $i,B: $i,A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ),
inference(simp,[status(thm)],[945]) ).
thf(1522,plain,
! [C: $i,B: $i,A: $i] :
( ( a != a )
| ( ( A @ ( A @ equivalent ) )
!= ( B @ ( C @ equivalent ) ) )
| ( ( C @ ( B @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) ) )
| ( ( B @ ( C @ equivalent ) )
!= a ) ),
inference(eqfactor_ordered,[status(thm)],[1520]) ).
thf(1523,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) ) )
| ( ( A @ ( A @ equivalent ) )
!= a ) ),
inference(pattern_uni,[status(thm)],[1522:[bind(A,$thf( A )),bind(B,$thf( A )),bind(C,$thf( A ))]]) ).
thf(1530,plain,
! [A: $i] :
( ( A
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) ) )
| ( A
!= ( c @ ( b @ equivalent ) ) )
| ( ( A @ ( A @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[1523]) ).
thf(1531,plain,
( ( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) )
!= ( c @ ( b @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[1530]) ).
thf(1082,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) )
!= a )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[972,215]) ).
thf(1083,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[1082]) ).
thf(1084,plain,
! [C: $i,B: $i,A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ),
inference(pattern_uni,[status(thm)],[1083:[bind(A,$thf( M )),bind(B,$thf( N )),bind(C,$thf( J )),bind(D,$thf( N @ ( M @ equivalent ) @ ( M @ ( N @ equivalent ) @ ( J @ ( J @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(1098,plain,
! [C: $i,B: $i,A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ),
inference(simp,[status(thm)],[1084]) ).
thf(8698,plain,
! [A: $i] :
( ~ $true
| ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ( a @ is_a_theorem )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(eqfactor_ordered,[status(thm)],[7709]) ).
thf(8701,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( a @ is_a_theorem ) )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )
!= a )
| ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[8698]) ).
thf(9920,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,9297]) ).
thf(9921,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[9920]) ).
thf(10095,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ~ ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[9921]) ).
thf(5405,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ ( E @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[739,5236]) ).
thf(5406,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( a @ ( E @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[5405]) ).
thf(5407,plain,
! [B: $i,A: $i] :
~ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[5406:[bind(A,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) )),bind(B,$thf( a )),bind(C,$thf( X )),bind(D,$thf( Y )),bind(E,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( Y @ ( X @ equivalent ) @ ( X @ ( Y @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(5543,plain,
! [B: $i,A: $i] :
~ ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[5407]) ).
thf(1283,plain,
! [C: $i,B: $i,A: $i] :
( ( A
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( B @ ( C @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[1026]) ).
thf(1284,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ),
inference(simp,[status(thm)],[1283]) ).
thf(7002,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[5682,37]) ).
thf(7003,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[7002]) ).
thf(7004,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( C @ ( D @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[7003:[bind(A,$thf( S @ ( U @ ( T @ equivalent ) @ equivalent ) @ ( N @ equivalent ) )),bind(B,$thf( S )),bind(C,$thf( U )),bind(D,$thf( T )),bind(E,$thf( S @ ( U @ ( T @ equivalent ) @ equivalent ) )),bind(F,$thf( N )),bind(G,$thf( S @ ( T @ ( U @ equivalent ) @ ( S @ ( U @ ( T @ equivalent ) @ equivalent ) @ ( N @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(7163,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( C @ ( D @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[7004]) ).
thf(977,plain,
! [A: $i] :
( ( A
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( A != a ) ),
inference(simp,[status(thm)],[964]) ).
thf(978,plain,
( ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) )
!= a ),
inference(simp,[status(thm)],[977]) ).
thf(17373,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ ( D @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( H @ ( I @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( I @ ( H @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[11306,134]) ).
thf(17374,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ ( D @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( H @ ( I @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( I @ ( H @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[17373]) ).
thf(17375,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ ( D @ equivalent ) @ equivalent ) @ ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[17374:[bind(A,$thf( W )),bind(B,$thf( ZA @ ( Z @ equivalent ) )),bind(C,$thf( Y @ ( Z @ equivalent ) )),bind(D,$thf( Y @ ( ZA @ equivalent ) )),bind(E,$thf( Y )),bind(F,$thf( Z )),bind(G,$thf( ZA )),bind(H,$thf( ZA @ ( Z @ equivalent ) )),bind(I,$thf( W @ ( Y @ ( ZA @ equivalent ) @ equivalent ) @ ( W @ ( Y @ ( Z @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(17612,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ ( D @ equivalent ) @ equivalent ) @ ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[17375]) ).
thf(1141,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ equivalent ) @ equivalent ) @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1096,36]) ).
thf(1142,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ equivalent ) @ equivalent ) @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[1141]) ).
thf(1143,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1142:[bind(A,$thf( S )),bind(B,$thf( ZC @ ( ZB @ equivalent ) @ ( ZB @ ( ZC @ equivalent ) @ ( U @ equivalent ) @ equivalent ) )),bind(C,$thf( U )),bind(D,$thf( U @ ( ZC @ ( ZB @ equivalent ) @ ( ZB @ ( ZC @ equivalent ) @ ( U @ equivalent ) @ equivalent ) @ equivalent ) @ ( S @ ( S @ equivalent ) @ equivalent ) )),bind(E,$thf( U )),bind(F,$thf( ZB )),bind(G,$thf( ZC ))]]) ).
thf(1157,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1143]) ).
thf(16793,plain,
! [B: $i,A: $i] :
( ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( ( B @ ( B @ equivalent ) )
!= a )
| ~ $true
| ( a @ is_a_theorem )
| ( ( A @ ( A @ equivalent ) )
!= a ) ),
inference(paramod_ordered,[status(thm)],[12325,5885]) ).
thf(16794,plain,
! [B: $i,A: $i] :
( ( ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( ( B @ ( B @ equivalent ) )
!= a )
| ( a @ is_a_theorem )
| ( ( A @ ( A @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[16793]) ).
thf(16795,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= a )
| ( a @ is_a_theorem )
| ( ( A @ ( A @ equivalent ) )
!= a ) ),
inference(pattern_uni,[status(thm)],[16794:[]]) ).
thf(17962,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( A @ ( B @ ( D @ equivalent ) @ equivalent ) @ ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( E @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( E @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[17606,1800]) ).
thf(17963,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( A @ ( B @ ( D @ equivalent ) @ equivalent ) @ ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ ( E @ equivalent ) @ is_a_theorem ) )
| ~ ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[17962]) ).
thf(17964,plain,
! [B: $i,A: $i] :
~ ( A @ ( B @ ( a @ equivalent ) @ equivalent ) @ ( A @ ( B @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[17963:[bind(A,$thf( M )),bind(B,$thf( O )),bind(C,$thf( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) )),bind(D,$thf( a )),bind(E,$thf( M @ ( O @ ( a @ equivalent ) @ equivalent ) @ ( M @ ( O @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(18234,plain,
! [B: $i,A: $i] :
~ ( A @ ( B @ ( a @ equivalent ) @ equivalent ) @ ( A @ ( B @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[17964]) ).
thf(925,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,85]) ).
thf(926,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ) ),
inference(simp,[status(thm)],[925]) ).
thf(927,plain,
! [C: $i,B: $i,A: $i] :
( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(pattern_uni,[status(thm)],[926:[bind(A,$thf( F )),bind(B,$thf( F @ ( F @ equivalent ) )),bind(C,$thf( C )),bind(D,$thf( D ))]]) ).
thf(976,plain,
! [C: $i,B: $i,A: $i] :
( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[927]) ).
thf(144,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( H @ is_a_theorem ) )
| ( ( I @ ( H @ equivalent ) @ is_a_theorem )
!= ( H @ is_a_theorem ) )
| ~ $true
| ( I @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[113,33]) ).
thf(145,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( G @ ( F @ equivalent ) @ ( F @ ( G @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( H @ is_a_theorem ) )
| ( ( I @ ( H @ equivalent ) @ is_a_theorem )
!= ( H @ is_a_theorem ) )
| ( I @ is_a_theorem ) ),
inference(simp,[status(thm)],[144]) ).
thf(146,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[145:[bind(A,$thf( ZH )),bind(B,$thf( ZI )),bind(C,$thf( V )),bind(D,$thf( Z )),bind(E,$thf( ZA )),bind(F,$thf( ZD )),bind(G,$thf( ZE )),bind(H,$thf( ZI @ ( ZH @ equivalent ) @ ( ZH @ ( ZI @ equivalent ) @ ( ZE @ ( ZD @ equivalent ) @ ( ZD @ ( ZE @ equivalent ) @ ( ZA @ ( Z @ equivalent ) @ ( Z @ ( ZA @ equivalent ) @ ( V @ equivalent ) @ equivalent ) @ ( V @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(I,$thf( I ))]]) ).
thf(160,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[146]) ).
thf(14457,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( A @ ( H @ ( G @ equivalent ) @ ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(rewrite,[status(thm)],[160,113]) ).
thf(139,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[110]) ).
thf(7874,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ( H @ ( G @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[1096,112]) ).
thf(7875,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( H @ equivalent ) @ ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( H @ ( G @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[7874]) ).
thf(7876,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[7875:[bind(A,$thf( R )),bind(B,$thf( ZB @ ( ZA @ equivalent ) @ ( ZA @ ( ZB @ equivalent ) @ ( T @ equivalent ) @ equivalent ) )),bind(C,$thf( T )),bind(D,$thf( T )),bind(E,$thf( ZA )),bind(F,$thf( ZB )),bind(G,$thf( T @ ( ZB @ ( ZA @ equivalent ) @ ( ZA @ ( ZB @ equivalent ) @ ( T @ equivalent ) @ equivalent ) @ equivalent ) )),bind(H,$thf( R @ ( R @ equivalent ) ))]]) ).
thf(8119,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[7876]) ).
thf(1706,plain,
( ( ( e @ ( c @ equivalent ) )
!= c )
| ( ( e @ ( b @ equivalent ) )
!= b )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[1531]) ).
thf(203,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( F @ ( E @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( E @ ( F @ equivalent ) @ ( D @ equivalent ) )
!= a )
| ~ $true
| ~ ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[35,165]) ).
thf(204,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( F @ ( E @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( E @ ( F @ equivalent ) @ ( D @ equivalent ) )
!= a )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[203]) ).
thf(205,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) )
!= a )
| ~ ( C @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[204:[bind(A,$thf( I )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( N @ ( M @ equivalent ) @ ( M @ ( N @ equivalent ) @ ( I @ equivalent ) @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( F ))]]) ).
thf(214,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) ) )
| ( ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) )
!= a )
| ~ ( C @ is_a_theorem ) ),
inference(simp,[status(thm)],[205]) ).
thf(292,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) )
!= a )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[9,215]) ).
thf(293,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( D @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[292]) ).
thf(294,plain,
! [C: $i,B: $i,A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ),
inference(pattern_uni,[status(thm)],[293:[bind(A,$thf( M )),bind(B,$thf( L )),bind(C,$thf( N )),bind(D,$thf( N @ ( M @ equivalent ) @ ( L @ ( N @ equivalent ) @ ( L @ ( M @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(300,plain,
! [C: $i,B: $i,A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ),
inference(simp,[status(thm)],[294]) ).
thf(1707,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ ( D @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1701,37]) ).
thf(1708,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ ( D @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1707]) ).
thf(1709,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( C @ ( B @ ( A @ equivalent ) @ ( D @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1708:[bind(A,$thf( S @ ( R @ equivalent ) )),bind(B,$thf( S )),bind(C,$thf( Q )),bind(D,$thf( P )),bind(E,$thf( S )),bind(F,$thf( Q @ ( P @ equivalent ) @ ( S @ ( P @ ( Q @ equivalent ) @ equivalent ) @ ( S @ ( R @ equivalent ) @ equivalent ) @ equivalent ) )),bind(G,$thf( R ))]]) ).
thf(1757,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( C @ ( B @ ( A @ equivalent ) @ ( D @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1709]) ).
thf(712,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[688,35]) ).
thf(713,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[712]) ).
thf(714,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( E @ ( C @ equivalent ) @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[713:[bind(A,$thf( M )),bind(B,$thf( O )),bind(C,$thf( P )),bind(D,$thf( P @ ( O @ equivalent ) @ ( P @ ( M @ equivalent ) @ equivalent ) @ ( O @ ( M @ equivalent ) @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( F ))]]) ).
thf(735,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( E @ ( C @ equivalent ) @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[714]) ).
thf(961,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ equivalent ) )
!= a )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[911,215]) ).
thf(962,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[961]) ).
thf(963,plain,
! [A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= a ),
inference(pattern_uni,[status(thm)],[962:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ equivalent ) ))]]) ).
thf(967,plain,
! [A: $i] :
( ( a @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= a ),
inference(simp,[status(thm)],[963]) ).
thf(1527,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[1526]) ).
thf(18,plain,
! [C: $i,B: $i,A: $i] :
( ( C
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) ) )
| ( A != a )
| ( ( B @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[17]) ).
thf(19,plain,
! [A: $i] :
( ( A @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( a @ equivalent ) @ equivalent ) )
!= a ),
inference(simp,[status(thm)],[18]) ).
thf(804,plain,
! [C: $i,B: $i,A: $i] :
( ( a != a )
| ( ( C @ ( A @ equivalent ) )
!= ( B @ ( A @ equivalent ) ) )
| ( ( C @ ( B @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) ) )
| ( ( B @ ( A @ equivalent ) )
!= a ) ),
inference(eqfactor_ordered,[status(thm)],[801]) ).
thf(805,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) ) )
| ( ( B @ ( A @ equivalent ) )
!= a ) ),
inference(pattern_uni,[status(thm)],[804:[bind(A,$thf( A )),bind(B,$thf( C ))]]) ).
thf(807,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) ) )
| ( ( B @ ( A @ equivalent ) )
!= a ) ),
inference(simp,[status(thm)],[805]) ).
thf(888,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[854,35]) ).
thf(889,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[888]) ).
thf(890,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[889:[bind(A,$thf( H )),bind(B,$thf( O )),bind(C,$thf( P )),bind(D,$thf( H @ ( P @ ( O @ equivalent ) @ ( O @ ( P @ equivalent ) @ ( H @ equivalent ) @ equivalent ) @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( F ))]]) ).
thf(918,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[890]) ).
thf(1129,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1096,35]) ).
thf(1130,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( E @ ( F @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1129]) ).
thf(1131,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1130:[bind(A,$thf( N )),bind(B,$thf( O )),bind(C,$thf( P )),bind(D,$thf( P @ ( O @ equivalent ) @ ( N @ ( N @ equivalent ) @ equivalent ) @ ( O @ ( P @ equivalent ) @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( F ))]]) ).
thf(1152,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( E @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1131]) ).
thf(1463,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1450,6]) ).
thf(1464,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1463]) ).
thf(1505,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ ( a @ equivalent ) @ ( a @ equivalent ) ) ),
inference(simp,[status(thm)],[1464]) ).
thf(11118,plain,
! [J: $i,I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( I @ ( J @ equivalent ) @ ( H @ ( G @ equivalent ) @ ( F @ ( H @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( J @ ( I @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[791,134]) ).
thf(11119,plain,
! [J: $i,I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( D @ ( E @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( A @ ( B @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( I @ ( J @ equivalent ) @ ( H @ ( G @ equivalent ) @ ( F @ ( H @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( J @ ( I @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[11118]) ).
thf(11120,plain,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[11119:[bind(A,$thf( P )),bind(B,$thf( B )),bind(C,$thf( P @ ( P @ equivalent ) )),bind(D,$thf( S )),bind(E,$thf( T )),bind(F,$thf( P )),bind(G,$thf( P )),bind(H,$thf( B )),bind(I,$thf( T @ ( S @ equivalent ) )),bind(J,$thf( S @ ( T @ equivalent ) @ ( P @ ( P @ equivalent ) @ equivalent ) ))]]) ).
thf(11298,plain,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[11120]) ).
thf(8702,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= a )
| ( ( c @ ( b @ equivalent ) @ ( e @ ( c @ equivalent ) @ ( e @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )
!= a )
| ( a @ is_a_theorem ) ),
inference(simp,[status(thm)],[8698]) ).
thf(21959,plain,
$false,
inference(e,[status(thm)],[809,138,12731,88,1158,10234,730,5292,11277,2527,6458,741,5,10,2434,16965,3249,7364,1529,37,184,110,2420,1800,2403,1147,5682,18232,9520,1450,806,905,4230,634,8094,3492,9584,89,133,6,85,5545,1163,1091,38,1217,9849,165,33,92,10263,7555,17606,1159,3050,1402,2245,1096,141,9603,403,9,12325,2419,13355,911,13,41,134,15039,4889,12938,2408,1026,10683,1764,4354,12233,34,17,161,6001,7709,9602,1701,1520,3700,86,159,979,113,2383,9614,2422,1524,5901,7,4616,303,10115,11306,5552,811,5920,4103,91,964,5885,3861,2710,912,135,10063,299,35,6785,3522,162,209,112,968,14091,7705,971,739,1531,1098,8701,3462,791,16,10095,5543,1579,907,5902,1284,7163,978,859,17612,3171,1157,16795,9141,18234,8075,7395,87,976,688,1646,40,14457,139,1523,8119,8,2384,1706,2315,214,800,300,5554,854,1757,5398,735,6786,36,967,1527,19,807,400,918,801,1152,860,5806,5236,1505,11298,215,9297,454,972,3461,8702]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL125-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.14/0.61 % Computer : n011.cluster.edu
% 0.14/0.61 % Model : x86_64 x86_64
% 0.14/0.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.61 % Memory : 8046.5625MB
% 0.14/0.61 % OS : Linux 6.8.0-71-generic
% 0.14/0.61 % CPULimit : 300
% 0.14/0.61 % WCLimit : 300
% 0.14/0.61 % DateTime : Fri Sep 25 21:53:30 UTC 2026
% 0.14/0.61 % CPUTime :
% 0.14/0.61 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.77/1.10 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.06/1.28 % [INFO] Parsing done (177ms).
% 1.06/1.29 % [INFO] Running in sequential loop mode.
% 1.62/1.69 % [INFO] eprover registered as external prover.
% 1.78/1.70 % [INFO] Scanning for conjecture ...
% 1.78/1.79 % [INFO] Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ...
% 1.94/1.82 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 1.94/1.83 % [INFO] Problem is propositional (TPTP CNF).
% 1.94/1.83 % [INFO] Type checking passed.
% 1.94/1.84 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 181.65/50.58 % External prover 'e' found a proof!
% 181.65/50.58 % [INFO] Killing All external provers ...
% 181.65/50.58 % Time passed: 49884ms (effective reasoning time: 49279ms)
% 181.65/50.58 % Axioms used in derivation (3): q_2, q_3, condensed_detachment
% 181.65/50.58 % No. of inferences in proof: 593
% 181.65/50.58 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 49884 ms resp. 49279 ms w/o parsing
% 171.15/51.03 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 171.15/51.03 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------