%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL193-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:51:07 AM UTC 2026
% Result : Unsatisfiable 18.21s 5.40s
% Output : Refutation 18.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 9
% Syntax : Number of formulae : 105 ( 49 unt; 0 typ; 0 def)
% Number of atoms : 237 ( 84 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 1118 ( 119 ~; 88 |; 0 &; 911 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 223 ( 0 ^; 223 !; 0 ?; 223 :)
% Comments :
%------------------------------------------------------------------------------
thf(theorem_decl,type,
theorem: $i > $o ).
thf(implies_decl,type,
implies: $i > $i > $i ).
thf(q_decl,type,
q: $i ).
thf(r_decl,type,
r: $i ).
thf(or_decl,type,
or: $i > $i > $i ).
thf(p_decl,type,
p: $i ).
thf(axiom_decl,type,
axiom: $i > $o ).
thf(not_decl,type,
not: $i > $i ).
thf(1,negated_conjecture,
~ ( p @ ( r @ or ) @ ( q @ ( p @ or ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(10,plain,
~ ( p @ ( r @ or ) @ ( q @ ( p @ or ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(4,axiom,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ implies ) @ axiom ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
thf(14,plain,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ implies ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(7,axiom,
! [B: $i,A: $i] :
( ( B @ ( A @ implies ) )
= ( B @ ( A @ not @ or ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
thf(17,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ implies ) )
= ( B @ ( A @ not @ or ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(18,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ not @ or ) )
= ( B @ ( A @ implies ) ) ),
inference(lifteq,[status(thm)],[17]) ).
thf(41,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ or ) )
!= ( C @ ( D @ or ) ) )
| ( B @ ( A @ implies ) @ ( D @ ( C @ or ) @ implies ) @ axiom ) ),
inference(paramod_ordered,[status(thm)],[18,14]) ).
thf(42,plain,
! [B: $i,A: $i] : ( A @ ( B @ implies ) @ ( B @ not @ ( A @ or ) @ implies ) @ axiom ),
inference(pattern_uni,[status(thm)],[41:[bind(A,$thf( E )),bind(B,$thf( B )),bind(C,$thf( B )),bind(D,$thf( E @ not ))]]) ).
thf(45,plain,
! [B: $i,A: $i] : ( A @ ( B @ implies ) @ ( B @ not @ ( A @ or ) @ implies ) @ axiom ),
inference(simp,[status(thm)],[42]) ).
thf(8,axiom,
! [A: $i] :
( ~ ( A @ axiom )
| ( A @ theorem ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
thf(19,plain,
! [A: $i] :
( ~ ( A @ axiom )
| ( A @ theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(20,plain,
! [A: $i] :
( ~ ( A @ axiom )
| ( A @ theorem ) ),
inference(cnf,[status(esa)],[19]) ).
thf(69,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ implies ) @ ( B @ not @ ( A @ or ) @ implies ) @ axiom )
!= ( C @ axiom ) )
| ~ $true
| ( C @ theorem ) ),
inference(paramod_ordered,[status(thm)],[45,20]) ).
thf(70,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ implies ) @ ( B @ not @ ( A @ or ) @ implies ) @ axiom )
!= ( C @ axiom ) )
| ( C @ theorem ) ),
inference(simp,[status(thm)],[69]) ).
thf(71,plain,
! [B: $i,A: $i] : ( B @ ( A @ implies ) @ ( A @ not @ ( B @ or ) @ implies ) @ theorem ),
inference(pattern_uni,[status(thm)],[70:[bind(A,$thf( J )),bind(B,$thf( I )),bind(C,$thf( J @ ( I @ implies ) @ ( I @ not @ ( J @ or ) @ implies ) ))]]) ).
thf(84,plain,
! [B: $i,A: $i] : ( B @ ( A @ implies ) @ ( A @ not @ ( B @ or ) @ implies ) @ theorem ),
inference(simp,[status(thm)],[71]) ).
thf(3,axiom,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( A @ implies ) @ axiom ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
thf(13,plain,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( A @ implies ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(27,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ or ) )
!= ( C @ ( D @ or ) ) )
| ( B @ ( A @ implies ) @ ( C @ implies ) @ axiom ) ),
inference(paramod_ordered,[status(thm)],[18,13]) ).
thf(28,plain,
! [B: $i,A: $i] : ( A @ ( B @ implies ) @ ( A @ implies ) @ axiom ),
inference(pattern_uni,[status(thm)],[27:[bind(A,$thf( E )),bind(B,$thf( B )),bind(C,$thf( B )),bind(D,$thf( E @ not ))]]) ).
thf(32,plain,
! [B: $i,A: $i] : ( A @ ( B @ implies ) @ ( A @ implies ) @ axiom ),
inference(simp,[status(thm)],[28]) ).
thf(72,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ implies ) @ ( A @ implies ) @ axiom )
!= ( C @ axiom ) )
| ~ $true
| ( C @ theorem ) ),
inference(paramod_ordered,[status(thm)],[32,20]) ).
thf(73,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ implies ) @ ( A @ implies ) @ axiom )
!= ( C @ axiom ) )
| ( C @ theorem ) ),
inference(simp,[status(thm)],[72]) ).
thf(74,plain,
! [B: $i,A: $i] : ( B @ ( A @ implies ) @ ( B @ implies ) @ theorem ),
inference(pattern_uni,[status(thm)],[73:[bind(A,$thf( G )),bind(B,$thf( F )),bind(C,$thf( G @ ( F @ implies ) @ ( G @ implies ) ))]]) ).
thf(85,plain,
! [B: $i,A: $i] : ( B @ ( A @ implies ) @ ( B @ implies ) @ theorem ),
inference(simp,[status(thm)],[74]) ).
thf(9,axiom,
! [B: $i,A: $i] :
( ~ ( B @ theorem )
| ~ ( A @ ( B @ implies ) @ theorem )
| ( A @ theorem ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
thf(21,plain,
! [B: $i,A: $i] :
( ~ ( B @ theorem )
| ~ ( A @ ( B @ implies ) @ theorem )
| ( A @ theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(22,plain,
! [B: $i,A: $i] :
( ~ ( B @ theorem )
| ~ ( A @ ( B @ implies ) @ theorem )
| ( A @ theorem ) ),
inference(cnf,[status(esa)],[21]) ).
thf(11,plain,
~ ( p @ ( r @ or ) @ ( q @ ( p @ or ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ),
inference(polarity_switch,[status(thm)],[10]) ).
thf(99,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ implies ) @ ( B @ implies ) @ theorem )
!= ( p @ ( r @ or ) @ ( q @ ( p @ or ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[85,11]) ).
thf(100,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ implies ) @ ( B @ implies ) @ theorem )
!= ( p @ ( r @ or ) @ ( q @ ( p @ or ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ) ),
inference(simp,[status(thm)],[99]) ).
thf(112,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ implies ) @ ( B @ implies ) )
!= ( p @ ( r @ or ) @ ( q @ ( p @ or ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[100]) ).
thf(43,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ or ) )
!= ( D @ ( C @ or ) ) )
| ( C @ ( D @ or ) @ ( B @ ( A @ implies ) @ implies ) @ axiom ) ),
inference(paramod_ordered,[status(thm)],[18,14]) ).
thf(44,plain,
! [B: $i,A: $i] : ( B @ not @ ( A @ or ) @ ( A @ ( B @ implies ) @ implies ) @ axiom ),
inference(pattern_uni,[status(thm)],[43:[bind(A,$thf( E )),bind(B,$thf( B )),bind(C,$thf( E @ not )),bind(D,$thf( B ))]]) ).
thf(46,plain,
! [B: $i,A: $i] : ( B @ not @ ( A @ or ) @ ( A @ ( B @ implies ) @ implies ) @ axiom ),
inference(simp,[status(thm)],[44]) ).
thf(66,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ not @ ( A @ or ) @ ( A @ ( B @ implies ) @ implies ) @ axiom )
!= ( C @ axiom ) )
| ~ $true
| ( C @ theorem ) ),
inference(paramod_ordered,[status(thm)],[46,20]) ).
thf(67,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ not @ ( A @ or ) @ ( A @ ( B @ implies ) @ implies ) @ axiom )
!= ( C @ axiom ) )
| ( C @ theorem ) ),
inference(simp,[status(thm)],[66]) ).
thf(68,plain,
! [B: $i,A: $i] : ( B @ not @ ( A @ or ) @ ( A @ ( B @ implies ) @ implies ) @ theorem ),
inference(pattern_uni,[status(thm)],[67:[bind(A,$thf( H )),bind(B,$thf( J )),bind(C,$thf( J @ not @ ( H @ or ) @ ( H @ ( J @ implies ) @ implies ) ))]]) ).
thf(83,plain,
! [B: $i,A: $i] : ( B @ not @ ( A @ or ) @ ( A @ ( B @ implies ) @ implies ) @ theorem ),
inference(simp,[status(thm)],[68]) ).
thf(220,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ implies ) )
!= ( p @ ( r @ or ) @ ( q @ ( p @ or ) @ implies ) ) )
| ( B
!= ( r @ ( q @ implies ) ) ) ),
inference(simp,[status(thm)],[112]) ).
thf(234,plain,
! [A: $i] :
( ( r @ ( q @ implies ) @ ( A @ implies ) )
!= ( p @ ( r @ or ) @ ( q @ ( p @ or ) @ implies ) ) ),
inference(simp,[status(thm)],[220]) ).
thf(60,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( A @ implies ) @ axiom )
!= ( C @ axiom ) )
| ~ $true
| ( C @ theorem ) ),
inference(paramod_ordered,[status(thm)],[13,20]) ).
thf(61,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( A @ implies ) @ axiom )
!= ( C @ axiom ) )
| ( C @ theorem ) ),
inference(simp,[status(thm)],[60]) ).
thf(62,plain,
! [B: $i,A: $i] : ( B @ ( A @ or ) @ ( B @ implies ) @ theorem ),
inference(pattern_uni,[status(thm)],[61:[bind(A,$thf( G )),bind(B,$thf( F )),bind(C,$thf( G @ ( F @ or ) @ ( G @ implies ) ))]]) ).
thf(88,plain,
! [B: $i,A: $i] : ( B @ ( A @ or ) @ ( B @ implies ) @ theorem ),
inference(simp,[status(thm)],[62]) ).
thf(23,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ not @ or ) )
!= ( q @ ( p @ or ) ) )
| ~ ( p @ ( r @ or ) @ ( B @ ( A @ implies ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ) ),
inference(paramod_ordered,[status(thm)],[18,11]) ).
thf(29,plain,
! [B: $i,A: $i] :
( ( B != q )
| ( ( A @ not )
!= p )
| ~ ( p @ ( r @ or ) @ ( B @ ( A @ implies ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ) ),
inference(simp,[status(thm)],[23]) ).
thf(33,plain,
! [A: $i] :
( ( ( A @ not )
!= p )
| ~ ( p @ ( r @ or ) @ ( q @ ( A @ implies ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ) ),
inference(simp,[status(thm)],[29]) ).
thf(35,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ or ) )
!= ( p @ ( r @ or ) ) )
| ( ( C @ not )
!= p )
| ~ ( B @ ( A @ implies ) @ ( q @ ( C @ implies ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ) ),
inference(paramod_ordered,[status(thm)],[18,33]) ).
thf(36,plain,
! [C: $i,B: $i,A: $i] :
( ( B != p )
| ( ( A @ not )
!= r )
| ( ( C @ not )
!= p )
| ~ ( B @ ( A @ implies ) @ ( q @ ( C @ implies ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ) ),
inference(simp,[status(thm)],[35]) ).
thf(37,plain,
! [B: $i,A: $i] :
( ( ( A @ not )
!= r )
| ( ( B @ not )
!= p )
| ~ ( p @ ( A @ implies ) @ ( q @ ( B @ implies ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ) ),
inference(simp,[status(thm)],[36]) ).
thf(236,plain,
! [A: $i] :
( ( ( p @ ( r @ or ) )
!= ( r @ ( q @ implies ) ) )
| ( A
!= ( q @ ( p @ or ) ) ) ),
inference(simp,[status(thm)],[234]) ).
thf(250,plain,
( ( p @ ( r @ or ) )
!= ( r @ ( q @ implies ) ) ),
inference(simp,[status(thm)],[236]) ).
thf(253,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ not @ or ) )
!= ( p @ ( r @ or ) ) )
| ( ( B @ ( A @ implies ) )
!= ( r @ ( q @ implies ) ) ) ),
inference(paramod_ordered,[status(thm)],[18,250]) ).
thf(256,plain,
! [B: $i,A: $i] :
( ( B != p )
| ( ( A @ not )
!= r )
| ( B != r )
| ( A != q ) ),
inference(simp,[status(thm)],[253]) ).
thf(257,plain,
( ( p != r )
| ( ( q @ not )
!= r ) ),
inference(simp,[status(thm)],[256]) ).
thf(24,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ not @ or ) )
!= ( p @ ( r @ or ) ) )
| ~ ( B @ ( A @ implies ) @ ( q @ ( p @ or ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ) ),
inference(paramod_ordered,[status(thm)],[18,11]) ).
thf(30,plain,
! [B: $i,A: $i] :
( ( B != p )
| ( ( A @ not )
!= r )
| ~ ( B @ ( A @ implies ) @ ( q @ ( p @ or ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ) ),
inference(simp,[status(thm)],[24]) ).
thf(34,plain,
! [A: $i] :
( ( ( A @ not )
!= r )
| ~ ( p @ ( A @ implies ) @ ( q @ ( p @ or ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ) ),
inference(simp,[status(thm)],[30]) ).
thf(2,axiom,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ implies ) @ axiom ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
thf(12,plain,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ implies ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(53,plain,
! [B: $i,A: $i] :
( ~ $true
| ( ( A @ ( B @ implies ) @ theorem )
!= ( B @ theorem ) )
| ~ ( B @ theorem )
| ( A @ theorem ) ),
inference(eqfactor_ordered,[status(thm)],[22]) ).
thf(54,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ implies ) @ theorem )
!= ( B @ theorem ) )
| ~ ( B @ theorem )
| ( A @ theorem ) ),
inference(simp,[status(thm)],[53]) ).
thf(47,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ or ) )
!= ( D @ not @ ( C @ or ) ) )
| ( C @ ( D @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ axiom ) ),
inference(paramod_ordered,[status(thm)],[18,45]) ).
thf(48,plain,
! [B: $i,A: $i] : ( A @ not @ ( B @ implies ) @ ( B @ not @ ( A @ implies ) @ implies ) @ axiom ),
inference(pattern_uni,[status(thm)],[47:[bind(A,$thf( E )),bind(B,$thf( F @ not )),bind(C,$thf( E @ not )),bind(D,$thf( F ))]]) ).
thf(49,plain,
! [B: $i,A: $i] : ( A @ not @ ( B @ implies ) @ ( B @ not @ ( A @ implies ) @ implies ) @ axiom ),
inference(simp,[status(thm)],[48]) ).
thf(57,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ implies ) @ axiom )
!= ( C @ axiom ) )
| ~ $true
| ( C @ theorem ) ),
inference(paramod_ordered,[status(thm)],[14,20]) ).
thf(58,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ implies ) @ axiom )
!= ( C @ axiom ) )
| ( C @ theorem ) ),
inference(simp,[status(thm)],[57]) ).
thf(59,plain,
! [B: $i,A: $i] : ( B @ ( A @ or ) @ ( A @ ( B @ or ) @ implies ) @ theorem ),
inference(pattern_uni,[status(thm)],[58:[bind(A,$thf( I )),bind(B,$thf( H )),bind(C,$thf( I @ ( H @ or ) @ ( H @ ( I @ or ) @ implies ) ))]]) ).
thf(86,plain,
! [B: $i,A: $i] : ( B @ ( A @ or ) @ ( A @ ( B @ or ) @ implies ) @ theorem ),
inference(simp,[status(thm)],[59]) ).
thf(78,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ not @ ( B @ implies ) @ ( B @ not @ ( A @ implies ) @ implies ) @ axiom )
!= ( C @ axiom ) )
| ~ $true
| ( C @ theorem ) ),
inference(paramod_ordered,[status(thm)],[49,20]) ).
thf(79,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ not @ ( B @ implies ) @ ( B @ not @ ( A @ implies ) @ implies ) @ axiom )
!= ( C @ axiom ) )
| ( C @ theorem ) ),
inference(simp,[status(thm)],[78]) ).
thf(80,plain,
! [B: $i,A: $i] : ( B @ not @ ( A @ implies ) @ ( A @ not @ ( B @ implies ) @ implies ) @ theorem ),
inference(pattern_uni,[status(thm)],[79:[bind(A,$thf( K )),bind(B,$thf( I )),bind(C,$thf( K @ not @ ( I @ implies ) @ ( I @ not @ ( K @ implies ) @ implies ) ))]]) ).
thf(81,plain,
! [B: $i,A: $i] : ( B @ not @ ( A @ implies ) @ ( A @ not @ ( B @ implies ) @ implies ) @ theorem ),
inference(simp,[status(thm)],[80]) ).
thf(221,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ or ) )
!= ( p @ ( r @ or ) ) )
| ( ( B @ ( A @ implies ) @ ( q @ ( p @ or ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) )
!= ( D @ ( C @ implies ) @ ( D @ implies ) ) ) ),
inference(paramod_ordered,[status(thm)],[18,112]) ).
thf(225,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( B != p )
| ( ( A @ not )
!= r )
| ( ( B @ ( A @ implies ) @ ( q @ ( p @ or ) @ implies ) )
!= ( D @ ( C @ implies ) ) )
| ( ( r @ ( q @ implies ) )
!= D ) ),
inference(simp,[status(thm)],[221]) ).
thf(230,plain,
! [B: $i,A: $i] :
( ( ( A @ not )
!= r )
| ( ( p @ ( A @ implies ) @ ( q @ ( p @ or ) @ implies ) )
!= ( r @ ( q @ implies ) @ ( B @ implies ) ) ) ),
inference(simp,[status(thm)],[225]) ).
thf(6,axiom,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ or ) @ ( A @ ( C @ or ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ axiom ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
thf(16,plain,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ or ) @ ( A @ ( C @ or ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(25,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ or ) )
!= ( C @ ( C @ or ) ) )
| ( C @ ( B @ ( A @ implies ) @ implies ) @ axiom ) ),
inference(paramod_ordered,[status(thm)],[18,12]) ).
thf(26,plain,
! [A: $i] : ( A @ not @ ( A @ not @ ( A @ implies ) @ implies ) @ axiom ),
inference(pattern_uni,[status(thm)],[25:[bind(A,$thf( E )),bind(B,$thf( E @ not )),bind(C,$thf( E @ not ))]]) ).
thf(31,plain,
! [A: $i] : ( A @ not @ ( A @ not @ ( A @ implies ) @ implies ) @ axiom ),
inference(simp,[status(thm)],[26]) ).
thf(75,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ or ) @ implies ) @ axiom )
!= ( B @ axiom ) )
| ~ $true
| ( B @ theorem ) ),
inference(paramod_ordered,[status(thm)],[12,20]) ).
thf(76,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ or ) @ implies ) @ axiom )
!= ( B @ axiom ) )
| ( B @ theorem ) ),
inference(simp,[status(thm)],[75]) ).
thf(77,plain,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ implies ) @ theorem ),
inference(pattern_uni,[status(thm)],[76:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ ( D @ or ) @ implies ) ))]]) ).
thf(87,plain,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ implies ) @ theorem ),
inference(simp,[status(thm)],[77]) ).
thf(38,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ or ) )
!= ( q @ ( p @ or ) ) )
| ( ( C @ not )
!= r )
| ~ ( p @ ( C @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ) ),
inference(paramod_ordered,[status(thm)],[18,34]) ).
thf(39,plain,
! [C: $i,B: $i,A: $i] :
( ( B != q )
| ( ( A @ not )
!= p )
| ( ( C @ not )
!= r )
| ~ ( p @ ( C @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ) ),
inference(simp,[status(thm)],[38]) ).
thf(40,plain,
! [B: $i,A: $i] :
( ( ( A @ not )
!= p )
| ( ( B @ not )
!= r )
| ~ ( p @ ( B @ implies ) @ ( q @ ( A @ implies ) @ implies ) @ ( r @ ( q @ implies ) @ implies ) @ theorem ) ),
inference(simp,[status(thm)],[39]) ).
thf(55,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ implies ) )
!= B )
| ~ ( B @ theorem )
| ( A @ theorem ) ),
inference(simp,[status(thm)],[53]) ).
thf(237,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ or ) )
!= ( p @ ( r @ or ) ) )
| ( ( B @ ( A @ implies ) @ ( q @ ( p @ or ) @ implies ) )
!= ( r @ ( q @ implies ) @ ( C @ implies ) ) ) ),
inference(paramod_ordered,[status(thm)],[18,234]) ).
thf(241,plain,
! [C: $i,B: $i,A: $i] :
( ( B != p )
| ( ( A @ not )
!= r )
| ( ( B @ ( A @ implies ) )
!= ( r @ ( q @ implies ) ) )
| ( ( q @ ( p @ or ) )
!= C ) ),
inference(simp,[status(thm)],[237]) ).
thf(246,plain,
! [A: $i] :
( ( ( A @ not )
!= r )
| ( ( p @ ( A @ implies ) )
!= ( r @ ( q @ implies ) ) ) ),
inference(simp,[status(thm)],[241]) ).
thf(63,plain,
! [B: $i,A: $i] :
( ( ( A @ not @ ( A @ not @ ( A @ implies ) @ implies ) @ axiom )
!= ( B @ axiom ) )
| ~ $true
| ( B @ theorem ) ),
inference(paramod_ordered,[status(thm)],[31,20]) ).
thf(64,plain,
! [B: $i,A: $i] :
( ( ( A @ not @ ( A @ not @ ( A @ implies ) @ implies ) @ axiom )
!= ( B @ axiom ) )
| ( B @ theorem ) ),
inference(simp,[status(thm)],[63]) ).
thf(65,plain,
! [A: $i] : ( A @ not @ ( A @ not @ ( A @ implies ) @ implies ) @ theorem ),
inference(pattern_uni,[status(thm)],[64:[bind(A,$thf( H )),bind(B,$thf( H @ not @ ( H @ not @ ( H @ implies ) @ implies ) ))]]) ).
thf(82,plain,
! [A: $i] : ( A @ not @ ( A @ not @ ( A @ implies ) @ implies ) @ theorem ),
inference(simp,[status(thm)],[65]) ).
thf(5,axiom,
! [C: $i,B: $i,A: $i] : ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ implies ) @ axiom ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
thf(15,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ implies ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(124,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ implies ) @ axiom )
!= ( D @ axiom ) )
| ~ $true
| ( D @ theorem ) ),
inference(paramod_ordered,[status(thm)],[15,20]) ).
thf(125,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ implies ) @ axiom )
!= ( D @ axiom ) )
| ( D @ theorem ) ),
inference(simp,[status(thm)],[124]) ).
thf(126,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ or ) @ ( A @ or ) @ ( C @ ( A @ or ) @ ( B @ or ) @ implies ) @ theorem ),
inference(pattern_uni,[status(thm)],[125:[bind(A,$thf( M )),bind(B,$thf( K )),bind(C,$thf( N )),bind(D,$thf( N @ ( M @ or ) @ ( K @ or ) @ ( N @ ( K @ or ) @ ( M @ or ) @ implies ) ))]]) ).
thf(131,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ or ) @ ( A @ or ) @ ( C @ ( A @ or ) @ ( B @ or ) @ implies ) @ theorem ),
inference(simp,[status(thm)],[126]) ).
thf(1975,plain,
$false,
inference(e,[status(thm)],[10,14,84,85,13,22,112,18,11,19,83,234,88,37,257,20,46,21,33,45,17,32,34,12,54,49,86,81,230,16,31,250,87,40,55,246,82,131,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL193-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.12/0.39 % Computer : n010.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Fri Sep 25 21:59:44 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 1.32/1.21 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.75/1.42 % [INFO] Parsing done (204ms).
% 1.75/1.44 % [INFO] Running in sequential loop mode.
% 2.52/1.96 % [INFO] eprover registered as external prover.
% 2.52/1.97 % [INFO] Scanning for conjecture ...
% 2.76/2.05 % [INFO] Found a conjecture (or negated_conjecture) and 8 axioms. Running axiom selection ...
% 2.76/2.09 % [INFO] Axiom selection finished. Selected 8 axioms (removed 0 axioms).
% 2.76/2.10 % [INFO] Problem is propositional (TPTP CNF).
% 2.76/2.11 % [INFO] Type checking passed.
% 2.76/2.11 % [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 ...
% 17.63/5.39 % External prover 'e' found a proof!
% 17.63/5.40 % [INFO] Killing All external provers ...
% 18.21/5.40 % Time passed: 4797ms (effective reasoning time: 3948ms)
% 18.21/5.40 % Axioms used in derivation (8): axiom_1_5, axiom_1_4, rule_1, axiom_1_3, implies_definition, axiom_1_2, rule_2, axiom_1_6
% 18.21/5.40 % No. of inferences in proof: 105
% 18.21/5.40 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 4797 ms resp. 3948 ms w/o parsing
% 18.21/5.47 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 18.21/5.47 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------