%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL105-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 : n013.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:50 AM UTC 2026
% Result : Unsatisfiable 143.89s 39.79s
% Output : Refutation 145.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 46
% Number of leaves : 5
% Syntax : Number of formulae : 787 ( 241 unt; 0 typ; 0 def)
% Number of atoms : 2480 ( 842 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 17189 (1151 ~; 925 |; 0 &;15113 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 9 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 : 3094 ( 0 ^;3094 !; 0 ?;3094 :)
% 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] : ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_1) ).
thf(10,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ 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 ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_2) ).
thf(11,plain,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(5,axiom,
! [C: $i,B: $i,A: $i] : ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_3) ).
thf(12,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
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(8,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(9,plain,
! [B: $i,A: $i] :
( ( B @ is_a_theorem )
| ~ ( A @ is_a_theorem )
| ~ ( B @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(cnf,[status(esa)],[8]) ).
thf(30,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ 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)],[12,9]) ).
thf(31,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ 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)],[30]) ).
thf(32,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[31:[bind(A,$thf( M )),bind(B,$thf( L )),bind(C,$thf( K )),bind(D,$thf( K @ ( M @ ( L @ equivalent ) @ equivalent ) @ ( L @ ( M @ equivalent ) @ equivalent ) )),bind(E,$thf( K ))]]) ).
thf(45,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[32]) ).
thf(62,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( F @ ( E @ equivalent ) @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[11,45]) ).
thf(63,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( F @ ( E @ equivalent ) @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[62]) ).
thf(64,plain,
! [A: $i] : ( A @ ( A @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[63:[bind(A,$thf( A )),bind(B,$thf( H )),bind(C,$thf( H )),bind(D,$thf( H @ ( H @ equivalent ) )),bind(E,$thf( H )),bind(F,$thf( A ))]]) ).
thf(66,plain,
! [A: $i] : ( A @ ( A @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[64]) ).
thf(75,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( C @ is_a_theorem )
| ~ $true
| ~ ( C @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[66,9]) ).
thf(76,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( C @ is_a_theorem )
| ~ ( C @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[75]) ).
thf(77,plain,
! [B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[76:[bind(A,$thf( E )),bind(B,$thf( E @ ( E @ equivalent ) )),bind(C,$thf( C ))]]) ).
thf(80,plain,
! [B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[77]) ).
thf(126,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,80]) ).
thf(127,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[126]) ).
thf(128,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[127:[bind(A,$thf( Q @ ( Q @ equivalent ) )),bind(B,$thf( O )),bind(C,$thf( N )),bind(D,$thf( Q @ ( Q @ equivalent ) @ ( O @ ( N @ equivalent ) @ equivalent ) @ ( N @ ( O @ equivalent ) @ equivalent ) )),bind(E,$thf( Q ))]]) ).
thf(133,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[128]) ).
thf(142,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[133,80]) ).
thf(143,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[142]) ).
thf(144,plain,
! [B: $i,A: $i] : ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[143:[bind(A,$thf( I )),bind(B,$thf( I )),bind(C,$thf( K )),bind(D,$thf( K @ ( K @ equivalent ) @ ( I @ ( I @ equivalent ) @ equivalent ) )),bind(E,$thf( I ))]]) ).
thf(158,plain,
! [B: $i,A: $i] : ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[144]) ).
thf(42,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)],[9]) ).
thf(43,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)],[42]) ).
thf(181,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( C @ equivalent ) @ is_a_theorem ) )
| ~ ( C @ is_a_theorem )
| ~ ( C @ is_a_theorem )
| ( D @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[158,43]) ).
thf(182,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( C @ equivalent ) @ is_a_theorem ) )
| ~ ( C @ is_a_theorem )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[181]) ).
thf(183,plain,
! [B: $i,A: $i] :
( ~ ( A @ ( A @ equivalent ) @ is_a_theorem )
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[182:[bind(A,$thf( F )),bind(B,$thf( H )),bind(C,$thf( F @ ( F @ equivalent ) )),bind(D,$thf( H @ ( H @ equivalent ) ))]]) ).
thf(188,plain,
! [B: $i,A: $i] :
( ~ ( A @ ( A @ equivalent ) @ is_a_theorem )
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[183]) ).
thf(24,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ 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,9]) ).
thf(25,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ 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)],[24]) ).
thf(26,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[25:[bind(A,$thf( K )),bind(B,$thf( M )),bind(C,$thf( L )),bind(D,$thf( K )),bind(E,$thf( K @ ( M @ ( L @ equivalent ) @ equivalent ) @ ( L @ ( M @ equivalent ) @ equivalent ) ))]]) ).
thf(49,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[26]) ).
thf(1,negated_conjecture,
~ ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_2) ).
thf(6,plain,
~ ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(7,plain,
~ ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(972,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[49,7]) ).
thf(973,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[972]) ).
thf(1018,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[973]) ).
thf(1834,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ equivalent ) )
!= e )
| ( ( B @ ( C @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[1018]) ).
thf(2084,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( B @ equivalent ) @ equivalent ) )
!= e )
| ( B != e )
| ( C
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[1834]) ).
thf(2178,plain,
! [A: $i] :
( ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[2084]) ).
thf(2218,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[188,2178]) ).
thf(2219,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[2218]) ).
thf(2220,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[2219:[bind(A,$thf( A )),bind(B,$thf( E )),bind(C,$thf( E @ ( E @ equivalent ) ))]]) ).
thf(2295,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[2220]) ).
thf(36,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ 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)],[11,9]) ).
thf(37,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[36]) ).
thf(38,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[37:[bind(A,$thf( K )),bind(B,$thf( M )),bind(C,$thf( L )),bind(D,$thf( M @ ( K @ equivalent ) )),bind(E,$thf( M @ ( L @ equivalent ) @ ( K @ ( L @ equivalent ) @ equivalent ) ))]]) ).
thf(47,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[38]) ).
thf(323,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( C @ equivalent ) @ is_a_theorem ) )
| ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[158,47]) ).
thf(324,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( C @ equivalent ) @ is_a_theorem ) )
| ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[323]) ).
thf(325,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[324:[bind(A,$thf( G )),bind(B,$thf( I )),bind(C,$thf( G @ ( G @ equivalent ) )),bind(D,$thf( D )),bind(E,$thf( I @ ( I @ equivalent ) ))]]) ).
thf(333,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[325]) ).
thf(33,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ 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)],[12,9]) ).
thf(34,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ 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)],[33]) ).
thf(35,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( B @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[34:[bind(A,$thf( O )),bind(B,$thf( N )),bind(C,$thf( G )),bind(D,$thf( G @ ( G @ ( O @ ( N @ equivalent ) @ equivalent ) @ ( N @ ( O @ equivalent ) @ equivalent ) @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(46,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( B @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[35]) ).
thf(422,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ ( E @ ( G @ ( F @ equivalent ) @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[333,46]) ).
thf(423,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ ( E @ ( G @ ( F @ equivalent ) @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[422]) ).
thf(424,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[423:[bind(A,$thf( ZC @ ( ZC @ equivalent ) @ ( ZA @ ( Z @ equivalent ) @ equivalent ) @ ( Z @ ( ZA @ equivalent ) @ equivalent ) )),bind(B,$thf( ZC )),bind(C,$thf( ZE )),bind(D,$thf( ZE @ ( ZE @ equivalent ) @ ( ZC @ ( ZC @ equivalent ) @ ( ZA @ ( Z @ equivalent ) @ equivalent ) @ ( Z @ ( ZA @ equivalent ) @ equivalent ) @ equivalent ) )),bind(E,$thf( ZC @ ( ZC @ equivalent ) )),bind(F,$thf( Z )),bind(G,$thf( ZA ))]]) ).
thf(461,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[424]) ).
thf(1343,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( F @ equivalent ) @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[461,45]) ).
thf(1344,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( F @ equivalent ) @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[1343]) ).
thf(1345,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1344:[bind(A,$thf( ZI )),bind(B,$thf( ZH )),bind(C,$thf( ZG )),bind(D,$thf( ZI @ ( ZH @ equivalent ) @ ( ZG @ ( ZG @ equivalent ) @ ( ZH @ ( ZI @ equivalent ) @ equivalent ) @ equivalent ) )),bind(E,$thf( ZI @ ( ZH @ equivalent ) @ ( ZG @ ( ZG @ equivalent ) @ ( ZH @ ( ZI @ equivalent ) @ equivalent ) @ equivalent ) )),bind(F,$thf( ZG @ ( ZG @ equivalent ) @ ( ZH @ ( ZI @ equivalent ) @ equivalent ) )),bind(G,$thf( ZI @ ( ZH @ equivalent ) ))]]) ).
thf(1381,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1345]) ).
thf(1424,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1381,7]) ).
thf(1425,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1424]) ).
thf(1448,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[1425]) ).
thf(2655,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) )
!= e )
| ( ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[1448]) ).
thf(2656,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) )
!= e )
| ( ( A @ ( A @ equivalent ) )
!= e )
| ( ( B @ ( C @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[2655]) ).
thf(3002,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) )
!= e )
| ( ( A @ ( A @ equivalent ) )
!= e )
| ( B
!= ( c @ ( b @ equivalent ) ) )
| ( C
!= ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[2656]) ).
thf(3005,plain,
! [A: $i] :
( ( ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) )
!= e )
| ( ( A @ ( A @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3002]) ).
thf(3007,plain,
! [A: $i] :
( ( e != e )
| ( ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) )
!= ( A @ ( A @ equivalent ) ) )
| ( ( A @ ( A @ equivalent ) )
!= e ) ),
inference(eqfactor_ordered,[status(thm)],[3005]) ).
thf(3008,plain,
! [A: $i] :
( ( ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) )
!= ( A @ ( A @ equivalent ) ) )
| ( ( A @ ( A @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3007]) ).
thf(175,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true
| ~ ( D @ ( C @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[158,9]) ).
thf(176,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ ( D @ ( C @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[175]) ).
thf(177,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[176:[bind(A,$thf( H )),bind(B,$thf( J )),bind(C,$thf( J @ ( J @ equivalent ) @ ( H @ ( H @ equivalent ) @ equivalent ) )),bind(D,$thf( D ))]]) ).
thf(185,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[177]) ).
thf(6416,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( F @ ( F @ equivalent ) @ ( E @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[133,185]) ).
thf(6417,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( F @ ( F @ equivalent ) @ ( E @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[6416]) ).
thf(6418,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[6417:[bind(A,$thf( P @ ( P @ equivalent ) )),bind(B,$thf( R @ ( R @ equivalent ) )),bind(C,$thf( T )),bind(D,$thf( T @ ( T @ equivalent ) @ ( R @ ( R @ equivalent ) @ ( P @ ( P @ equivalent ) @ equivalent ) @ equivalent ) )),bind(E,$thf( R )),bind(F,$thf( P ))]]) ).
thf(6587,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[6418]) ).
thf(6677,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[6587,7]) ).
thf(6678,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[6677]) ).
thf(6712,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[6678]) ).
thf(145,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ 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)],[133,9]) ).
thf(146,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[145]) ).
thf(147,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( A @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[146:[bind(A,$thf( J )),bind(B,$thf( K )),bind(C,$thf( M )),bind(D,$thf( J @ ( K @ equivalent ) )),bind(E,$thf( M @ ( M @ equivalent ) @ ( K @ ( J @ equivalent ) @ equivalent ) ))]]) ).
thf(159,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( A @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[147]) ).
thf(4661,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ ( E @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[158,159]) ).
thf(4662,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ ( E @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4661]) ).
thf(4663,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[4662:[bind(A,$thf( G )),bind(B,$thf( I )),bind(C,$thf( I @ ( I @ equivalent ) )),bind(D,$thf( G @ ( G @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(4733,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[4663]) ).
thf(4833,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[4733,47]) ).
thf(4834,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4833]) ).
thf(4835,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[4834:[bind(A,$thf( N )),bind(B,$thf( L )),bind(C,$thf( J )),bind(D,$thf( L @ ( L @ equivalent ) @ ( J @ ( J @ equivalent ) @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( N @ ( N @ equivalent ) ))]]) ).
thf(4852,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[4835]) ).
thf(219,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ( E @ ( E @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[11,188]) ).
thf(220,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ ( E @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[219]) ).
thf(234,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) )
!= ( D @ ( D @ equivalent ) ) )
| ( E @ ( E @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[220]) ).
thf(393,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ ( C @ ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( B @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[66,46]) ).
thf(394,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ ( C @ ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[393]) ).
thf(395,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[394:[bind(A,$thf( Q @ ( Q @ ( Y @ ( X @ equivalent ) @ equivalent ) @ ( X @ ( Y @ equivalent ) @ equivalent ) @ equivalent ) )),bind(B,$thf( Q @ ( Q @ ( Y @ ( X @ equivalent ) @ equivalent ) @ ( X @ ( Y @ equivalent ) @ equivalent ) @ equivalent ) )),bind(C,$thf( Q )),bind(D,$thf( X )),bind(E,$thf( Y ))]]) ).
thf(418,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[395]) ).
thf(2254,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[418,2178]) ).
thf(2255,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[2254]) ).
thf(2256,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[2255:[bind(A,$thf( F )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( F @ ( F @ ( N @ ( M @ equivalent ) @ equivalent ) @ ( M @ ( N @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(2280,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[2256]) ).
thf(294,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[133,47]) ).
thf(295,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[294]) ).
thf(296,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[295:[bind(A,$thf( K )),bind(B,$thf( L )),bind(C,$thf( N )),bind(D,$thf( K @ ( L @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( N @ ( N @ equivalent ) @ ( L @ ( K @ equivalent ) @ equivalent ) ))]]) ).
thf(334,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[296]) ).
thf(27,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ 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,9]) ).
thf(28,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ 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)],[27]) ).
thf(29,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[28:[bind(A,$thf( M )),bind(B,$thf( O )),bind(C,$thf( N )),bind(D,$thf( M @ ( O @ ( N @ equivalent ) @ equivalent ) @ ( N @ ( O @ equivalent ) @ equivalent ) @ ( M @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(50,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[29]) ).
thf(1264,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( H @ ( G @ equivalent ) @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[334,50]) ).
thf(1265,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( H @ ( G @ equivalent ) @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[1264]) ).
thf(1266,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1265:[bind(A,$thf( V )),bind(B,$thf( V @ ( Y @ ( Z @ equivalent ) @ equivalent ) )),bind(C,$thf( Z @ ( Y @ equivalent ) )),bind(D,$thf( ZB )),bind(E,$thf( ZB @ ( ZB @ equivalent ) @ ( Z @ ( Y @ equivalent ) @ ( V @ ( Y @ ( Z @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( V @ equivalent ) )),bind(F,$thf( V )),bind(G,$thf( Z )),bind(H,$thf( Y ))]]) ).
thf(1315,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1266]) ).
thf(997,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[158,49]) ).
thf(998,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[997]) ).
thf(999,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[998:[bind(A,$thf( I )),bind(B,$thf( K )),bind(C,$thf( K @ ( K @ equivalent ) @ ( I @ ( I @ equivalent ) @ equivalent ) )),bind(D,$thf( D )),bind(E,$thf( E ))]]) ).
thf(1034,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[999]) ).
thf(1795,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1034,80]) ).
thf(1796,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[1795]) ).
thf(1797,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1796:[bind(A,$thf( J )),bind(B,$thf( J )),bind(C,$thf( N )),bind(D,$thf( P )),bind(E,$thf( P @ ( P @ equivalent ) @ ( N @ ( N @ equivalent ) @ equivalent ) @ ( J @ ( J @ equivalent ) @ equivalent ) )),bind(F,$thf( J ))]]) ).
thf(1820,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1797]) ).
thf(1963,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1820,7]) ).
thf(1964,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1963]) ).
thf(1991,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[1964]) ).
thf(3102,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) )
!= e )
| ( ( A @ ( A @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[1991]) ).
thf(9999,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) )
!= e )
| ( A != e )
| ( A
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[3102]) ).
thf(10000,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= e )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[9999]) ).
thf(10777,plain,
! [B: $i,A: $i] :
( ( e != e )
| ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(eqfactor_ordered,[status(thm)],[10000]) ).
thf(10779,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= ( c @ ( b @ equivalent ) ) )
| ( ( A @ ( A @ equivalent ) )
!= ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[10777]) ).
thf(10780,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= ( c @ ( b @ equivalent ) ) )
| ( A
!= ( c @ ( a @ equivalent ) ) )
| ( A
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[10779]) ).
thf(10812,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= ( c @ ( b @ equivalent ) ) )
| ( ( c @ ( a @ equivalent ) )
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[10780]) ).
thf(690,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( E @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[334,47]) ).
thf(691,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( E @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[690]) ).
thf(692,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( E @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[691:[bind(A,$thf( L )),bind(B,$thf( P )),bind(C,$thf( Q )),bind(D,$thf( S )),bind(E,$thf( P @ ( Q @ equivalent ) @ ( L @ equivalent ) )),bind(F,$thf( F )),bind(G,$thf( S @ ( S @ equivalent ) @ ( Q @ ( P @ equivalent ) @ equivalent ) @ ( L @ equivalent ) ))]]) ).
thf(706,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( E @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[692]) ).
thf(39,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ 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)],[11,9]) ).
thf(40,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ ( E @ ( D @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[39]) ).
thf(41,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( D @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[40:[bind(A,$thf( M )),bind(B,$thf( O )),bind(C,$thf( N )),bind(D,$thf( O @ ( N @ equivalent ) @ ( M @ ( N @ equivalent ) @ equivalent ) @ ( O @ ( M @ equivalent ) @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(48,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( D @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[41]) ).
thf(11624,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( E @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ ( I @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[706,48]) ).
thf(11625,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( E @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ ( I @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[11624]) ).
thf(11626,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[11625:[bind(A,$thf( X @ ( U @ equivalent ) )),bind(B,$thf( U @ ( Y @ equivalent ) )),bind(C,$thf( X )),bind(D,$thf( Y )),bind(E,$thf( ZA )),bind(F,$thf( ZA @ ( ZA @ equivalent ) @ ( Y @ ( X @ equivalent ) @ equivalent ) @ ( U @ ( Y @ equivalent ) @ equivalent ) @ ( X @ ( U @ equivalent ) @ equivalent ) )),bind(G,$thf( U )),bind(H,$thf( Y )),bind(I,$thf( X ))]]) ).
thf(11688,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[11626]) ).
thf(95,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( C @ ( B @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ~ $true
| ( C @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[66,43]) ).
thf(96,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( C @ ( B @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( C @ is_a_theorem ) ),
inference(simp,[status(thm)],[95]) ).
thf(97,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( B @ ( B @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[96:[bind(A,$thf( E )),bind(B,$thf( E @ ( E @ equivalent ) )),bind(C,$thf( C ))]]) ).
thf(114,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( B @ ( B @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[97]) ).
thf(2659,plain,
! [B: $i,A: $i] :
( ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( A @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(bool_ext,[status(thm)],[114]) ).
thf(3048,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( D @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( C @ is_a_theorem )
| ~ $true
| ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[2659,80]) ).
thf(3049,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( D @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( C @ is_a_theorem )
| ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[3048]) ).
thf(3050,plain,
! [B: $i,A: $i] :
( ( A @ is_a_theorem )
| ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[3049:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A )),bind(D,$thf( B ))]]) ).
thf(3096,plain,
! [B: $i,A: $i] :
( ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[3050]) ).
thf(3112,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[3096,2178]) ).
thf(3113,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3112]) ).
thf(3114,plain,
! [B: $i,A: $i] :
( ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[3113:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A ))]]) ).
thf(3745,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true
| ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(paramod_ordered,[status(thm)],[3114,2178]) ).
thf(3746,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3745]) ).
thf(3747,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(pattern_uni,[status(thm)],[3746:[bind(A,$thf( A )),bind(B,$thf( E )),bind(C,$thf( E @ ( E @ equivalent ) ))]]) ).
thf(3813,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3747]) ).
thf(320,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( D @ is_a_theorem )
| ~ ( D @ is_a_theorem )
| ( E @ is_a_theorem )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[47,43]) ).
thf(321,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ ( D @ is_a_theorem )
| ( E @ is_a_theorem )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[320]) ).
thf(322,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( A @ ( B @ equivalent ) @ is_a_theorem )
| ( C @ ( B @ equivalent ) @ is_a_theorem )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[321:[bind(A,$thf( G )),bind(B,$thf( H )),bind(C,$thf( I )),bind(D,$thf( G @ ( H @ equivalent ) )),bind(E,$thf( I @ ( H @ equivalent ) ))]]) ).
thf(331,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( A @ ( B @ equivalent ) @ is_a_theorem )
| ( C @ ( B @ equivalent ) @ is_a_theorem )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[322]) ).
thf(15768,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( A @ ( B @ equivalent ) @ is_a_theorem )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[331,7]) ).
thf(15769,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( A @ ( B @ equivalent ) @ is_a_theorem )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[15768]) ).
thf(15770,plain,
! [A: $i] :
( ~ ( A @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( e @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[15769:[bind(A,$thf( A )),bind(B,$thf( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(C,$thf( e ))]]) ).
thf(314,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[11,47]) ).
thf(315,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[314]) ).
thf(316,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[315:[bind(A,$thf( L )),bind(B,$thf( N )),bind(C,$thf( M )),bind(D,$thf( N @ ( L @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( N @ ( M @ equivalent ) @ ( L @ ( M @ equivalent ) @ equivalent ) ))]]) ).
thf(342,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[316]) ).
thf(6516,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[342,185]) ).
thf(6517,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[6516]) ).
thf(6518,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[6517:[bind(A,$thf( M @ ( M @ equivalent ) )),bind(B,$thf( S )),bind(C,$thf( R )),bind(D,$thf( S )),bind(E,$thf( S @ ( R @ equivalent ) @ ( S @ ( R @ equivalent ) @ equivalent ) @ ( M @ ( M @ equivalent ) @ equivalent ) )),bind(F,$thf( M )),bind(G,$thf( S ))]]) ).
thf(6626,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[6518]) ).
thf(6749,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[6626,2178]) ).
thf(6750,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[6749]) ).
thf(6751,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[6750:[bind(A,$thf( H )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( N @ ( M @ equivalent ) @ ( N @ ( M @ equivalent ) @ equivalent ) @ ( H @ ( H @ equivalent ) @ equivalent ) ))]]) ).
thf(6830,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[6751]) ).
thf(10784,plain,
! [B: $i,A: $i] :
( ( ( c @ ( b @ equivalent ) )
!= ( A @ ( A @ equivalent ) ) )
| ( ( B @ ( B @ equivalent ) )
!= ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) ) )
| ( ( A @ ( A @ equivalent ) )
!= ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(eqfactor_ordered,[status(thm)],[10779]) ).
thf(10791,plain,
! [B: $i,A: $i] :
( ( c != A )
| ( b != A )
| ( B
!= ( c @ ( a @ equivalent ) ) )
| ( B
!= ( b @ ( a @ equivalent ) ) )
| ( A
!= ( c @ ( a @ equivalent ) ) )
| ( A
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[10784]) ).
thf(10805,plain,
( ( ( b @ ( a @ equivalent ) )
!= c )
| ( ( b @ ( a @ equivalent ) )
!= b )
| ( ( c @ ( a @ equivalent ) )
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[10791]) ).
thf(44,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) )
!= A )
| ~ ( A @ is_a_theorem )
| ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[42]) ).
thf(259,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( D @ ( C @ equivalent ) )
!= C )
| ~ $true
| ( D @ is_a_theorem )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[188,44]) ).
thf(260,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( D @ ( C @ equivalent ) )
!= C )
| ( D @ is_a_theorem )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[259]) ).
thf(261,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ ( C @ equivalent ) @ equivalent ) )
!= ( C @ ( C @ equivalent ) ) )
| ( B @ is_a_theorem )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[260:[bind(A,$thf( A )),bind(B,$thf( F )),bind(C,$thf( F @ ( F @ equivalent ) )),bind(D,$thf( D ))]]) ).
thf(269,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ ( C @ equivalent ) @ equivalent ) )
!= ( C @ ( C @ equivalent ) ) )
| ( B @ is_a_theorem )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[261]) ).
thf(19,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[12,7]) ).
thf(20,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[19]) ).
thf(21,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[20]) ).
thf(54,plain,
! [C: $i,B: $i,A: $i] :
( ( C != e )
| ( ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[21]) ).
thf(55,plain,
! [B: $i,A: $i] :
( ( e @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[54]) ).
thf(56,plain,
! [B: $i,A: $i] :
( ( ( e @ ( A @ ( B @ equivalent ) @ equivalent ) )
!= e )
| ( ( B @ ( A @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[55]) ).
thf(282,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[12,47]) ).
thf(283,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[282]) ).
thf(284,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[283:[bind(A,$thf( N )),bind(B,$thf( M )),bind(C,$thf( L )),bind(D,$thf( L @ ( N @ ( M @ equivalent ) @ equivalent ) @ ( M @ ( N @ equivalent ) @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( L ))]]) ).
thf(341,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( A @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[284]) ).
thf(745,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( E @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[341,47]) ).
thf(746,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( E @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[745]) ).
thf(747,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( A @ equivalent ) @ ( E @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[746:[bind(A,$thf( R )),bind(B,$thf( S )),bind(C,$thf( P )),bind(D,$thf( Q )),bind(E,$thf( S @ ( Q @ ( P @ equivalent ) @ equivalent ) @ ( P @ ( Q @ equivalent ) @ equivalent ) @ ( R @ equivalent ) )),bind(F,$thf( F )),bind(G,$thf( S @ ( R @ equivalent ) ))]]) ).
thf(759,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( A @ equivalent ) @ ( E @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[747]) ).
thf(12782,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( A @ equivalent ) @ ( E @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ ( I @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[759,48]) ).
thf(12783,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( A @ equivalent ) @ ( E @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ ( I @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[12782]) ).
thf(12784,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[12783:[bind(A,$thf( ZC @ ( ZF @ ( ZG @ equivalent ) @ equivalent ) @ ( ZE @ equivalent ) )),bind(B,$thf( ZG )),bind(C,$thf( ZF )),bind(D,$thf( ZE @ ( ZG @ ( ZF @ equivalent ) @ equivalent ) )),bind(E,$thf( ZC )),bind(F,$thf( ZC @ ( ZE @ ( ZG @ ( ZF @ equivalent ) @ equivalent ) @ equivalent ) @ ( ZC @ ( ZF @ ( ZG @ equivalent ) @ equivalent ) @ ( ZE @ equivalent ) @ equivalent ) )),bind(G,$thf( ZE )),bind(H,$thf( ZG @ ( ZF @ equivalent ) )),bind(I,$thf( ZC @ ( ZF @ ( ZG @ equivalent ) @ equivalent ) ))]]) ).
thf(12850,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[12784]) ).
thf(13450,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ ( H @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[12850,48]) ).
thf(13451,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ ( H @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[13450]) ).
thf(13452,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[13451:[bind(A,$thf( V @ ( U @ equivalent ) )),bind(B,$thf( V @ ( S @ equivalent ) )),bind(C,$thf( S )),bind(D,$thf( U )),bind(E,$thf( V @ ( U @ equivalent ) @ ( V @ ( S @ equivalent ) @ ( U @ ( S @ equivalent ) @ equivalent ) @ equivalent ) )),bind(F,$thf( S )),bind(G,$thf( U )),bind(H,$thf( V ))]]) ).
thf(13502,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[13452]) ).
thf(13572,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[13502,7]) ).
thf(13573,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[13572]) ).
thf(13623,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[13573]) ).
thf(4804,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[4733,7]) ).
thf(4805,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4804]) ).
thf(4839,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[4805]) ).
thf(13569,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[13502,159]) ).
thf(13570,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[13569]) ).
thf(13571,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[13570:[bind(A,$thf( K )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( N @ ( M @ equivalent ) )),bind(E,$thf( N @ ( K @ equivalent ) @ ( M @ ( K @ equivalent ) @ equivalent ) )),bind(F,$thf( F ))]]) ).
thf(13640,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[13571]) ).
thf(3200,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ is_a_theorem )
!= ( C @ ( D @ ( F @ ( E @ equivalent ) @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( C @ is_a_theorem )
| ~ $true
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[3096,50]) ).
thf(3201,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ is_a_theorem )
!= ( C @ ( D @ ( F @ ( E @ equivalent ) @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( C @ is_a_theorem )
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3200]) ).
thf(3202,plain,
! [B: $i,A: $i] :
( ( B @ is_a_theorem )
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[3201:[bind(A,$thf( H @ ( P @ ( R @ ( Q @ equivalent ) @ equivalent ) @ ( Q @ ( R @ equivalent ) @ equivalent ) @ ( P @ equivalent ) @ equivalent ) )),bind(B,$thf( B )),bind(C,$thf( H )),bind(D,$thf( P )),bind(E,$thf( Q )),bind(F,$thf( R ))]]) ).
thf(3245,plain,
! [B: $i,A: $i] :
( ( B @ is_a_theorem )
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3202]) ).
thf(17173,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ is_a_theorem )
!= ( C @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( e @ ( C @ equivalent ) @ is_a_theorem )
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[3245,15770]) ).
thf(17174,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ is_a_theorem )
!= ( C @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( e @ ( C @ equivalent ) @ is_a_theorem )
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[17173]) ).
thf(17175,plain,
! [B: $i,A: $i] :
( ~ ( e @ ( B @ equivalent ) @ is_a_theorem )
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[17174:[bind(A,$thf( A )),bind(B,$thf( E @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(C,$thf( E ))]]) ).
thf(17375,plain,
! [B: $i,A: $i] :
( ~ ( e @ ( B @ equivalent ) @ is_a_theorem )
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[17175]) ).
thf(3017,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ( ( D @ ( D @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true
| ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[2659,2295]) ).
thf(3018,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ( ( D @ ( D @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[3017]) ).
thf(3019,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[3018:[bind(A,$thf( H @ ( H @ equivalent ) )),bind(B,$thf( H )),bind(C,$thf( H @ ( H @ equivalent ) )),bind(D,$thf( D ))]]) ).
thf(3088,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3019]) ).
thf(681,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ ( H @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[334,48]) ).
thf(682,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ ( H @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[681]) ).
thf(683,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[682:[bind(A,$thf( X @ ( Z @ equivalent ) )),bind(B,$thf( X @ ( Y @ equivalent ) )),bind(C,$thf( Z @ ( Y @ equivalent ) )),bind(D,$thf( ZB )),bind(E,$thf( ZB @ ( ZB @ equivalent ) @ ( Z @ ( Y @ equivalent ) @ ( X @ ( Y @ equivalent ) @ equivalent ) @ equivalent ) @ ( X @ ( Z @ equivalent ) @ equivalent ) )),bind(F,$thf( Z )),bind(G,$thf( Y )),bind(H,$thf( X ))]]) ).
thf(702,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[683]) ).
thf(1576,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[702,80]) ).
thf(1577,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[1576]) ).
thf(1578,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1577:[bind(A,$thf( N )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( P )),bind(E,$thf( P @ ( P @ equivalent ) @ ( N @ ( M @ equivalent ) @ ( N @ ( M @ equivalent ) @ equivalent ) @ equivalent ) )),bind(F,$thf( N ))]]) ).
thf(1603,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1578]) ).
thf(4582,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1603,159]) ).
thf(4583,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4582]) ).
thf(4584,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[4583:[bind(A,$thf( K )),bind(B,$thf( L )),bind(C,$thf( N )),bind(D,$thf( N @ ( N @ equivalent ) )),bind(E,$thf( L @ ( K @ equivalent ) @ ( L @ ( K @ equivalent ) @ equivalent ) )),bind(F,$thf( F ))]]) ).
thf(4760,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[4584]) ).
thf(3776,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(paramod_ordered,[status(thm)],[3114,7]) ).
thf(3777,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3776]) ).
thf(3809,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3777]) ).
thf(312,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[47,7]) ).
thf(313,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[312]) ).
thf(330,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[313]) ).
thf(565,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) )
!= e )
| ( ( A @ ( B @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[330]) ).
thf(801,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( E @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[342,47]) ).
thf(802,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( E @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[801]) ).
thf(803,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( E @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[802:[bind(A,$thf( L )),bind(B,$thf( Q )),bind(C,$thf( R )),bind(D,$thf( S )),bind(E,$thf( S @ ( Q @ equivalent ) @ ( L @ equivalent ) )),bind(F,$thf( F )),bind(G,$thf( S @ ( R @ equivalent ) @ ( Q @ ( R @ equivalent ) @ equivalent ) @ ( L @ equivalent ) ))]]) ).
thf(812,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( E @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[803]) ).
thf(14443,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( E @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( G @ ( I @ ( H @ equivalent ) @ equivalent ) @ ( H @ ( I @ equivalent ) @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[812,50]) ).
thf(14444,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( E @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( G @ ( I @ ( H @ equivalent ) @ equivalent ) @ ( H @ ( I @ equivalent ) @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[14443]) ).
thf(14445,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[14444:[bind(A,$thf( ZA )),bind(B,$thf( X @ ( Y @ equivalent ) )),bind(C,$thf( Y @ ( X @ equivalent ) )),bind(D,$thf( Z )),bind(E,$thf( ZA )),bind(F,$thf( ZA @ ( Z @ equivalent ) @ ( Y @ ( X @ equivalent ) @ ( Z @ equivalent ) @ equivalent ) @ ( X @ ( Y @ equivalent ) @ equivalent ) @ ( ZA @ equivalent ) )),bind(G,$thf( ZA )),bind(H,$thf( X )),bind(I,$thf( Y ))]]) ).
thf(14510,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[14445]) ).
thf(167,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[158,7]) ).
thf(168,plain,
! [B: $i,A: $i] :
( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[167]) ).
thf(184,plain,
! [B: $i,A: $i] :
( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[168]) ).
thf(1261,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ ( G @ ( F @ equivalent ) @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[133,50]) ).
thf(1262,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ ( G @ ( F @ equivalent ) @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[1261]) ).
thf(1263,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( A @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1262:[bind(A,$thf( S @ ( ZA @ ( Z @ equivalent ) @ equivalent ) @ ( Z @ ( ZA @ equivalent ) @ equivalent ) )),bind(B,$thf( S )),bind(C,$thf( ZC )),bind(D,$thf( ZC @ ( ZC @ equivalent ) @ ( S @ ( S @ ( ZA @ ( Z @ equivalent ) @ equivalent ) @ ( Z @ ( ZA @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(E,$thf( S )),bind(F,$thf( Z )),bind(G,$thf( ZA ))]]) ).
thf(1313,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( A @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1263]) ).
thf(200,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[188,7]) ).
thf(201,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[200]) ).
thf(233,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[201]) ).
thf(3130,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ( ( D @ ( D @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ $true
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[3096,233]) ).
thf(3131,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ( ( D @ ( D @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3130]) ).
thf(3132,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[3131:[bind(A,$thf( F @ ( F @ equivalent ) )),bind(B,$thf( B )),bind(C,$thf( F )),bind(D,$thf( D ))]]) ).
thf(3280,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3132]) ).
thf(3022,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ( ( D @ ( D @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ $true
| ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[2659,233]) ).
thf(3023,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ( ( D @ ( D @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[3022]) ).
thf(3024,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[3023:[bind(A,$thf( H @ ( H @ equivalent ) )),bind(B,$thf( H )),bind(C,$thf( H @ ( H @ equivalent ) )),bind(D,$thf( D ))]]) ).
thf(3089,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3024]) ).
thf(4602,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1820,159]) ).
thf(4603,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4602]) ).
thf(4604,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[4603:[bind(A,$thf( H )),bind(B,$thf( L )),bind(C,$thf( N )),bind(D,$thf( N @ ( N @ equivalent ) @ ( L @ ( L @ equivalent ) @ equivalent ) )),bind(E,$thf( H @ ( H @ equivalent ) )),bind(F,$thf( F ))]]) ).
thf(4766,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[4604]) ).
thf(16771,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( e @ ( D @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[133,15770]) ).
thf(16772,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( e @ ( D @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[16771]) ).
thf(16773,plain,
! [A: $i] :
~ ( e @ ( A @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[16772:[bind(A,$thf( e )),bind(B,$thf( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )),bind(C,$thf( ZD )),bind(D,$thf( ZD @ ( ZD @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) ))]]) ).
thf(17386,plain,
! [A: $i] :
~ ( e @ ( A @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[16773]) ).
thf(453,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[333,47]) ).
thf(454,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[453]) ).
thf(455,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[454:[bind(A,$thf( K )),bind(B,$thf( J )),bind(C,$thf( N )),bind(D,$thf( J @ ( J @ equivalent ) @ ( K @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( N @ ( N @ equivalent ) @ ( K @ equivalent ) ))]]) ).
thf(460,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[455]) ).
thf(140,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[133,7]) ).
thf(141,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[140]) ).
thf(157,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[141]) ).
thf(2236,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1820,2178]) ).
thf(2237,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[2236]) ).
thf(2238,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[2237:[bind(A,$thf( H )),bind(B,$thf( L )),bind(C,$thf( N )),bind(D,$thf( N @ ( N @ equivalent ) @ ( L @ ( L @ equivalent ) @ equivalent ) @ ( H @ ( H @ equivalent ) @ equivalent ) ))]]) ).
thf(2301,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[2238]) ).
thf(68,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( B @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[66,45]) ).
thf(69,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[68]) ).
thf(78,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) ) )
| ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[69]) ).
thf(926,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( D @ ( F @ ( E @ equivalent ) @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[333,49]) ).
thf(927,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( D @ ( F @ ( E @ equivalent ) @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[926]) ).
thf(928,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( E @ equivalent ) @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[927:[bind(A,$thf( M )),bind(B,$thf( L )),bind(C,$thf( P )),bind(D,$thf( P @ ( P @ equivalent ) @ ( M @ equivalent ) @ ( L @ ( L @ equivalent ) @ ( M @ equivalent ) @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( F ))]]) ).
thf(1030,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( E @ equivalent ) @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[928]) ).
thf(16441,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( E @ equivalent ) @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( G @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1030,80]) ).
thf(16442,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( E @ equivalent ) @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( D @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( G @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[16441]) ).
thf(16443,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[16442:[bind(A,$thf( K )),bind(B,$thf( K )),bind(C,$thf( Q )),bind(D,$thf( R )),bind(E,$thf( U )),bind(F,$thf( U @ ( U @ equivalent ) @ ( R @ equivalent ) @ ( Q @ ( Q @ equivalent ) @ ( R @ equivalent ) @ equivalent ) @ ( K @ ( K @ equivalent ) @ equivalent ) )),bind(G,$thf( K ))]]) ).
thf(16534,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[16443]) ).
thf(3379,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[3245,2178]) ).
thf(3380,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3379]) ).
thf(3381,plain,
! [B: $i,A: $i] :
( ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[3380:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( B ))]]) ).
thf(4993,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(paramod_ordered,[status(thm)],[3381,7]) ).
thf(4994,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[4993]) ).
thf(5027,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[4994]) ).
thf(824,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) )
!= e )
| ( A != e )
| ( B
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[565]) ).
thf(876,plain,
! [A: $i] :
( ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ~ ( A @ ( e @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[824]) ).
thf(2532,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( E @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( E @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1315,876]) ).
thf(2533,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( E @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( E @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[2532]) ).
thf(2534,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( e @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[2533:[bind(A,$thf( e )),bind(B,$thf( N )),bind(C,$thf( O )),bind(D,$thf( Q )),bind(E,$thf( Q @ ( Q @ equivalent ) @ ( O @ ( N @ equivalent ) @ ( e @ ( N @ ( O @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(2555,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( e @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[2534]) ).
thf(2257,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[158,2178]) ).
thf(2258,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[2257]) ).
thf(2259,plain,
! [B: $i,A: $i] :
( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[2258:[bind(A,$thf( G )),bind(B,$thf( I )),bind(C,$thf( I @ ( I @ equivalent ) @ ( G @ ( G @ equivalent ) @ equivalent ) ))]]) ).
thf(2281,plain,
! [B: $i,A: $i] :
( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[2259]) ).
thf(121,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[12,80]) ).
thf(122,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[121]) ).
thf(132,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( D @ ( E @ ( E @ equivalent ) @ equivalent ) ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[122]) ).
thf(191,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= e )
| ( ( A @ ( A @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[184]) ).
thf(192,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= e )
| ( A != e )
| ( A
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[191]) ).
thf(193,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= e )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[192]) ).
thf(242,plain,
! [A: $i] :
( ( e != e )
| ( ( A @ ( A @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(eqfactor_ordered,[status(thm)],[193]) ).
thf(243,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[242]) ).
thf(291,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,47]) ).
thf(292,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[291]) ).
thf(293,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[292:[bind(A,$thf( L )),bind(B,$thf( N )),bind(C,$thf( M )),bind(D,$thf( L )),bind(E,$thf( E )),bind(F,$thf( L @ ( N @ ( M @ equivalent ) @ equivalent ) @ ( M @ ( N @ equivalent ) @ equivalent ) ))]]) ).
thf(332,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[293]) ).
thf(543,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( E @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[332,47]) ).
thf(544,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( G @ ( E @ equivalent ) @ is_a_theorem ) )
| ( G @ ( F @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[543]) ).
thf(545,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[544:[bind(A,$thf( J )),bind(B,$thf( Q )),bind(C,$thf( R )),bind(D,$thf( S )),bind(E,$thf( Q @ ( J @ equivalent ) )),bind(F,$thf( F )),bind(G,$thf( Q @ ( S @ ( R @ equivalent ) @ equivalent ) @ ( R @ ( S @ equivalent ) @ equivalent ) @ ( J @ equivalent ) ))]]) ).
thf(552,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[545]) ).
thf(6484,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( H @ ( H @ equivalent ) @ ( G @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[552,185]) ).
thf(6485,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( H @ ( H @ equivalent ) @ ( G @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[6484]) ).
thf(6486,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[6485:[bind(A,$thf( N @ ( N @ equivalent ) )),bind(B,$thf( V )),bind(C,$thf( V )),bind(D,$thf( W )),bind(E,$thf( X )),bind(F,$thf( V @ ( X @ ( W @ equivalent ) @ equivalent ) @ ( W @ ( X @ equivalent ) @ equivalent ) @ ( V @ equivalent ) @ ( N @ ( N @ equivalent ) @ equivalent ) )),bind(G,$thf( N )),bind(H,$thf( V ))]]) ).
thf(6616,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[6486]) ).
thf(4801,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[4733,159]) ).
thf(4802,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4801]) ).
thf(4803,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[4802:[bind(A,$thf( N )),bind(B,$thf( L )),bind(C,$thf( J )),bind(D,$thf( N @ ( N @ equivalent ) )),bind(E,$thf( L @ ( L @ equivalent ) @ ( J @ ( J @ equivalent ) @ equivalent ) )),bind(F,$thf( F ))]]) ).
thf(4842,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[4803]) ).
thf(148,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ 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)],[133,9]) ).
thf(149,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ ( E @ ( D @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[148]) ).
thf(150,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[149:[bind(A,$thf( L )),bind(B,$thf( M )),bind(C,$thf( O )),bind(D,$thf( O @ ( O @ equivalent ) @ ( M @ ( L @ equivalent ) @ equivalent ) @ ( L @ ( M @ equivalent ) @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(160,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[150]) ).
thf(5150,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( H @ equivalent ) @ ( G @ ( F @ equivalent ) @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[342,160]) ).
thf(5151,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( H @ equivalent ) @ ( G @ ( F @ equivalent ) @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[5150]) ).
thf(5152,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[5151:[bind(A,$thf( W @ ( X @ equivalent ) )),bind(B,$thf( X @ ( W @ equivalent ) )),bind(C,$thf( Y )),bind(D,$thf( ZB @ ( ZB @ equivalent ) )),bind(E,$thf( ZB @ ( ZB @ equivalent ) @ ( Y @ equivalent ) @ ( X @ ( W @ equivalent ) @ ( Y @ equivalent ) @ equivalent ) @ ( W @ ( X @ equivalent ) @ equivalent ) )),bind(F,$thf( W )),bind(G,$thf( X )),bind(H,$thf( ZB ))]]) ).
thf(5210,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[5152]) ).
thf(10787,plain,
! [B: $i,A: $i] :
( ( ( c @ ( b @ equivalent ) )
!= ( A @ ( A @ equivalent ) ) )
| ( B
!= ( c @ ( a @ equivalent ) ) )
| ( B
!= ( b @ ( a @ equivalent ) ) )
| ( A
!= ( c @ ( a @ equivalent ) ) )
| ( A
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[10784]) ).
thf(10801,plain,
( ( ( b @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) )
!= ( c @ ( b @ equivalent ) ) )
| ( ( c @ ( a @ equivalent ) )
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[10787]) ).
thf(1648,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1603,7]) ).
thf(1649,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1648]) ).
thf(1672,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[1649]) ).
thf(3001,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) )
!= e )
| ( ( B @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[1672]) ).
thf(9533,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) )
!= e )
| ( ( B @ ( A @ equivalent ) )
!= e )
| ( ( B @ ( A @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[3001]) ).
thf(15178,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem )
!= ( E @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( E @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[14510,876]) ).
thf(15179,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( D @ equivalent ) @ is_a_theorem )
!= ( E @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( E @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[15178]) ).
thf(15180,plain,
! [C: $i,B: $i,A: $i] :
( ( e @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[15179:[bind(A,$thf( N )),bind(B,$thf( O )),bind(C,$thf( P )),bind(D,$thf( e )),bind(E,$thf( e @ ( P @ equivalent ) @ ( O @ ( N @ equivalent ) @ ( P @ equivalent ) @ equivalent ) @ ( N @ ( O @ equivalent ) @ equivalent ) ))]]) ).
thf(15221,plain,
! [C: $i,B: $i,A: $i] :
( ( e @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[15180]) ).
thf(262,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) )
!= D )
| ~ $true
| ( E @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[11,44]) ).
thf(263,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) )
!= D )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[262]) ).
thf(264,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( D @ ( B @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( D @ ( B @ equivalent ) @ equivalent ) ) )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[263:[bind(A,$thf( M )),bind(B,$thf( O )),bind(C,$thf( N )),bind(D,$thf( O @ ( N @ equivalent ) @ ( M @ ( N @ equivalent ) @ equivalent ) @ ( O @ ( M @ equivalent ) @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(270,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( D @ ( B @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( D @ ( B @ equivalent ) @ equivalent ) ) )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[264]) ).
thf(889,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,876]) ).
thf(890,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[889]) ).
thf(891,plain,
! [B: $i,A: $i] :
( ( e @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[890:[bind(A,$thf( e )),bind(B,$thf( L )),bind(C,$thf( K )),bind(D,$thf( e @ ( L @ ( K @ equivalent ) @ equivalent ) @ ( K @ ( L @ equivalent ) @ equivalent ) ))]]) ).
thf(925,plain,
! [B: $i,A: $i] :
( ( e @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[891]) ).
thf(84,plain,
! [B: $i,A: $i] :
( ( ( e @ ( A @ ( B @ equivalent ) @ equivalent ) )
!= e )
| ( B
!= ( c @ ( b @ equivalent ) ) )
| ( A
!= ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[56]) ).
thf(85,plain,
( ( e @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[84]) ).
thf(766,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ ( H @ ( G @ equivalent ) @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[342,46]) ).
thf(767,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ ( H @ ( G @ equivalent ) @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[766]) ).
thf(768,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( E @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[767:[bind(A,$thf( ZJ @ ( ZH @ equivalent ) @ ( ZB @ ( ZA @ equivalent ) @ equivalent ) @ ( ZA @ ( ZB @ equivalent ) @ equivalent ) )),bind(B,$thf( ZH )),bind(C,$thf( ZI )),bind(D,$thf( ZJ )),bind(E,$thf( ZJ @ ( ZI @ equivalent ) @ ( ZH @ ( ZI @ equivalent ) @ equivalent ) @ ( ZJ @ ( ZH @ equivalent ) @ ( ZB @ ( ZA @ equivalent ) @ equivalent ) @ ( ZA @ ( ZB @ equivalent ) @ equivalent ) @ equivalent ) )),bind(F,$thf( ZJ @ ( ZH @ equivalent ) )),bind(G,$thf( ZA )),bind(H,$thf( ZB ))]]) ).
thf(810,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( E @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[768]) ).
thf(617,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ ( G @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,48]) ).
thf(618,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ ( G @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[617]) ).
thf(619,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( E @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[618:[bind(A,$thf( ZI @ ( ZH @ equivalent ) @ ( ZG @ ( ZH @ equivalent ) @ equivalent ) @ ( ZI @ ( ZG @ equivalent ) @ equivalent ) )),bind(B,$thf( Y )),bind(C,$thf( X )),bind(D,$thf( ZI @ ( ZH @ equivalent ) @ ( ZG @ ( ZH @ equivalent ) @ equivalent ) @ ( ZI @ ( ZG @ equivalent ) @ equivalent ) @ ( Y @ ( X @ equivalent ) @ equivalent ) @ ( X @ ( Y @ equivalent ) @ equivalent ) )),bind(E,$thf( ZG )),bind(F,$thf( ZH )),bind(G,$thf( ZI ))]]) ).
thf(650,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( E @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[619]) ).
thf(4327,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( E @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( G @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[650,80]) ).
thf(4328,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( E @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( G @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[4327]) ).
thf(4329,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( D @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[4328:[bind(A,$thf( K )),bind(B,$thf( K )),bind(C,$thf( S )),bind(D,$thf( T )),bind(E,$thf( U )),bind(F,$thf( U @ ( T @ equivalent ) @ ( S @ ( T @ equivalent ) @ equivalent ) @ ( U @ ( S @ equivalent ) @ equivalent ) @ ( K @ ( K @ equivalent ) @ equivalent ) )),bind(G,$thf( K ))]]) ).
thf(4375,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( D @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[4329]) ).
thf(1666,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1603,47]) ).
thf(1667,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1666]) ).
thf(1668,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1667:[bind(A,$thf( K )),bind(B,$thf( L )),bind(C,$thf( N )),bind(D,$thf( L @ ( K @ equivalent ) @ ( L @ ( K @ equivalent ) @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( N @ ( N @ equivalent ) ))]]) ).
thf(1676,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1668]) ).
thf(792,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ ( H @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[342,48]) ).
thf(793,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ ( H @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[792]) ).
thf(794,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[793:[bind(A,$thf( ZB @ ( X @ equivalent ) )),bind(B,$thf( X @ ( ZA @ equivalent ) )),bind(C,$thf( Y )),bind(D,$thf( ZB @ ( ZA @ equivalent ) )),bind(E,$thf( ZB @ ( ZA @ equivalent ) @ ( Y @ equivalent ) @ ( X @ ( ZA @ equivalent ) @ ( Y @ equivalent ) @ equivalent ) @ ( ZB @ ( X @ equivalent ) @ equivalent ) )),bind(F,$thf( X )),bind(G,$thf( ZA )),bind(H,$thf( ZB ))]]) ).
thf(820,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[794]) ).
thf(14202,plain,
! [A: $i] :
( ( ( c @ ( b @ equivalent ) )
!= ( b @ ( a @ equivalent ) ) )
| ( ( A @ ( A @ equivalent ) )
!= ( c @ ( a @ equivalent ) ) )
| ( ( c @ ( a @ equivalent ) )
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(eqfactor_ordered,[status(thm)],[10812]) ).
thf(14212,plain,
! [A: $i] :
( ( ( c @ ( b @ equivalent ) )
!= ( b @ ( a @ equivalent ) ) )
| ( A != c )
| ( A != a )
| ( ( c @ ( a @ equivalent ) )
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[14202]) ).
thf(14222,plain,
( ( ( c @ ( b @ equivalent ) )
!= ( b @ ( a @ equivalent ) ) )
| ( c != a )
| ( ( c @ ( a @ equivalent ) )
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[14212]) ).
thf(275,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) )
!= e )
| ( ( A @ ( B @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[157]) ).
thf(13543,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[13502,2178]) ).
thf(13544,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[13543]) ).
thf(13545,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[13544:[bind(A,$thf( K )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( N @ ( M @ equivalent ) @ ( N @ ( K @ equivalent ) @ ( M @ ( K @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(13654,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[13545]) ).
thf(60,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( F @ ( E @ equivalent ) @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[12,45]) ).
thf(61,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( F @ ( E @ equivalent ) @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[60]) ).
thf(65,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( D @ ( F @ ( E @ equivalent ) @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[61]) ).
thf(3218,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ is_a_theorem )
!= ( C @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ~ $true
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[3096,876]) ).
thf(3219,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ is_a_theorem )
!= ( C @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3218]) ).
thf(3220,plain,
! [B: $i,A: $i] :
( ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[3219:[bind(A,$thf( E @ ( e @ equivalent ) )),bind(B,$thf( B )),bind(C,$thf( E ))]]) ).
thf(3255,plain,
! [B: $i,A: $i] :
( ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3220]) ).
thf(3316,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(paramod_ordered,[status(thm)],[3255,7]) ).
thf(3317,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3316]) ).
thf(3349,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3317]) ).
thf(280,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( F @ ( E @ equivalent ) @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[47,45]) ).
thf(281,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( F @ ( E @ equivalent ) @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[280]) ).
thf(329,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) )
!= ( D @ ( F @ ( E @ equivalent ) @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) ) )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[281]) ).
thf(1443,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1381,47]) ).
thf(1444,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1443]) ).
thf(1445,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1444:[bind(A,$thf( L )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( L @ ( L @ equivalent ) @ ( M @ ( N @ equivalent ) @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( N @ ( M @ equivalent ) ))]]) ).
thf(1457,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1445]) ).
thf(3003,plain,
! [C: $i,B: $i,A: $i] :
( ( e != e )
| ( ( C @ ( B @ equivalent ) )
!= ( A @ ( A @ equivalent ) ) )
| ( ( A @ ( A @ equivalent ) )
!= e )
| ( ( B @ ( C @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(eqfactor_ordered,[status(thm)],[2656]) ).
thf(3004,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= e )
| ( ( A @ ( A @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(pattern_uni,[status(thm)],[3003:[bind(A,$thf( C )),bind(B,$thf( C ))]]) ).
thf(3006,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= e )
| ( ( A @ ( A @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[3004]) ).
thf(3103,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= e )
| ( A
!= ( c @ ( b @ equivalent ) ) )
| ( A
!= ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[3006]) ).
thf(3104,plain,
( ( ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ( ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) )
!= ( c @ ( b @ equivalent ) ) ) ),
inference(simp,[status(thm)],[3103]) ).
thf(3105,plain,
( ( ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ( ( c @ ( a @ equivalent ) )
!= c )
| ( ( b @ ( a @ equivalent ) )
!= b ) ),
inference(simp,[status(thm)],[3104]) ).
thf(16,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[11,7]) ).
thf(17,plain,
! [C: $i,B: $i,A: $i] :
( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[16]) ).
thf(18,plain,
! [C: $i,B: $i,A: $i] :
( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[17]) ).
thf(51,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) )
!= e )
| ( ( B @ ( A @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[18]) ).
thf(52,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) )
!= e )
| ( B != e )
| ( A
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[51]) ).
thf(53,plain,
! [A: $i] :
( ( e @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[52]) ).
thf(581,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( B @ equivalent ) @ is_a_theorem ) )
| ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[66,330]) ).
thf(582,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( B @ equivalent ) @ is_a_theorem ) )
| ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[581]) ).
thf(583,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(pattern_uni,[status(thm)],[582:[bind(A,$thf( A )),bind(B,$thf( A )),bind(C,$thf( C )),bind(D,$thf( A ))]]) ).
thf(601,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[583]) ).
thf(610,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ equivalent ) )
!= e )
| ( ( A @ ( B @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[601]) ).
thf(396,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ ( E @ ( G @ ( F @ equivalent ) @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,46]) ).
thf(397,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ ( E @ ( G @ ( F @ equivalent ) @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[396]) ).
thf(398,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( C @ ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[397:[bind(A,$thf( ZA @ ( ZA @ ( ZI @ ( ZH @ equivalent ) @ equivalent ) @ ( ZH @ ( ZI @ equivalent ) @ equivalent ) @ equivalent ) )),bind(B,$thf( Y )),bind(C,$thf( X )),bind(D,$thf( ZA @ ( ZA @ ( ZI @ ( ZH @ equivalent ) @ equivalent ) @ ( ZH @ ( ZI @ equivalent ) @ equivalent ) @ equivalent ) @ ( Y @ ( X @ equivalent ) @ equivalent ) @ ( X @ ( Y @ equivalent ) @ equivalent ) )),bind(E,$thf( ZA )),bind(F,$thf( ZH )),bind(G,$thf( ZI ))]]) ).
thf(420,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( C @ ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[398]) ).
thf(852,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( C @ equivalent ) @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) )
!= e )
| ( ( C @ ( D @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[158,565]) ).
thf(853,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( C @ equivalent ) @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) )
!= e )
| ( ( C @ ( D @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[852]) ).
thf(854,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( A @ equivalent ) )
!= e )
| ( ( B @ ( B @ equivalent ) @ ( A @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(pattern_uni,[status(thm)],[853:[bind(A,$thf( G )),bind(B,$thf( I )),bind(C,$thf( G @ ( G @ equivalent ) )),bind(D,$thf( D )),bind(E,$thf( I @ ( I @ equivalent ) ))]]) ).
thf(875,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( A @ equivalent ) )
!= e )
| ( ( B @ ( B @ equivalent ) @ ( A @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[854]) ).
thf(1180,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( A @ equivalent ) )
!= e )
| ( ( B @ ( B @ equivalent ) )
!= e )
| ( A
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[875]) ).
thf(1181,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ( ( A @ ( A @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[1180]) ).
thf(1247,plain,
! [B: $i,A: $i] :
( ( e != e )
| ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( A @ ( A @ equivalent ) ) )
| ( ( A @ ( A @ equivalent ) )
!= e ) ),
inference(eqfactor_ordered,[status(thm)],[1181]) ).
thf(1249,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= A )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= A )
| ( ( A @ ( A @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[1247]) ).
thf(1250,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[1249]) ).
thf(1395,plain,
! [A: $i] :
( ( A
!= ( c @ ( b @ equivalent ) ) )
| ( A
!= ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[1250]) ).
thf(1396,plain,
( ( ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) )
!= ( c @ ( b @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[1395]) ).
thf(1397,plain,
( ( ( c @ ( a @ equivalent ) )
!= c )
| ( ( b @ ( a @ equivalent ) )
!= b )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[1396]) ).
thf(3009,plain,
! [A: $i] :
( ( ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) )
!= A )
| ( ( c @ ( b @ equivalent ) )
!= A )
| ( ( A @ ( A @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3007]) ).
thf(3010,plain,
( ( ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) )
!= ( c @ ( b @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3009]) ).
thf(6513,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1034,185]) ).
thf(6514,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[6513]) ).
thf(6515,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[6514:[bind(A,$thf( Q @ ( Q @ equivalent ) )),bind(B,$thf( S @ ( S @ equivalent ) )),bind(C,$thf( W )),bind(D,$thf( Y )),bind(E,$thf( Y @ ( Y @ equivalent ) @ ( W @ ( W @ equivalent ) @ equivalent ) @ ( S @ ( S @ equivalent ) @ ( Q @ ( Q @ equivalent ) @ equivalent ) @ equivalent ) )),bind(F,$thf( S )),bind(G,$thf( Q ))]]) ).
thf(6625,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[6515]) ).
thf(514,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ ( H @ ( G @ equivalent ) @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[332,46]) ).
thf(515,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ ( H @ ( G @ equivalent ) @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[514]) ).
thf(516,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ ( C @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[515:[bind(A,$thf( ZF @ ( Z @ ( Y @ equivalent ) @ equivalent ) @ ( Y @ ( Z @ equivalent ) @ equivalent ) )),bind(B,$thf( ZF )),bind(C,$thf( ZG )),bind(D,$thf( ZH )),bind(E,$thf( ZF @ ( ZH @ ( ZG @ equivalent ) @ equivalent ) @ ( ZG @ ( ZH @ equivalent ) @ equivalent ) @ ( ZF @ ( Z @ ( Y @ equivalent ) @ equivalent ) @ ( Y @ ( Z @ equivalent ) @ equivalent ) @ equivalent ) )),bind(F,$thf( ZF )),bind(G,$thf( Y )),bind(H,$thf( Z ))]]) ).
thf(554,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ ( C @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[516]) ).
thf(6428,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[820,185]) ).
thf(6429,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( C @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[6428]) ).
thf(6430,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( C @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[6429:[bind(A,$thf( S @ ( S @ equivalent ) )),bind(B,$thf( T )),bind(C,$thf( V )),bind(D,$thf( Y @ ( Y @ equivalent ) )),bind(E,$thf( Y @ ( Y @ equivalent ) @ ( V @ equivalent ) @ ( T @ equivalent ) @ ( S @ ( S @ equivalent ) @ ( V @ equivalent ) @ ( T @ equivalent ) @ equivalent ) )),bind(F,$thf( S )),bind(G,$thf( Y ))]]) ).
thf(6593,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( C @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[6430]) ).
thf(4514,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[133,159]) ).
thf(4515,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4514]) ).
thf(4516,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[4515:[bind(A,$thf( K )),bind(B,$thf( L )),bind(C,$thf( N )),bind(D,$thf( N @ ( N @ equivalent ) @ ( L @ ( K @ equivalent ) @ equivalent ) )),bind(E,$thf( K @ ( L @ equivalent ) )),bind(F,$thf( F ))]]) ).
thf(4721,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[4516]) ).
thf(17057,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ~ ( e @ ( D @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[11,15770]) ).
thf(17058,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ ( e @ ( D @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[17057]) ).
thf(17059,plain,
! [A: $i] :
~ ( e @ ( e @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[17058:[bind(A,$thf( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )),bind(B,$thf( e )),bind(C,$thf( ZC )),bind(D,$thf( e @ ( ZC @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( ZC @ equivalent ) @ equivalent ) ))]]) ).
thf(17360,plain,
! [A: $i] :
~ ( e @ ( e @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[17059]) ).
thf(1146,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[460,80]) ).
thf(1147,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[1146]) ).
thf(1148,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1147:[bind(A,$thf( P @ ( P @ equivalent ) @ ( Q @ equivalent ) )),bind(B,$thf( P )),bind(C,$thf( Q )),bind(D,$thf( T )),bind(E,$thf( T @ ( T @ equivalent ) @ ( Q @ equivalent ) @ ( P @ ( P @ equivalent ) @ ( Q @ equivalent ) @ equivalent ) )),bind(F,$thf( P @ ( P @ equivalent ) @ ( Q @ equivalent ) ))]]) ).
thf(1177,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1148]) ).
thf(1208,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1177,7]) ).
thf(1209,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1208]) ).
thf(1231,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[1209]) ).
thf(14440,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( E @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ ( I @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[812,48]) ).
thf(14441,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( E @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( I @ ( H @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ ( I @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[14440]) ).
thf(14442,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[14441:[bind(A,$thf( ZA @ ( U @ equivalent ) )),bind(B,$thf( U @ ( Y @ equivalent ) )),bind(C,$thf( Y )),bind(D,$thf( Z )),bind(E,$thf( ZA )),bind(F,$thf( ZA @ ( Z @ equivalent ) @ ( Y @ ( Z @ equivalent ) @ equivalent ) @ ( U @ ( Y @ equivalent ) @ equivalent ) @ ( ZA @ ( U @ equivalent ) @ equivalent ) )),bind(G,$thf( U )),bind(H,$thf( Y )),bind(I,$thf( ZA ))]]) ).
thf(14509,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[14442]) ).
thf(445,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[333,7]) ).
thf(446,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[445]) ).
thf(457,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[446]) ).
thf(487,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[418,7]) ).
thf(488,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[487]) ).
thf(503,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[488]) ).
thf(6553,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[332,185]) ).
thf(6554,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[6553]) ).
thf(6555,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[6554:[bind(A,$thf( O @ ( O @ equivalent ) )),bind(B,$thf( Y @ ( Y @ equivalent ) )),bind(C,$thf( V )),bind(D,$thf( W )),bind(E,$thf( Y @ ( Y @ equivalent ) @ ( W @ ( V @ equivalent ) @ equivalent ) @ ( V @ ( W @ equivalent ) @ equivalent ) @ ( O @ ( O @ equivalent ) @ equivalent ) )),bind(F,$thf( O )),bind(G,$thf( Y ))]]) ).
thf(6592,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[6555]) ).
thf(1615,plain,
! [C: $i,B: $i,A: $i] :
( ( A != e )
| ( ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[503]) ).
thf(1616,plain,
! [B: $i,A: $i] :
( ( e @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[1615]) ).
thf(2239,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1177,2178]) ).
thf(2240,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[2239]) ).
thf(2241,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[2240:[bind(A,$thf( J )),bind(B,$thf( K )),bind(C,$thf( N )),bind(D,$thf( N @ ( N @ equivalent ) @ ( K @ equivalent ) @ ( J @ ( J @ equivalent ) @ ( K @ equivalent ) @ equivalent ) ))]]) ).
thf(2275,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[2241]) ).
thf(5071,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( H @ equivalent ) @ ( G @ ( F @ equivalent ) @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[334,160]) ).
thf(5072,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( H @ equivalent ) @ ( G @ ( F @ equivalent ) @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[5071]) ).
thf(5073,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[5072:[bind(A,$thf( Y @ ( Z @ equivalent ) )),bind(B,$thf( X @ ( X @ equivalent ) )),bind(C,$thf( Z @ ( Y @ equivalent ) )),bind(D,$thf( ZB )),bind(E,$thf( ZB @ ( ZB @ equivalent ) @ ( Z @ ( Y @ equivalent ) @ ( X @ ( X @ equivalent ) @ equivalent ) @ equivalent ) @ ( Y @ ( Z @ equivalent ) @ equivalent ) )),bind(F,$thf( Y )),bind(G,$thf( Z )),bind(H,$thf( X ))]]) ).
thf(5230,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[5073]) ).
thf(151,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ~ $true
| ( E @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[133,43]) ).
thf(152,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[151]) ).
thf(153,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[152:[bind(A,$thf( L )),bind(B,$thf( M )),bind(C,$thf( O )),bind(D,$thf( O @ ( O @ equivalent ) @ ( M @ ( L @ equivalent ) @ equivalent ) @ ( L @ ( M @ equivalent ) @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(161,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[153]) ).
thf(3118,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ( ( D @ ( D @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[3096,2295]) ).
thf(3119,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ( ( D @ ( D @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3118]) ).
thf(3120,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[3119:[bind(A,$thf( F @ ( F @ equivalent ) )),bind(B,$thf( B )),bind(C,$thf( F )),bind(D,$thf( D ))]]) ).
thf(3272,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3120]) ).
thf(89,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ~ $true
| ( E @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[12,43]) ).
thf(90,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[89]) ).
thf(91,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( B @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[90:[bind(A,$thf( O )),bind(B,$thf( N )),bind(C,$thf( G )),bind(D,$thf( G @ ( G @ ( O @ ( N @ equivalent ) @ equivalent ) @ ( N @ ( O @ equivalent ) @ equivalent ) @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(118,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( B @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[91]) ).
thf(4496,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,159]) ).
thf(4497,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4496]) ).
thf(4498,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[4497:[bind(A,$thf( L )),bind(B,$thf( N )),bind(C,$thf( M )),bind(D,$thf( L @ ( N @ ( M @ equivalent ) @ equivalent ) @ ( M @ ( N @ equivalent ) @ equivalent ) )),bind(E,$thf( L )),bind(F,$thf( F ))]]) ).
thf(4709,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[4498]) ).
thf(326,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[47,47]) ).
thf(327,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( C @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[326]) ).
thf(328,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( D @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( D @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[327:[bind(A,$thf( H )),bind(B,$thf( I )),bind(C,$thf( J )),bind(D,$thf( H @ ( I @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( J @ ( I @ equivalent ) ))]]) ).
thf(335,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( D @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( D @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[328]) ).
thf(4776,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[4733,2178]) ).
thf(4777,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[4776]) ).
thf(4778,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[4777:[bind(A,$thf( N )),bind(B,$thf( L )),bind(C,$thf( J )),bind(D,$thf( N @ ( N @ equivalent ) @ ( L @ ( L @ equivalent ) @ ( J @ ( J @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(4854,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[4778]) ).
thf(655,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ ( H @ ( G @ equivalent ) @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[334,46]) ).
thf(656,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ ( H @ ( G @ equivalent ) @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[655]) ).
thf(657,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( E @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[656:[bind(A,$thf( ZG @ ( ZH @ equivalent ) @ ( ZB @ ( ZA @ equivalent ) @ equivalent ) @ ( ZA @ ( ZB @ equivalent ) @ equivalent ) )),bind(B,$thf( ZG )),bind(C,$thf( ZH )),bind(D,$thf( ZJ )),bind(E,$thf( ZJ @ ( ZJ @ equivalent ) @ ( ZH @ ( ZG @ equivalent ) @ equivalent ) @ ( ZG @ ( ZH @ equivalent ) @ ( ZB @ ( ZA @ equivalent ) @ equivalent ) @ ( ZA @ ( ZB @ equivalent ) @ equivalent ) @ equivalent ) )),bind(F,$thf( ZG @ ( ZH @ equivalent ) )),bind(G,$thf( ZA )),bind(H,$thf( ZB ))]]) ).
thf(704,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( E @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[657]) ).
thf(3031,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ( D @ ( D @ equivalent ) @ is_a_theorem )
| ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[2659,188]) ).
thf(3032,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ( D @ ( D @ equivalent ) @ is_a_theorem )
| ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[3031]) ).
thf(3033,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) @ is_a_theorem )
| ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[3032:[bind(A,$thf( H @ ( H @ equivalent ) )),bind(B,$thf( H )),bind(C,$thf( H @ ( H @ equivalent ) )),bind(D,$thf( D ))]]) ).
thf(3091,plain,
! [B: $i,A: $i] :
( ( A @ ( A @ equivalent ) @ is_a_theorem )
| ( B @ ( B @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[3033]) ).
thf(3296,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ( ( D @ ( D @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ~ $true
| ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(paramod_ordered,[status(thm)],[3255,233]) ).
thf(3297,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ( ( D @ ( D @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3296]) ).
thf(3298,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(pattern_uni,[status(thm)],[3297:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A ))]]) ).
thf(3352,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3298]) ).
thf(3115,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true
| ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[3096,2178]) ).
thf(3116,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[3115]) ).
thf(3117,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[3116:[bind(A,$thf( A )),bind(B,$thf( E )),bind(C,$thf( E @ ( E @ equivalent ) ))]]) ).
thf(3270,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[3117]) ).
thf(4429,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ is_a_theorem )
!= ( C @ ( D @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( C @ is_a_theorem )
| ~ $true
| ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(paramod_ordered,[status(thm)],[3270,80]) ).
thf(4430,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ is_a_theorem )
!= ( C @ ( D @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( C @ is_a_theorem )
| ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[4429]) ).
thf(4431,plain,
! [B: $i,A: $i] :
( ( B @ is_a_theorem )
| ( ( A @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(pattern_uni,[status(thm)],[4430:[bind(A,$thf( F @ ( H @ ( H @ equivalent ) @ equivalent ) )),bind(B,$thf( B )),bind(C,$thf( F )),bind(D,$thf( H ))]]) ).
thf(4463,plain,
! [B: $i,A: $i] :
( ( B @ is_a_theorem )
| ( ( A @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[4431]) ).
thf(8450,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true
| ( ( A @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(paramod_ordered,[status(thm)],[4463,2178]) ).
thf(8451,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( ( A @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[8450]) ).
thf(8452,plain,
! [B: $i,A: $i] :
( ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( ( A @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(pattern_uni,[status(thm)],[8451:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( B ))]]) ).
thf(253,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( C @ ( B @ equivalent ) )
!= B )
| ~ $true
| ( C @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[66,44]) ).
thf(254,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( C @ ( B @ equivalent ) )
!= B )
| ( C @ is_a_theorem ) ),
inference(simp,[status(thm)],[253]) ).
thf(255,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ equivalent ) @ equivalent ) )
!= ( B @ ( B @ equivalent ) ) )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[254:[bind(A,$thf( E )),bind(B,$thf( E @ ( E @ equivalent ) )),bind(C,$thf( C ))]]) ).
thf(274,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ equivalent ) @ equivalent ) )
!= ( B @ ( B @ equivalent ) ) )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[255]) ).
thf(2197,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,2178]) ).
thf(2198,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[2197]) ).
thf(2199,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[2198:[bind(A,$thf( L )),bind(B,$thf( N )),bind(C,$thf( M )),bind(D,$thf( L @ ( N @ ( M @ equivalent ) @ equivalent ) @ ( M @ ( N @ equivalent ) @ equivalent ) @ ( L @ equivalent ) ))]]) ).
thf(2284,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[2199]) ).
thf(208,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ( E @ ( E @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[10,188]) ).
thf(209,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ ( E @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[208]) ).
thf(230,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) )
!= ( D @ ( D @ equivalent ) ) )
| ( E @ ( E @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[209]) ).
thf(244,plain,
! [A: $i] :
( ( A
!= ( c @ ( b @ equivalent ) ) )
| ( A
!= ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[242]) ).
thf(245,plain,
( ( ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) )
!= ( c @ ( b @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[244]) ).
thf(247,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) )
!= D )
| ~ $true
| ( E @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[133,44]) ).
thf(248,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) )
!= D )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[247]) ).
thf(249,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) ) )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[248:[bind(A,$thf( L )),bind(B,$thf( M )),bind(C,$thf( O )),bind(D,$thf( O @ ( O @ equivalent ) @ ( M @ ( L @ equivalent ) @ equivalent ) @ ( L @ ( M @ equivalent ) @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(271,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) ) )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[249]) ).
thf(1281,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( H @ ( G @ equivalent ) @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[342,50]) ).
thf(1282,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( H @ ( G @ equivalent ) @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[1281]) ).
thf(1283,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1282:[bind(A,$thf( Z )),bind(B,$thf( ZA @ ( ZB @ equivalent ) )),bind(C,$thf( W )),bind(D,$thf( Z @ ( ZB @ ( ZA @ equivalent ) @ equivalent ) )),bind(E,$thf( Z @ ( ZB @ ( ZA @ equivalent ) @ equivalent ) @ ( W @ equivalent ) @ ( ZA @ ( ZB @ equivalent ) @ ( W @ equivalent ) @ equivalent ) @ ( Z @ equivalent ) )),bind(F,$thf( Z )),bind(G,$thf( ZA )),bind(H,$thf( ZB ))]]) ).
thf(1307,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1283]) ).
thf(1984,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1820,47]) ).
thf(1985,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[1984]) ).
thf(1986,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[1985:[bind(A,$thf( H )),bind(B,$thf( L )),bind(C,$thf( N )),bind(D,$thf( H @ ( H @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( N @ ( N @ equivalent ) @ ( L @ ( L @ equivalent ) @ equivalent ) ))]]) ).
thf(1993,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[1986]) ).
thf(4658,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[418,159]) ).
thf(4659,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4658]) ).
thf(4660,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[4659:[bind(A,$thf( L )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( L )),bind(E,$thf( L @ ( N @ ( M @ equivalent ) @ equivalent ) @ ( M @ ( N @ equivalent ) @ equivalent ) )),bind(F,$thf( F ))]]) ).
thf(4731,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[4660]) ).
thf(904,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[158,876]) ).
thf(905,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[904]) ).
thf(915,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= ( C @ ( e @ equivalent ) ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[905]) ).
thf(711,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ ( H @ ( G @ equivalent ) @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[341,46]) ).
thf(712,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ ( H @ ( G @ equivalent ) @ equivalent ) @ ( G @ ( H @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[711]) ).
thf(713,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[712:[bind(A,$thf( Z @ ( ZP @ ( ZO @ equivalent ) @ equivalent ) @ ( ZO @ ( ZP @ equivalent ) @ equivalent ) @ ( ZH @ ( ZG @ equivalent ) @ equivalent ) @ ( ZG @ ( ZH @ equivalent ) @ equivalent ) )),bind(B,$thf( Z )),bind(C,$thf( ZO )),bind(D,$thf( ZP )),bind(E,$thf( Z @ ( Z @ ( ZP @ ( ZO @ equivalent ) @ equivalent ) @ ( ZO @ ( ZP @ equivalent ) @ equivalent ) @ ( ZH @ ( ZG @ equivalent ) @ equivalent ) @ ( ZG @ ( ZH @ equivalent ) @ equivalent ) @ equivalent ) )),bind(F,$thf( Z @ ( ZP @ ( ZO @ equivalent ) @ equivalent ) @ ( ZO @ ( ZP @ equivalent ) @ equivalent ) )),bind(G,$thf( ZG )),bind(H,$thf( ZH ))]]) ).
thf(758,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[713]) ).
thf(6780,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[6626,7]) ).
thf(6781,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[6780]) ).
thf(6811,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[6781]) ).
thf(2517,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1315,80]) ).
thf(2518,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( E @ ( F @ ( F @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[2517]) ).
thf(2519,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[2518:[bind(A,$thf( R @ ( R @ equivalent ) )),bind(B,$thf( S )),bind(C,$thf( T )),bind(D,$thf( V )),bind(E,$thf( V @ ( V @ equivalent ) @ ( T @ ( S @ equivalent ) @ ( R @ ( R @ equivalent ) @ ( S @ ( T @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(F,$thf( R ))]]) ).
thf(2550,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[2519]) ).
thf(3287,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true
| ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(paramod_ordered,[status(thm)],[3255,2178]) ).
thf(3288,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3287]) ).
thf(3289,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(pattern_uni,[status(thm)],[3288:[bind(A,$thf( E )),bind(B,$thf( B )),bind(C,$thf( E @ ( E @ equivalent ) ))]]) ).
thf(3363,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3289]) ).
thf(3866,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( G @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[420,80]) ).
thf(3867,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( G @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[3866]) ).
thf(3868,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[3867:[bind(A,$thf( K )),bind(B,$thf( K )),bind(C,$thf( M )),bind(D,$thf( T )),bind(E,$thf( U )),bind(F,$thf( M @ ( M @ ( U @ ( T @ equivalent ) @ equivalent ) @ ( T @ ( U @ equivalent ) @ equivalent ) @ equivalent ) @ ( K @ ( K @ equivalent ) @ equivalent ) )),bind(G,$thf( K ))]]) ).
thf(3908,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( B @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[3868]) ).
thf(2054,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem )
!= ( E @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( E @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1307,876]) ).
thf(2055,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ is_a_theorem )
!= ( E @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( E @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[2054]) ).
thf(2056,plain,
! [C: $i,B: $i,A: $i] :
( ( e @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[2055:[bind(A,$thf( L )),bind(B,$thf( e )),bind(C,$thf( P )),bind(D,$thf( Q )),bind(E,$thf( e @ ( Q @ ( P @ equivalent ) @ equivalent ) @ ( L @ equivalent ) @ ( P @ ( Q @ equivalent ) @ ( L @ equivalent ) @ equivalent ) ))]]) ).
thf(2069,plain,
! [C: $i,B: $i,A: $i] :
( ( e @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[2056]) ).
thf(3174,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[3096,7]) ).
thf(3175,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[3174]) ).
thf(3241,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[3175]) ).
thf(562,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) )
!= e )
| ( A != e )
| ( B
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[275]) ).
thf(563,plain,
! [A: $i] :
( ( A @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[562]) ).
thf(221,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( D @ ( C @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ~ $true
| ( D @ is_a_theorem )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[188,43]) ).
thf(222,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( D @ ( C @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[221]) ).
thf(223,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ( B @ is_a_theorem )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[222:[bind(A,$thf( A )),bind(B,$thf( F )),bind(C,$thf( F @ ( F @ equivalent ) )),bind(D,$thf( D ))]]) ).
thf(241,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ( B @ is_a_theorem )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[223]) ).
thf(637,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ ( H @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[332,48]) ).
thf(638,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( H @ ( G @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ ( H @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[637]) ).
thf(639,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( E @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[638:[bind(A,$thf( ZH @ ( ZF @ equivalent ) )),bind(B,$thf( ZH @ ( ZG @ equivalent ) @ ( ZF @ ( ZG @ equivalent ) @ equivalent ) )),bind(C,$thf( ZA )),bind(D,$thf( ZB )),bind(E,$thf( ZH @ ( ZG @ equivalent ) @ ( ZF @ ( ZG @ equivalent ) @ equivalent ) @ ( ZB @ ( ZA @ equivalent ) @ equivalent ) @ ( ZA @ ( ZB @ equivalent ) @ equivalent ) @ ( ZH @ ( ZF @ equivalent ) @ equivalent ) )),bind(F,$thf( ZF )),bind(G,$thf( ZG )),bind(H,$thf( ZH ))]]) ).
thf(653,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( D @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( E @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[639]) ).
thf(6777,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[6626,159]) ).
thf(6778,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[6777]) ).
thf(6779,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[6778:[bind(A,$thf( H )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( N @ ( M @ equivalent ) @ ( N @ ( M @ equivalent ) @ equivalent ) )),bind(E,$thf( H @ ( H @ equivalent ) )),bind(F,$thf( F ))]]) ).
thf(6838,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[6779]) ).
thf(11627,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( E @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( G @ ( I @ ( H @ equivalent ) @ equivalent ) @ ( H @ ( I @ equivalent ) @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[706,50]) ).
thf(11628,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( E @ ( E @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ ( C @ ( D @ equivalent ) @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( G @ ( I @ ( H @ equivalent ) @ equivalent ) @ ( H @ ( I @ equivalent ) @ equivalent ) @ ( G @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( F @ is_a_theorem ) ),
inference(simp,[status(thm)],[11627]) ).
thf(11629,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[11628:[bind(A,$thf( V )),bind(B,$thf( X @ ( Y @ equivalent ) )),bind(C,$thf( V )),bind(D,$thf( Y @ ( X @ equivalent ) )),bind(E,$thf( ZA )),bind(F,$thf( ZA @ ( ZA @ equivalent ) @ ( Y @ ( X @ equivalent ) @ ( V @ equivalent ) @ equivalent ) @ ( X @ ( Y @ equivalent ) @ equivalent ) @ ( V @ equivalent ) )),bind(G,$thf( V )),bind(H,$thf( X )),bind(I,$thf( Y ))]]) ).
thf(11689,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[11629]) ).
thf(4644,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[11,159]) ).
thf(4645,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4644]) ).
thf(4646,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[4645:[bind(A,$thf( L )),bind(B,$thf( N )),bind(C,$thf( M )),bind(D,$thf( N @ ( M @ equivalent ) @ ( L @ ( M @ equivalent ) @ equivalent ) )),bind(E,$thf( N @ ( L @ equivalent ) )),bind(F,$thf( F ))]]) ).
thf(4722,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[4646]) ).
thf(2227,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1603,2178]) ).
thf(2228,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[2227]) ).
thf(2229,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[2228:[bind(A,$thf( K )),bind(B,$thf( L )),bind(C,$thf( N )),bind(D,$thf( N @ ( N @ equivalent ) @ ( L @ ( K @ equivalent ) @ ( L @ ( K @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(2298,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[2229]) ).
thf(4447,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ is_a_theorem )
!= ( C @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ~ $true
| ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(paramod_ordered,[status(thm)],[3270,876]) ).
thf(4448,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ is_a_theorem )
!= ( C @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( C @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[4447]) ).
thf(4449,plain,
! [B: $i,A: $i] :
( ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ( ( A @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(pattern_uni,[status(thm)],[4448:[bind(A,$thf( E @ ( e @ equivalent ) )),bind(B,$thf( B )),bind(C,$thf( E ))]]) ).
thf(4469,plain,
! [B: $i,A: $i] :
( ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ( ( A @ ( A @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[4449]) ).
thf(4693,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ ( E @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true
| ( A @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[3096,159]) ).
thf(4694,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ ( E @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[4693]) ).
thf(4695,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[4694:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( B )),bind(D,$thf( B ))]]) ).
thf(4754,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[4695]) ).
thf(7572,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[5230,185]) ).
thf(7573,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[7572]) ).
thf(7574,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[7573:[bind(A,$thf( Q )),bind(B,$thf( U @ ( U @ equivalent ) )),bind(C,$thf( W @ ( W @ equivalent ) )),bind(D,$thf( Y )),bind(E,$thf( Y @ ( Y @ equivalent ) @ ( W @ ( W @ equivalent ) @ ( U @ ( U @ equivalent ) @ equivalent ) @ ( Q @ ( Q @ equivalent ) @ equivalent ) @ equivalent ) )),bind(F,$thf( W )),bind(G,$thf( U ))]]) ).
thf(7662,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[7574]) ).
thf(2242,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1381,2178]) ).
thf(2243,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[2242]) ).
thf(2244,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[2243:[bind(A,$thf( L )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( N @ ( M @ equivalent ) @ ( L @ ( L @ equivalent ) @ ( M @ ( N @ equivalent ) @ equivalent ) @ equivalent ) ))]]) ).
thf(2276,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[2244]) ).
thf(3305,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ( D @ ( D @ equivalent ) @ is_a_theorem )
| ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(paramod_ordered,[status(thm)],[3255,188]) ).
thf(3306,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ is_a_theorem ) )
| ( D @ ( D @ equivalent ) @ is_a_theorem )
| ( ( B @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3305]) ).
thf(3307,plain,
! [B: $i,A: $i] :
( ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(pattern_uni,[status(thm)],[3306:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A ))]]) ).
thf(3356,plain,
! [B: $i,A: $i] :
( ( B @ ( B @ equivalent ) @ is_a_theorem )
| ( ( A @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3307]) ).
thf(2251,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[11,2178]) ).
thf(2252,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[2251]) ).
thf(2253,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[2252:[bind(A,$thf( L )),bind(B,$thf( N )),bind(C,$thf( M )),bind(D,$thf( N @ ( M @ equivalent ) @ ( L @ ( M @ equivalent ) @ equivalent ) @ ( N @ ( L @ equivalent ) @ equivalent ) ))]]) ).
thf(2279,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( C @ ( A @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[2253]) ).
thf(14527,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[14509,185]) ).
thf(14528,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[14527]) ).
thf(14529,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[14528:[bind(A,$thf( Q @ ( Q @ equivalent ) )),bind(B,$thf( U )),bind(C,$thf( V )),bind(D,$thf( Y @ ( Y @ equivalent ) )),bind(E,$thf( Y @ ( Y @ equivalent ) @ ( V @ equivalent ) @ ( U @ ( V @ equivalent ) @ equivalent ) @ ( Q @ ( Q @ equivalent ) @ ( U @ equivalent ) @ equivalent ) )),bind(F,$thf( Q )),bind(G,$thf( Y ))]]) ).
thf(14631,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[14529]) ).
thf(1617,plain,
! [B: $i,A: $i] :
( ( ( e @ ( B @ ( A @ equivalent ) @ equivalent ) )
!= e )
| ( ( A @ ( B @ equivalent ) )
!= ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[1616]) ).
thf(198,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ( E @ ( E @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[12,188]) ).
thf(199,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ ( E @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[198]) ).
thf(231,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( D @ ( D @ equivalent ) ) )
| ( E @ ( E @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[199]) ).
thf(14203,plain,
! [A: $i] :
( ( ( c @ ( b @ equivalent ) )
!= ( c @ ( a @ equivalent ) ) )
| ( ( A @ ( A @ equivalent ) )
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( a @ equivalent ) )
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(eqfactor_ordered,[status(thm)],[10812]) ).
thf(14209,plain,
! [A: $i] :
( ( c != c )
| ( b != a )
| ( A != b )
| ( A != a )
| ( ( c @ ( a @ equivalent ) )
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[14203]) ).
thf(14219,plain,
( ( b != a )
| ( ( c @ ( a @ equivalent ) )
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[14209]) ).
thf(4608,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[1381,159]) ).
thf(4609,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4608]) ).
thf(4610,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[4609:[bind(A,$thf( L )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( N @ ( M @ equivalent ) )),bind(E,$thf( L @ ( L @ equivalent ) @ ( M @ ( N @ equivalent ) @ equivalent ) )),bind(F,$thf( F ))]]) ).
thf(4698,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[4610]) ).
thf(6808,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[6626,47]) ).
thf(6809,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[6808]) ).
thf(6810,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[6809:[bind(A,$thf( H )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( H @ ( H @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( N @ ( M @ equivalent ) @ ( N @ ( M @ equivalent ) @ equivalent ) ))]]) ).
thf(6829,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[6810]) ).
thf(2206,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[133,2178]) ).
thf(2207,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[2206]) ).
thf(2208,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[2207:[bind(A,$thf( K )),bind(B,$thf( L )),bind(C,$thf( N )),bind(D,$thf( N @ ( N @ equivalent ) @ ( L @ ( K @ equivalent ) @ equivalent ) @ ( K @ ( L @ equivalent ) @ equivalent ) ))]]) ).
thf(2290,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[2208]) ).
thf(13,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,7]) ).
thf(14,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[13]) ).
thf(15,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[14]) ).
thf(22,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) )
!= e )
| ( A
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[15]) ).
thf(23,plain,
! [B: $i,A: $i] :
( ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[22]) ).
thf(620,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ ( G @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[133,48]) ).
thf(621,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( G @ ( F @ equivalent ) @ ( E @ ( F @ equivalent ) @ equivalent ) @ ( G @ ( E @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[620]) ).
thf(622,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[621:[bind(A,$thf( ZA @ ( X @ equivalent ) @ ( Z @ ( X @ equivalent ) @ equivalent ) )),bind(B,$thf( ZA @ ( Z @ equivalent ) )),bind(C,$thf( ZC )),bind(D,$thf( ZC @ ( ZC @ equivalent ) @ ( ZA @ ( Z @ equivalent ) @ ( ZA @ ( X @ equivalent ) @ ( Z @ ( X @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )),bind(E,$thf( Z )),bind(F,$thf( X )),bind(G,$thf( ZA ))]]) ).
thf(652,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[622]) ).
thf(178,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( D @ ( C @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ~ $true
| ( D @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[158,43]) ).
thf(179,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( D @ ( C @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[178]) ).
thf(180,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[179:[bind(A,$thf( H )),bind(B,$thf( J )),bind(C,$thf( J @ ( J @ equivalent ) @ ( H @ ( H @ equivalent ) @ equivalent ) )),bind(D,$thf( D ))]]) ).
thf(186,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[180]) ).
thf(4490,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[333,159]) ).
thf(4491,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ equivalent ) @ is_a_theorem ) )
| ( F @ ( F @ equivalent ) @ ( E @ ( D @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[4490]) ).
thf(4492,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ equivalent ) @ ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[4491:[bind(A,$thf( K )),bind(B,$thf( J )),bind(C,$thf( N )),bind(D,$thf( N @ ( N @ equivalent ) @ ( K @ equivalent ) )),bind(E,$thf( J @ ( J @ equivalent ) @ ( K @ equivalent ) )),bind(F,$thf( F ))]]) ).
thf(4705,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( A @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( C @ equivalent ) @ ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[4492]) ).
thf(4678,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( C @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ ( E @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true
| ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[3245,159]) ).
thf(4679,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( C @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ ( E @ equivalent ) @ ( D @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
| ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[4678]) ).
thf(4680,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
| ( B @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[4679:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A )),bind(D,$thf( A ))]]) ).
thf(4745,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
| ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[4680]) ).
thf(8319,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ is_a_theorem )
!= ( D @ ( E @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true
| ( C @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[4745,80]) ).
thf(8320,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ is_a_theorem )
!= ( D @ ( E @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ( C @ ( C @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[8319]) ).
thf(8321,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ is_a_theorem )
| ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[8320:[bind(A,$thf( A )),bind(B,$thf( G @ ( I @ ( I @ equivalent ) @ equivalent ) )),bind(C,$thf( C )),bind(D,$thf( G )),bind(E,$thf( I ))]]) ).
thf(8388,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ is_a_theorem )
| ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[8321]) ).
thf(265,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( D @ ( C @ equivalent ) )
!= C )
| ~ $true
| ( D @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[158,44]) ).
thf(266,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( D @ ( C @ equivalent ) )
!= C )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[265]) ).
thf(267,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) ) )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[266:[bind(A,$thf( H )),bind(B,$thf( J )),bind(C,$thf( J @ ( J @ equivalent ) @ ( H @ ( H @ equivalent ) @ equivalent ) )),bind(D,$thf( D ))]]) ).
thf(272,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( C @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ equivalent ) ) )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[267]) ).
thf(70,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[66,7]) ).
thf(71,plain,
! [A: $i] :
( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[70]) ).
thf(79,plain,
! [A: $i] :
( ( A @ ( A @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ),
inference(simp,[status(thm)],[71]) ).
thf(81,plain,
! [A: $i] :
( ( A != e )
| ( A
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[79]) ).
thf(82,plain,
( ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[81]) ).
thf(196,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( C @ is_a_theorem )
| ~ $true
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[188,45]) ).
thf(197,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( C @ is_a_theorem )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[196]) ).
thf(235,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) )
!= ( C @ ( E @ ( D @ equivalent ) @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) ) )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem )
| ( C @ is_a_theorem ) ),
inference(simp,[status(thm)],[197]) ).
thf(246,plain,
( ( ( c @ ( a @ equivalent ) )
!= c )
| ( ( b @ ( a @ equivalent ) )
!= b )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[245]) ).
thf(3100,plain,
( ( ( c @ ( a @ equivalent ) )
!= c )
| ( ( b @ ( a @ equivalent ) )
!= b )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( b @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[3010]) ).
thf(1248,plain,
! [B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( A @ ( A @ equivalent ) ) )
| ( ( A @ ( A @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[1247]) ).
thf(250,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) )
!= D )
| ~ $true
| ( E @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[12,44]) ).
thf(251,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) )
!= D )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[250]) ).
thf(252,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( B @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[251:[bind(A,$thf( O )),bind(B,$thf( N )),bind(C,$thf( G )),bind(D,$thf( G @ ( G @ ( O @ ( N @ equivalent ) @ equivalent ) @ ( N @ ( O @ equivalent ) @ equivalent ) @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(273,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= ( B @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[252]) ).
thf(6405,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[702,185]) ).
thf(6406,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[6405]) ).
thf(6407,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[6406:[bind(A,$thf( S @ ( S @ equivalent ) )),bind(B,$thf( T )),bind(C,$thf( W @ ( W @ equivalent ) )),bind(D,$thf( Y )),bind(E,$thf( Y @ ( Y @ equivalent ) @ ( W @ ( W @ equivalent ) @ ( T @ equivalent ) @ ( S @ ( S @ equivalent ) @ ( T @ equivalent ) @ equivalent ) @ equivalent ) )),bind(F,$thf( W )),bind(G,$thf( S ))]]) ).
thf(6580,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ ( C @ equivalent ) @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[6407]) ).
thf(213,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true
| ~ ( D @ ( C @ equivalent ) @ is_a_theorem )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[188,9]) ).
thf(214,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( B @ equivalent ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ ( D @ ( C @ equivalent ) @ is_a_theorem )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[213]) ).
thf(215,plain,
! [C: $i,B: $i,A: $i] :
( ( B @ is_a_theorem )
| ~ ( B @ ( C @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[214:[bind(A,$thf( A )),bind(B,$thf( F )),bind(C,$thf( F @ ( F @ equivalent ) )),bind(D,$thf( D ))]]) ).
thf(239,plain,
! [C: $i,B: $i,A: $i] :
( ( B @ is_a_theorem )
| ~ ( B @ ( C @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ ( A @ ( A @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[215]) ).
thf(256,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) )
!= D )
| ~ $true
| ( E @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[10,44]) ).
thf(257,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( E @ ( D @ equivalent ) )
!= D )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[256]) ).
thf(258,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) )
!= ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) ) )
| ( A @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[257:[bind(A,$thf( M )),bind(B,$thf( O )),bind(C,$thf( N )),bind(D,$thf( M @ ( O @ ( N @ equivalent ) @ equivalent ) @ ( N @ ( O @ equivalent ) @ equivalent ) @ ( M @ equivalent ) )),bind(E,$thf( E ))]]) ).
thf(268,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) @ equivalent ) )
!= ( B @ ( D @ ( C @ equivalent ) @ equivalent ) @ ( C @ ( D @ equivalent ) @ equivalent ) @ ( B @ equivalent ) ) )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[258]) ).
thf(13614,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[13502,47]) ).
thf(13615,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( F @ ( D @ equivalent ) @ is_a_theorem ) )
| ( F @ ( E @ equivalent ) @ ( D @ ( E @ equivalent ) @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[13614]) ).
thf(13616,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[13615:[bind(A,$thf( K )),bind(B,$thf( M )),bind(C,$thf( N )),bind(D,$thf( N @ ( K @ equivalent ) @ ( M @ ( K @ equivalent ) @ equivalent ) )),bind(E,$thf( E )),bind(F,$thf( N @ ( M @ equivalent ) ))]]) ).
thf(13657,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( C @ equivalent ) @ ( A @ equivalent ) @ ( D @ ( B @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[13616]) ).
thf(3435,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[3245,7]) ).
thf(3436,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) @ is_a_theorem )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[3435]) ).
thf(3506,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= ( e @ ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) )
| ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[3436]) ).
thf(2651,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ equivalent ) )
!= e )
| ( ( A @ ( A @ equivalent ) @ ( B @ equivalent ) )
!= ( e @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) ) ) ),
inference(simp,[status(thm)],[1231]) ).
thf(399,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ ( E @ ( G @ ( F @ equivalent ) @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[133,46]) ).
thf(400,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( E @ ( E @ ( G @ ( F @ equivalent ) @ equivalent ) @ ( F @ ( G @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[399]) ).
thf(401,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[400:[bind(A,$thf( Y )),bind(B,$thf( Y @ ( ZA @ ( Z @ equivalent ) @ equivalent ) @ ( Z @ ( ZA @ equivalent ) @ equivalent ) )),bind(C,$thf( ZC )),bind(D,$thf( ZC @ ( ZC @ equivalent ) @ ( Y @ ( ZA @ ( Z @ equivalent ) @ equivalent ) @ ( Z @ ( ZA @ equivalent ) @ equivalent ) @ ( Y @ equivalent ) @ equivalent ) )),bind(E,$thf( Y )),bind(F,$thf( Z )),bind(G,$thf( ZA ))]]) ).
thf(415,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( A @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[401]) ).
thf(7462,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[5210,185]) ).
thf(7463,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[7462]) ).
thf(7464,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[7463:[bind(A,$thf( S @ ( S @ equivalent ) )),bind(B,$thf( U @ ( U @ equivalent ) )),bind(C,$thf( V )),bind(D,$thf( Y )),bind(E,$thf( Y @ ( Y @ equivalent ) @ ( V @ equivalent ) @ ( U @ ( U @ equivalent ) @ ( S @ ( S @ equivalent ) @ equivalent ) @ ( V @ equivalent ) @ equivalent ) )),bind(F,$thf( U )),bind(G,$thf( S ))]]) ).
thf(7557,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( C @ equivalent ) @ ( B @ ( B @ equivalent ) @ ( A @ ( A @ equivalent ) @ equivalent ) @ ( C @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[7464]) ).
thf(11701,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[11688,185]) ).
thf(11702,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( A @ ( C @ equivalent ) @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( E @ ( G @ ( G @ equivalent ) @ ( F @ ( F @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ) )
| ( E @ is_a_theorem ) ),
inference(simp,[status(thm)],[11701]) ).
thf(11703,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( B @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[11702:[bind(A,$thf( Q @ ( Q @ equivalent ) )),bind(B,$thf( W @ ( W @ equivalent ) )),bind(C,$thf( U )),bind(D,$thf( Y )),bind(E,$thf( Y @ ( Y @ equivalent ) @ ( U @ ( W @ ( W @ equivalent ) @ equivalent ) @ equivalent ) @ ( Q @ ( Q @ equivalent ) @ ( U @ equivalent ) @ equivalent ) )),bind(F,$thf( Q )),bind(G,$thf( W ))]]) ).
thf(11826,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ equivalent ) @ ( B @ ( C @ ( C @ equivalent ) @ equivalent ) @ equivalent ) @ ( A @ ( A @ equivalent ) @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem ),
inference(simp,[status(thm)],[11703]) ).
thf(11902,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( E @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( E @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[11689,876]) ).
thf(11903,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( D @ ( D @ equivalent ) @ ( C @ ( B @ equivalent ) @ ( A @ equivalent ) @ equivalent ) @ ( B @ ( C @ equivalent ) @ equivalent ) @ ( A @ equivalent ) @ is_a_theorem )
!= ( E @ ( e @ equivalent ) @ is_a_theorem ) )
| ( ( E @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[11902]) ).
thf(11904,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( e @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ),
inference(pattern_uni,[status(thm)],[11903:[bind(A,$thf( e )),bind(B,$thf( N )),bind(C,$thf( O )),bind(D,$thf( Q )),bind(E,$thf( Q @ ( Q @ equivalent ) @ ( O @ ( N @ equivalent ) @ ( e @ equivalent ) @ equivalent ) @ ( N @ ( O @ equivalent ) @ equivalent ) ))]]) ).
thf(11935,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ ( e @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ),
inference(simp,[status(thm)],[11904]) ).
thf(276,plain,
! [B: $i,A: $i] :
( ( A != B )
| ( ( B @ ( B @ equivalent ) )
!= B )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[274]) ).
thf(277,plain,
! [A: $i] :
( ( ( A @ ( A @ equivalent ) )
!= A )
| ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[276]) ).
thf(10782,plain,
! [B: $i,A: $i] :
( ( B != c )
| ( B != b )
| ( A
!= ( c @ ( a @ equivalent ) ) )
| ( A
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[10779]) ).
thf(10814,plain,
( ( c != b )
| ( ( c @ ( a @ equivalent ) )
!= ( b @ ( a @ equivalent ) ) )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[10782]) ).
thf(10816,plain,
( ( c != b )
| ( c != b )
| ( a != a )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[10814]) ).
thf(10817,plain,
( ( c != b )
| ( ( c @ ( b @ equivalent ) @ ( c @ ( a @ equivalent ) @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) )
!= e ) ),
inference(simp,[status(thm)],[10816]) ).
thf(194,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( D @ equivalent ) @ is_a_theorem ) )
| ~ $true
| ( E @ ( E @ equivalent ) @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[133,188]) ).
thf(195,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) @ is_a_theorem )
!= ( D @ ( D @ equivalent ) @ is_a_theorem ) )
| ( E @ ( E @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[194]) ).
thf(232,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( C @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ ( A @ ( B @ equivalent ) @ equivalent ) )
!= ( D @ ( D @ equivalent ) ) )
| ( E @ ( E @ equivalent ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[195]) ).
thf(23918,plain,
$false,
inference(e,[status(thm)],[2295,3008,6712,333,4852,234,2280,1315,10812,11688,6587,3813,2659,15770,6830,10805,269,10,56,13623,4839,13640,17375,185,3088,4760,3809,565,14510,184,702,1313,3280,3089,4766,17386,460,157,6626,46,2301,78,2178,16534,5027,4733,2555,2281,132,133,243,6616,4842,5210,10801,9533,10779,15221,270,925,85,810,233,6,334,4375,1676,160,820,14222,275,21,13654,65,3349,329,1457,461,3105,650,3381,9,53,610,420,3001,1397,188,3102,1672,3010,6625,706,554,6593,4721,193,17360,1231,14509,457,3005,503,1991,6592,1616,2275,5230,45,161,601,191,3255,44,3272,118,875,4709,12,49,335,4854,704,3091,159,3352,8452,274,3270,2284,230,7,245,271,1307,10000,1603,552,1993,4731,66,3006,915,330,1820,758,12850,1177,1381,1396,6811,2550,3363,1250,3908,2069,3241,563,241,80,653,6838,1034,812,11689,342,1018,4722,1181,18,2298,48,4469,4754,3114,331,7662,2276,2656,50,3356,2279,14631,11,1617,43,876,231,14219,4698,1834,759,1448,4463,6829,2290,418,23,158,652,186,3104,55,114,13502,4705,4745,8,1030,8388,272,82,235,246,51,3100,1248,273,6580,239,268,79,13657,3506,2651,415,7557,341,11826,332,3245,47,15,11935,277,3096,10817,232,2655]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL105-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.13 % 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.25/5.71 % Computer : n013.cluster.edu
% 0.25/5.71 % Model : x86_64 x86_64
% 0.25/5.71 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.25/5.71 % Memory : 8046.5625MB
% 0.25/5.71 % OS : Linux 6.8.0-71-generic
% 0.25/5.71 % CPULimit : 300
% 0.25/5.71 % WCLimit : 300
% 0.25/5.71 % DateTime : Fri Sep 25 21:50:47 UTC 2026
% 0.25/5.72 % CPUTime :
% 0.25/5.72 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
% 1.40/6.57 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.93/6.83 % [INFO] Parsing done (260ms).
% 1.93/6.85 % [INFO] Running in sequential loop mode.
% 2.85/7.46 % [INFO] eprover registered as external prover.
% 2.85/7.47 % [INFO] Scanning for conjecture ...
% 3.23/7.60 % [INFO] Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ...
% 3.23/7.65 % [INFO] Axiom selection finished. Selected 4 axioms (removed 0 axioms).
% 3.23/7.67 % [INFO] Problem is propositional (TPTP CNF).
% 3.23/7.67 % [INFO] Type checking passed.
% 3.23/7.68 % [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 ...
% 143.89/39.78 % External prover 'e' found a proof!
% 143.89/39.78 % [INFO] Killing All external provers ...
% 143.89/39.78 % Time passed: 33860ms (effective reasoning time: 32921ms)
% 143.89/39.78 % Axioms used in derivation (4): q_1, q_2, q_3, condensed_detachment
% 143.89/39.78 % No. of inferences in proof: 787
% 143.89/39.79 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 33860 ms resp. 32921 ms w/o parsing
% 145.84/40.10 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 145.84/40.11 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------