%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL359-1 : 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 : n018.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:34 AM UTC 2026
% Result : Unsatisfiable 19.58s 5.36s
% Output : Refutation 16.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 5
% Syntax : Number of formulae : 113 ( 49 unt; 0 typ; 0 def)
% Number of atoms : 309 ( 115 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 1735 ( 172 ~; 100 |; 0 &;1463 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 328 ( 0 ^; 328 !; 0 ?; 328 :)
% 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(z_decl,type,
z: $i ).
thf(u_decl,type,
u: $i ).
thf(not_decl,type,
not: $i > $i ).
thf(3,axiom,
! [C: $i,B: $i,A: $i] : ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).
thf(10,plain,
! [C: $i,B: $i,A: $i] : ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: $i] : ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).
thf(11,plain,
! [A: $i] : ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(5,axiom,
! [B: $i,A: $i] : ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
thf(12,plain,
! [B: $i,A: $i] : ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(2,axiom,
! [B: $i,A: $i] :
( ( B @ is_a_theorem )
| ~ ( A @ is_a_theorem )
| ~ ( B @ ( A @ implies ) @ is_a_theorem ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
thf(8,plain,
! [B: $i,A: $i] :
( ( B @ is_a_theorem )
| ~ ( A @ is_a_theorem )
| ~ ( B @ ( A @ implies ) @ is_a_theorem ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
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(31,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)],[12,9]) ).
thf(32,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)],[31]) ).
thf(33,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ not @ implies ) @ is_a_theorem )
| ~ ( B @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[32:[bind(A,$thf( G )),bind(B,$thf( F )),bind(C,$thf( G )),bind(D,$thf( F @ ( G @ not @ implies ) ))]]) ).
thf(46,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ not @ implies ) @ is_a_theorem )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[33]) ).
thf(1,negated_conjecture,
~ ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) @ is_a_theorem ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_08) ).
thf(6,plain,
~ ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(7,plain,
~ ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) @ is_a_theorem ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(66,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) @ is_a_theorem ) )
| ~ $true
| ~ ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[46,7]) ).
thf(67,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) @ is_a_theorem ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[66]) ).
thf(77,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) )
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[67]) ).
thf(114,plain,
! [B: $i,A: $i] :
( ( A
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) ) )
| ( ( B @ not )
!= ( y @ ( x @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[77]) ).
thf(134,plain,
! [A: $i] :
( ( ( A @ not )
!= ( y @ ( x @ implies ) ) )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[114]) ).
thf(165,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( B @ not )
!= ( y @ ( x @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[11,134]) ).
thf(166,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( B @ not )
!= ( y @ ( x @ implies ) ) ) ),
inference(simp,[status(thm)],[165]) ).
thf(167,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(pattern_uni,[status(thm)],[166:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ ( D @ not @ implies ) @ implies ) ))]]) ).
thf(184,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(simp,[status(thm)],[167]) ).
thf(19,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem )
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,7]) ).
thf(20,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem )
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[19]) ).
thf(21,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) )
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[20]) ).
thf(43,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(44,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)],[43]) ).
thf(63,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)],[12,46]) ).
thf(64,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)],[63]) ).
thf(65,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[64:[bind(A,$thf( I )),bind(B,$thf( H )),bind(C,$thf( C )),bind(D,$thf( H @ ( I @ not @ implies ) @ ( I @ implies ) ))]]) ).
thf(78,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(simp,[status(thm)],[65]) ).
thf(86,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)],[78,46]) ).
thf(87,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)],[86]) ).
thf(88,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)],[87:[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(96,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)],[88]) ).
thf(142,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)],[96,46]) ).
thf(143,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)],[142]) ).
thf(144,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)],[143:[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(155,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)],[144]) ).
thf(15,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[12,7]) ).
thf(16,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[15]) ).
thf(18,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ not @ implies ) @ ( A @ implies ) )
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[16]) ).
thf(177,plain,
! [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 )
!= ( E @ is_a_theorem ) )
| ( ( E @ not )
!= ( y @ ( x @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[96,134]) ).
thf(178,plain,
! [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 )
!= ( E @ is_a_theorem ) )
| ( ( E @ not )
!= ( y @ ( x @ implies ) ) ) ),
inference(simp,[status(thm)],[177]) ).
thf(179,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ ( D @ not @ implies ) @ ( D @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(pattern_uni,[status(thm)],[178:[bind(A,$thf( G )),bind(B,$thf( J )),bind(C,$thf( O )),bind(D,$thf( P )),bind(E,$thf( G @ ( J @ ( O @ ( P @ not @ implies ) @ ( P @ implies ) @ not @ implies ) @ not @ implies ) ))]]) ).
thf(182,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ ( D @ not @ implies ) @ ( D @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(simp,[status(thm)],[179]) ).
thf(68,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)],[11,46]) ).
thf(69,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)],[68]) ).
thf(70,plain,
! [B: $i,A: $i] : ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[69:[bind(A,$thf( E )),bind(B,$thf( B )),bind(C,$thf( E @ ( E @ ( E @ not @ implies ) @ implies ) ))]]) ).
thf(79,plain,
! [B: $i,A: $i] : ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(simp,[status(thm)],[70]) ).
thf(101,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)],[79,46]) ).
thf(102,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)],[101]) ).
thf(103,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)],[102:[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(111,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)],[103]) ).
thf(168,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 @ ( x @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[79,134]) ).
thf(169,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 @ ( x @ implies ) ) ) ),
inference(simp,[status(thm)],[168]) ).
thf(170,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(pattern_uni,[status(thm)],[169:[bind(A,$thf( E )),bind(B,$thf( H )),bind(C,$thf( E @ ( H @ ( H @ ( H @ not @ implies ) @ implies ) @ not @ implies ) ))]]) ).
thf(185,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(simp,[status(thm)],[170]) ).
thf(13,plain,
! [A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[11,7]) ).
thf(14,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[13]) ).
thf(17,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ not @ implies ) @ implies ) )
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[14]) ).
thf(22,plain,
! [A: $i] :
( ( A
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) ) )
| ( ( A @ ( A @ not @ implies ) )
!= ( y @ ( x @ implies ) ) ) ),
inference(simp,[status(thm)],[17]) ).
thf(23,plain,
( ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ not @ implies ) )
!= ( y @ ( x @ implies ) ) ),
inference(simp,[status(thm)],[22]) ).
thf(24,plain,
( ( ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) )
!= y )
| ( ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) @ not )
!= x ) ),
inference(simp,[status(thm)],[23]) ).
thf(52,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) )
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) ) )
| ( A
!= ( y @ ( x @ implies ) ) ) ),
inference(simp,[status(thm)],[18]) ).
thf(53,plain,
! [A: $i] :
( ( A @ ( y @ ( x @ implies ) @ not @ implies ) )
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) @ ( x @ ( z @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[52]) ).
thf(45,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ implies ) )
!= A )
| ~ ( A @ is_a_theorem )
| ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[43]) ).
thf(174,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 @ ( x @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[78,134]) ).
thf(175,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 @ ( x @ implies ) ) ) ),
inference(simp,[status(thm)],[174]) ).
thf(176,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(pattern_uni,[status(thm)],[175:[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(180,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(simp,[status(thm)],[176]) ).
thf(159,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 @ ( x @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,134]) ).
thf(160,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 @ ( x @ implies ) ) ) ),
inference(simp,[status(thm)],[159]) ).
thf(161,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ implies ) @ ( C @ ( A @ implies ) @ implies ) @ ( A @ ( B @ implies ) @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(pattern_uni,[status(thm)],[160:[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(181,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( B @ implies ) @ ( C @ ( A @ implies ) @ implies ) @ ( A @ ( B @ implies ) @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(simp,[status(thm)],[161]) ).
thf(171,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ not )
!= ( y @ ( x @ implies ) ) )
| ~ $true
| ~ ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[46,134]) ).
thf(172,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ not )
!= ( y @ ( x @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[171]) ).
thf(173,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[172:[bind(A,$thf( E )),bind(B,$thf( F )),bind(C,$thf( E @ ( F @ not @ implies ) ))]]) ).
thf(186,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[173]) ).
thf(290,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ ( C @ ( C @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( E @ is_a_theorem ) )
| ( ( D @ ( E @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[111,186]) ).
thf(291,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ ( C @ ( C @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( E @ is_a_theorem ) )
| ( ( D @ ( E @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ) ),
inference(simp,[status(thm)],[290]) ).
thf(292,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ ( D @ ( D @ ( D @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(pattern_uni,[status(thm)],[291:[bind(A,$thf( G )),bind(B,$thf( J )),bind(C,$thf( M )),bind(D,$thf( D )),bind(E,$thf( G @ ( J @ ( M @ ( M @ ( M @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) ))]]) ).
thf(303,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ ( D @ ( D @ ( D @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(simp,[status(thm)],[292]) ).
thf(258,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ ( C @ ( C @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( E @ is_a_theorem ) )
| ( D @ ( E @ not @ implies ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[111,46]) ).
thf(259,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ ( C @ ( C @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( E @ is_a_theorem ) )
| ( D @ ( E @ not @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[258]) ).
thf(260,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ ( D @ ( D @ ( D @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[259:[bind(A,$thf( G )),bind(B,$thf( J )),bind(C,$thf( M )),bind(D,$thf( D )),bind(E,$thf( G @ ( J @ ( M @ ( M @ ( M @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) ))]]) ).
thf(271,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ ( D @ ( D @ ( D @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(simp,[status(thm)],[260]) ).
thf(293,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 @ ( x @ implies ) ) )
| ~ $true
| ~ ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[46,186]) ).
thf(294,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 @ ( x @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[293]) ).
thf(295,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) )
| ~ ( C @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[294:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( C )),bind(D,$thf( F @ ( G @ not @ implies ) ))]]) ).
thf(304,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) )
| ~ ( C @ is_a_theorem ) ),
inference(simp,[status(thm)],[295]) ).
thf(325,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( E @ is_a_theorem ) )
| ( ( C @ ( D @ ( E @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) )
| ~ $true
| ~ ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[46,304]) ).
thf(326,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( E @ is_a_theorem ) )
| ( ( C @ ( D @ ( E @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[325]) ).
thf(327,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ ( D @ not @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) )
| ~ ( D @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[326:[bind(A,$thf( G )),bind(B,$thf( H )),bind(C,$thf( C )),bind(D,$thf( D )),bind(E,$thf( G @ ( H @ not @ implies ) ))]]) ).
thf(336,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ ( D @ not @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) )
| ~ ( D @ is_a_theorem ) ),
inference(simp,[status(thm)],[327]) ).
thf(54,plain,
! [A: $i] :
( ( A
!= ( u @ ( z @ implies ) @ ( u @ ( y @ implies ) @ implies ) ) )
| ( ( x @ ( z @ implies ) )
!= ( y @ ( x @ implies ) @ not ) ) ),
inference(simp,[status(thm)],[53]) ).
thf(55,plain,
( ( x @ ( z @ implies ) )
!= ( y @ ( x @ implies ) @ not ) ),
inference(simp,[status(thm)],[54]) ).
thf(162,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ not )
!= ( y @ ( x @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[12,134]) ).
thf(163,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ not )
!= ( y @ ( x @ implies ) ) ) ),
inference(simp,[status(thm)],[162]) ).
thf(164,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ not @ implies ) @ ( B @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(pattern_uni,[status(thm)],[163:[bind(A,$thf( H )),bind(B,$thf( G )),bind(C,$thf( G @ ( H @ not @ implies ) @ ( H @ implies ) ))]]) ).
thf(183,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ not @ implies ) @ ( B @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(simp,[status(thm)],[164]) ).
thf(247,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ ( C @ ( C @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ not )
!= ( y @ ( x @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[111,134]) ).
thf(248,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ ( C @ ( C @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( D @ is_a_theorem ) )
| ( ( D @ not )
!= ( y @ ( x @ implies ) ) ) ),
inference(simp,[status(thm)],[247]) ).
thf(249,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ ( C @ ( C @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(pattern_uni,[status(thm)],[248:[bind(A,$thf( F )),bind(B,$thf( I )),bind(C,$thf( L )),bind(D,$thf( F @ ( I @ ( L @ ( L @ ( L @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) ))]]) ).
thf(273,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ ( C @ ( C @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(simp,[status(thm)],[249]) ).
thf(278,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem )
!= ( E @ is_a_theorem ) )
| ( ( D @ ( E @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,186]) ).
thf(279,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem )
!= ( E @ is_a_theorem ) )
| ( ( D @ ( E @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ) ),
inference(simp,[status(thm)],[278]) ).
thf(280,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ ( D @ ( C @ implies ) @ ( D @ ( B @ implies ) @ implies ) @ ( B @ ( C @ implies ) @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(pattern_uni,[status(thm)],[279:[bind(A,$thf( N )),bind(B,$thf( L )),bind(C,$thf( O )),bind(D,$thf( D )),bind(E,$thf( O @ ( N @ implies ) @ ( O @ ( L @ implies ) @ implies ) @ ( L @ ( N @ implies ) @ implies ) ))]]) ).
thf(305,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ ( D @ ( C @ implies ) @ ( D @ ( B @ implies ) @ implies ) @ ( B @ ( C @ implies ) @ implies ) @ not @ implies ) @ not )
!= ( y @ ( x @ implies ) ) ),
inference(simp,[status(thm)],[280]) ).
thf(1923,plain,
$false,
inference(e,[status(thm)],[10,184,6,21,134,44,155,18,182,8,111,185,24,46,78,9,53,77,96,45,180,17,12,181,7,303,271,336,11,304,186,55,23,183,273,305,79]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL359-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07 % 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.13/0.39 % Computer : n018.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Fri Sep 25 22:21:36 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/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
% 0.88/0.96 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.29/1.14 % [INFO] Parsing done (179ms).
% 1.29/1.16 % [INFO] Running in sequential loop mode.
% 1.81/1.56 % [INFO] eprover registered as external prover.
% 1.81/1.57 % [INFO] Scanning for conjecture ...
% 2.02/1.66 % [INFO] Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ...
% 2.02/1.70 % [INFO] Axiom selection finished. Selected 4 axioms (removed 0 axioms).
% 2.19/1.71 % [INFO] Problem is propositional (TPTP CNF).
% 2.19/1.71 % [INFO] Type checking passed.
% 2.19/1.71 % [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 ...
% 19.58/5.36 % External prover 'e' found a proof!
% 19.58/5.36 % [INFO] Killing All external provers ...
% 19.58/5.36 % Time passed: 4828ms (effective reasoning time: 4197ms)
% 19.58/5.36 % Axioms used in derivation (4): cn_1, cn_2, cn_3, condensed_detachment
% 19.58/5.36 % No. of inferences in proof: 113
% 19.58/5.36 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 4828 ms resp. 4197 ms w/o parsing
% 16.92/5.41 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 16.92/5.42 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------