TSTP Solution File: LCL191-1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : LCL191-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n009.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:40 EDT 2023
% Result : Unsatisfiable 56.85s 9.59s
% Output : Refutation 56.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of formulae : 95 ( 45 unt; 7 typ; 0 def)
% Number of atoms : 193 ( 26 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 1167 ( 97 ~; 53 |; 0 &;1017 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 154 ( 0 ^; 154 !; 0 ?; 154 :)
% 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(r_type,type,
r: $i ).
thf(axiom_type,type,
axiom: $i > $o ).
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(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(1,negated_conjecture,
~ ( theorem @ ( or @ ( not @ ( or @ p @ ( or @ q @ r ) ) ) @ ( or @ ( or @ p @ q ) @ r ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
thf(10,plain,
~ ( theorem @ ( or @ ( not @ ( or @ p @ ( or @ q @ r ) ) ) @ ( or @ ( or @ p @ q ) @ r ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(11,plain,
~ ( theorem @ ( or @ ( not @ ( or @ p @ ( or @ q @ r ) ) ) @ ( or @ ( or @ p @ q ) @ r ) ) ),
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 @ ( or @ p @ ( or @ q @ r ) ) ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[22,11]) ).
thf(43,plain,
! [A: $i] :
( ~ ( axiom @ ( or @ ( not @ ( or @ p @ ( or @ q @ r ) ) ) @ A ) )
| ~ ( theorem @ ( or @ ( not @ A ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ),
inference(pattern_uni,[status(thm)],[42:[bind(A,$thf( or @ p @ ( or @ q @ r ) )),bind(B,$thf( or @ ( or @ p @ q ) @ r )),bind(C,$thf( C ))]]) ).
thf(48,plain,
! [A: $i] :
( ~ ( axiom @ ( or @ ( not @ ( or @ p @ ( or @ q @ r ) ) ) @ A ) )
| ~ ( theorem @ ( or @ ( not @ A ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ),
inference(simp,[status(thm)],[43]) ).
thf(55,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( theorem @ ( or @ ( not @ C ) @ ( or @ ( or @ p @ q ) @ r ) ) )
| ( ( axiom @ ( or @ ( not @ ( or @ A @ B ) ) @ ( or @ B @ A ) ) )
!= ( axiom @ ( or @ ( not @ ( or @ p @ ( or @ q @ r ) ) ) @ C ) ) ) ),
inference(paramod_ordered,[status(thm)],[14,48]) ).
thf(56,plain,
~ ( theorem @ ( or @ ( not @ ( or @ ( or @ q @ r ) @ p ) ) @ ( or @ ( or @ p @ q ) @ r ) ) ),
inference(pattern_uni,[status(thm)],[55:[bind(A,$thf( p )),bind(B,$thf( or @ q @ r )),bind(C,$thf( or @ ( or @ q @ r ) @ p ))]]) ).
thf(67,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 @ ( or @ ( or @ q @ r ) @ p ) ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[22,56]) ).
thf(68,plain,
! [A: $i] :
( ~ ( axiom @ ( or @ ( not @ ( or @ ( or @ q @ r ) @ p ) ) @ A ) )
| ~ ( theorem @ ( or @ ( not @ A ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ),
inference(pattern_uni,[status(thm)],[67:[bind(A,$thf( or @ ( or @ q @ r ) @ p )),bind(B,$thf( or @ ( or @ p @ q ) @ r )),bind(C,$thf( C ))]]) ).
thf(69,plain,
! [A: $i] :
( ~ ( axiom @ ( or @ ( not @ ( or @ ( or @ q @ r ) @ p ) ) @ A ) )
| ~ ( theorem @ ( or @ ( not @ A ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ),
inference(simp,[status(thm)],[68]) ).
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(178,plain,
! [B: $i,A: $i] :
( ~ ( theorem @ ( or @ B @ A ) )
| ( ( theorem @ ( or @ A @ B ) )
!= ( theorem @ ( or @ ( not @ ( or @ ( or @ q @ r ) @ p ) ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[29,56]) ).
thf(179,plain,
~ ( theorem @ ( or @ ( or @ ( or @ p @ q ) @ r ) @ ( not @ ( or @ ( or @ q @ r ) @ p ) ) ) ),
inference(pattern_uni,[status(thm)],[178:[bind(A,$thf( not @ ( or @ ( or @ q @ r ) @ p ) )),bind(B,$thf( or @ ( or @ p @ q ) @ r ))]]) ).
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(86,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(87,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( not @ B ) @ ( or @ A @ B ) ) ),
inference(pattern_uni,[status(thm)],[86:[bind(A,$thf( H )),bind(B,$thf( G )),bind(C,$thf( or @ ( not @ H ) @ ( or @ G @ H ) ))]]) ).
thf(95,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( not @ B ) @ ( or @ A @ B ) ) ),
inference(simp,[status(thm)],[87]) ).
thf(198,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)],[95,29]) ).
thf(199,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( or @ A @ B ) @ ( not @ B ) ) ),
inference(pattern_uni,[status(thm)],[198:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( or @ F @ G )),bind(D,$thf( not @ G ))]]) ).
thf(205,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( or @ A @ B ) @ ( not @ B ) ) ),
inference(simp,[status(thm)],[199]) ).
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(134,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( axiom @ ( or @ ( not @ ( or @ ( or @ q @ r ) @ p ) ) @ C ) )
| ( ( theorem @ ( or @ ( not @ B ) @ ( or @ A @ B ) ) )
!= ( theorem @ ( or @ ( not @ C ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[95,69]) ).
thf(135,plain,
~ ( axiom @ ( or @ ( not @ ( or @ ( or @ q @ r ) @ p ) ) @ r ) ),
inference(pattern_uni,[status(thm)],[134:[bind(A,$thf( or @ p @ q )),bind(B,$thf( r )),bind(C,$thf( r ))]]) ).
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(57,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( theorem @ ( or @ ( not @ C ) @ ( or @ ( or @ p @ q ) @ r ) ) )
| ( ( axiom @ ( or @ ( not @ A ) @ ( or @ B @ A ) ) )
!= ( axiom @ ( or @ ( not @ ( or @ p @ ( or @ q @ r ) ) ) @ C ) ) ) ),
inference(paramod_ordered,[status(thm)],[13,48]) ).
thf(58,plain,
! [A: $i] :
~ ( theorem @ ( or @ ( not @ ( or @ A @ ( or @ p @ ( or @ q @ r ) ) ) ) @ ( or @ ( or @ p @ q ) @ r ) ) ),
inference(pattern_uni,[status(thm)],[57:[bind(A,$thf( or @ p @ ( or @ q @ r ) )),bind(B,$thf( H )),bind(C,$thf( or @ H @ ( or @ p @ ( or @ q @ r ) ) ))]]) ).
thf(65,plain,
! [A: $i] :
~ ( theorem @ ( or @ ( not @ ( or @ A @ ( or @ p @ ( or @ q @ r ) ) ) ) @ ( or @ ( or @ p @ q ) @ r ) ) ),
inference(simp,[status(thm)],[58]) ).
thf(180,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( theorem @ ( or @ B @ A ) )
| ( ( theorem @ ( or @ A @ B ) )
!= ( theorem @ ( or @ ( not @ ( or @ C @ ( or @ p @ ( or @ q @ r ) ) ) ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[29,65]) ).
thf(181,plain,
! [A: $i] :
~ ( theorem @ ( or @ ( or @ ( or @ p @ q ) @ r ) @ ( not @ ( or @ A @ ( or @ p @ ( or @ q @ r ) ) ) ) ) ),
inference(pattern_uni,[status(thm)],[180:[bind(A,$thf( not @ ( or @ E @ ( or @ p @ ( or @ q @ r ) ) ) )),bind(B,$thf( or @ ( or @ p @ q ) @ r )),bind(C,$thf( E ))]]) ).
thf(203,plain,
! [A: $i] :
~ ( theorem @ ( or @ ( or @ ( or @ p @ q ) @ r ) @ ( not @ ( or @ A @ ( or @ p @ ( or @ q @ r ) ) ) ) ) ),
inference(simp,[status(thm)],[181]) ).
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(88,plain,
! [B: $i,A: $i] :
( ( theorem @ B )
| ( ( axiom @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) )
!= ( axiom @ B ) ) ),
inference(paramod_ordered,[status(thm)],[12,18]) ).
thf(89,plain,
! [A: $i] : ( theorem @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) ),
inference(pattern_uni,[status(thm)],[88:[bind(A,$thf( D )),bind(B,$thf( or @ ( not @ ( or @ D @ D ) ) @ D ))]]) ).
thf(96,plain,
! [A: $i] : ( theorem @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) ),
inference(simp,[status(thm)],[89]) ).
thf(141,plain,
! [B: $i,A: $i] :
( ~ ( axiom @ ( or @ ( not @ ( or @ ( or @ q @ r ) @ p ) ) @ B ) )
| ( ( theorem @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) )
!= ( theorem @ ( or @ ( not @ B ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[96,69]) ).
thf(142,plain,
~ ( axiom @ ( or @ ( not @ ( or @ ( or @ q @ r ) @ p ) ) @ ( or @ ( or @ ( or @ p @ q ) @ r ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ),
inference(pattern_uni,[status(thm)],[141:[bind(A,$thf( or @ ( or @ p @ q ) @ r )),bind(B,$thf( or @ ( or @ ( or @ p @ q ) @ r ) @ ( or @ ( or @ p @ q ) @ r ) ))]]) ).
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(350,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( theorem @ B )
| ( ( theorem @ ( or @ A @ B ) )
!= ( theorem @ ( or @ ( not @ ( or @ C @ ( or @ p @ ( or @ q @ r ) ) ) ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[30,65]) ).
thf(351,plain,
~ ( theorem @ ( or @ ( or @ p @ q ) @ r ) ),
inference(pattern_uni,[status(thm)],[350:[bind(A,$thf( not @ ( or @ E @ ( or @ p @ ( or @ q @ r ) ) ) )),bind(B,$thf( or @ ( or @ p @ q ) @ r )),bind(C,$thf( E ))]]) ).
thf(406,plain,
! [B: $i,A: $i] :
( ~ ( theorem @ B )
| ( ( theorem @ ( or @ A @ B ) )
!= ( theorem @ ( or @ ( or @ p @ q ) @ r ) ) ) ),
inference(paramod_ordered,[status(thm)],[30,351]) ).
thf(407,plain,
~ ( theorem @ r ),
inference(pattern_uni,[status(thm)],[406:[bind(A,$thf( or @ p @ q )),bind(B,$thf( r ))]]) ).
thf(84,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(85,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( not @ ( or @ B @ A ) ) @ ( or @ A @ B ) ) ),
inference(pattern_uni,[status(thm)],[84:[bind(A,$thf( J )),bind(B,$thf( I )),bind(C,$thf( or @ ( not @ ( or @ J @ I ) ) @ ( or @ I @ J ) ))]]) ).
thf(94,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( not @ ( or @ B @ A ) ) @ ( or @ A @ B ) ) ),
inference(simp,[status(thm)],[85]) ).
thf(309,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)],[94,29]) ).
thf(310,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( or @ A @ B ) @ ( not @ ( or @ B @ A ) ) ) ),
inference(pattern_uni,[status(thm)],[309:[bind(A,$thf( H )),bind(B,$thf( I )),bind(C,$thf( or @ H @ I )),bind(D,$thf( not @ ( or @ I @ H ) ))]]) ).
thf(324,plain,
! [B: $i,A: $i] : ( theorem @ ( or @ ( or @ A @ B ) @ ( not @ ( or @ B @ A ) ) ) ),
inference(simp,[status(thm)],[310]) ).
thf(401,plain,
! [B: $i,A: $i] :
( ~ ( theorem @ ( or @ B @ A ) )
| ( ( theorem @ ( or @ A @ B ) )
!= ( theorem @ ( or @ ( or @ p @ q ) @ r ) ) ) ),
inference(paramod_ordered,[status(thm)],[29,351]) ).
thf(402,plain,
~ ( theorem @ ( or @ r @ ( or @ p @ q ) ) ),
inference(pattern_uni,[status(thm)],[401:[bind(A,$thf( or @ p @ q )),bind(B,$thf( r ))]]) ).
thf(475,plain,
! [B: $i,A: $i] :
( ~ ( theorem @ B )
| ( ( theorem @ ( or @ A @ B ) )
!= ( theorem @ ( or @ r @ ( or @ p @ q ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[30,402]) ).
thf(476,plain,
~ ( theorem @ ( or @ p @ q ) ),
inference(pattern_uni,[status(thm)],[475:[bind(A,$thf( r )),bind(B,$thf( or @ p @ q ))]]) ).
thf(182,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)],[96,29]) ).
thf(183,plain,
! [A: $i] : ( theorem @ ( or @ A @ ( not @ ( or @ A @ A ) ) ) ),
inference(pattern_uni,[status(thm)],[182:[bind(A,$thf( F )),bind(B,$thf( F )),bind(C,$thf( not @ ( or @ F @ F ) ))]]) ).
thf(204,plain,
! [A: $i] : ( theorem @ ( or @ A @ ( not @ ( or @ A @ A ) ) ) ),
inference(simp,[status(thm)],[183]) ).
thf(62,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( theorem @ ( or @ ( not @ D ) @ ( or @ ( or @ p @ q ) @ r ) ) )
| ( ( axiom @ ( or @ ( not @ ( or @ A @ ( or @ B @ C ) ) ) @ ( or @ B @ ( or @ A @ C ) ) ) )
!= ( axiom @ ( or @ ( not @ ( or @ p @ ( or @ q @ r ) ) ) @ D ) ) ) ),
inference(paramod_ordered,[status(thm)],[15,48]) ).
thf(63,plain,
~ ( theorem @ ( or @ ( not @ ( or @ q @ ( or @ p @ r ) ) ) @ ( or @ ( or @ p @ q ) @ r ) ) ),
inference(pattern_uni,[status(thm)],[62:[bind(A,$thf( p )),bind(B,$thf( q )),bind(C,$thf( r )),bind(D,$thf( or @ q @ ( or @ p @ r ) ))]]) ).
thf(313,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( axiom @ ( or @ ( not @ ( or @ p @ ( or @ q @ r ) ) ) @ C ) )
| ( ( theorem @ ( or @ ( not @ ( or @ B @ A ) ) @ ( or @ A @ B ) ) )
!= ( theorem @ ( or @ ( not @ C ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[94,48]) ).
thf(314,plain,
~ ( axiom @ ( or @ ( not @ ( or @ p @ ( or @ q @ r ) ) ) @ ( or @ r @ ( or @ p @ q ) ) ) ),
inference(pattern_uni,[status(thm)],[313:[bind(A,$thf( or @ p @ q )),bind(B,$thf( r )),bind(C,$thf( or @ r @ ( or @ p @ q ) ))]]) ).
thf(127,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( theorem @ ( or @ ( not @ C ) @ ( or @ ( or @ p @ q ) @ r ) ) )
| ( ( axiom @ ( or @ ( not @ A ) @ ( or @ B @ A ) ) )
!= ( axiom @ ( or @ ( not @ ( or @ ( or @ q @ r ) @ p ) ) @ C ) ) ) ),
inference(paramod_ordered,[status(thm)],[13,69]) ).
thf(128,plain,
! [A: $i] :
~ ( theorem @ ( or @ ( not @ ( or @ A @ ( or @ ( or @ q @ r ) @ p ) ) ) @ ( or @ ( or @ p @ q ) @ r ) ) ),
inference(pattern_uni,[status(thm)],[127:[bind(A,$thf( or @ ( or @ q @ r ) @ p )),bind(B,$thf( H )),bind(C,$thf( or @ H @ ( or @ ( or @ q @ r ) @ p ) ))]]) ).
thf(139,plain,
! [A: $i] :
~ ( theorem @ ( or @ ( not @ ( or @ A @ ( or @ ( or @ q @ r ) @ p ) ) ) @ ( or @ ( or @ p @ q ) @ r ) ) ),
inference(simp,[status(thm)],[128]) ).
thf(150,plain,
! [B: $i,A: $i] :
( ~ ( axiom @ ( or @ ( not @ ( or @ p @ ( or @ q @ r ) ) ) @ B ) )
| ( ( theorem @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) )
!= ( theorem @ ( or @ ( not @ B ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[96,48]) ).
thf(151,plain,
~ ( axiom @ ( or @ ( not @ ( or @ p @ ( or @ q @ r ) ) ) @ ( or @ ( or @ ( or @ p @ q ) @ r ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ),
inference(pattern_uni,[status(thm)],[150:[bind(A,$thf( or @ ( or @ p @ q ) @ r )),bind(B,$thf( or @ ( or @ ( or @ p @ q ) @ r ) @ ( or @ ( or @ p @ q ) @ r ) ))]]) ).
thf(299,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( axiom @ ( or @ ( not @ ( or @ ( or @ q @ r ) @ p ) ) @ C ) )
| ( ( theorem @ ( or @ ( not @ ( or @ B @ A ) ) @ ( or @ A @ B ) ) )
!= ( theorem @ ( or @ ( not @ C ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[94,69]) ).
thf(300,plain,
~ ( axiom @ ( or @ ( not @ ( or @ ( or @ q @ r ) @ p ) ) @ ( or @ r @ ( or @ p @ q ) ) ) ),
inference(pattern_uni,[status(thm)],[299:[bind(A,$thf( or @ p @ q )),bind(B,$thf( r )),bind(C,$thf( or @ r @ ( or @ p @ q ) ))]]) ).
thf(106,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( axiom @ ( or @ ( not @ ( or @ p @ ( or @ q @ r ) ) ) @ C ) )
| ( ( theorem @ ( or @ ( not @ B ) @ ( or @ A @ B ) ) )
!= ( theorem @ ( or @ ( not @ C ) @ ( or @ ( or @ p @ q ) @ r ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[95,48]) ).
thf(107,plain,
~ ( axiom @ ( or @ ( not @ ( or @ p @ ( or @ q @ r ) ) ) @ r ) ),
inference(pattern_uni,[status(thm)],[106:[bind(A,$thf( or @ p @ q )),bind(B,$thf( r )),bind(C,$thf( r ))]]) ).
thf(6647,plain,
$false,
inference(e,[status(thm)],[69,14,179,13,205,17,12,135,16,203,15,10,56,142,20,29,407,21,65,324,476,96,402,22,204,48,63,18,95,11,314,351,139,151,300,30,19,107,94]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL191-1 : TPTP v8.1.2. Released v1.1.0.
% 0.08/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n009.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu May 18 16:22:34 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.96/0.86 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.16/0.98 % [INFO] Parsing done (118ms).
% 1.35/0.99 % [INFO] Running in sequential loop mode.
% 1.70/1.32 % [INFO] eprover registered as external prover.
% 1.70/1.32 % [INFO] cvc4 registered as external prover.
% 1.70/1.33 % [INFO] Scanning for conjecture ...
% 1.90/1.38 % [INFO] Found a conjecture and 8 axioms. Running axiom selection ...
% 1.90/1.40 % [INFO] Axiom selection finished. Selected 8 axioms (removed 0 axioms).
% 1.90/1.41 % [INFO] Problem is propositional (TPTP CNF).
% 1.90/1.42 % [INFO] Type checking passed.
% 1.90/1.42 % [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 ...
% 56.85/9.59 % External prover 'e' found a proof!
% 56.85/9.59 % [INFO] Killing All external provers ...
% 56.85/9.59 % Time passed: 9055ms (effective reasoning time: 8596ms)
% 56.85/9.59 % 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)>
% 56.85/9.59 % 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
% 56.85/9.59 % No. of inferences in proof: 88
% 56.85/9.59 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 9055 ms resp. 8596 ms w/o parsing
% 56.85/9.65 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 56.85/9.65 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------