TSTP Solution File: LCL234-1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : LCL234-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n028.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 : Fri May 19 11:29:53 EDT 2023
% Result : Unsatisfiable 9.39s 2.86s
% Output : Refutation 9.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 93 ( 44 unt; 6 typ; 0 def)
% Number of atoms : 185 ( 34 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 1078 ( 97 ~; 54 |; 0 &; 927 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 155 ( 0 ^; 155 !; 0 ?; 155 :)
% Comments :
%------------------------------------------------------------------------------
thf(theorem_type,type,
theorem: $i > $o ).
thf(or_type,type,
or: $i > $i > $i ).
thf(not_type,type,
not: $i > $i ).
thf(p_type,type,
p: $i ).
thf(q_type,type,
q: $i ).
thf(axiom_type,type,
axiom: $i > $o ).
thf(3,axiom,
! [B: $i,A: $i] : ( axiom @ ( or @ ( not @ A ) @ ( or @ B @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
thf(13,plain,
! [B: $i,A: $i] : ( axiom @ ( or @ ( not @ A ) @ ( or @ B @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(7,axiom,
! [A: $i] :
( ( theorem @ A )
| ~ ( axiom @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
thf(17,plain,
! [A: $i] :
( ( theorem @ A )
| ~ ( axiom @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(18,plain,
! [A: $i] :
( ( theorem @ A )
| ~ ( axiom @ A ) ),
inference(cnf,[status(esa)],[17]) ).
thf(80,plain,
! [C: $i,B: $i,A: $i] :
( ( theorem @ C )
| ( ( axiom @ ( or @ ( not @ A ) @ ( or @ B @ A ) ) )
!= ( axiom @ C ) ) ),
inference(paramod_ordered,[status(thm)],[13,18]) ).
thf(81,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( not @ B ) @ ( or @ A @ B ) ) ),
inference(pattern_uni,[status(thm)],[80:[bind(A,$thf( H )),bind(B,$thf( G )),bind(C,$thf( or @ ( not @ H ) @ ( or @ G @ H ) ))]]) ).
thf(88,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( not @ B ) @ ( or @ A @ B ) ) ),
inference(simp,[status(thm)],[81]) ).
thf(1,negated_conjecture,
~ ( theorem @ ( or @ ( not @ p ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
thf(10,plain,
~ ( theorem @ ( or @ ( not @ p ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(2,axiom,
! [A: $i] : ( axiom @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
thf(12,plain,
! [A: $i] : ( axiom @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(82,plain,
! [B: $i,A: $i] :
( ( theorem @ B )
| ( ( axiom @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) )
!= ( axiom @ B ) ) ),
inference(paramod_ordered,[status(thm)],[12,18]) ).
thf(83,plain,
! [A: $i] : ( theorem @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) ),
inference(pattern_uni,[status(thm)],[82:[bind(A,$thf( D )),bind(B,$thf( or @ ( not @ ( or @ D @ D ) ) @ D ))]]) ).
thf(89,plain,
! [A: $i] : ( theorem @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) ),
inference(simp,[status(thm)],[83]) ).
thf(4,axiom,
! [B: $i,A: $i] : ( axiom @ ( or @ ( not @ ( or @ A @ B ) ) @ ( or @ B @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
thf(14,plain,
! [B: $i,A: $i] : ( axiom @ ( or @ ( not @ ( or @ A @ B ) ) @ ( or @ B @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(8,axiom,
! [B: $i,A: $i] :
( ( theorem @ A )
| ~ ( axiom @ ( or @ ( not @ B ) @ A ) )
| ~ ( theorem @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
thf(19,plain,
! [B: $i,A: $i] :
( ( theorem @ A )
| ~ ( axiom @ ( or @ ( not @ B ) @ A ) )
| ~ ( theorem @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(20,plain,
! [B: $i,A: $i] :
( ( theorem @ A )
| ~ ( axiom @ ( or @ ( not @ B ) @ A ) )
| ~ ( theorem @ B ) ),
inference(cnf,[status(esa)],[19]) ).
thf(23,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( theorem @ C )
| ~ ( theorem @ D )
| ( ( axiom @ ( or @ ( not @ ( or @ A @ B ) ) @ ( or @ B @ A ) ) )
!= ( axiom @ ( or @ ( not @ D ) @ C ) ) ) ),
inference(paramod_ordered,[status(thm)],[14,20]) ).
thf(24,plain,
! [B: $i,A: $i] :
( ( theorem @ ( or @ A @ B ) )
| ~ ( theorem @ ( or @ B @ A ) ) ),
inference(pattern_uni,[status(thm)],[23:[bind(A,$thf( H )),bind(B,$thf( G )),bind(C,$thf( or @ G @ H )),bind(D,$thf( or @ H @ G ))]]) ).
thf(29,plain,
! [B: $i,A: $i] :
( ( theorem @ ( or @ A @ B ) )
| ~ ( theorem @ ( or @ B @ A ) ) ),
inference(simp,[status(thm)],[24]) ).
thf(164,plain,
! [C: $i,B: $i,A: $i] :
( ( theorem @ ( or @ B @ C ) )
| ( ( theorem @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) )
!= ( theorem @ ( or @ C @ B ) ) ) ),
inference(paramod_ordered,[status(thm)],[89,29]) ).
thf(165,plain,
! [A: $i] : ( theorem @ ( or @ A @ ( not @ ( or @ A @ A ) ) ) ),
inference(pattern_uni,[status(thm)],[164:[bind(A,$thf( F )),bind(B,$thf( F )),bind(C,$thf( not @ ( or @ F @ F ) ))]]) ).
thf(185,plain,
! [A: $i] : ( theorem @ ( or @ A @ ( not @ ( or @ A @ A ) ) ) ),
inference(simp,[status(thm)],[165]) ).
thf(25,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( theorem @ C )
| ~ ( theorem @ D )
| ( ( axiom @ ( or @ ( not @ A ) @ ( or @ B @ A ) ) )
!= ( axiom @ ( or @ ( not @ D ) @ C ) ) ) ),
inference(paramod_ordered,[status(thm)],[13,20]) ).
thf(26,plain,
! [B: $i,A: $i] :
( ( theorem @ ( or @ A @ B ) )
| ~ ( theorem @ B ) ),
inference(pattern_uni,[status(thm)],[25:[bind(A,$thf( F )),bind(B,$thf( E )),bind(C,$thf( or @ E @ F )),bind(D,$thf( F ))]]) ).
thf(30,plain,
! [B: $i,A: $i] :
( ( theorem @ ( or @ A @ B ) )
| ~ ( theorem @ B ) ),
inference(simp,[status(thm)],[26]) ).
thf(9,axiom,
! [C: $i,B: $i,A: $i] :
( ( theorem @ ( or @ ( not @ A ) @ B ) )
| ~ ( axiom @ ( or @ ( not @ A ) @ C ) )
| ~ ( theorem @ ( or @ ( not @ C ) @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_3) ).
thf(21,plain,
! [C: $i,B: $i,A: $i] :
( ( theorem @ ( or @ ( not @ A ) @ B ) )
| ~ ( axiom @ ( or @ ( not @ A ) @ C ) )
| ~ ( theorem @ ( or @ ( not @ C ) @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(22,plain,
! [C: $i,B: $i,A: $i] :
( ( theorem @ ( or @ ( not @ A ) @ B ) )
| ~ ( axiom @ ( or @ ( not @ A ) @ C ) )
| ~ ( theorem @ ( or @ ( not @ C ) @ B ) ) ),
inference(cnf,[status(esa)],[21]) ).
thf(11,plain,
~ ( theorem @ ( or @ ( not @ p ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ),
inference(polarity_switch,[status(thm)],[10]) ).
thf(42,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( axiom @ ( or @ ( not @ A ) @ C ) )
| ~ ( theorem @ ( or @ ( not @ C ) @ B ) )
| ( ( theorem @ ( or @ ( not @ A ) @ B ) )
!= ( theorem @ ( or @ ( not @ p ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[22,11]) ).
thf(43,plain,
! [A: $i] :
( ~ ( axiom @ ( or @ ( not @ p ) @ A ) )
| ~ ( theorem @ ( or @ ( not @ A ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ) ),
inference(pattern_uni,[status(thm)],[42:[bind(A,$thf( p )),bind(B,$thf( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) )),bind(C,$thf( C ))]]) ).
thf(48,plain,
! [A: $i] :
( ~ ( axiom @ ( or @ ( not @ p ) @ A ) )
| ~ ( theorem @ ( or @ ( not @ A ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ) ),
inference(simp,[status(thm)],[43]) ).
thf(56,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( theorem @ ( or @ ( not @ C ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) )
| ( ( axiom @ ( or @ ( not @ A ) @ ( or @ B @ A ) ) )
!= ( axiom @ ( or @ ( not @ p ) @ C ) ) ) ),
inference(paramod_ordered,[status(thm)],[13,48]) ).
thf(57,plain,
! [A: $i] :
~ ( theorem @ ( or @ ( not @ ( or @ A @ p ) ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ),
inference(pattern_uni,[status(thm)],[56:[bind(A,$thf( p )),bind(B,$thf( D )),bind(C,$thf( or @ D @ p ))]]) ).
thf(65,plain,
! [A: $i] :
~ ( theorem @ ( or @ ( not @ ( or @ A @ p ) ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ),
inference(simp,[status(thm)],[57]) ).
thf(177,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( theorem @ ( or @ B @ A ) )
| ( ( theorem @ ( or @ A @ B ) )
!= ( theorem @ ( or @ ( not @ ( or @ C @ p ) ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[29,65]) ).
thf(178,plain,
! [A: $i] :
~ ( theorem @ ( or @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) @ ( not @ ( or @ A @ p ) ) ) ),
inference(pattern_uni,[status(thm)],[177:[bind(A,$thf( not @ ( or @ E @ p ) )),bind(B,$thf( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) )),bind(C,$thf( E ))]]) ).
thf(182,plain,
! [A: $i] :
~ ( theorem @ ( or @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) @ ( not @ ( or @ A @ p ) ) ) ),
inference(simp,[status(thm)],[178]) ).
thf(308,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( theorem @ B )
| ( ( theorem @ ( or @ A @ B ) )
!= ( theorem @ ( or @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) @ ( not @ ( or @ C @ p ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[30,182]) ).
thf(309,plain,
! [A: $i] :
~ ( theorem @ ( not @ ( or @ A @ p ) ) ),
inference(pattern_uni,[status(thm)],[308:[bind(A,$thf( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) )),bind(B,$thf( not @ ( or @ M @ p ) )),bind(C,$thf( M ))]]) ).
thf(321,plain,
! [A: $i] :
~ ( theorem @ ( not @ ( or @ A @ p ) ) ),
inference(simp,[status(thm)],[309]) ).
thf(99,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( axiom @ ( or @ ( not @ p ) @ C ) )
| ( ( theorem @ ( or @ ( not @ B ) @ ( or @ A @ B ) ) )
!= ( theorem @ ( or @ ( not @ C ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[88,48]) ).
thf(100,plain,
~ ( axiom @ ( or @ ( not @ p ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ),
inference(pattern_uni,[status(thm)],[99:[bind(A,$thf( not @ q )),bind(B,$thf( not @ ( or @ ( not @ p ) @ ( not @ q ) ) )),bind(C,$thf( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ))]]) ).
thf(107,plain,
! [A: $i] :
( ( axiom @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) )
!= ( axiom @ ( or @ ( not @ p ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[12,100]) ).
thf(114,plain,
! [A: $i] :
( ( or @ ( not @ ( or @ A @ A ) ) @ A )
!= ( or @ ( not @ p ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ),
inference(simp,[status(thm)],[107]) ).
thf(335,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( theorem @ B )
| ( ( theorem @ ( or @ A @ B ) )
!= ( theorem @ ( not @ ( or @ C @ p ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[30,321]) ).
thf(341,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( theorem @ B )
| ( ( or @ A @ B )
!= ( not @ ( or @ C @ p ) ) ) ),
inference(simp,[status(thm)],[335]) ).
thf(5,axiom,
! [C: $i,B: $i,A: $i] : ( axiom @ ( or @ ( not @ ( or @ A @ ( or @ B @ C ) ) ) @ ( or @ B @ ( or @ A @ C ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
thf(15,plain,
! [C: $i,B: $i,A: $i] : ( axiom @ ( or @ ( not @ ( or @ A @ ( or @ B @ C ) ) ) @ ( or @ B @ ( or @ A @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(179,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( theorem @ ( or @ B @ A ) )
| ~ ( axiom @ ( or @ ( not @ p ) @ C ) )
| ( ( theorem @ ( or @ A @ B ) )
!= ( theorem @ ( or @ ( not @ C ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[29,48]) ).
thf(180,plain,
! [A: $i] :
( ~ ( theorem @ ( or @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) @ ( not @ A ) ) )
| ~ ( axiom @ ( or @ ( not @ p ) @ A ) ) ),
inference(pattern_uni,[status(thm)],[179:[bind(A,$thf( not @ D )),bind(B,$thf( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) )),bind(C,$thf( D ))]]) ).
thf(184,plain,
! [A: $i] :
( ~ ( theorem @ ( or @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) @ ( not @ A ) ) )
| ~ ( axiom @ ( or @ ( not @ p ) @ A ) ) ),
inference(simp,[status(thm)],[180]) ).
thf(106,plain,
! [B: $i,A: $i] :
( ( axiom @ ( or @ ( not @ A ) @ ( or @ B @ A ) ) )
!= ( axiom @ ( or @ ( not @ p ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[13,100]) ).
thf(110,plain,
! [B: $i,A: $i] :
( ( or @ ( not @ A ) @ ( or @ B @ A ) )
!= ( or @ ( not @ p ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ),
inference(simp,[status(thm)],[106]) ).
thf(259,plain,
! [A: $i] :
( ( ( not @ ( or @ A @ A ) )
!= ( not @ p ) )
| ( A
!= ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ),
inference(simp,[status(thm)],[114]) ).
thf(260,plain,
( ( not @ ( or @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) )
!= ( not @ p ) ),
inference(simp,[status(thm)],[259]) ).
thf(137,plain,
! [B: $i,A: $i] :
( ( ( not @ A )
!= ( not @ p ) )
| ( ( or @ B @ A )
!= ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ),
inference(simp,[status(thm)],[110]) ).
thf(78,plain,
! [C: $i,B: $i,A: $i] :
( ( theorem @ C )
| ( ( axiom @ ( or @ ( not @ ( or @ A @ B ) ) @ ( or @ B @ A ) ) )
!= ( axiom @ C ) ) ),
inference(paramod_ordered,[status(thm)],[14,18]) ).
thf(79,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( not @ ( or @ B @ A ) ) @ ( or @ A @ B ) ) ),
inference(pattern_uni,[status(thm)],[78:[bind(A,$thf( J )),bind(B,$thf( I )),bind(C,$thf( or @ ( not @ ( or @ J @ I ) ) @ ( or @ I @ J ) ))]]) ).
thf(92,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( not @ ( or @ B @ A ) ) @ ( or @ A @ B ) ) ),
inference(simp,[status(thm)],[79]) ).
thf(160,plain,
! [B: $i,A: $i] :
( ( A != p )
| ( ( or @ B @ A )
!= ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ),
inference(simp,[status(thm)],[137]) ).
thf(161,plain,
! [A: $i] :
( ( or @ A @ p )
!= ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ),
inference(simp,[status(thm)],[160]) ).
thf(279,plain,
( ( or @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) )
!= p ),
inference(simp,[status(thm)],[260]) ).
thf(290,plain,
! [B: $i,A: $i] :
( ~ ( theorem @ B )
| ( ( theorem @ ( or @ A @ B ) )
!= ( theorem @ ( or @ ( not @ p ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[30,11]) ).
thf(291,plain,
~ ( theorem @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ),
inference(pattern_uni,[status(thm)],[290:[bind(A,$thf( not @ p )),bind(B,$thf( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ))]]) ).
thf(175,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( theorem @ ( or @ C @ D ) )
| ( ( theorem @ ( or @ ( not @ ( or @ B @ A ) ) @ ( or @ A @ B ) ) )
!= ( theorem @ ( or @ D @ C ) ) ) ),
inference(paramod_ordered,[status(thm)],[92,29]) ).
thf(176,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( or @ A @ B ) @ ( not @ ( or @ B @ A ) ) ) ),
inference(pattern_uni,[status(thm)],[175:[bind(A,$thf( H )),bind(B,$thf( I )),bind(C,$thf( or @ H @ I )),bind(D,$thf( not @ ( or @ I @ H ) ))]]) ).
thf(181,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( or @ A @ B ) @ ( not @ ( or @ B @ A ) ) ) ),
inference(simp,[status(thm)],[176]) ).
thf(354,plain,
! [B: $i,A: $i] :
( ~ ( theorem @ B )
| ( ( theorem @ ( or @ A @ B ) )
!= ( theorem @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[30,291]) ).
thf(355,plain,
~ ( theorem @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ),
inference(pattern_uni,[status(thm)],[354:[bind(A,$thf( not @ q )),bind(B,$thf( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ))]]) ).
thf(144,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( axiom @ ( or @ ( not @ p ) @ C ) )
| ( ( theorem @ ( or @ ( not @ ( or @ B @ A ) ) @ ( or @ A @ B ) ) )
!= ( theorem @ ( or @ ( not @ C ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[92,48]) ).
thf(145,plain,
~ ( axiom @ ( or @ ( not @ p ) @ ( or @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) @ ( not @ q ) ) ) ),
inference(pattern_uni,[status(thm)],[144:[bind(A,$thf( not @ q )),bind(B,$thf( not @ ( or @ ( not @ p ) @ ( not @ q ) ) )),bind(C,$thf( or @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) @ ( not @ q ) ))]]) ).
thf(6,axiom,
! [C: $i,B: $i,A: $i] : ( axiom @ ( or @ ( not @ ( or @ ( not @ A ) @ B ) ) @ ( or @ ( not @ ( or @ C @ A ) ) @ ( or @ C @ B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
thf(16,plain,
! [C: $i,B: $i,A: $i] : ( axiom @ ( or @ ( not @ ( or @ ( not @ A ) @ B ) ) @ ( or @ ( not @ ( or @ C @ A ) ) @ ( or @ C @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(292,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( theorem @ B )
| ~ ( axiom @ ( or @ ( not @ p ) @ C ) )
| ( ( theorem @ ( or @ A @ B ) )
!= ( theorem @ ( or @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) @ ( not @ C ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[30,184]) ).
thf(293,plain,
! [A: $i] :
( ~ ( theorem @ ( not @ A ) )
| ~ ( axiom @ ( or @ ( not @ p ) @ A ) ) ),
inference(pattern_uni,[status(thm)],[292:[bind(A,$thf( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) )),bind(B,$thf( not @ L )),bind(C,$thf( L ))]]) ).
thf(315,plain,
! [A: $i] :
( ~ ( theorem @ ( not @ A ) )
| ~ ( axiom @ ( or @ ( not @ p ) @ A ) ) ),
inference(simp,[status(thm)],[293]) ).
thf(162,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( theorem @ ( or @ C @ D ) )
| ( ( theorem @ ( or @ ( not @ B ) @ ( or @ A @ B ) ) )
!= ( theorem @ ( or @ D @ C ) ) ) ),
inference(paramod_ordered,[status(thm)],[88,29]) ).
thf(163,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( or @ A @ B ) @ ( not @ B ) ) ),
inference(pattern_uni,[status(thm)],[162:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( or @ F @ G )),bind(D,$thf( not @ G ))]]) ).
thf(183,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( or @ A @ B ) @ ( not @ B ) ) ),
inference(simp,[status(thm)],[163]) ).
thf(121,plain,
! [B: $i,A: $i] :
( ~ ( axiom @ ( or @ ( not @ p ) @ B ) )
| ( ( theorem @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) )
!= ( theorem @ ( or @ ( not @ B ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[89,48]) ).
thf(122,plain,
~ ( axiom @ ( or @ ( not @ p ) @ ( or @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ) ) ),
inference(pattern_uni,[status(thm)],[121:[bind(A,$thf( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) )),bind(B,$thf( or @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) @ ( or @ ( not @ q ) @ ( not @ ( or @ ( not @ p ) @ ( not @ q ) ) ) ) ))]]) ).
thf(643,plain,
$false,
inference(e,[status(thm)],[88,10,185,321,89,13,11,114,341,15,14,184,110,20,29,260,21,137,92,65,161,279,17,22,291,12,181,355,145,48,18,182,16,315,30,183,19,122,100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL234-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.12/0.15 % Command : run_Leo-III %s %d
% 0.15/0.35 % Computer : n028.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu May 18 16:28:04 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.97/0.87 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.13/1.00 % [INFO] Parsing done (123ms).
% 1.13/1.01 % [INFO] Running in sequential loop mode.
% 1.70/1.20 % [INFO] eprover registered as external prover.
% 1.70/1.21 % [INFO] cvc4 registered as external prover.
% 1.70/1.21 % [INFO] Scanning for conjecture ...
% 1.78/1.26 % [INFO] Found a conjecture and 8 axioms. Running axiom selection ...
% 1.78/1.28 % [INFO] Axiom selection finished. Selected 8 axioms (removed 0 axioms).
% 1.78/1.29 % [INFO] Problem is propositional (TPTP CNF).
% 1.78/1.29 % [INFO] Type checking passed.
% 1.78/1.30 % [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 ...
% 9.39/2.85 % External prover 'e' found a proof!
% 9.39/2.85 % [INFO] Killing All external provers ...
% 9.39/2.86 % Time passed: 2344ms (effective reasoning time: 1846ms)
% 9.39/2.86 % 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)>
% 9.39/2.86 % Axioms used in derivation (8): axiom_1_5, axiom_1_4, rule_1, axiom_1_3, rule_3, axiom_1_2, rule_2, axiom_1_6
% 9.39/2.86 % No. of inferences in proof: 87
% 9.39/2.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2344 ms resp. 1846 ms w/o parsing
% 9.46/2.91 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.46/2.91 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------