%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL213-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n017.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:12 AM UTC 2026
% Result : Unsatisfiable 22.65s 6.29s
% Output : Refutation 23.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of formulae : 107 ( 48 unt; 0 typ; 0 def)
% Number of atoms : 281 ( 56 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 1546 ( 145 ~; 90 |; 0 &;1311 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 209 ( 0 ^; 209 !; 0 ?; 209 :)
% Comments :
%------------------------------------------------------------------------------
thf(theorem_decl,type,
theorem: $i > $o ).
thf(or_decl,type,
or: $i > $i > $i ).
thf(not_decl,type,
not: $i > $i ).
thf(p_decl,type,
p: $i ).
thf(q_decl,type,
q: $i ).
thf(axiom_decl,type,
axiom: $i > $o ).
thf(3,axiom,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
thf(13,plain,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(8,axiom,
! [B: $i,A: $i] :
( ~ ( B @ theorem )
| ~ ( A @ ( B @ not @ or ) @ axiom )
| ( A @ theorem ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
thf(19,plain,
! [B: $i,A: $i] :
( ~ ( B @ theorem )
| ~ ( A @ ( B @ not @ or ) @ axiom )
| ( A @ theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(20,plain,
! [B: $i,A: $i] :
( ~ ( B @ theorem )
| ~ ( A @ ( B @ not @ or ) @ axiom )
| ( A @ theorem ) ),
inference(cnf,[status(esa)],[19]) ).
thf(26,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom )
!= ( C @ ( D @ not @ or ) @ axiom ) )
| ~ ( D @ theorem )
| ~ $true
| ( C @ theorem ) ),
inference(paramod_ordered,[status(thm)],[13,20]) ).
thf(27,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom )
!= ( C @ ( D @ not @ or ) @ axiom ) )
| ~ ( D @ theorem )
| ( C @ theorem ) ),
inference(simp,[status(thm)],[26]) ).
thf(28,plain,
! [B: $i,A: $i] :
( ~ ( B @ theorem )
| ( B @ ( A @ or ) @ theorem ) ),
inference(pattern_uni,[status(thm)],[27:[bind(A,$thf( F )),bind(B,$thf( E )),bind(C,$thf( F @ ( E @ or ) )),bind(D,$thf( F ))]]) ).
thf(33,plain,
! [B: $i,A: $i] :
( ~ ( B @ theorem )
| ( B @ ( A @ or ) @ theorem ) ),
inference(simp,[status(thm)],[28]) ).
thf(1,negated_conjecture,
~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( p @ not @ or ) @ not @ or ) @ theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
thf(10,plain,
~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( p @ not @ or ) @ not @ or ) @ theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(11,plain,
~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( p @ not @ or ) @ not @ or ) @ theorem ),
inference(polarity_switch,[status(thm)],[10]) ).
thf(406,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( p @ not @ or ) @ not @ or ) @ theorem ) )
| ~ $true
| ~ ( B @ theorem ) ),
inference(paramod_ordered,[status(thm)],[33,11]) ).
thf(407,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( p @ not @ or ) @ not @ or ) @ theorem ) )
| ~ ( B @ theorem ) ),
inference(simp,[status(thm)],[406]) ).
thf(408,plain,
~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[407:[bind(A,$thf( q @ ( p @ not @ or ) @ not )),bind(B,$thf( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) ))]]) ).
thf(4,axiom,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ not @ or ) @ axiom ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
thf(14,plain,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ not @ or ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(473,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ theorem ) )
| ~ $true
| ~ ( B @ theorem ) ),
inference(paramod_ordered,[status(thm)],[33,408]) ).
thf(474,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ theorem ) )
| ~ ( B @ theorem ) ),
inference(simp,[status(thm)],[473]) ).
thf(475,plain,
~ ( q @ theorem ),
inference(pattern_uni,[status(thm)],[474:[bind(A,$thf( q @ ( p @ not @ not @ or ) @ not )),bind(B,$thf( q ))]]) ).
thf(7,axiom,
! [A: $i] :
( ~ ( A @ axiom )
| ( A @ theorem ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
thf(17,plain,
! [A: $i] :
( ~ ( A @ axiom )
| ( A @ theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(18,plain,
! [A: $i] :
( ~ ( A @ axiom )
| ( A @ theorem ) ),
inference(cnf,[status(esa)],[17]) ).
thf(107,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ not @ or ) @ axiom )
!= ( C @ axiom ) )
| ~ $true
| ( C @ theorem ) ),
inference(paramod_ordered,[status(thm)],[14,18]) ).
thf(108,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ not @ or ) @ axiom )
!= ( C @ axiom ) )
| ( C @ theorem ) ),
inference(simp,[status(thm)],[107]) ).
thf(109,plain,
! [B: $i,A: $i] : ( B @ ( A @ or ) @ ( A @ ( B @ or ) @ not @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[108:[bind(A,$thf( J )),bind(B,$thf( I )),bind(C,$thf( J @ ( I @ or ) @ ( I @ ( J @ or ) @ not @ or ) ))]]) ).
thf(126,plain,
! [B: $i,A: $i] : ( B @ ( A @ or ) @ ( A @ ( B @ or ) @ not @ or ) @ theorem ),
inference(simp,[status(thm)],[109]) ).
thf(23,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ not @ or ) @ axiom )
!= ( C @ ( D @ not @ or ) @ axiom ) )
| ~ ( D @ theorem )
| ~ $true
| ( C @ theorem ) ),
inference(paramod_ordered,[status(thm)],[14,20]) ).
thf(24,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ not @ or ) @ axiom )
!= ( C @ ( D @ not @ or ) @ axiom ) )
| ~ ( D @ theorem )
| ( C @ theorem ) ),
inference(simp,[status(thm)],[23]) ).
thf(25,plain,
! [B: $i,A: $i] :
( ~ ( A @ ( B @ or ) @ theorem )
| ( B @ ( A @ or ) @ theorem ) ),
inference(pattern_uni,[status(thm)],[24:[bind(A,$thf( H )),bind(B,$thf( G )),bind(C,$thf( H @ ( G @ or ) )),bind(D,$thf( G @ ( H @ or ) ))]]) ).
thf(32,plain,
! [B: $i,A: $i] :
( ~ ( A @ ( B @ or ) @ theorem )
| ( B @ ( A @ or ) @ theorem ) ),
inference(simp,[status(thm)],[25]) ).
thf(286,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ ( A @ ( B @ or ) @ not @ or ) @ theorem )
!= ( C @ ( D @ or ) @ theorem ) )
| ~ $true
| ( D @ ( C @ or ) @ theorem ) ),
inference(paramod_ordered,[status(thm)],[126,32]) ).
thf(287,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ ( A @ ( B @ or ) @ not @ or ) @ theorem )
!= ( C @ ( D @ or ) @ theorem ) )
| ( D @ ( C @ or ) @ theorem ) ),
inference(simp,[status(thm)],[286]) ).
thf(288,plain,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ not @ ( B @ ( A @ or ) @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[287:[bind(A,$thf( H )),bind(B,$thf( I )),bind(C,$thf( I @ ( H @ or ) )),bind(D,$thf( H @ ( I @ or ) @ not ))]]) ).
thf(307,plain,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ not @ ( B @ ( A @ or ) @ or ) @ theorem ),
inference(simp,[status(thm)],[288]) ).
thf(2,axiom,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ not @ or ) @ axiom ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
thf(12,plain,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ not @ or ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(116,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ or ) @ not @ or ) @ axiom )
!= ( B @ axiom ) )
| ~ $true
| ( B @ theorem ) ),
inference(paramod_ordered,[status(thm)],[12,18]) ).
thf(117,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ or ) @ not @ or ) @ axiom )
!= ( B @ axiom ) )
| ( B @ theorem ) ),
inference(simp,[status(thm)],[116]) ).
thf(118,plain,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ not @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[117:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ ( D @ or ) @ not @ or ) ))]]) ).
thf(124,plain,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ not @ or ) @ theorem ),
inference(simp,[status(thm)],[118]) ).
thf(194,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ or ) @ not @ or ) @ theorem )
!= ( B @ ( C @ or ) @ theorem ) )
| ~ $true
| ( C @ ( B @ or ) @ theorem ) ),
inference(paramod_ordered,[status(thm)],[124,32]) ).
thf(195,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ or ) @ not @ or ) @ theorem )
!= ( B @ ( C @ or ) @ theorem ) )
| ( C @ ( B @ or ) @ theorem ) ),
inference(simp,[status(thm)],[194]) ).
thf(196,plain,
! [A: $i] : ( A @ ( A @ or ) @ not @ ( A @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[195:[bind(A,$thf( F )),bind(B,$thf( F )),bind(C,$thf( F @ ( F @ or ) @ not ))]]) ).
thf(224,plain,
! [A: $i] : ( A @ ( A @ or ) @ not @ ( A @ or ) @ theorem ),
inference(simp,[status(thm)],[196]) ).
thf(110,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom )
!= ( C @ axiom ) )
| ~ $true
| ( C @ theorem ) ),
inference(paramod_ordered,[status(thm)],[13,18]) ).
thf(111,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom )
!= ( C @ axiom ) )
| ( C @ theorem ) ),
inference(simp,[status(thm)],[110]) ).
thf(112,plain,
! [B: $i,A: $i] : ( B @ ( A @ or ) @ ( B @ not @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[111:[bind(A,$thf( H )),bind(B,$thf( G )),bind(C,$thf( H @ ( G @ or ) @ ( H @ not @ or ) ))]]) ).
thf(122,plain,
! [B: $i,A: $i] : ( B @ ( A @ or ) @ ( B @ not @ or ) @ theorem ),
inference(simp,[status(thm)],[112]) ).
thf(9,axiom,
! [C: $i,B: $i,A: $i] :
( ~ ( B @ ( C @ not @ or ) @ theorem )
| ~ ( C @ ( A @ not @ or ) @ axiom )
| ( B @ ( A @ not @ or ) @ theorem ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_3) ).
thf(21,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( B @ ( C @ not @ or ) @ theorem )
| ~ ( C @ ( A @ not @ or ) @ axiom )
| ( B @ ( A @ not @ or ) @ theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(22,plain,
! [C: $i,B: $i,A: $i] :
( ~ ( B @ ( C @ not @ or ) @ theorem )
| ~ ( C @ ( A @ not @ or ) @ axiom )
| ( B @ ( A @ not @ or ) @ theorem ) ),
inference(cnf,[status(esa)],[21]) ).
thf(50,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( p @ not @ or ) @ not @ or ) @ theorem ) )
| ~ $true
| ~ ( B @ ( C @ not @ or ) @ theorem )
| ~ ( C @ ( A @ not @ or ) @ axiom ) ),
inference(paramod_ordered,[status(thm)],[22,11]) ).
thf(51,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( p @ not @ or ) @ not @ or ) @ theorem ) )
| ~ ( B @ ( C @ not @ or ) @ theorem )
| ~ ( C @ ( A @ not @ or ) @ axiom ) ),
inference(simp,[status(thm)],[50]) ).
thf(52,plain,
! [A: $i] :
( ~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( A @ not @ or ) @ theorem )
| ~ ( A @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) ),
inference(pattern_uni,[status(thm)],[51:[bind(A,$thf( q @ ( p @ not @ or ) )),bind(B,$thf( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) )),bind(C,$thf( C ))]]) ).
thf(54,plain,
! [A: $i] :
( ~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( A @ not @ or ) @ theorem )
| ~ ( A @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) ),
inference(simp,[status(thm)],[52]) ).
thf(135,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ ( B @ not @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( C @ not @ or ) @ theorem ) )
| ~ $true
| ~ ( C @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) ),
inference(paramod_ordered,[status(thm)],[122,54]) ).
thf(136,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ ( B @ not @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( C @ not @ or ) @ theorem ) )
| ~ ( C @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) ),
inference(simp,[status(thm)],[135]) ).
thf(137,plain,
~ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ),
inference(pattern_uni,[status(thm)],[136:[bind(A,$thf( q @ ( p @ not @ not @ or ) @ not )),bind(B,$thf( q )),bind(C,$thf( q ))]]) ).
thf(156,plain,
! [A: $i] :
( ( ( A @ ( A @ ( A @ or ) @ not @ or ) @ axiom )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[12,137]) ).
thf(157,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ or ) @ not @ or ) @ axiom )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) ),
inference(simp,[status(thm)],[156]) ).
thf(161,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ or ) @ not @ or ) )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) ) ),
inference(simp,[status(thm)],[157]) ).
thf(391,plain,
! [A: $i] :
( ( A != q )
| ( ( A @ ( A @ or ) @ not )
!= ( q @ ( p @ not @ or ) @ not ) ) ),
inference(simp,[status(thm)],[161]) ).
thf(392,plain,
( ( q @ ( p @ not @ or ) @ not )
!= ( q @ ( q @ or ) @ not ) ),
inference(simp,[status(thm)],[391]) ).
thf(393,plain,
( ( q @ ( p @ not @ or ) )
!= ( q @ ( q @ or ) ) ),
inference(simp,[status(thm)],[392]) ).
thf(461,plain,
( ( q != q )
| ( ( p @ not )
!= q ) ),
inference(simp,[status(thm)],[393]) ).
thf(462,plain,
( ( p @ not )
!= q ),
inference(simp,[status(thm)],[461]) ).
thf(6,axiom,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ or ) @ ( A @ ( C @ or ) @ not @ or ) @ ( B @ ( A @ not @ or ) @ not @ or ) @ axiom ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
thf(16,plain,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ or ) @ ( A @ ( C @ or ) @ not @ or ) @ ( B @ ( A @ not @ or ) @ not @ or ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(152,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[13,137]) ).
thf(153,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) ),
inference(simp,[status(thm)],[152]) ).
thf(160,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ or ) @ ( A @ not @ or ) )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) ) ),
inference(simp,[status(thm)],[153]) ).
thf(165,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ or ) )
!= q )
| ( ( A @ not )
!= ( q @ ( p @ not @ or ) @ not ) ) ),
inference(simp,[status(thm)],[160]) ).
thf(294,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ ( A @ ( B @ or ) @ not @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( C @ not @ or ) @ theorem ) )
| ~ $true
| ~ ( C @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) ),
inference(paramod_ordered,[status(thm)],[126,54]) ).
thf(295,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ ( A @ ( B @ or ) @ not @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( C @ not @ or ) @ theorem ) )
| ~ ( C @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) ),
inference(simp,[status(thm)],[294]) ).
thf(296,plain,
~ ( q @ ( p @ not @ not @ or ) @ not @ ( q @ or ) @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ),
inference(pattern_uni,[status(thm)],[295:[bind(A,$thf( q @ ( p @ not @ not @ or ) @ not )),bind(B,$thf( q )),bind(C,$thf( q @ ( p @ not @ not @ or ) @ not @ ( q @ or ) ))]]) ).
thf(174,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ or ) @ not @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( B @ not @ or ) @ theorem ) )
| ~ $true
| ~ ( B @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) ),
inference(paramod_ordered,[status(thm)],[124,54]) ).
thf(175,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ or ) @ not @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( B @ not @ or ) @ theorem ) )
| ~ ( B @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) ),
inference(simp,[status(thm)],[174]) ).
thf(176,plain,
~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ or ) @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ),
inference(pattern_uni,[status(thm)],[175:[bind(A,$thf( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) )),bind(B,$thf( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ or ) ))]]) ).
thf(69,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom )
!= ( C @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) )
| ~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( C @ not @ or ) @ theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[13,54]) ).
thf(70,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom )
!= ( C @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) )
| ~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( C @ not @ or ) @ theorem ) ),
inference(simp,[status(thm)],[69]) ).
thf(71,plain,
! [A: $i] :
~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( p @ not @ or ) @ ( A @ or ) @ not @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[70:[bind(A,$thf( q @ ( p @ not @ or ) )),bind(B,$thf( G )),bind(C,$thf( q @ ( p @ not @ or ) @ ( G @ or ) ))]]) ).
thf(81,plain,
! [A: $i] :
~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( p @ not @ or ) @ ( A @ or ) @ not @ or ) @ theorem ),
inference(simp,[status(thm)],[71]) ).
thf(93,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ or ) @ ( A @ ( C @ or ) @ not @ or ) @ ( B @ ( A @ not @ or ) @ not @ or ) @ axiom )
!= ( D @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) )
| ~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( D @ not @ or ) @ theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[16,54]) ).
thf(94,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ or ) @ ( A @ ( C @ or ) @ not @ or ) @ ( B @ ( A @ not @ or ) @ not @ or ) @ axiom )
!= ( D @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) )
| ~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( D @ not @ or ) @ theorem ) ),
inference(simp,[status(thm)],[93]) ).
thf(95,plain,
! [A: $i] :
~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( A @ or ) @ ( p @ ( A @ or ) @ not @ or ) @ not @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[94:[bind(A,$thf( p )),bind(B,$thf( q )),bind(C,$thf( J )),bind(D,$thf( q @ ( J @ or ) @ ( p @ ( J @ or ) @ not @ or ) ))]]) ).
thf(98,plain,
! [A: $i] :
~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( A @ or ) @ ( p @ ( A @ or ) @ not @ or ) @ not @ or ) @ theorem ),
inference(simp,[status(thm)],[95]) ).
thf(208,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ ( B @ not @ or ) @ theorem )
!= ( C @ ( D @ or ) @ theorem ) )
| ~ $true
| ( D @ ( C @ or ) @ theorem ) ),
inference(paramod_ordered,[status(thm)],[122,32]) ).
thf(209,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ ( B @ not @ or ) @ theorem )
!= ( C @ ( D @ or ) @ theorem ) )
| ( D @ ( C @ or ) @ theorem ) ),
inference(simp,[status(thm)],[208]) ).
thf(210,plain,
! [B: $i,A: $i] : ( B @ not @ ( B @ ( A @ or ) @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[209:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( G @ ( F @ or ) )),bind(D,$thf( G @ not ))]]) ).
thf(223,plain,
! [B: $i,A: $i] : ( B @ not @ ( B @ ( A @ or ) @ or ) @ theorem ),
inference(simp,[status(thm)],[210]) ).
thf(214,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( p @ not @ or ) @ ( C @ or ) @ not @ or ) @ theorem ) )
| ~ $true
| ~ ( A @ ( B @ or ) @ theorem ) ),
inference(paramod_ordered,[status(thm)],[32,81]) ).
thf(215,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( q @ ( p @ not @ or ) @ ( C @ or ) @ not @ or ) @ theorem ) )
| ~ ( A @ ( B @ or ) @ theorem ) ),
inference(simp,[status(thm)],[214]) ).
thf(216,plain,
! [A: $i] :
~ ( q @ ( p @ not @ or ) @ ( A @ or ) @ not @ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[215:[bind(A,$thf( q @ ( p @ not @ or ) @ ( E @ or ) @ not )),bind(B,$thf( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) )),bind(C,$thf( E ))]]) ).
thf(226,plain,
! [A: $i] :
~ ( q @ ( p @ not @ or ) @ ( A @ or ) @ not @ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ or ) @ theorem ),
inference(simp,[status(thm)],[216]) ).
thf(189,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ or ) )
!= q )
| ( A
!= ( q @ ( p @ not @ or ) ) ) ),
inference(simp,[status(thm)],[165]) ).
thf(190,plain,
! [A: $i] :
( ( q @ ( p @ not @ or ) @ ( A @ or ) )
!= q ),
inference(simp,[status(thm)],[189]) ).
thf(442,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ theorem )
!= ( q @ ( p @ not @ or ) @ ( C @ or ) @ not @ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ or ) @ theorem ) )
| ~ $true
| ~ ( B @ theorem ) ),
inference(paramod_ordered,[status(thm)],[33,226]) ).
thf(443,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ theorem )
!= ( q @ ( p @ not @ or ) @ ( C @ or ) @ not @ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ or ) @ theorem ) )
| ~ ( B @ theorem ) ),
inference(simp,[status(thm)],[442]) ).
thf(444,plain,
! [A: $i] :
~ ( q @ ( p @ not @ or ) @ ( A @ or ) @ not @ theorem ),
inference(pattern_uni,[status(thm)],[443:[bind(A,$thf( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) )),bind(B,$thf( q @ ( p @ not @ or ) @ ( L @ or ) @ not )),bind(C,$thf( L ))]]) ).
thf(459,plain,
! [A: $i] :
~ ( q @ ( p @ not @ or ) @ ( A @ or ) @ not @ theorem ),
inference(simp,[status(thm)],[444]) ).
thf(5,axiom,
! [C: $i,B: $i,A: $i] : ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ not @ or ) @ axiom ),
file('/export/starexec/sandbox/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 ) @ not @ or ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(66,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ not @ or ) @ axiom )
!= ( C @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) )
| ~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( C @ not @ or ) @ theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[14,54]) ).
thf(67,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ not @ or ) @ axiom )
!= ( C @ ( q @ ( p @ not @ or ) @ not @ or ) @ axiom ) )
| ~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( C @ not @ or ) @ theorem ) ),
inference(simp,[status(thm)],[66]) ).
thf(68,plain,
~ ( q @ ( q @ ( p @ not @ not @ or ) @ not @ or ) @ ( p @ not @ ( q @ or ) @ not @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[67:[bind(A,$thf( p @ not )),bind(B,$thf( q )),bind(C,$thf( p @ not @ ( q @ or ) ))]]) ).
thf(3784,plain,
$false,
inference(e,[status(thm)],[408,10,14,20,475,307,224,124,462,18,16,11,126,122,160,392,165,33,21,137,393,13,32,161,296,17,176,22,12,54,81,98,223,226,190,19,459,15,68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL213-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.14/0.41 % Computer : n017.cluster.edu
% 0.14/0.41 % Model : x86_64 x86_64
% 0.14/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41 % Memory : 8046.5625MB
% 0.14/0.41 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.41 % WCLimit : 300
% 0.14/0.41 % DateTime : Fri Sep 25 21:56:47 UTC 2026
% 0.14/0.41 % CPUTime :
% 0.14/0.41 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.98/0.95 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.29/1.13 % [INFO] Parsing done (182ms).
% 1.29/1.14 % [INFO] Running in sequential loop mode.
% 2.06/1.47 % [INFO] eprover registered as external prover.
% 2.06/1.48 % [INFO] Scanning for conjecture ...
% 2.32/1.55 % [INFO] Found a conjecture (or negated_conjecture) and 8 axioms. Running axiom selection ...
% 2.32/1.58 % [INFO] Axiom selection finished. Selected 8 axioms (removed 0 axioms).
% 2.32/1.59 % [INFO] Problem is propositional (TPTP CNF).
% 2.32/1.60 % [INFO] Type checking passed.
% 2.56/1.60 % [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 ...
% 22.65/6.29 % External prover 'e' found a proof!
% 22.65/6.29 % [INFO] Killing All external provers ...
% 22.65/6.29 % Time passed: 5748ms (effective reasoning time: 5138ms)
% 22.65/6.29 % 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
% 22.65/6.29 % No. of inferences in proof: 107
% 22.65/6.29 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 5748 ms resp. 5138 ms w/o parsing
% 23.17/6.37 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 23.17/6.37 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------