%------------------------------------------------------------------------------
% File : Leo-III---1.7.19
% Problem : LCL508+1 : TPTP v9.2.0. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n027.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:15 PM UTC 2025
% Result : Theorem 33.18s 7.69s
% Output : Refutation 33.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 43
% Syntax : Number of formulae : 152 ( 43 unt; 0 typ; 0 def)
% Number of atoms : 466 ( 86 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 1864 ( 149 ~; 147 |; 29 &;1445 @)
% ( 26 <=>; 68 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 48 ( 45 usr; 41 con; 0-2 aty)
% Number of variables : 415 ( 0 ^; 415 !; 0 ?; 415 :)
% Comments :
%------------------------------------------------------------------------------
thf(and_3_type,type,
and_3: $o ).
thf(op_or_type,type,
op_or: $o ).
thf(kn2_type,type,
kn2: $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_equiv_type,type,
op_equiv: $o ).
thf(substitution_of_equivalents_type,type,
substitution_of_equivalents: $o ).
thf(op_implies_and_type,type,
op_implies_and: $o ).
thf(modus_ponens_type,type,
modus_ponens: $o ).
thf(kn3_type,type,
kn3: $o ).
thf(kn1_type,type,
kn1: $o ).
thf(equiv_type,type,
equiv: $i > $i > $i ).
thf(implies_type,type,
implies: $i > $i > $i ).
thf(and_2_type,type,
and_2: $o ).
thf(is_a_theorem_type,type,
is_a_theorem: $i > $o ).
thf(modus_tollens_type,type,
modus_tollens: $o ).
thf(r2_type,type,
r2: $o ).
thf(implies_3_type,type,
implies_3: $o ).
thf(equivalence_2_type,type,
equivalence_2: $o ).
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(cn3_type,type,
cn3: $o ).
thf(equivalence_1_type,type,
equivalence_1: $o ).
thf(implies_1_type,type,
implies_1: $o ).
thf(cn1_type,type,
cn1: $o ).
thf(or_3_type,type,
or_3: $o ).
thf(cn2_type,type,
cn2: $o ).
thf(or_2_type,type,
or_2: $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(sk7_type,type,
sk7: $i ).
thf(sk8_type,type,
sk8: $i ).
thf(sk15_type,type,
sk15: $i ).
thf(sk16_type,type,
sk16: $i ).
thf(11,axiom,
kn3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn3) ).
thf(56,plain,
kn3,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(32,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(116,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)],[32]) ).
thf(28,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(102,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)],[28]) ).
thf(106,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)],[102]) ).
thf(156,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)],[106]) ).
thf(157,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)],[156]) ).
thf(10,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_modus_ponens) ).
thf(55,plain,
modus_ponens,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(172,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)],[157,55]) ).
thf(173,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)],[172]) ).
thf(14,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_equiv) ).
thf(59,plain,
op_equiv,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(17,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(66,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)],[17]) ).
thf(67,plain,
( ~ ( is_a_theorem @ ( implies @ ( implies @ ( not @ sk4 ) @ ( not @ sk3 ) ) @ ( implies @ sk3 @ sk4 ) ) )
| modus_tollens ),
inference(cnf,[status(esa)],[66]) ).
thf(42,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(146,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)],[42]) ).
thf(18,axiom,
( kn2
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ ( and @ A @ B ) @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn2) ).
thf(69,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)],[18]) ).
thf(26,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(93,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)],[26]) ).
thf(96,plain,
! [B: $i,A: $i] :
( ~ substitution_of_equivalents
| ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ( A = B ) ),
inference(cnf,[status(esa)],[93]) ).
thf(98,plain,
! [B: $i,A: $i] :
( ( A = B )
| ~ substitution_of_equivalents
| ~ ( is_a_theorem @ ( equiv @ A @ B ) ) ),
inference(lifteq,[status(thm)],[96]) ).
thf(8,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',use_substitution_of_equivalents) ).
thf(53,plain,
substitution_of_equivalents,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(178,plain,
! [B: $i,A: $i] :
( ( A = B )
| ~ $true
| ~ ( is_a_theorem @ ( equiv @ A @ B ) ) ),
inference(rewrite,[status(thm)],[98,53]) ).
thf(179,plain,
! [B: $i,A: $i] :
( ( A = B )
| ~ ( is_a_theorem @ ( equiv @ A @ B ) ) ),
inference(simp,[status(thm)],[178]) ).
thf(204,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)],[179,173]) ).
thf(205,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)],[204:[bind(A,$thf( implies @ E @ F )),bind(B,$thf( B )),bind(C,$thf( E )),bind(D,$thf( F ))]]) ).
thf(214,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)],[205]) ).
thf(868,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)],[179,214]) ).
thf(869,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)],[868:[bind(A,$thf( implies @ F @ G )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( F )),bind(E,$thf( G ))]]) ).
thf(886,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)],[869]) ).
thf(897,plain,
! [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 @ F )
| ~ ( is_a_theorem @ E )
| ( ( is_a_theorem @ D )
!= ( is_a_theorem @ E ) )
| ( A
!= ( equiv @ ( implies @ E @ F ) @ C ) ) ),
inference(paramod_ordered,[status(thm)],[179,886]) ).
thf(898,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( equiv @ ( implies @ D @ E ) @ C ) @ A ) )
| ~ ( is_a_theorem @ A )
| ~ ( is_a_theorem @ ( equiv @ C @ B ) )
| ( is_a_theorem @ E )
| ~ ( is_a_theorem @ D )
| ( ( is_a_theorem @ B )
!= ( is_a_theorem @ D ) ) ),
inference(pattern_uni,[status(thm)],[897:[bind(A,$thf( equiv @ ( implies @ I @ J ) @ H )),bind(B,$thf( B )),bind(C,$thf( H )),bind(D,$thf( D )),bind(E,$thf( I )),bind(F,$thf( J ))]]) ).
thf(922,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( equiv @ ( implies @ D @ E ) @ C ) @ A ) )
| ~ ( is_a_theorem @ A )
| ~ ( is_a_theorem @ ( equiv @ C @ B ) )
| ( is_a_theorem @ E )
| ~ ( is_a_theorem @ D )
| ( ( is_a_theorem @ B )
!= ( is_a_theorem @ D ) ) ),
inference(simp,[status(thm)],[898]) ).
thf(1951,plain,
! [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 @ ( equiv @ E @ D ) )
| ( is_a_theorem @ G )
| ~ ( is_a_theorem @ F )
| ( ( is_a_theorem @ D )
!= ( is_a_theorem @ F ) )
| ( A
!= ( equiv @ ( implies @ F @ G ) @ E ) ) ),
inference(paramod_ordered,[status(thm)],[179,922]) ).
thf(1952,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 @ ( equiv @ A @ B ) )
| ~ ( is_a_theorem @ B )
| ~ ( is_a_theorem @ ( equiv @ D @ C ) )
| ( is_a_theorem @ F )
| ~ ( is_a_theorem @ E )
| ( ( is_a_theorem @ C )
!= ( is_a_theorem @ E ) ) ),
inference(pattern_uni,[status(thm)],[1951:[bind(A,$thf( equiv @ ( implies @ J @ K ) @ I )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( D )),bind(E,$thf( I )),bind(F,$thf( J )),bind(G,$thf( K ))]]) ).
thf(2001,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 @ ( equiv @ A @ B ) )
| ~ ( is_a_theorem @ B )
| ~ ( is_a_theorem @ ( equiv @ D @ C ) )
| ( is_a_theorem @ F )
| ~ ( is_a_theorem @ E )
| ( ( is_a_theorem @ C )
!= ( is_a_theorem @ E ) ) ),
inference(simp,[status(thm)],[1952]) ).
thf(2019,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 @ ( equiv @ B @ C ) )
| ~ ( is_a_theorem @ ( equiv @ C @ D ) )
| ~ ( is_a_theorem @ D )
| ~ ( is_a_theorem @ ( equiv @ F @ E ) )
| ( is_a_theorem @ H )
| ~ ( is_a_theorem @ G )
| ( ( is_a_theorem @ E )
!= ( is_a_theorem @ G ) )
| ( A
!= ( equiv @ ( implies @ G @ H ) @ F ) ) ),
inference(paramod_ordered,[status(thm)],[179,2001]) ).
thf(2020,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( equiv @ ( implies @ F @ G ) @ E ) @ A ) )
| ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ~ ( is_a_theorem @ ( equiv @ B @ C ) )
| ~ ( is_a_theorem @ C )
| ~ ( is_a_theorem @ ( equiv @ E @ D ) )
| ( is_a_theorem @ G )
| ~ ( is_a_theorem @ F )
| ( ( is_a_theorem @ D )
!= ( is_a_theorem @ F ) ) ),
inference(pattern_uni,[status(thm)],[2019:[bind(A,$thf( equiv @ ( implies @ K @ L ) @ J )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( D )),bind(E,$thf( E )),bind(F,$thf( J )),bind(G,$thf( K )),bind(H,$thf( L ))]]) ).
thf(2094,plain,
! [G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( equiv @ ( implies @ F @ G ) @ E ) @ A ) )
| ~ ( is_a_theorem @ ( equiv @ A @ B ) )
| ~ ( is_a_theorem @ ( equiv @ B @ C ) )
| ~ ( is_a_theorem @ C )
| ~ ( is_a_theorem @ ( equiv @ E @ D ) )
| ( is_a_theorem @ G )
| ~ ( is_a_theorem @ F )
| ( ( is_a_theorem @ D )
!= ( is_a_theorem @ F ) ) ),
inference(simp,[status(thm)],[2020]) ).
thf(7,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_equiv) ).
thf(52,plain,
op_equiv,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(30,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(110,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)],[30]) ).
thf(6,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(49,plain,
( op_or
=> ! [A: $i,B: $i] :
( ( or @ A @ B )
= ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(50,plain,
! [B: $i,A: $i] :
( ~ op_or
| ( ( or @ A @ B )
= ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) ) ),
inference(cnf,[status(esa)],[49]) ).
thf(51,plain,
! [B: $i,A: $i] :
( ( ( or @ A @ B )
= ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) )
| ~ op_or ),
inference(lifteq,[status(thm)],[50]) ).
thf(3,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_or) ).
thf(46,plain,
op_or,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(159,plain,
! [B: $i,A: $i] :
( ( ( or @ A @ B )
= ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) )
| ~ $true ),
inference(rewrite,[status(thm)],[51,46]) ).
thf(160,plain,
! [B: $i,A: $i] :
( ( or @ A @ B )
= ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) ),
inference(simp,[status(thm)],[159]) ).
thf(161,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)],[160,160]) ).
thf(162,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)],[161:[bind(A,$thf( G )),bind(B,$thf( H )),bind(C,$thf( C )),bind(D,$thf( and @ ( not @ G ) @ ( not @ H ) ))]]) ).
thf(165,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)],[162]) ).
thf(296,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)],[160,165]) ).
thf(297,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)],[296:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( A )),bind(E,$thf( B ))]]) ).
thf(532,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)],[160,297]) ).
thf(533,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)],[532:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A )),bind(D,$thf( B ))]]) ).
thf(619,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)],[533]) ).
thf(35,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(125,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)],[35]) ).
thf(44,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(152,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)],[44]) ).
thf(12,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
thf(57,plain,
op_implies_and,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(21,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(78,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)],[21]) ).
thf(23,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(84,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)],[23]) ).
thf(15,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(60,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)],[15]) ).
thf(85,plain,
( ~ ( is_a_theorem @ ( implies @ ( and @ sk15 @ sk16 ) @ sk15 ) )
| and_1 ),
inference(cnf,[status(esa)],[84]) ).
thf(39,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(137,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)],[39]) ).
thf(16,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(63,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)],[16]) ).
thf(65,plain,
! [B: $i,A: $i] :
( ~ and_2
| ( is_a_theorem @ ( implies @ ( and @ A @ B ) @ B ) ) ),
inference(cnf,[status(esa)],[63]) ).
thf(163,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)],[160,160]) ).
thf(164,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)],[163:[bind(A,$thf( G )),bind(B,$thf( H )),bind(C,$thf( and @ ( not @ G ) @ ( not @ H ) )),bind(D,$thf( D ))]]) ).
thf(166,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)],[164]) ).
thf(385,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)],[166,160]) ).
thf(386,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)],[385:[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(435,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)],[386]) ).
thf(387,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)],[160,166]) ).
thf(388,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)],[387:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( A )),bind(E,$thf( B ))]]) ).
thf(38,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(134,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)],[38]) ).
thf(19,axiom,
( r2
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ B @ ( or @ A @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r2) ).
thf(72,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)],[19]) ).
thf(73,plain,
( ~ ( is_a_theorem @ ( implies @ sk8 @ ( or @ sk7 @ sk8 ) ) )
| r2 ),
inference(cnf,[status(esa)],[72]) ).
thf(36,axiom,
( cn2
<=> ! [A: $i,B: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ ( not @ A ) @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn2) ).
thf(128,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)],[36]) ).
thf(1,conjecture,
and_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_3) ).
thf(2,negated_conjecture,
~ and_3,
inference(neg_conjecture,[status(cth)],[1]) ).
thf(45,plain,
~ and_3,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(64,plain,
( ~ ( is_a_theorem @ ( implies @ ( and @ sk1 @ sk2 ) @ sk2 ) )
| and_2 ),
inference(cnf,[status(esa)],[63]) ).
thf(43,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(149,plain,
( op_implies_and
=> ! [A: $i,B: $i] :
( ( implies @ A @ B )
= ( not @ ( and @ A @ ( not @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[43]) ).
thf(9,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_op_implies_and) ).
thf(54,plain,
op_implies_and,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(31,axiom,
( cn3
<=> ! [A: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( not @ A ) @ A ) @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn3) ).
thf(113,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)],[31]) ).
thf(22,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(81,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)],[22]) ).
thf(40,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(140,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)],[40]) ).
thf(1423,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)],[160,388]) ).
thf(1424,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)],[1423:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A )),bind(D,$thf( B ))]]) ).
thf(1594,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)],[1424]) ).
thf(61,plain,
! [B: $i,A: $i] :
( ~ op_equiv
| ( ( equiv @ A @ B )
= ( and @ ( implies @ A @ B ) @ ( implies @ B @ A ) ) ) ),
inference(cnf,[status(esa)],[60]) ).
thf(62,plain,
! [B: $i,A: $i] :
( ( ( equiv @ A @ B )
= ( and @ ( implies @ A @ B ) @ ( implies @ B @ A ) ) )
| ~ op_equiv ),
inference(lifteq,[status(thm)],[61]) ).
thf(225,plain,
! [B: $i,A: $i] :
( ( ( equiv @ A @ B )
= ( and @ ( implies @ A @ B ) @ ( implies @ B @ A ) ) )
| ~ $true ),
inference(rewrite,[status(thm)],[62,52]) ).
thf(226,plain,
! [B: $i,A: $i] :
( ( equiv @ A @ B )
= ( and @ ( implies @ A @ B ) @ ( implies @ B @ A ) ) ),
inference(simp,[status(thm)],[225]) ).
thf(5,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn2) ).
thf(48,plain,
kn2,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(41,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(143,plain,
( op_and
=> ! [A: $i,B: $i] :
( ( and @ A @ B )
= ( not @ ( or @ ( not @ A ) @ ( not @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[41]) ).
thf(3363,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 @ ( equiv @ B @ G ) @ C ) )
| ~ ( is_a_theorem @ ( equiv @ C @ D ) )
| ~ ( is_a_theorem @ ( equiv @ D @ E ) )
| ~ ( is_a_theorem @ E )
| ~ ( is_a_theorem @ ( equiv @ G @ F ) )
| ( is_a_theorem @ I )
| ~ ( is_a_theorem @ H )
| ( ( is_a_theorem @ F )
!= ( is_a_theorem @ H ) )
| ( A
!= ( implies @ H @ I ) ) ),
inference(paramod_ordered,[status(thm)],[179,2094]) ).
thf(3364,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( implies @ G @ H ) @ A ) )
| ~ ( is_a_theorem @ ( equiv @ ( equiv @ A @ F ) @ B ) )
| ~ ( is_a_theorem @ ( equiv @ B @ C ) )
| ~ ( is_a_theorem @ ( equiv @ C @ D ) )
| ~ ( is_a_theorem @ D )
| ~ ( is_a_theorem @ ( equiv @ F @ E ) )
| ( is_a_theorem @ H )
| ~ ( is_a_theorem @ G )
| ( ( is_a_theorem @ E )
!= ( is_a_theorem @ G ) ) ),
inference(pattern_uni,[status(thm)],[3363:[bind(A,$thf( implies @ J @ K )),bind(B,$thf( B )),bind(C,$thf( C )),bind(D,$thf( D )),bind(E,$thf( E )),bind(F,$thf( F )),bind(G,$thf( G )),bind(H,$thf( J )),bind(I,$thf( K ))]]) ).
thf(3478,plain,
! [H: $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ~ ( is_a_theorem @ ( equiv @ ( implies @ G @ H ) @ A ) )
| ~ ( is_a_theorem @ ( equiv @ ( equiv @ A @ F ) @ B ) )
| ~ ( is_a_theorem @ ( equiv @ B @ C ) )
| ~ ( is_a_theorem @ ( equiv @ C @ D ) )
| ~ ( is_a_theorem @ D )
| ~ ( is_a_theorem @ ( equiv @ F @ E ) )
| ( is_a_theorem @ H )
| ~ ( is_a_theorem @ G )
| ( ( is_a_theorem @ E )
!= ( is_a_theorem @ G ) ) ),
inference(simp,[status(thm)],[3364]) ).
thf(27,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(99,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)],[27]) ).
thf(24,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(87,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)],[24]) ).
thf(20,axiom,
( kn1
<=> ! [A: $i] : ( is_a_theorem @ ( implies @ A @ ( and @ A @ A ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn1) ).
thf(75,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)],[20]) ).
thf(33,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(119,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)],[33]) ).
thf(13,axiom,
kn1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn1) ).
thf(58,plain,
kn1,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(563,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( not @ ( and @ ( not @ C ) @ ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) ) )
= ( not @ ( and @ ( not @ D ) @ ( or @ E @ F ) ) ) )
| ( ( or @ C @ ( and @ ( not @ A ) @ ( not @ B ) ) )
!= ( or @ D @ ( and @ ( not @ E ) @ ( not @ F ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[297,165]) ).
thf(564,plain,
! [C: $i,B: $i,A: $i] :
( ( not @ ( and @ ( not @ C ) @ ( not @ ( and @ ( not @ A ) @ ( not @ B ) ) ) ) )
= ( not @ ( and @ ( not @ C ) @ ( or @ A @ B ) ) ) ),
inference(pattern_uni,[status(thm)],[563:[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(29,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(107,plain,
( op_implies_or
=> ! [A: $i,B: $i] :
( ( implies @ A @ B )
= ( or @ ( not @ A ) @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[29]) ).
thf(37,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(131,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)],[37]) ).
thf(4,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
thf(47,plain,
op_or,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(25,axiom,
( r1
<=> ! [A: $i] : ( is_a_theorem @ ( implies @ ( or @ A @ A ) @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r1) ).
thf(90,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)],[25]) ).
thf(294,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)],[165,160]) ).
thf(295,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)],[294:[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(337,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)],[295]) ).
thf(34,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(122,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)],[34]) ).
thf(13065,plain,
$false,
inference(e,[status(thm)],[56,116,173,59,67,55,146,69,2094,52,110,619,125,46,93,152,57,78,179,84,60,85,102,160,297,137,165,65,435,388,53,134,73,128,2001,166,45,64,149,54,49,113,81,140,66,1594,226,922,48,63,72,143,3478,99,87,75,214,119,58,564,107,886,131,47,90,337,122]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : LCL508+1 : TPTP v9.2.0. Bugfixed v9.2.0.
% 0.08/0.14 % Command : run_Leo-III %s %d THM
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Sep 30 13:42:24 EDT 2025
% 0.14/0.36 % CPUTime :
% 1.06/0.98 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.37/1.13 % [INFO] Parsing done (149ms).
% 1.37/1.14 % [INFO] Running in sequential loop mode.
% 1.97/1.35 % [INFO] eprover registered as external prover.
% 1.97/1.36 % [INFO] Scanning for conjecture ...
% 2.14/1.41 % [INFO] Found a conjecture (or negated_conjecture) and 42 axioms. Running axiom selection ...
% 2.14/1.45 % [INFO] Axiom selection finished. Selected 42 axioms (removed 0 axioms).
% 2.53/1.51 % [INFO] Problem is first-order (TPTP FOF).
% 2.53/1.51 % [INFO] Type checking passed.
% 2.53/1.52 % [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 ...
% 33.18/7.69 % External prover 'e' found a proof!
% 33.18/7.69 % [INFO] Killing All external provers ...
% 33.18/7.69 % Time passed: 7125ms (effective reasoning time: 6552ms)
% 33.18/7.69 % 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)>
% 33.18/7.69 % Axioms used in derivation (42): or_3, and_1, equivalence_2, op_equiv, rosser_kn2, kn1, r5, rosser_modus_ponens, implies_3, op_implies_and, cn3, rosser_kn3, cn1, rosser_op_or, kn2, rosser_op_implies_and, cn2, hilbert_op_implies_and, equivalence_3, modus_tollens, rosser_kn1, op_and, or_1, kn3, and_3, use_substitution_of_equivalents, r4, modus_ponens, hilbert_op_or, r1, r2, equivalence_1, or_2, implies_1, r3, and_2, substitution_of_equivalents, rosser_op_equiv, op_or, op_implies_or, hilbert_op_equiv, implies_2
% 33.18/7.69 % No. of inferences in proof: 152
% 33.18/7.69 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 7125 ms resp. 6552 ms w/o parsing
% 33.18/7.76 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 33.18/7.76 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------