%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL371+1 : TPTP v9.3.1. Released v9.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 : n013.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:37 AM UTC 2026
% Result : Theorem 23.99s 6.80s
% Output : Refutation 23.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of formulae : 116 ( 50 unt; 0 typ; 0 def)
% Number of atoms : 316 ( 115 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 1733 ( 171 ~; 100 |; 2 &;1458 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 308 ( 0 ^; 308 !; 0 ?; 308 :)
% Comments :
%------------------------------------------------------------------------------
thf(is_a_theorem_decl,type,
is_a_theorem: $i > $o ).
thf(implies_decl,type,
implies: $i > $i > $i ).
thf(x_decl,type,
x: $i ).
thf(y_decl,type,
y: $i ).
thf(not_decl,type,
not: $i > $i ).
thf(6,axiom,
! [A: $i,B: $i] : ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
thf(14,plain,
! [A: $i,B: $i] : ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(15,plain,
! [B: $i,A: $i] : ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem ),
inference(cnf,[status(esa)],[14]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( ( A @ is_a_theorem )
& ( B @ ( A @ implies ) @ is_a_theorem ) )
=> ( B @ is_a_theorem ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
thf(8,plain,
! [A: $i,B: $i] :
( ( ( A @ is_a_theorem )
& ( B @ ( A @ implies ) @ is_a_theorem ) )
=> ( B @ is_a_theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(9,plain,
! [B: $i,A: $i] :
( ( B @ is_a_theorem )
| ~ ( A @ is_a_theorem )
| ~ ( B @ ( A @ implies ) @ is_a_theorem ) ),
inference(cnf,[status(esa)],[8]) ).
thf(44,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( D @ ( C @ implies ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ ( C @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[15,9]) ).
thf(45,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( D @ ( C @ implies ) @ is_a_theorem ) )
| ( D @ is_a_theorem )
| ~ ( C @ is_a_theorem ) ),
inference(simp,[status(thm)],[44]) ).
thf(46,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ not @ implies ) @ is_a_theorem )
| ~ ( B @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[45:[bind(A,$thf( G )),bind(B,$thf( F )),bind(C,$thf( G )),bind(D,$thf( F @ ( G @ not @ implies ) ))]]) ).
thf(58,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ not @ implies ) @ is_a_theorem )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[46]) ).
thf(1,conjecture,
x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_27) ).
thf(2,negated_conjecture,
~ ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(7,plain,
~ ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(81,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ) )
| ~ $true
| ~ ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[58,7]) ).
thf(82,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[81]) ).
thf(92,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[82]) ).
thf(106,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( C @ ( D @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) )
| ~ $true
| ~ ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[58,92]) ).
thf(107,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( C @ ( D @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[106]) ).
thf(108,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ not @ implies ) @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) )
| ~ ( C @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[107:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( C )),bind(D,$thf( F @ ( G @ not @ implies ) ))]]) ).
thf(115,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ not @ implies ) @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) )
| ~ ( C @ is_a_theorem ) ),
inference(simp,[status(thm)],[108]) ).
thf(4,axiom,
! [A: $i,B: $i,C: $i] : ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).
thf(10,plain,
! [A: $i,B: $i,C: $i] : ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(5,axiom,
! [A: $i] : ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
thf(12,plain,
! [A: $i] : ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(13,plain,
! [A: $i] : ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem ),
inference(cnf,[status(esa)],[12]) ).
thf(16,plain,
! [A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[13,7]) ).
thf(17,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[16]) ).
thf(18,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ not @ implies ) @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[17]) ).
thf(22,plain,
! [A: $i] :
( ( A
!= ( x @ ( x @ ( y @ implies ) @ implies ) ) )
| ( ( A @ ( A @ not @ implies ) )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[18]) ).
thf(23,plain,
( ( x @ ( x @ ( y @ implies ) @ implies ) @ ( x @ ( x @ ( y @ implies ) @ implies ) @ not @ implies ) )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[22]) ).
thf(24,plain,
( ( ( x @ ( x @ ( y @ implies ) @ implies ) )
!= y )
| ( ( x @ ( x @ ( y @ implies ) @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ) ),
inference(simp,[status(thm)],[23]) ).
thf(19,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[15,7]) ).
thf(20,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[19]) ).
thf(21,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ not @ implies ) @ ( A @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[20]) ).
thf(75,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( B @ ( C @ not @ implies ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[13,58]) ).
thf(76,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( B @ ( C @ not @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[75]) ).
thf(77,plain,
! [B: $i,A: $i] : ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[76:[bind(A,$thf( E )),bind(B,$thf( B )),bind(C,$thf( E @ ( E @ ( E @ not @ implies ) @ implies ) ))]]) ).
thf(98,plain,
! [B: $i,A: $i] : ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(simp,[status(thm)],[77]) ).
thf(217,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( C @ ( D @ not @ implies ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[98,58]) ).
thf(218,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( C @ ( D @ not @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[217]) ).
thf(219,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ ( C @ ( C @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[218:[bind(A,$thf( F )),bind(B,$thf( I )),bind(C,$thf( C )),bind(D,$thf( F @ ( I @ ( I @ ( I @ not @ implies ) @ implies ) @ not @ implies ) ))]]) ).
thf(237,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ ( C @ ( C @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(simp,[status(thm)],[219]) ).
thf(99,plain,
! [B: $i,A: $i] :
( ( A
!= ( x @ ( x @ ( y @ implies ) @ implies ) ) )
| ( ( B @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[92]) ).
thf(112,plain,
! [A: $i] :
( ( ( A @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[99]) ).
thf(117,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( B @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[13,112]) ).
thf(118,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( B @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[117]) ).
thf(119,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[118:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ ( D @ not @ implies ) @ implies ) ))]]) ).
thf(130,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[119]) ).
thf(28,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) ) )
| ( A
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[21]) ).
thf(29,plain,
! [A: $i] :
( ( A @ ( y @ ( y @ ( x @ implies ) @ implies ) @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[28]) ).
thf(30,plain,
! [A: $i] :
( ( A != x )
| ( ( y @ ( y @ ( x @ implies ) @ implies ) @ not )
!= ( x @ ( y @ implies ) ) ) ),
inference(simp,[status(thm)],[29]) ).
thf(31,plain,
( ( y @ ( y @ ( x @ implies ) @ implies ) @ not )
!= ( x @ ( y @ implies ) ) ),
inference(simp,[status(thm)],[30]) ).
thf(50,plain,
! [B: $i,A: $i] :
( ~ $true
| ( ( B @ ( A @ implies ) @ is_a_theorem )
!= ( A @ is_a_theorem ) )
| ( B @ is_a_theorem )
| ~ ( A @ is_a_theorem ) ),
inference(eqfactor_ordered,[status(thm)],[9]) ).
thf(51,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ implies ) @ is_a_theorem )
!= ( A @ is_a_theorem ) )
| ~ ( A @ is_a_theorem )
| ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[50]) ).
thf(52,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ implies ) )
!= A )
| ~ ( A @ is_a_theorem )
| ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[50]) ).
thf(89,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( C @ ( D @ not @ implies ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[15,58]) ).
thf(90,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( C @ ( D @ not @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[89]) ).
thf(91,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[90:[bind(A,$thf( I )),bind(B,$thf( H )),bind(C,$thf( C )),bind(D,$thf( H @ ( I @ not @ implies ) @ ( I @ implies ) ))]]) ).
thf(97,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(simp,[status(thm)],[91]) ).
thf(123,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ $true
| ~ ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[58,112]) ).
thf(124,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[123]) ).
thf(125,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[124:[bind(A,$thf( E )),bind(B,$thf( F )),bind(C,$thf( E @ ( F @ not @ implies ) ))]]) ).
thf(132,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[125]) ).
thf(246,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( E @ is_a_theorem ) )
| ( ( D @ ( E @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[97,132]) ).
thf(247,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( E @ is_a_theorem ) )
| ( ( D @ ( E @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[246]) ).
thf(248,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ ( D @ not @ implies ) @ ( D @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[247:[bind(A,$thf( G )),bind(B,$thf( L )),bind(C,$thf( M )),bind(D,$thf( D )),bind(E,$thf( G @ ( L @ ( M @ not @ implies ) @ ( M @ implies ) @ not @ implies ) ))]]) ).
thf(261,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ ( D @ not @ implies ) @ ( D @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[248]) ).
thf(109,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( C @ ( D @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[15,92]) ).
thf(110,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( C @ ( D @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[109]) ).
thf(111,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[110:[bind(A,$thf( I )),bind(B,$thf( H )),bind(C,$thf( C )),bind(D,$thf( H @ ( I @ not @ implies ) @ ( I @ implies ) ))]]) ).
thf(116,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[111]) ).
thf(126,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[15,112]) ).
thf(127,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[126]) ).
thf(128,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ not @ implies ) @ ( B @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[127:[bind(A,$thf( H )),bind(B,$thf( G )),bind(C,$thf( G @ ( H @ not @ implies ) @ ( H @ implies ) ))]]) ).
thf(129,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ not @ implies ) @ ( B @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[128]) ).
thf(240,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( C @ ( D @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ $true
| ~ ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[58,132]) ).
thf(241,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( C @ ( D @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[240]) ).
thf(242,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ ( C @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[241:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( C )),bind(D,$thf( F @ ( G @ not @ implies ) ))]]) ).
thf(259,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ ( C @ is_a_theorem ) ),
inference(simp,[status(thm)],[242]) ).
thf(11,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ),
inference(cnf,[status(esa)],[10]) ).
thf(25,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[11,7]) ).
thf(26,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[25]) ).
thf(27,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[26]) ).
thf(32,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( C @ ( B @ implies ) @ is_a_theorem ) )
| ( C @ is_a_theorem )
| ~ ( B @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[13,9]) ).
thf(33,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( C @ ( B @ implies ) @ is_a_theorem ) )
| ( C @ is_a_theorem )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[32]) ).
thf(34,plain,
! [A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( A @ not @ implies ) @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[33:[bind(A,$thf( E )),bind(B,$thf( E @ ( E @ not @ implies ) )),bind(C,$thf( E ))]]) ).
thf(54,plain,
! [A: $i] :
( ( A @ is_a_theorem )
| ~ ( A @ ( A @ not @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[34]) ).
thf(214,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[98,112]) ).
thf(215,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[214]) ).
thf(216,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[215:[bind(A,$thf( E )),bind(B,$thf( H )),bind(C,$thf( E @ ( H @ ( H @ ( H @ not @ implies ) @ implies ) @ not @ implies ) ))]]) ).
thf(236,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[216]) ).
thf(100,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( B @ ( C @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[13,92]) ).
thf(101,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( B @ ( C @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[100]) ).
thf(102,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[101:[bind(A,$thf( E )),bind(B,$thf( B )),bind(C,$thf( E @ ( E @ ( E @ not @ implies ) @ implies ) ))]]) ).
thf(113,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) )
!= ( x @ ( x @ ( y @ implies ) @ implies ) @ ( y @ ( y @ ( x @ implies ) @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[102]) ).
thf(147,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( E @ is_a_theorem ) )
| ( D @ ( E @ not @ implies ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[97,58]) ).
thf(148,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( E @ is_a_theorem ) )
| ( D @ ( E @ not @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[147]) ).
thf(149,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ ( D @ not @ implies ) @ ( D @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[148:[bind(A,$thf( G )),bind(B,$thf( L )),bind(C,$thf( M )),bind(D,$thf( D )),bind(E,$thf( G @ ( L @ ( M @ not @ implies ) @ ( M @ implies ) @ not @ implies ) ))]]) ).
thf(155,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ ( D @ not @ implies ) @ ( D @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(simp,[status(thm)],[149]) ).
thf(300,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ ( D @ not @ implies ) @ ( D @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( F @ is_a_theorem ) )
| ( E @ ( F @ not @ implies ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[155,58]) ).
thf(301,plain,
! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ ( D @ not @ implies ) @ ( D @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( F @ is_a_theorem ) )
| ( E @ ( F @ not @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[300]) ).
thf(302,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ ( D @ ( E @ not @ implies ) @ ( E @ implies ) @ not @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[301:[bind(A,$thf( H )),bind(B,$thf( K )),bind(C,$thf( P )),bind(D,$thf( Q )),bind(E,$thf( E )),bind(F,$thf( H @ ( K @ ( P @ ( Q @ not @ implies ) @ ( Q @ implies ) @ not @ implies ) @ not @ implies ) ))]]) ).
thf(330,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ ( D @ ( E @ not @ implies ) @ ( E @ implies ) @ not @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(simp,[status(thm)],[302]) ).
thf(252,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( C @ ( D @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[98,132]) ).
thf(253,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( C @ ( D @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[252]) ).
thf(254,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ ( C @ ( C @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[253:[bind(A,$thf( F )),bind(B,$thf( I )),bind(C,$thf( C )),bind(D,$thf( F @ ( I @ ( I @ ( I @ not @ implies ) @ implies ) @ not @ implies ) ))]]) ).
thf(263,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ ( C @ ( C @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[254]) ).
thf(144,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[97,112]) ).
thf(145,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[144]) ).
thf(146,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[145:[bind(A,$thf( F )),bind(B,$thf( K )),bind(C,$thf( L )),bind(D,$thf( F @ ( K @ ( L @ not @ implies ) @ ( L @ implies ) @ not @ implies ) ))]]) ).
thf(154,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[146]) ).
thf(120,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[11,112]) ).
thf(121,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[120]) ).
thf(122,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ implies ) @ ( C @ ( A @ implies ) @ implies ) @ ( A @ ( B @ implies ) @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[121:[bind(A,$thf( M )),bind(B,$thf( K )),bind(C,$thf( N )),bind(D,$thf( N @ ( M @ implies ) @ ( N @ ( K @ implies ) @ implies ) @ ( K @ ( M @ implies ) @ implies ) ))]]) ).
thf(131,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ implies ) @ ( C @ ( A @ implies ) @ implies ) @ ( A @ ( B @ implies ) @ implies ) @ not )
!= ( y @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[122]) ).
thf(3354,plain,
$false,
inference(e,[status(thm)],[115,10,24,21,9,237,130,112,31,23,51,52,14,261,29,132,116,92,97,13,129,259,27,12,54,236,113,7,98,155,330,18,263,154,11,8,58,131,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL371+1 : TPTP v9.3.1. Released v9.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.15/0.41 % Computer : n013.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Fri Sep 25 22:20:06 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 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.93/0.99 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.34/1.17 % [INFO] Parsing done (175ms).
% 1.34/1.18 % [INFO] Running in sequential loop mode.
% 1.91/1.58 % [INFO] eprover registered as external prover.
% 1.91/1.59 % [INFO] Scanning for conjecture ...
% 2.11/1.67 % [INFO] Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ...
% 2.27/1.70 % [INFO] Axiom selection finished. Selected 4 axioms (removed 0 axioms).
% 2.27/1.72 % [INFO] Problem is first-order (TPTP FOF).
% 2.27/1.73 % [INFO] Type checking passed.
% 2.27/1.73 % [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 ...
% 25.21/6.80 % External prover 'e' found a proof!
% 25.21/6.80 % [INFO] Killing All external provers ...
% 25.21/6.80 % Time passed: 6241ms (effective reasoning time: 5612ms)
% 25.21/6.80 % 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)>
% 23.99/6.80 % Axioms used in derivation (4): cn_3, condensed_detachment, cn_1, cn_2
% 23.99/6.80 % No. of inferences in proof: 116
% 23.99/6.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 6241 ms resp. 5612 ms w/o parsing
% 23.99/6.89 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 23.99/6.89 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------