%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL365-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 : n004.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:35 AM UTC 2026
% Result : Unsatisfiable 23.21s 7.09s
% Output : Refutation 18.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 5
% Syntax : Number of formulae : 112 ( 51 unt; 0 typ; 0 def)
% Number of atoms : 302 ( 104 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 1984 ( 157 ~; 94 |; 0 &;1733 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 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 : 320 ( 0 ^; 320 !; 0 ?; 320 :)
% 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(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(65,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(66,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)],[65]) ).
thf(67,plain,
! [B: $i,A: $i] : ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[66:[bind(A,$thf( E )),bind(B,$thf( B )),bind(C,$thf( E @ ( E @ ( E @ not @ implies ) @ implies ) ))]]) ).
thf(78,plain,
! [B: $i,A: $i] : ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(simp,[status(thm)],[67]) ).
thf(1,negated_conjecture,
~ ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_14) ).
thf(6,plain,
~ ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(7,plain,
~ ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(63,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ) )
| ~ $true
| ~ ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[46,7]) ).
thf(64,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[63]) ).
thf(77,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[64]) ).
thf(99,plain,
! [B: $i,A: $i] :
( ( A
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) ) )
| ( ( B @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[77]) ).
thf(116,plain,
! [A: $i] :
( ( ( A @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ ( A @ is_a_theorem ) ),
inference(simp,[status(thm)],[99]) ).
thf(133,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 )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[78,116]) ).
thf(134,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 )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[133]) ).
thf(135,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[134:[bind(A,$thf( E )),bind(B,$thf( H )),bind(C,$thf( E @ ( H @ ( H @ ( H @ not @ implies ) @ implies ) @ not @ implies ) ))]]) ).
thf(138,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[135]) ).
thf(13,plain,
! [A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ 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 @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[13]) ).
thf(17,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ not @ implies ) @ implies ) )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[14]) ).
thf(22,plain,
! [A: $i] :
( ( A
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) ) )
| ( ( A @ ( A @ not @ implies ) )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[17]) ).
thf(23,plain,
( ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ not @ implies ) )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[22]) ).
thf(24,plain,
( ( ( u @ ( y @ ( z @ not @ implies ) @ implies ) )
!= u )
| ( ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ not )
!= ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) ) ) ),
inference(simp,[status(thm)],[23]) ).
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(124,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( B @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[11,116]) ).
thf(125,plain,
! [B: $i,A: $i] :
( ( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ is_a_theorem )
!= ( B @ is_a_theorem ) )
| ( ( B @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[124]) ).
thf(126,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[125:[bind(A,$thf( D )),bind(B,$thf( D @ ( D @ ( D @ not @ implies ) @ implies ) ))]]) ).
thf(140,plain,
! [A: $i] :
( ( A @ ( A @ ( A @ not @ implies ) @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[126]) ).
thf(86,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)],[78,46]) ).
thf(87,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)],[86]) ).
thf(88,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)],[87:[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(96,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)],[88]) ).
thf(251,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)],[96,46]) ).
thf(252,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)],[251]) ).
thf(253,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)],[252:[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(274,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)],[253]) ).
thf(354,plain,
! [F: $i,E: $i,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 )
!= ( F @ is_a_theorem ) )
| ( E @ ( F @ not @ implies ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[274,46]) ).
thf(355,plain,
! [F: $i,E: $i,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 )
!= ( F @ is_a_theorem ) )
| ( E @ ( F @ not @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[354]) ).
thf(356,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ ( D @ ( E @ ( E @ ( E @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[355:[bind(A,$thf( H )),bind(B,$thf( K )),bind(C,$thf( N )),bind(D,$thf( Q )),bind(E,$thf( E )),bind(F,$thf( H @ ( K @ ( N @ ( Q @ ( Q @ ( Q @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ not @ implies ) ))]]) ).
thf(374,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ ( D @ ( E @ ( E @ ( E @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ not @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(simp,[status(thm)],[356]) ).
thf(130,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ $true
| ~ ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[46,116]) ).
thf(131,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[130]) ).
thf(132,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[131:[bind(A,$thf( E )),bind(B,$thf( F )),bind(C,$thf( E @ ( F @ not @ implies ) ))]]) ).
thf(137,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ not @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[132]) ).
thf(176,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 )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ $true
| ~ ( B @ is_a_theorem ) ),
inference(paramod_ordered,[status(thm)],[46,137]) ).
thf(177,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 )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ ( B @ is_a_theorem ) ),
inference(simp,[status(thm)],[176]) ).
thf(178,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ not @ implies ) @ not @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ ( C @ is_a_theorem ) ),
inference(pattern_uni,[status(thm)],[177:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( C )),bind(D,$thf( F @ ( G @ not @ implies ) ))]]) ).
thf(182,plain,
! [C: $i,B: $i,A: $i] :
( ( ( A @ ( B @ ( C @ not @ implies ) @ not @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ ( C @ is_a_theorem ) ),
inference(simp,[status(thm)],[178]) ).
thf(179,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 )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[78,137]) ).
thf(180,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 )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[179]) ).
thf(181,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ ( C @ ( C @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[180:[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(183,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ ( C @ ( C @ not @ implies ) @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[181]) ).
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(68,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 ) @ is_a_theorem )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[10,46]) ).
thf(69,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 ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[68]) ).
thf(70,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( D @ ( C @ implies ) @ ( D @ ( B @ implies ) @ implies ) @ ( B @ ( C @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[69:[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(79,plain,
! [D: $i,C: $i,B: $i,A: $i] : ( A @ ( D @ ( C @ implies ) @ ( D @ ( B @ implies ) @ implies ) @ ( B @ ( C @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(simp,[status(thm)],[70]) ).
thf(60,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(61,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)],[60]) ).
thf(62,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(pattern_uni,[status(thm)],[61:[bind(A,$thf( I )),bind(B,$thf( H )),bind(C,$thf( C )),bind(D,$thf( H @ ( I @ not @ implies ) @ ( I @ implies ) ))]]) ).
thf(83,plain,
! [C: $i,B: $i,A: $i] : ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ is_a_theorem ),
inference(simp,[status(thm)],[62]) ).
thf(141,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 )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[83,116]) ).
thf(142,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 )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[141]) ).
thf(143,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[142:[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(163,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[143]) ).
thf(15,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ 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 @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[15]) ).
thf(18,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ not @ implies ) @ ( A @ implies ) )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[16]) ).
thf(52,plain,
! [B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) ) )
| ( A
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[18]) ).
thf(53,plain,
! [A: $i] :
( ( A @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ not @ implies ) )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[52]) ).
thf(55,plain,
! [A: $i] :
( ( A != u )
| ( ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ not )
!= ( y @ ( z @ not @ implies ) ) ) ),
inference(simp,[status(thm)],[53]) ).
thf(56,plain,
( ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ not )
!= ( y @ ( z @ not @ implies ) ) ),
inference(simp,[status(thm)],[55]) ).
thf(100,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 ) )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[12,77]) ).
thf(101,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 ) )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[100]) ).
thf(102,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[101:[bind(A,$thf( I )),bind(B,$thf( H )),bind(C,$thf( C )),bind(D,$thf( H @ ( I @ not @ implies ) @ ( I @ implies ) ))]]) ).
thf(117,plain,
! [C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ not @ implies ) @ ( C @ implies ) @ not @ implies ) )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[102]) ).
thf(149,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)],[83,46]) ).
thf(150,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)],[149]) ).
thf(151,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)],[150:[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(160,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)],[151]) ).
thf(286,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)],[160,46]) ).
thf(287,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)],[286]) ).
thf(288,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)],[287:[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(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(simp,[status(thm)],[288]) ).
thf(19,plain,
! [C: $i,B: $i,A: $i] :
( ( ( C @ ( A @ implies ) @ ( C @ ( B @ implies ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ is_a_theorem )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ 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 @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ 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 @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[20]) ).
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(84,plain,
! [B: $i,A: $i] :
( ( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[78,7]) ).
thf(85,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) @ is_a_theorem )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) @ is_a_theorem ) ),
inference(simp,[status(thm)],[84]) ).
thf(95,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ ( B @ ( B @ not @ implies ) @ implies ) @ not @ implies ) )
!= ( u @ ( y @ ( z @ not @ implies ) @ implies ) @ ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[85]) ).
thf(170,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 )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[83,137]) ).
thf(171,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 )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[170]) ).
thf(172,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ ( D @ not @ implies ) @ ( D @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[171:[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(186,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( A @ ( B @ ( C @ ( D @ not @ implies ) @ ( D @ implies ) @ not @ implies ) @ not @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[172]) ).
thf(121,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) )
| ~ $true ),
inference(paramod_ordered,[status(thm)],[12,116]) ).
thf(122,plain,
! [C: $i,B: $i,A: $i] :
( ( ( B @ ( A @ not @ implies ) @ ( A @ implies ) @ is_a_theorem )
!= ( C @ is_a_theorem ) )
| ( ( C @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ) ),
inference(simp,[status(thm)],[121]) ).
thf(123,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ not @ implies ) @ ( B @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ),
inference(pattern_uni,[status(thm)],[122:[bind(A,$thf( H )),bind(B,$thf( G )),bind(C,$thf( G @ ( H @ not @ implies ) @ ( H @ implies ) ))]]) ).
thf(139,plain,
! [B: $i,A: $i] :
( ( A @ ( B @ not @ implies ) @ ( B @ implies ) @ not )
!= ( u @ ( z @ ( z @ ( y @ implies ) @ implies ) @ ( x @ implies ) @ implies ) ) ),
inference(simp,[status(thm)],[123]) ).
thf(1138,plain,
$false,
inference(e,[status(thm)],[138,24,116,44,12,140,374,182,11,8,183,79,163,83,10,56,46,78,6,117,302,160,21,137,9,53,77,96,45,17,274,7,18,95,186,139,23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL365-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.15/0.40 % Computer : n004.cluster.edu
% 0.15/0.40 % Model : x86_64 x86_64
% 0.15/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40 % Memory : 8046.5625MB
% 0.15/0.40 % OS : Linux 6.8.0-71-generic
% 0.15/0.40 % CPULimit : 300
% 0.15/0.40 % WCLimit : 300
% 0.15/0.40 % DateTime : Fri Sep 25 22:19:36 UTC 2026
% 0.15/0.40 % CPUTime :
% 0.15/0.41 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.86/0.96 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.28/1.14 % [INFO] Parsing done (177ms).
% 1.28/1.16 % [INFO] Running in sequential loop mode.
% 1.81/1.57 % [INFO] eprover registered as external prover.
% 1.81/1.58 % [INFO] Scanning for conjecture ...
% 2.02/1.67 % [INFO] Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ...
% 2.17/1.71 % [INFO] Axiom selection finished. Selected 4 axioms (removed 0 axioms).
% 2.17/1.72 % [INFO] Problem is propositional (TPTP CNF).
% 2.17/1.72 % [INFO] Type checking passed.
% 2.17/1.72 % [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 ...
% 23.21/7.08 % External prover 'e' found a proof!
% 23.21/7.08 % [INFO] Killing All external provers ...
% 23.21/7.08 % Time passed: 6554ms (effective reasoning time: 5921ms)
% 23.21/7.09 % Axioms used in derivation (4): cn_2, cn_3, condensed_detachment, cn_1
% 23.21/7.09 % No. of inferences in proof: 112
% 23.21/7.09 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 6554 ms resp. 5921 ms w/o parsing
% 18.90/7.20 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 18.90/7.20 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------