%------------------------------------------------------------------------------
% File : Leo-III---1.7.19
% Problem : LCL467+1 : TPTP v9.2.0. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Oct 1 12:41:11 PM UTC 2025
% Result : Theorem 43.15s 10.79s
% Output : Refutation 43.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 42
% Syntax : Number of formulae : 147 ( 40 unt; 0 typ; 0 def)
% Number of atoms : 459 ( 82 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 1837 ( 147 ~; 145 |; 29 &;1422 @)
% ( 26 <=>; 68 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 49 ( 46 usr; 42 con; 0-2 aty)
% Number of variables : 407 ( 0 ^; 407 !; 0 ?; 407 :)
% Comments :
%------------------------------------------------------------------------------
thf(and_2_type,type,
and_2: $o ).
thf(op_or_type,type,
op_or: $o ).
thf(op_equiv_type,type,
op_equiv: $o ).
thf(substitution_of_equivalents_type,type,
substitution_of_equivalents: $o ).
thf(cn3_type,type,
cn3: $o ).
thf(cn1_type,type,
cn1: $o ).
thf(modus_ponens_type,type,
modus_ponens: $o ).
thf(or_type,type,
or: $i > $i > $i ).
thf(not_type,type,
not: $i > $i ).
thf(and_type,type,
and: $i > $i > $i ).
thf(op_implies_and_type,type,
op_implies_and: $o ).
thf(cn2_type,type,
cn2: $o ).
thf(modus_tollens_type,type,
modus_tollens: $o ).
thf(is_a_theorem_type,type,
is_a_theorem: $i > $o ).
thf(implies_type,type,
implies: $i > $i > $i ).
thf(kn2_type,type,
kn2: $o ).
thf(or_3_type,type,
or_3: $o ).
thf(and_3_type,type,
and_3: $o ).
thf(r2_type,type,
r2: $o ).
thf(kn1_type,type,
kn1: $o ).
thf(implies_3_type,type,
implies_3: $o ).
thf(equivalence_2_type,type,
equivalence_2: $o ).
thf(equiv_type,type,
equiv: $i > $i > $i ).
thf(and_1_type,type,
and_1: $o ).
thf(implies_2_type,type,
implies_2: $o ).
thf(r1_type,type,
r1: $o ).
thf(r3_type,type,
r3: $o ).
thf(op_implies_or_type,type,
op_implies_or: $o ).
thf(equivalence_3_type,type,
equivalence_3: $o ).
thf(equivalence_1_type,type,
equivalence_1: $o ).
thf(implies_1_type,type,
implies_1: $o ).
thf(or_2_type,type,
or_2: $o ).
thf(kn3_type,type,
kn3: $o ).
thf(or_1_type,type,
or_1: $o ).
thf(r4_type,type,
r4: $o ).
thf(op_and_type,type,
op_and: $o ).
thf(r5_type,type,
r5: $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(sk4_type,type,
sk4: $i ).
thf(sk10_type,type,
sk10: $i ).
thf(sk11_type,type,
sk11: $i ).
thf(sk12_type,type,
sk12: $i ).
thf(sk18_type,type,
sk18: $i ).
thf(sk19_type,type,
sk19: $i ).
thf(10,axiom,
( op_or
=> ! [A: $i,B: $i] :
( ( or @ A @ B )
= ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_or) ).
thf(52,plain,
( op_or
=> ! [A: $i,B: $i] :
( ( or @ A @ B )
= ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(18,axiom,
( r2
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ B @ ( or @ A @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r2) ).
thf(70,plain,
( ( r2
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ B @ ( or @ A @ B ) ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ B @ ( or @ A @ B ) ) )
=> r2 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).
thf(26,axiom,
( r3
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( or @ A @ B ) @ ( or @ B @ A ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r3) ).
thf(97,plain,
( ( r3
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( or @ A @ B ) @ ( or @ B @ A ) ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( or @ A @ B ) @ ( or @ B @ A ) ) )
=> r3 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[26]) ).
thf(40,axiom,
( op_and
=> ! [A: $i,B: $i] :
( ( and @ A @ B )
= ( not @ ( or @ ( not @ A ) @ ( not @ B ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_and) ).
thf(141,plain,
( op_and
=> ! [A: $i,B: $i] :
( ( and @ A @ B )
= ( not @ ( or @ ( not @ A ) @ ( not @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[40]) ).
thf(36,axiom,
( or_2
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ B @ ( or @ A @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',or_2) ).
thf(129,plain,
( ( or_2
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ B @ ( or @ A @ B ) ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ B @ ( or @ A @ B ) ) )
=> or_2 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[36]) ).
thf(38,axiom,
( or_1
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ A @ ( or @ A @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',or_1) ).
thf(135,plain,
( ( or_1
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ A @ ( or @ A @ B ) ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ A @ ( or @ A @ B ) ) )
=> or_1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[38]) ).
thf(34,axiom,
( op_equiv
=> ! [A: $i,B: $i] :
( ( equiv @ A @ B )
= ( and @ ( implies @ A @ B ) @ ( implies @ B @ A ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_equiv) ).
thf(123,plain,
( op_equiv
=> ! [A: $i,B: $i] :
( ( equiv @ A @ B )
= ( and @ ( implies @ A @ B ) @ ( implies @ B @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[34]) ).
thf(9,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_modus_ponens) ).
thf(51,plain,
modus_ponens,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(39,axiom,
( r4
<=> ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( or @ A @ ( or @ B @ C ) ) @ ( or @ B @ ( or @ A @ C ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r4) ).
thf(138,plain,
( ( r4
=> ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( or @ A @ ( or @ B @ C ) ) @ ( or @ B @ ( or @ A @ C ) ) ) ) )
& ( ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( or @ A @ ( or @ B @ C ) ) @ ( or @ B @ ( or @ A @ C ) ) ) )
=> r4 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[39]) ).
thf(24,axiom,
( r1
<=> ! [A: $i] : ( is_a_theorem @ ( implies @ ( or @ A @ A ) @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r1) ).
thf(88,plain,
( ( r1
=> ! [A: $i] : ( is_a_theorem @ ( implies @ ( or @ A @ A ) @ A ) ) )
& ( ! [A: $i] : ( is_a_theorem @ ( implies @ ( or @ A @ A ) @ A ) )
=> r1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[24]) ).
thf(25,axiom,
( substitution_of_equivalents
<=> ! [A: $i,B: $i] :
( ( is_a_theorem @ ( equiv @ A @ B ) )
=> ( A = B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution_of_equivalents) ).
thf(91,plain,
( ( substitution_of_equivalents
=> ! [A: $i,B: $i] :
( ( is_a_theorem @ ( equiv @ A @ B ) )
=> ( A = B ) ) )
& ( ! [A: $i,B: $i] :
( ( is_a_theorem @ ( equiv @ A @ B ) )
=> ( A = B ) )
=> substitution_of_equivalents ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[25]) ).
thf(94,plain,
! [B: $i,A: $i] :
( ~ substitution_of_equivalents
| ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ( A = B ) ),
inference(cnf,[status(esa)],[91]) ).
thf(96,plain,
! [B: $i,A: $i] :
( ( A = B )
| ~ substitution_of_equivalents
| ~ ( is_a_theorem @ ( equiv @ A @ B ) ) ),
inference(lifteq,[status(thm)],[94]) ).
thf(6,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',use_substitution_of_equivalents) ).
thf(48,plain,
substitution_of_equivalents,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(169,plain,
! [B: $i,A: $i] :
( ( A = B )
| ~ $true
| ~ ( is_a_theorem @ ( equiv @ A @ B ) ) ),
inference(rewrite,[status(thm)],[96,48]) ).
thf(170,plain,
! [B: $i,A: $i] :
( ( A = B )
| ~ ( is_a_theorem @ ( equiv @ A @ B ) ) ),
inference(simp,[status(thm)],[169]) ).
thf(33,axiom,
( cn1
<=> ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ B @ C ) @ ( implies @ A @ C ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn1) ).
thf(120,plain,
( ( cn1
=> ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ B @ C ) @ ( implies @ A @ C ) ) ) ) )
& ( ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ B @ C ) @ ( implies @ A @ C ) ) ) )
=> cn1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[33]) ).
thf(53,plain,
! [B: $i,A: $i] :
( ~ op_or
| ( ( or @ A @ B )
= ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) ) ),
inference(cnf,[status(esa)],[52]) ).
thf(54,plain,
! [B: $i,A: $i] :
( ( ( or @ A @ B )
= ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) )
| ~ op_or ),
inference(lifteq,[status(thm)],[53]) ).
thf(3,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_op_or) ).
thf(45,plain,
op_or,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(186,plain,
! [B: $i,A: $i] :
( ( ( or @ A @ B )
= ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) )
| ~ $true ),
inference(rewrite,[status(thm)],[54,45]) ).
thf(187,plain,
! [B: $i,A: $i] :
( ( or @ A @ B )
= ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) ),
inference(simp,[status(thm)],[186]) ).
thf(208,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( not @ ( and @ ( or @ A @ B ) @ ( not @ D ) ) )
= ( or @ C @ D ) )
| ( ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) )
!= ( not @ C ) ) ),
inference(paramod_ordered,[status(thm)],[187,187]) ).
thf(209,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( or @ B @ C ) @ ( not @ A ) ) )
= ( or @ ( and @ ( not @ B ) @ ( not @ C ) ) @ A ) ),
inference(pattern_uni,[status(thm)],[208:[bind(A,$thf( G )),bind(B,$thf( H )),bind(C,$thf( and @ ( not @ G ) @ ( not @ H ) )),bind(D,$thf( D ))]]) ).
thf(220,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( or @ B @ C ) @ ( not @ A ) ) )
= ( or @ ( and @ ( not @ B ) @ ( not @ C ) ) @ A ) ),
inference(simp,[status(thm)],[209]) ).
thf(271,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( not @ ( and @ ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) @ ( not @ C ) ) )
= ( or @ ( and @ ( not @ D ) @ ( not @ E ) ) @ C ) )
| ( ( or @ A @ B )
!= ( or @ D @ E ) ) ),
inference(paramod_ordered,[status(thm)],[187,220]) ).
thf(272,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) @ ( not @ C ) ) )
= ( or @ ( and @ ( not @ A ) @ ( not @ B ) ) @ C ) ),
inference(pattern_uni,[status(thm)],[271:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( A )),bind(E,$thf( B ))]]) ).
thf(510,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( not @ ( and @ ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) @ ( not @ C ) ) )
= ( not @ ( and @ ( or @ E @ F ) @ ( not @ D ) ) ) )
| ( ( or @ ( and @ ( not @ A ) @ ( not @ B ) ) @ C )
!= ( or @ ( and @ ( not @ E ) @ ( not @ F ) ) @ D ) ) ),
inference(paramod_ordered,[status(thm)],[272,220]) ).
thf(511,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) @ ( not @ C ) ) )
= ( not @ ( and @ ( or @ A @ B ) @ ( not @ C ) ) ) ),
inference(pattern_uni,[status(thm)],[510:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( C )),bind(E,$thf( A )),bind(F,$thf( B ))]]) ).
thf(12,axiom,
cn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).
thf(56,plain,
cn2,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(27,axiom,
( modus_ponens
<=> ! [A: $i,B: $i] :
( ( ( is_a_theorem @ A )
& ( is_a_theorem @ ( implies @ A @ B ) ) )
=> ( is_a_theorem @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
thf(100,plain,
( ( modus_ponens
=> ! [A: $i,B: $i] :
( ( ( is_a_theorem @ A )
& ( is_a_theorem @ ( implies @ A @ B ) ) )
=> ( is_a_theorem @ B ) ) )
& ( ! [A: $i,B: $i] :
( ( ( is_a_theorem @ A )
& ( is_a_theorem @ ( implies @ A @ B ) ) )
=> ( is_a_theorem @ B ) )
=> modus_ponens ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[27]) ).
thf(104,plain,
! [B: $i,A: $i] :
( ~ modus_ponens
| ~ ( is_a_theorem @ A )
| ~ ( is_a_theorem @ ( implies @ A @ B ) )
| ( is_a_theorem @ B ) ),
inference(cnf,[status(esa)],[100]) ).
thf(154,plain,
! [B: $i,A: $i] :
( ~ modus_ponens
| ~ ( is_a_theorem @ A )
| ( is_a_theorem @ B )
| ( ( is_a_theorem @ ( implies @ A @ B ) )
!= ( is_a_theorem @ A ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[104]) ).
thf(155,plain,
! [B: $i,A: $i] :
( ( is_a_theorem @ B )
| ~ modus_ponens
| ~ ( is_a_theorem @ A )
| ( ( is_a_theorem @ ( implies @ A @ B ) )
!= ( is_a_theorem @ A ) ) ),
inference(simp,[status(thm)],[154]) ).
thf(163,plain,
! [B: $i,A: $i] :
( ( is_a_theorem @ B )
| ~ $true
| ~ ( is_a_theorem @ A )
| ( ( is_a_theorem @ ( implies @ A @ B ) )
!= ( is_a_theorem @ A ) ) ),
inference(rewrite,[status(thm)],[155,51]) ).
thf(164,plain,
! [B: $i,A: $i] :
( ( is_a_theorem @ B )
| ~ ( is_a_theorem @ A )
| ( ( is_a_theorem @ ( implies @ A @ B ) )
!= ( is_a_theorem @ A ) ) ),
inference(simp,[status(thm)],[163]) ).
thf(175,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ( is_a_theorem @ D )
| ~ ( is_a_theorem @ C )
| ( ( is_a_theorem @ B )
!= ( is_a_theorem @ C ) )
| ( A
!= ( implies @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[170,164]) ).
thf(176,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( implies @ B @ C ) @ A ) )
| ( is_a_theorem @ C )
| ~ ( is_a_theorem @ B )
| ( ( is_a_theorem @ A )
!= ( is_a_theorem @ B ) ) ),
inference(pattern_uni,[status(thm)],[175:[bind(A,$thf( implies @ E @ F )),bind(B,$thf( B )),bind(C,$thf( E )),bind(D,$thf( F ))]]) ).
thf(179,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( implies @ B @ C ) @ A ) )
| ( is_a_theorem @ C )
| ~ ( is_a_theorem @ B )
| ( ( is_a_theorem @ A )
!= ( is_a_theorem @ B ) ) ),
inference(simp,[status(thm)],[176]) ).
thf(819,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ~ ( is_a_theorem @ ( equiv @ B @ C ) )
| ( is_a_theorem @ E )
| ~ ( is_a_theorem @ D )
| ( ( is_a_theorem @ C )
!= ( is_a_theorem @ D ) )
| ( A
!= ( implies @ D @ E ) ) ),
inference(paramod_ordered,[status(thm)],[170,179]) ).
thf(820,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( implies @ C @ D ) @ A ) )
| ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ( is_a_theorem @ D )
| ~ ( is_a_theorem @ C )
| ( ( is_a_theorem @ B )
!= ( is_a_theorem @ C ) ) ),
inference(pattern_uni,[status(thm)],[819:[bind(A,$thf( implies @ F @ G )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( F )),bind(E,$thf( G ))]]) ).
thf(834,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( implies @ C @ D ) @ A ) )
| ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ( is_a_theorem @ D )
| ~ ( is_a_theorem @ C )
| ( ( is_a_theorem @ B )
!= ( is_a_theorem @ C ) ) ),
inference(simp,[status(thm)],[820]) ).
thf(845,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ~ ( is_a_theorem @ ( equiv @ B @ C ) )
| ~ ( is_a_theorem @ ( equiv @ C @ D ) )
| ( is_a_theorem @ F )
| ~ ( is_a_theorem @ E )
| ( ( is_a_theorem @ D )
!= ( is_a_theorem @ E ) )
| ( A
!= ( implies @ E @ F ) ) ),
inference(paramod_ordered,[status(thm)],[170,834]) ).
thf(846,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( implies @ D @ E ) @ A ) )
| ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ~ ( is_a_theorem @ ( equiv @ B @ C ) )
| ( is_a_theorem @ E )
| ~ ( is_a_theorem @ D )
| ( ( is_a_theorem @ C )
!= ( is_a_theorem @ D ) ) ),
inference(pattern_uni,[status(thm)],[845:[bind(A,$thf( implies @ G @ H )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( D )),bind(E,$thf( G )),bind(F,$thf( H ))]]) ).
thf(871,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( implies @ D @ E ) @ A ) )
| ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ~ ( is_a_theorem @ ( equiv @ B @ C ) )
| ( is_a_theorem @ E )
| ~ ( is_a_theorem @ D )
| ( ( is_a_theorem @ C )
!= ( is_a_theorem @ D ) ) ),
inference(simp,[status(thm)],[846]) ).
thf(1999,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ~ ( is_a_theorem @ B )
| ~ ( is_a_theorem @ ( equiv @ C @ D ) )
| ~ ( is_a_theorem @ ( equiv @ D @ E ) )
| ( is_a_theorem @ G )
| ~ ( is_a_theorem @ F )
| ( ( is_a_theorem @ E )
!= ( is_a_theorem @ F ) )
| ( A
!= ( equiv @ ( implies @ F @ G ) @ C ) ) ),
inference(paramod_ordered,[status(thm)],[170,871]) ).
thf(2000,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( equiv @ ( implies @ E @ F ) @ D ) @ A ) )
| ~ ( is_a_theorem @ A )
| ~ ( is_a_theorem @ ( equiv @ D @ B ) )
| ~ ( is_a_theorem @ ( equiv @ B @ C ) )
| ( is_a_theorem @ F )
| ~ ( is_a_theorem @ E )
| ( ( is_a_theorem @ C )
!= ( is_a_theorem @ E ) ) ),
inference(pattern_uni,[status(thm)],[1999:[bind(A,$thf( equiv @ ( implies @ J @ K ) @ I )),bind(B,$thf( B )),bind(C,$thf( I )),bind(D,$thf( D )),bind(E,$thf( E )),bind(F,$thf( J )),bind(G,$thf( K ))]]) ).
thf(2042,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( equiv @ ( implies @ E @ F ) @ D ) @ A ) )
| ~ ( is_a_theorem @ A )
| ~ ( is_a_theorem @ ( equiv @ D @ B ) )
| ~ ( is_a_theorem @ ( equiv @ B @ C ) )
| ( is_a_theorem @ F )
| ~ ( is_a_theorem @ E )
| ( ( is_a_theorem @ C )
!= ( is_a_theorem @ E ) ) ),
inference(simp,[status(thm)],[2000]) ).
thf(4,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
thf(46,plain,
op_or,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(13,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_op_equiv) ).
thf(57,plain,
op_equiv,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(210,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( not @ ( and @ ( not @ C ) @ ( or @ A @ B ) ) )
= ( or @ C @ D ) )
| ( ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) )
!= ( not @ D ) ) ),
inference(paramod_ordered,[status(thm)],[187,187]) ).
thf(211,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( not @ A ) @ ( or @ B @ C ) ) )
= ( or @ A @ ( and @ ( not @ B ) @ ( not @ C ) ) ) ),
inference(pattern_uni,[status(thm)],[210:[bind(A,$thf( G )),bind(B,$thf( H )),bind(C,$thf( C )),bind(D,$thf( and @ ( not @ G ) @ ( not @ H ) ))]]) ).
thf(221,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( not @ A ) @ ( or @ B @ C ) ) )
= ( or @ A @ ( and @ ( not @ B ) @ ( not @ C ) ) ) ),
inference(simp,[status(thm)],[211]) ).
thf(380,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( not @ ( and @ ( not @ C ) @ ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) ) )
= ( or @ C @ ( and @ ( not @ D ) @ ( not @ E ) ) ) )
| ( ( or @ A @ B )
!= ( or @ D @ E ) ) ),
inference(paramod_ordered,[status(thm)],[187,221]) ).
thf(381,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( not @ C ) @ ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) ) )
= ( or @ C @ ( and @ ( not @ A ) @ ( not @ B ) ) ) ),
inference(pattern_uni,[status(thm)],[380:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( A )),bind(E,$thf( B ))]]) ).
thf(1419,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( not @ ( and @ ( not @ E ) @ ( or @ A @ B ) ) )
= ( or @ E @ ( and @ ( not @ C ) @ ( not @ D ) ) ) )
| ( ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) )
!= ( not @ ( and @ ( not @ C ) @ ( not @ D ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[187,381]) ).
thf(1420,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( not @ C ) @ ( or @ A @ B ) ) )
= ( or @ C @ ( and @ ( not @ A ) @ ( not @ B ) ) ) ),
inference(pattern_uni,[status(thm)],[1419:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A )),bind(D,$thf( B ))]]) ).
thf(1632,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( not @ C ) @ ( or @ A @ B ) ) )
= ( or @ C @ ( and @ ( not @ A ) @ ( not @ B ) ) ) ),
inference(simp,[status(thm)],[1420]) ).
thf(42,axiom,
( op_implies_and
=> ! [A: $i,B: $i] :
( ( implies @ A @ B )
= ( not @ ( and @ A @ ( not @ B ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_and) ).
thf(147,plain,
( op_implies_and
=> ! [A: $i,B: $i] :
( ( implies @ A @ B )
= ( not @ ( and @ A @ ( not @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[42]) ).
thf(15,axiom,
( kn2
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( and @ A @ B ) @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn2) ).
thf(61,plain,
( ( kn2
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( and @ A @ B ) @ A ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( and @ A @ B ) @ A ) )
=> kn2 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(37,axiom,
( kn3
<=> ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( not @ ( and @ B @ C ) ) @ ( not @ ( and @ C @ A ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn3) ).
thf(132,plain,
( ( kn3
=> ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( not @ ( and @ B @ C ) ) @ ( not @ ( and @ C @ A ) ) ) ) ) )
& ( ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( not @ ( and @ B @ C ) ) @ ( not @ ( and @ C @ A ) ) ) ) )
=> kn3 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[37]) ).
thf(378,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( not @ ( and @ ( not @ A ) @ ( or @ B @ C ) ) )
= ( not @ ( and @ ( not @ D ) @ ( not @ E ) ) ) )
| ( ( or @ A @ ( and @ ( not @ B ) @ ( not @ C ) ) )
!= ( or @ D @ E ) ) ),
inference(paramod_ordered,[status(thm)],[221,187]) ).
thf(379,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( not @ A ) @ ( or @ B @ C ) ) )
= ( not @ ( and @ ( not @ A ) @ ( not @ ( and @ ( not @ B ) @ ( not @ C ) ) ) ) ) ),
inference(pattern_uni,[status(thm)],[378:[bind(A,$thf( A )),bind(B,$thf( H )),bind(C,$thf( I )),bind(D,$thf( A )),bind(E,$thf( and @ ( not @ H ) @ ( not @ I ) ))]]) ).
thf(428,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( not @ A ) @ ( or @ B @ C ) ) )
= ( not @ ( and @ ( not @ A ) @ ( not @ ( and @ ( not @ B ) @ ( not @ C ) ) ) ) ) ),
inference(simp,[status(thm)],[379]) ).
thf(19,axiom,
( kn1
<=> ! [A: $i] : ( is_a_theorem @ ( implies @ A @ ( and @ A @ A ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn1) ).
thf(73,plain,
( ( kn1
=> ! [A: $i] : ( is_a_theorem @ ( implies @ A @ ( and @ A @ A ) ) ) )
& ( ! [A: $i] : ( is_a_theorem @ ( implies @ A @ ( and @ A @ A ) ) )
=> kn1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[19]) ).
thf(74,plain,
( ~ ( is_a_theorem @ ( implies @ sk12 @ ( and @ sk12 @ sk12 ) ) )
| kn1 ),
inference(cnf,[status(esa)],[73]) ).
thf(23,axiom,
( implies_2
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ ( implies @ A @ B ) ) @ ( implies @ A @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_2) ).
thf(85,plain,
( ( implies_2
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ ( implies @ A @ B ) ) @ ( implies @ A @ B ) ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ ( implies @ A @ B ) ) @ ( implies @ A @ B ) ) )
=> implies_2 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[23]) ).
thf(14,axiom,
( modus_tollens
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( not @ B ) @ ( not @ A ) ) @ ( implies @ A @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_tollens) ).
thf(58,plain,
( ( modus_tollens
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( not @ B ) @ ( not @ A ) ) @ ( implies @ A @ B ) ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( not @ B ) @ ( not @ A ) ) @ ( implies @ A @ B ) ) )
=> modus_tollens ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(60,plain,
! [B: $i,A: $i] :
( ~ modus_tollens
| ( is_a_theorem @ ( implies @ ( implies @ ( not @ B ) @ ( not @ A ) ) @ ( implies @ A @ B ) ) ) ),
inference(cnf,[status(esa)],[58]) ).
thf(32,axiom,
( implies_1
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ B @ A ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_1) ).
thf(117,plain,
( ( implies_1
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ B @ A ) ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ B @ A ) ) )
=> implies_1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[32]) ).
thf(28,axiom,
( op_implies_or
=> ! [A: $i,B: $i] :
( ( implies @ A @ B )
= ( or @ ( not @ A ) @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_or) ).
thf(105,plain,
( op_implies_or
=> ! [A: $i,B: $i] :
( ( implies @ A @ B )
= ( or @ ( not @ A ) @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[28]) ).
thf(2056,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ~ ( is_a_theorem @ B )
| ~ ( is_a_theorem @ C )
| ~ ( is_a_theorem @ ( equiv @ F @ D ) )
| ~ ( is_a_theorem @ ( equiv @ D @ E ) )
| ( is_a_theorem @ H )
| ~ ( is_a_theorem @ G )
| ( ( is_a_theorem @ E )
!= ( is_a_theorem @ G ) )
| ( A
!= ( equiv @ ( equiv @ ( implies @ G @ H ) @ F ) @ C ) ) ),
inference(paramod_ordered,[status(thm)],[170,2042]) ).
thf(2057,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( equiv @ ( equiv @ ( implies @ F @ G ) @ E ) @ D ) @ A ) )
| ~ ( is_a_theorem @ A )
| ~ ( is_a_theorem @ D )
| ~ ( is_a_theorem @ ( equiv @ E @ B ) )
| ~ ( is_a_theorem @ ( equiv @ B @ C ) )
| ( is_a_theorem @ G )
| ~ ( is_a_theorem @ F )
| ( ( is_a_theorem @ C )
!= ( is_a_theorem @ F ) ) ),
inference(pattern_uni,[status(thm)],[2056:[bind(A,$thf( equiv @ ( equiv @ ( implies @ M @ N ) @ L ) @ J )),bind(B,$thf( B )),bind(C,$thf( J )),bind(D,$thf( D )),bind(E,$thf( E )),bind(F,$thf( L )),bind(G,$thf( M )),bind(H,$thf( N ))]]) ).
thf(2111,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( equiv @ ( equiv @ ( implies @ F @ G ) @ E ) @ D ) @ A ) )
| ~ ( is_a_theorem @ A )
| ~ ( is_a_theorem @ D )
| ~ ( is_a_theorem @ ( equiv @ E @ B ) )
| ~ ( is_a_theorem @ ( equiv @ B @ C ) )
| ( is_a_theorem @ G )
| ~ ( is_a_theorem @ F )
| ( ( is_a_theorem @ C )
!= ( is_a_theorem @ F ) ) ),
inference(simp,[status(thm)],[2057]) ).
thf(3498,plain,
! [I: $i,H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ~ ( is_a_theorem @ ( equiv @ B @ C ) )
| ~ ( is_a_theorem @ C )
| ~ ( is_a_theorem @ F )
| ~ ( is_a_theorem @ ( equiv @ G @ D ) )
| ~ ( is_a_theorem @ ( equiv @ D @ E ) )
| ( is_a_theorem @ I )
| ~ ( is_a_theorem @ H )
| ( ( is_a_theorem @ E )
!= ( is_a_theorem @ H ) )
| ( A
!= ( equiv @ ( equiv @ ( implies @ H @ I ) @ G ) @ F ) ) ),
inference(paramod_ordered,[status(thm)],[170,2111]) ).
thf(3499,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( equiv @ ( equiv @ ( implies @ G @ H ) @ F ) @ E ) @ A ) )
| ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ~ ( is_a_theorem @ B )
| ~ ( is_a_theorem @ E )
| ~ ( is_a_theorem @ ( equiv @ F @ C ) )
| ~ ( is_a_theorem @ ( equiv @ C @ D ) )
| ( is_a_theorem @ H )
| ~ ( is_a_theorem @ G )
| ( ( is_a_theorem @ D )
!= ( is_a_theorem @ G ) ) ),
inference(pattern_uni,[status(thm)],[3498:[bind(A,$thf( equiv @ ( equiv @ ( implies @ N @ O ) @ M ) @ K )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( D )),bind(E,$thf( E )),bind(F,$thf( K )),bind(G,$thf( M )),bind(H,$thf( N )),bind(I,$thf( O ))]]) ).
thf(3592,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( equiv @ ( equiv @ ( implies @ G @ H ) @ F ) @ E ) @ A ) )
| ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ~ ( is_a_theorem @ B )
| ~ ( is_a_theorem @ E )
| ~ ( is_a_theorem @ ( equiv @ F @ C ) )
| ~ ( is_a_theorem @ ( equiv @ C @ D ) )
| ( is_a_theorem @ H )
| ~ ( is_a_theorem @ G )
| ( ( is_a_theorem @ D )
!= ( is_a_theorem @ G ) ) ),
inference(simp,[status(thm)],[3499]) ).
thf(16,axiom,
( or_3
<=> ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ C ) @ ( implies @ ( implies @ B @ C ) @ ( implies @ ( or @ A @ B ) @ C ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',or_3) ).
thf(64,plain,
( ( or_3
=> ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ C ) @ ( implies @ ( implies @ B @ C ) @ ( implies @ ( or @ A @ B ) @ C ) ) ) ) )
& ( ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ C ) @ ( implies @ ( implies @ B @ C ) @ ( implies @ ( or @ A @ B ) @ C ) ) ) )
=> or_3 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(1,conjecture,
and_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_2) ).
thf(2,negated_conjecture,
~ and_2,
inference(neg_conjecture,[status(cth)],[1]) ).
thf(44,plain,
~ and_2,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(59,plain,
( ~ ( is_a_theorem @ ( implies @ ( implies @ ( not @ sk2 ) @ ( not @ sk1 ) ) @ ( implies @ sk1 @ sk2 ) ) )
| modus_tollens ),
inference(cnf,[status(esa)],[58]) ).
thf(71,plain,
( ~ ( is_a_theorem @ ( implies @ sk11 @ ( or @ sk10 @ sk11 ) ) )
| r2 ),
inference(cnf,[status(esa)],[70]) ).
thf(41,axiom,
( r5
<=> ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ B @ C ) @ ( implies @ ( or @ A @ B ) @ ( or @ A @ C ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r5) ).
thf(144,plain,
( ( r5
=> ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ B @ C ) @ ( implies @ ( or @ A @ B ) @ ( or @ A @ C ) ) ) ) )
& ( ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ B @ C ) @ ( implies @ ( or @ A @ B ) @ ( or @ A @ C ) ) ) )
=> r5 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[41]) ).
thf(7,axiom,
cn3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn3) ).
thf(49,plain,
cn3,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(20,axiom,
( implies_3
<=> ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ B @ C ) @ ( implies @ A @ C ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_3) ).
thf(76,plain,
( ( implies_3
=> ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ B @ C ) @ ( implies @ A @ C ) ) ) ) )
& ( ! [A: $i,B: $i,C: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ B @ C ) @ ( implies @ A @ C ) ) ) )
=> implies_3 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[20]) ).
thf(29,axiom,
( equivalence_3
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ B @ A ) @ ( equiv @ A @ B ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalence_3) ).
thf(108,plain,
( ( equivalence_3
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ B @ A ) @ ( equiv @ A @ B ) ) ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ B @ A ) @ ( equiv @ A @ B ) ) ) )
=> equivalence_3 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[29]) ).
thf(43,axiom,
( and_2
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( and @ A @ B ) @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_2) ).
thf(150,plain,
( ( and_2
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( and @ A @ B ) @ B ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( and @ A @ B ) @ B ) )
=> and_2 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[43]) ).
thf(8,axiom,
cn1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn1) ).
thf(50,plain,
cn1,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(17,axiom,
( and_3
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ B @ ( and @ A @ B ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_3) ).
thf(67,plain,
( ( and_3
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ B @ ( and @ A @ B ) ) ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ B @ ( and @ A @ B ) ) ) )
=> and_3 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).
thf(11,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
thf(55,plain,
op_implies_and,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(31,axiom,
( equivalence_1
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( equiv @ A @ B ) @ ( implies @ A @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalence_1) ).
thf(114,plain,
( ( equivalence_1
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( equiv @ A @ B ) @ ( implies @ A @ B ) ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( equiv @ A @ B ) @ ( implies @ A @ B ) ) )
=> equivalence_1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[31]) ).
thf(22,axiom,
( and_1
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( and @ A @ B ) @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_1) ).
thf(82,plain,
( ( and_1
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( and @ A @ B ) @ A ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( and @ A @ B ) @ A ) )
=> and_1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[22]) ).
thf(269,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( not @ ( and @ ( or @ B @ C ) @ ( not @ A ) ) )
= ( not @ ( and @ ( not @ D ) @ ( not @ E ) ) ) )
| ( ( or @ ( and @ ( not @ B ) @ ( not @ C ) ) @ A )
!= ( or @ D @ E ) ) ),
inference(paramod_ordered,[status(thm)],[220,187]) ).
thf(270,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( or @ B @ C ) @ ( not @ A ) ) )
= ( not @ ( and @ ( not @ ( and @ ( not @ B ) @ ( not @ C ) ) ) @ ( not @ A ) ) ) ),
inference(pattern_uni,[status(thm)],[269:[bind(A,$thf( A )),bind(B,$thf( H )),bind(C,$thf( I )),bind(D,$thf( and @ ( not @ H ) @ ( not @ I ) )),bind(E,$thf( A ))]]) ).
thf(290,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( or @ B @ C ) @ ( not @ A ) ) )
= ( not @ ( and @ ( not @ ( and @ ( not @ B ) @ ( not @ C ) ) ) @ ( not @ A ) ) ) ),
inference(simp,[status(thm)],[270]) ).
thf(35,axiom,
( cn2
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ ( not @ A ) @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn2) ).
thf(126,plain,
( ( cn2
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ ( not @ A ) @ B ) ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ ( not @ A ) @ B ) ) )
=> cn2 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[35]) ).
thf(21,axiom,
( equivalence_2
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( equiv @ A @ B ) @ ( implies @ B @ A ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalence_2) ).
thf(79,plain,
( ( equivalence_2
=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( equiv @ A @ B ) @ ( implies @ B @ A ) ) ) )
& ( ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( equiv @ A @ B ) @ ( implies @ B @ A ) ) )
=> equivalence_2 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[21]) ).
thf(536,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( not @ ( and @ ( or @ A @ B ) @ ( not @ E ) ) )
= ( or @ ( and @ ( not @ C ) @ ( not @ D ) ) @ E ) )
| ( ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) )
!= ( not @ ( and @ ( not @ C ) @ ( not @ D ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[187,272]) ).
thf(537,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( or @ A @ B ) @ ( not @ C ) ) )
= ( or @ ( and @ ( not @ A ) @ ( not @ B ) ) @ C ) ),
inference(pattern_uni,[status(thm)],[536:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A )),bind(D,$thf( B ))]]) ).
thf(575,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( or @ A @ B ) @ ( not @ C ) ) )
= ( or @ ( and @ ( not @ A ) @ ( not @ B ) ) @ C ) ),
inference(simp,[status(thm)],[537]) ).
thf(5,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_equiv) ).
thf(47,plain,
op_equiv,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(62,plain,
( ~ ( is_a_theorem @ ( implies @ ( and @ sk3 @ sk4 ) @ sk3 ) )
| kn2 ),
inference(cnf,[status(esa)],[61]) ).
thf(30,axiom,
( cn3
<=> ! [A: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( not @ A ) @ A ) @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn3) ).
thf(111,plain,
( ( cn3
=> ! [A: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( not @ A ) @ A ) @ A ) ) )
& ( ! [A: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( not @ A ) @ A ) @ A ) )
=> cn3 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[30]) ).
thf(83,plain,
( ~ ( is_a_theorem @ ( implies @ ( and @ sk18 @ sk19 ) @ sk18 ) )
| and_1 ),
inference(cnf,[status(esa)],[82]) ).
thf(20553,plain,
$false,
inference(e,[status(thm)],[52,70,97,141,129,135,123,51,138,88,170,120,511,56,2042,46,57,164,179,1632,834,147,61,221,132,428,74,85,381,220,60,117,73,105,3592,45,64,44,59,71,144,49,187,76,2111,91,108,48,150,50,67,55,114,272,82,290,58,126,79,575,47,62,871,111,83,100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL467+1 : TPTP v9.2.0. Bugfixed v9.2.0.
% 0.00/0.12 % Command : run_Leo-III %s %d THM
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Sep 30 13:39:54 EDT 2025
% 0.11/0.32 % CPUTime :
% 0.99/0.90 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.31/1.05 % [INFO] Parsing done (145ms).
% 1.31/1.06 % [INFO] Running in sequential loop mode.
% 1.77/1.27 % [INFO] eprover registered as external prover.
% 1.77/1.28 % [INFO] Scanning for conjecture ...
% 2.04/1.33 % [INFO] Found a conjecture (or negated_conjecture) and 42 axioms. Running axiom selection ...
% 2.04/1.37 % [INFO] Axiom selection finished. Selected 41 axioms (removed 1 axioms).
% 2.28/1.42 % [INFO] Problem is first-order (TPTP FOF).
% 2.28/1.43 % [INFO] Type checking passed.
% 2.28/1.43 % [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 ...
% 43.15/10.79 % External prover 'e' found a proof!
% 43.15/10.79 % [INFO] Killing All external provers ...
% 43.15/10.79 % Time passed: 10281ms (effective reasoning time: 9726ms)
% 43.15/10.79 % Solved by 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)>
% 43.15/10.79 % Axioms used in derivation (41): or_3, and_1, equivalence_2, luka_op_or, cn1, op_equiv, kn1, implies_3, op_implies_and, cn3, luka_cn3, substitution_of_equivalents, luka_cn2, kn2, cn2, hilbert_op_implies_and, equivalence_3, modus_tollens, luka_cn1, op_and, luka_modus_ponens, r5, or_1, kn3, luka_op_equiv, and_3, use_substitution_of_equivalents, r4, modus_ponens, hilbert_op_or, r1, r2, equivalence_1, or_2, implies_1, r3, and_2, op_or, op_implies_or, hilbert_op_equiv, implies_2
% 43.15/10.79 % No. of inferences in proof: 147
% 43.15/10.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 10281 ms resp. 9726 ms w/o parsing
% 43.27/10.88 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 43.27/10.88 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------