%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL330-3 : TPTP v9.3.1. Released v2.3.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 : n009.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:31 AM UTC 2026
% Result : Unsatisfiable 54.53s 12.75s
% Output : Refutation 44.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 113 ( 75 unt; 0 typ; 0 def)
% Number of atoms : 199 ( 65 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 1584 ( 85 ~; 50 |; 0 &;1449 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 224 ( 0 ^; 224 !; 0 ?; 224 :)
% Comments :
%------------------------------------------------------------------------------
thf(theorem_decl,type,
theorem: $i > $o ).
thf(equivalent_decl,type,
equivalent: $i > $i > $i ).
thf(or_decl,type,
or: $i > $i > $i ).
thf(p_decl,type,
p: $i ).
thf(q_decl,type,
q: $i ).
thf(implies_decl,type,
implies: $i > $i > $i ).
thf(axiom_decl,type,
axiom: $i > $o ).
thf(not_decl,type,
not: $i > $i ).
thf(and_decl,type,
and: $i > $i > $i ).
thf(3,axiom,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( A @ implies ) @ axiom ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
thf(15,plain,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( A @ implies ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(7,axiom,
! [B: $i,A: $i] :
( ( B @ ( A @ implies ) )
= ( B @ ( A @ not @ or ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
thf(19,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ implies ) )
= ( B @ ( A @ not @ or ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(20,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ implies ) )
= ( B @ ( A @ not @ or ) ) ),
inference(lifteq,[status(thm)],[19]) ).
thf(31,plain,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom ),
inference(rewrite,[status(thm)],[15,20]) ).
thf(8,axiom,
! [A: $i] :
( ~ ( A @ axiom )
| ( A @ theorem ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
thf(21,plain,
! [A: $i] :
( ~ ( A @ axiom )
| ( A @ theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(22,plain,
! [A: $i] :
( ~ ( A @ axiom )
| ( A @ theorem ) ),
inference(cnf,[status(esa)],[21]) ).
thf(41,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom )
!= ( C @ axiom ) )
| ~ $true
| ( C @ theorem ) ),
inference(paramod_ordered,[status(thm)],[31,22]) ).
thf(42,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( A @ not @ or ) @ axiom )
!= ( C @ axiom ) )
| ( C @ theorem ) ),
inference(simp,[status(thm)],[41]) ).
thf(43,plain,
! [B: $i,A: $i] : ( B @ ( A @ or ) @ ( B @ not @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[42:[bind(A,$thf( H )),bind(B,$thf( G )),bind(C,$thf( H @ ( G @ or ) @ ( H @ not @ or ) ))]]) ).
thf(44,plain,
! [B: $i,A: $i] : ( B @ ( A @ or ) @ ( B @ not @ or ) @ theorem ),
inference(simp,[status(thm)],[43]) ).
thf(1,negated_conjecture,
~ ( q @ ( q @ ( p @ implies ) @ implies ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
thf(12,plain,
~ ( q @ ( q @ ( p @ implies ) @ implies ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(13,plain,
~ ( q @ ( q @ ( p @ implies ) @ implies ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ),
inference(polarity_switch,[status(thm)],[12]) ).
thf(29,plain,
~ ( q @ ( q @ ( p @ implies ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ),
inference(rewrite,[status(thm)],[13,20]) ).
thf(32,plain,
~ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ),
inference(rewrite,[status(thm)],[29,20]) ).
thf(67,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ ( B @ not @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[44,32]) ).
thf(68,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ or ) @ ( B @ not @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ) ),
inference(simp,[status(thm)],[67]) ).
thf(69,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ or ) @ ( B @ not @ or ) )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) ) ),
inference(simp,[status(thm)],[68]) ).
thf(11,axiom,
! [B: $i,A: $i] :
( ( B @ ( A @ equivalent ) )
= ( A @ ( B @ implies ) @ ( B @ ( A @ implies ) @ and ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalent_defn) ).
thf(27,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ equivalent ) )
= ( A @ ( B @ implies ) @ ( B @ ( A @ implies ) @ and ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(28,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ implies ) @ ( B @ ( A @ implies ) @ and ) )
= ( B @ ( A @ equivalent ) ) ),
inference(lifteq,[status(thm)],[27]) ).
thf(10,axiom,
! [B: $i,A: $i] :
( ( B @ ( A @ and ) )
= ( B @ not @ ( A @ not @ or ) @ not ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).
thf(25,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ and ) )
= ( B @ not @ ( A @ not @ or ) @ not ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(26,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ and ) )
= ( B @ not @ ( A @ not @ or ) @ not ) ),
inference(lifteq,[status(thm)],[25]) ).
thf(83,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ not )
= ( B @ ( A @ equivalent ) ) ),
inference(rewrite,[status(thm)],[28,26]) ).
thf(112,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) ) )
| ~ ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ not @ theorem ) ),
inference(paramod_ordered,[status(thm)],[83,32]) ).
thf(113,plain,
~ ( q @ ( p @ or ) @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ implies ) @ not @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ implies ) @ not @ or ) @ not @ theorem ),
inference(pattern_uni,[status(thm)],[112:[bind(A,$thf( q @ ( p @ or ) )),bind(B,$thf( q @ ( q @ ( p @ not @ or ) @ not @ or ) ))]]) ).
thf(217,plain,
~ ( q @ ( p @ or ) @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ not @ or ) @ not @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ not @ or ) @ not @ or ) @ not @ theorem ),
inference(rewrite,[status(thm)],[113,20]) ).
thf(111,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ not )
!= ( q @ ( p @ not @ or ) @ not ) )
| ~ ( q @ ( B @ ( A @ equivalent ) @ or ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ) ),
inference(paramod_ordered,[status(thm)],[83,32]) ).
thf(123,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) )
!= ( q @ ( p @ not @ or ) ) )
| ~ ( q @ ( B @ ( A @ equivalent ) @ or ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ) ),
inference(simp,[status(thm)],[111]) ).
thf(321,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ or ) @ not @ ( B @ ( A @ not @ or ) @ not @ or ) )
!= ( q @ ( p @ not @ or ) ) )
| ~ ( q @ ( B @ ( A @ equivalent ) @ or ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ) ),
inference(rewrite,[status(thm)],[123,20]) ).
thf(6,axiom,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ or ) @ ( A @ ( C @ or ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ axiom ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
thf(18,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(204,plain,
! [C: $i,B: $i,A: $i] : ( B @ ( C @ or ) @ ( A @ ( C @ or ) @ implies ) @ ( B @ ( A @ implies ) @ not @ or ) @ axiom ),
inference(rewrite,[status(thm)],[18,20]) ).
thf(210,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ or ) @ ( A @ ( C @ or ) @ implies ) @ ( B @ ( A @ implies ) @ not @ or ) @ axiom )
!= ( D @ axiom ) )
| ~ $true
| ( D @ theorem ) ),
inference(paramod_ordered,[status(thm)],[204,22]) ).
thf(211,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( C @ or ) @ ( A @ ( C @ or ) @ implies ) @ ( B @ ( A @ implies ) @ not @ or ) @ axiom )
!= ( D @ axiom ) )
| ( D @ theorem ) ),
inference(simp,[status(thm)],[210]) ).
thf(212,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ or ) @ ( A @ ( B @ or ) @ implies ) @ ( C @ ( A @ implies ) @ not @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[211:[bind(A,$thf( M )),bind(B,$thf( O )),bind(C,$thf( N )),bind(D,$thf( O @ ( N @ or ) @ ( M @ ( N @ or ) @ implies ) @ ( O @ ( M @ implies ) @ not @ or ) ))]]) ).
thf(215,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ or ) @ ( A @ ( B @ or ) @ implies ) @ ( C @ ( A @ implies ) @ not @ or ) @ theorem ),
inference(simp,[status(thm)],[212]) ).
thf(411,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ or ) @ ( A @ ( B @ or ) @ not @ or ) @ ( C @ ( A @ not @ or ) @ not @ or ) @ theorem ),
inference(rewrite,[status(thm)],[215,20]) ).
thf(2,axiom,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ implies ) @ axiom ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
thf(14,plain,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ implies ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(30,plain,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ not @ or ) @ axiom ),
inference(rewrite,[status(thm)],[14,20]) ).
thf(37,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ or ) @ not @ or ) @ axiom )
!= ( B @ axiom ) )
| ~ $true
| ( B @ theorem ) ),
inference(paramod_ordered,[status(thm)],[30,22]) ).
thf(38,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ or ) @ not @ or ) @ axiom )
!= ( B @ axiom ) )
| ( B @ theorem ) ),
inference(simp,[status(thm)],[37]) ).
thf(39,plain,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ not @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[38:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ ( D @ or ) @ not @ or ) ))]]) ).
thf(40,plain,
! [A: $i] : ( A @ ( A @ ( A @ or ) @ not @ or ) @ theorem ),
inference(simp,[status(thm)],[39]) ).
thf(56,plain,
! [A: $i] :
( ( ( A @ ( A @ ( A @ or ) @ not @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[40,32]) ).
thf(57,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ or ) @ not @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ) ),
inference(simp,[status(thm)],[56]) ).
thf(58,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ or ) @ not @ or ) )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) ) ),
inference(simp,[status(thm)],[57]) ).
thf(104,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) ) )
| ( ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ not )
!= ( C @ ( C @ ( C @ or ) @ not @ or ) ) ) ),
inference(paramod_ordered,[status(thm)],[83,58]) ).
thf(105,plain,
! [A: $i] :
( ( q @ ( p @ or ) @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ implies ) @ not @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ implies ) @ not @ or ) @ not )
!= ( A @ ( A @ ( A @ or ) @ not @ or ) ) ),
inference(pattern_uni,[status(thm)],[104:[bind(A,$thf( q @ ( p @ or ) )),bind(B,$thf( q @ ( q @ ( p @ not @ or ) @ not @ or ) )),bind(C,$thf( C ))]]) ).
thf(131,plain,
! [A: $i] :
( ( q @ ( p @ or ) @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ implies ) @ not @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ implies ) @ not @ or ) @ not )
!= ( A @ ( A @ ( A @ or ) @ not @ or ) ) ),
inference(simp,[status(thm)],[105]) ).
thf(248,plain,
! [A: $i] :
( ( q @ ( p @ or ) @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ not @ or ) @ not @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ not @ or ) @ not @ or ) @ not )
!= ( A @ ( A @ ( A @ or ) @ not @ or ) ) ),
inference(rewrite,[status(thm)],[131,20]) ).
thf(88,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ equivalent ) )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) ) )
| ( ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ not )
!= ( D @ ( C @ or ) @ ( D @ not @ or ) ) ) ),
inference(paramod_ordered,[status(thm)],[83,69]) ).
thf(89,plain,
! [B: $i,A: $i] :
( ( q @ ( p @ or ) @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ implies ) @ not @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ implies ) @ not @ or ) @ not )
!= ( B @ ( A @ or ) @ ( B @ not @ or ) ) ),
inference(pattern_uni,[status(thm)],[88:[bind(A,$thf( q @ ( p @ or ) )),bind(B,$thf( q @ ( q @ ( p @ not @ or ) @ not @ or ) )),bind(C,$thf( C )),bind(D,$thf( D ))]]) ).
thf(137,plain,
! [B: $i,A: $i] :
( ( q @ ( p @ or ) @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ implies ) @ not @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ implies ) @ not @ or ) @ not )
!= ( B @ ( A @ or ) @ ( B @ not @ or ) ) ),
inference(simp,[status(thm)],[89]) ).
thf(989,plain,
! [B: $i,A: $i] :
( ( q @ ( p @ or ) @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ not @ or ) @ not @ ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ not @ or ) @ not @ or ) @ not )
!= ( B @ ( A @ or ) @ ( B @ not @ or ) ) ),
inference(rewrite,[status(thm)],[137,20]) ).
thf(4,axiom,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ implies ) @ axiom ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
thf(16,plain,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ implies ) @ axiom ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(45,plain,
! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ not @ or ) @ axiom ),
inference(rewrite,[status(thm)],[16,20]) ).
thf(46,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)],[45,22]) ).
thf(47,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ not @ or ) @ axiom )
!= ( C @ axiom ) )
| ( C @ theorem ) ),
inference(simp,[status(thm)],[46]) ).
thf(48,plain,
! [B: $i,A: $i] : ( B @ ( A @ or ) @ ( A @ ( B @ or ) @ not @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[47:[bind(A,$thf( J )),bind(B,$thf( I )),bind(C,$thf( J @ ( I @ or ) @ ( I @ ( J @ or ) @ not @ or ) ))]]) ).
thf(49,plain,
! [B: $i,A: $i] : ( B @ ( A @ or ) @ ( A @ ( B @ or ) @ not @ or ) @ theorem ),
inference(simp,[status(thm)],[48]) ).
thf(96,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ not )
!= ( C @ ( D @ or ) @ not ) )
| ( D @ ( C @ or ) @ ( B @ ( A @ equivalent ) @ or ) @ theorem ) ),
inference(paramod_ordered,[status(thm)],[83,49]) ).
thf(97,plain,
! [B: $i,A: $i] : ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ ( A @ ( B @ equivalent ) @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[96:[bind(A,$thf( J )),bind(B,$thf( I )),bind(C,$thf( J @ ( I @ implies ) @ not )),bind(D,$thf( I @ ( J @ implies ) @ not ))]]) ).
thf(128,plain,
! [B: $i,A: $i] : ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ ( A @ ( B @ equivalent ) @ or ) @ theorem ),
inference(simp,[status(thm)],[97]) ).
thf(918,plain,
! [B: $i,A: $i] : ( A @ ( B @ not @ or ) @ not @ ( B @ ( A @ not @ or ) @ not @ or ) @ ( A @ ( B @ equivalent ) @ or ) @ theorem ),
inference(rewrite,[status(thm)],[128,20]) ).
thf(118,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ not )
!= ( C @ ( C @ or ) @ not ) )
| ( C @ ( B @ ( A @ equivalent ) @ or ) @ theorem ) ),
inference(paramod_ordered,[status(thm)],[83,40]) ).
thf(119,plain,
! [A: $i] : ( A @ ( A @ implies ) @ not @ ( A @ ( A @ equivalent ) @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[118:[bind(A,$thf( F )),bind(B,$thf( F )),bind(C,$thf( F @ ( F @ implies ) @ not ))]]) ).
thf(136,plain,
! [A: $i] : ( A @ ( A @ implies ) @ not @ ( A @ ( A @ equivalent ) @ or ) @ theorem ),
inference(simp,[status(thm)],[119]) ).
thf(185,plain,
! [A: $i] : ( A @ ( A @ not @ or ) @ not @ ( A @ ( A @ equivalent ) @ or ) @ theorem ),
inference(rewrite,[status(thm)],[136,20]) ).
thf(114,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ not )
!= ( D @ ( C @ or ) @ not ) )
| ( C @ ( D @ or ) @ ( B @ ( A @ equivalent ) @ or ) @ axiom ) ),
inference(paramod_ordered,[status(thm)],[83,45]) ).
thf(115,plain,
! [B: $i,A: $i] : ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ ( A @ ( B @ equivalent ) @ or ) @ axiom ),
inference(pattern_uni,[status(thm)],[114:[bind(A,$thf( J )),bind(B,$thf( I )),bind(C,$thf( I @ ( J @ implies ) @ not )),bind(D,$thf( J @ ( I @ implies ) @ not ))]]) ).
thf(133,plain,
! [B: $i,A: $i] : ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ ( A @ ( B @ equivalent ) @ or ) @ axiom ),
inference(simp,[status(thm)],[115]) ).
thf(1055,plain,
! [B: $i,A: $i] : ( A @ ( B @ not @ or ) @ not @ ( B @ ( A @ not @ or ) @ not @ or ) @ ( A @ ( B @ equivalent ) @ or ) @ axiom ),
inference(rewrite,[status(thm)],[133,20]) ).
thf(5,axiom,
! [C: $i,B: $i,A: $i] : ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ implies ) @ axiom ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
thf(17,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(165,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ not @ or ) @ axiom ),
inference(rewrite,[status(thm)],[17,20]) ).
thf(9,axiom,
! [B: $i,A: $i] :
( ~ ( B @ theorem )
| ~ ( A @ ( B @ implies ) @ theorem )
| ( A @ theorem ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
thf(23,plain,
! [B: $i,A: $i] :
( ~ ( B @ theorem )
| ~ ( A @ ( B @ implies ) @ theorem )
| ( A @ theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(24,plain,
! [B: $i,A: $i] :
( ~ ( B @ theorem )
| ~ ( A @ ( B @ implies ) @ theorem )
| ( A @ theorem ) ),
inference(cnf,[status(esa)],[23]) ).
thf(33,plain,
! [B: $i,A: $i] :
( ~ ( B @ theorem )
| ~ ( A @ ( B @ not @ or ) @ theorem )
| ( A @ theorem ) ),
inference(rewrite,[status(thm)],[24,20]) ).
thf(100,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ not )
!= ( C @ ( C @ or ) @ not ) )
| ( ( C @ ( B @ ( A @ equivalent ) @ or ) )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) ) ) ),
inference(paramod_ordered,[status(thm)],[83,58]) ).
thf(101,plain,
! [A: $i] :
( ( A @ ( A @ implies ) @ not @ ( A @ ( A @ equivalent ) @ or ) )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) ) ),
inference(pattern_uni,[status(thm)],[100:[bind(A,$thf( F )),bind(B,$thf( F )),bind(C,$thf( F @ ( F @ implies ) @ not ))]]) ).
thf(130,plain,
! [A: $i] :
( ( A @ ( A @ implies ) @ not @ ( A @ ( A @ equivalent ) @ or ) )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) ) ),
inference(simp,[status(thm)],[101]) ).
thf(149,plain,
! [A: $i] :
( ( A @ ( A @ not @ or ) @ not @ ( A @ ( A @ equivalent ) @ or ) )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) ) ),
inference(rewrite,[status(thm)],[130,20]) ).
thf(110,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ not )
!= ( p @ not ) )
| ~ ( q @ ( q @ ( B @ ( A @ equivalent ) @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ) ),
inference(paramod_ordered,[status(thm)],[83,32]) ).
thf(120,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) )
!= p )
| ~ ( q @ ( q @ ( B @ ( A @ equivalent ) @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ) ),
inference(simp,[status(thm)],[110]) ).
thf(286,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ or ) @ not @ ( B @ ( A @ not @ or ) @ not @ or ) )
!= p )
| ~ ( q @ ( q @ ( B @ ( A @ equivalent ) @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ) ),
inference(rewrite,[status(thm)],[120,20]) ).
thf(106,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ implies ) @ not @ ( B @ ( A @ implies ) @ not @ or ) @ not )
!= ( C @ ( C @ or ) @ not ) )
| ( C @ ( B @ ( A @ equivalent ) @ or ) @ axiom ) ),
inference(paramod_ordered,[status(thm)],[83,30]) ).
thf(107,plain,
! [A: $i] : ( A @ ( A @ implies ) @ not @ ( A @ ( A @ equivalent ) @ or ) @ axiom ),
inference(pattern_uni,[status(thm)],[106:[bind(A,$thf( F )),bind(B,$thf( F )),bind(C,$thf( F @ ( F @ implies ) @ not ))]]) ).
thf(132,plain,
! [A: $i] : ( A @ ( A @ implies ) @ not @ ( A @ ( A @ equivalent ) @ or ) @ axiom ),
inference(simp,[status(thm)],[107]) ).
thf(172,plain,
! [A: $i] : ( A @ ( A @ not @ or ) @ not @ ( A @ ( A @ equivalent ) @ or ) @ axiom ),
inference(rewrite,[status(thm)],[132,20]) ).
thf(90,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ implies ) )
!= ( C @ ( D @ implies ) ) )
| ( ( B @ ( A @ not @ or ) @ not @ ( D @ ( C @ implies ) @ not @ or ) @ not )
= ( D @ ( C @ equivalent ) ) ) ),
inference(paramod_ordered,[status(thm)],[20,83]) ).
thf(91,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ not @ or ) @ not @ ( A @ ( B @ implies ) @ not @ or ) @ not )
= ( A @ ( B @ equivalent ) ) ),
inference(pattern_uni,[status(thm)],[90:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( B )),bind(D,$thf( A ))]]) ).
thf(451,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ not @ or ) @ not @ ( A @ ( B @ not @ or ) @ not @ or ) @ not )
= ( A @ ( B @ equivalent ) ) ),
inference(rewrite,[status(thm)],[91,20]) ).
thf(78,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ or ) @ ( A @ ( B @ or ) @ not @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[49,32]) ).
thf(79,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ or ) @ ( A @ ( B @ or ) @ not @ or ) @ theorem )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) @ theorem ) ),
inference(simp,[status(thm)],[78]) ).
thf(80,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ or ) @ ( A @ ( B @ or ) @ not @ or ) )
!= ( q @ ( q @ ( p @ not @ or ) @ not @ or ) @ ( q @ ( p @ or ) @ equivalent ) ) ),
inference(simp,[status(thm)],[79]) ).
thf(34,plain,
! [B: $i,A: $i] :
( ~ $true
| ( ( A @ ( B @ not @ or ) @ theorem )
!= ( B @ theorem ) )
| ~ ( B @ theorem )
| ( A @ theorem ) ),
inference(eqfactor_ordered,[status(thm)],[33]) ).
thf(35,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ or ) @ theorem )
!= ( B @ theorem ) )
| ~ ( B @ theorem )
| ( A @ theorem ) ),
inference(simp,[status(thm)],[34]) ).
thf(167,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ not @ or ) @ axiom )
!= ( D @ axiom ) )
| ~ $true
| ( D @ theorem ) ),
inference(paramod_ordered,[status(thm)],[165,22]) ).
thf(168,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ not @ or ) @ axiom )
!= ( D @ axiom ) )
| ( D @ theorem ) ),
inference(simp,[status(thm)],[167]) ).
thf(169,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ or ) @ ( A @ or ) @ ( C @ ( A @ or ) @ ( B @ or ) @ not @ or ) @ theorem ),
inference(pattern_uni,[status(thm)],[168:[bind(A,$thf( N )),bind(B,$thf( L )),bind(C,$thf( O )),bind(D,$thf( O @ ( N @ or ) @ ( L @ or ) @ ( O @ ( L @ or ) @ ( N @ or ) @ not @ or ) ))]]) ).
thf(171,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( B @ or ) @ ( A @ or ) @ ( C @ ( A @ or ) @ ( B @ or ) @ not @ or ) @ theorem ),
inference(simp,[status(thm)],[169]) ).
thf(92,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ implies ) )
!= ( D @ ( C @ implies ) ) )
| ( ( C @ ( D @ implies ) @ not @ ( B @ ( A @ not @ or ) @ not @ or ) @ not )
= ( D @ ( C @ equivalent ) ) ) ),
inference(paramod_ordered,[status(thm)],[20,83]) ).
thf(93,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ implies ) @ not @ ( B @ ( A @ not @ or ) @ not @ or ) @ not )
= ( B @ ( A @ equivalent ) ) ),
inference(pattern_uni,[status(thm)],[92:[bind(A,$thf( A )),bind(B,$thf( B )),bind(C,$thf( A )),bind(D,$thf( B ))]]) ).
thf(667,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ not @ or ) @ not @ ( B @ ( A @ not @ or ) @ not @ or ) @ not )
= ( B @ ( A @ equivalent ) ) ),
inference(rewrite,[status(thm)],[93,20]) ).
thf(8379,plain,
$false,
inference(e,[status(thm)],[69,217,20,321,411,248,989,18,918,15,83,185,25,1055,14,21,165,33,32,45,17,149,22,44,286,204,27,12,49,172,451,80,35,16,31,40,26,171,23,58,667,30,19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL330-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.12 % 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.22/0.49 % Computer : n009.cluster.edu
% 0.22/0.49 % Model : x86_64 x86_64
% 0.22/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.49 % Memory : 8046.5625MB
% 0.22/0.49 % OS : Linux 6.8.0-71-generic
% 0.22/0.49 % CPULimit : 300
% 0.22/0.49 % WCLimit : 300
% 0.22/0.49 % DateTime : Fri Sep 25 22:15:44 UTC 2026
% 0.22/0.49 % CPUTime :
% 0.22/0.49 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.97/0.98 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.47/1.16 % [INFO] Parsing done (175ms).
% 1.47/1.17 % [INFO] Running in sequential loop mode.
% 2.26/1.52 % [INFO] eprover registered as external prover.
% 2.26/1.53 % [INFO] Scanning for conjecture ...
% 2.48/1.66 % [INFO] Found a conjecture (or negated_conjecture) and 10 axioms. Running axiom selection ...
% 2.69/1.71 % [INFO] Axiom selection finished. Selected 10 axioms (removed 0 axioms).
% 2.69/1.74 % [INFO] Problem is propositional (TPTP CNF).
% 2.69/1.75 % [INFO] Type checking passed.
% 2.69/1.75 % [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 ...
% 54.53/12.74 % External prover 'e' found a proof!
% 54.53/12.74 % [INFO] Killing All external provers ...
% 54.53/12.75 % Time passed: 12114ms (effective reasoning time: 11568ms)
% 54.53/12.75 % Axioms used in derivation (10): axiom_1_5, equivalent_defn, and_defn, axiom_1_4, rule_1, axiom_1_3, implies_definition, axiom_1_2, rule_2, axiom_1_6
% 54.53/12.75 % No. of inferences in proof: 113
% 54.53/12.75 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 12114 ms resp. 11568 ms w/o parsing
% 44.76/12.83 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 44.76/12.83 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------