%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEU848^5 : TPTP v9.3.1. Released v4.0.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 : n011.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 : Wed Sep 30 08:29:28 AM UTC 2026
% Result : Theorem 6.94s 3.09s
% Output : Refutation 6.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 5
% Syntax : Number of formulae : 82 ( 15 unt; 0 typ; 4 def)
% Number of atoms : 408 ( 73 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 634 ( 119 ~; 190 |; 4 &; 305 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 84 ( 42 ^; 38 !; 0 ?; 84 :)
% ( 0 !>; 0 ?*; 0 @-; 4 @+)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_decl,type,
sk1: a > $o ).
thf(sk2_decl,type,
sk2: a > $o ).
thf(sk3_decl,type,
sk3: a ).
thf(sk4_decl,type,
sk4: a ).
thf(sk5_decl,type,
sk5: a ).
thf(sk10_decl,type,
sk10: a ).
thf(sk1_def,definition,
( sk1
= ( @+[A: a > $o] :
~ ! [B: a > $o] :
( ( ( ^ [C: a] :
( ( A @ C )
| ( B @ C ) ) )
= A )
= ( ! [C: a] :
( ( B @ C )
=> ( A @ C ) ) ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: a > $o] :
( ( ( ^ [B: a] :
( ( sk1 @ B )
| ( A @ B ) ) )
= sk1 )
!= ( ! [B: a] :
( ( A @ B )
=> ( sk1 @ B ) ) ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: a] :
~ ( ( sk2 @ A )
=> ( sk1 @ A ) ) ) ) ).
thf(sk10_def,definition,
( sk10
= ( @+[A: a] :
~ ( ( sk2 @ A )
=> ( sk1 @ A ) ) ) ) ).
thf(1,conjecture,
! [A: a > $o,B: a > $o] :
( ( ( ^ [C: a] :
( ( A @ C )
| ( B @ C ) ) )
= A )
= ( ! [C: a] :
( ( B @ C )
=> ( A @ C ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cGAZING_THM38_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > $o,B: a > $o] :
( ( ( ^ [C: a] :
( ( A @ C )
| ( B @ C ) ) )
= A )
= ( ! [C: a] :
( ( B @ C )
=> ( A @ C ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > $o,B: a > $o] :
( ( ( ^ [C: a] :
( ( A @ C )
| ( B @ C ) ) )
= A )
= ( ! [C: a] :
( ( B @ C )
=> ( A @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
= sk1 )
!= ( ! [A: a] :
( ( sk2 @ A )
=> ( sk1 @ A ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
= sk1 )
!= ( ! [A: a] :
( ( sk2 @ A )
=> ( sk1 @ A ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(6,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
!= sk1 )
| ~ ! [A: a] :
( ( sk2 @ A )
=> ( sk1 @ A ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(8,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
!= sk1 )
| ~ ! [A: a] :
( ( sk2 @ A )
=> ( sk1 @ A ) ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(10,plain,
( ( ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
!= sk1 )
| ( sk2 @ sk3 ) )
& ( ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
!= sk1 )
| ~ ( sk1 @ sk3 ) ) ),
inference(cnf,[status(esa)],[8]) ).
thf(11,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
!= sk1 )
| ( sk2 @ sk3 ) ),
inference(cnfConj,[status(thm)],[10]) ).
thf(14,plain,
( ( ( ( sk1 @ sk4 )
| ( sk2 @ sk4 ) )
!= ( sk1 @ sk4 ) )
| ( sk2 @ sk3 ) ),
inference(func_ext,[status(esa)],[11]) ).
thf(16,plain,
( ( sk2 @ sk3 )
| ~ ( ( sk1 @ sk4 )
| ( sk2 @ sk4 ) )
| ~ ( sk1 @ sk4 ) ),
inference(bool_ext,[status(thm)],[14]) ).
thf(18,plain,
( ( ( sk2 @ sk3 )
| ~ ( sk1 @ sk4 )
| ~ ( sk1 @ sk4 ) )
& ( ( sk2 @ sk3 )
| ~ ( sk2 @ sk4 )
| ~ ( sk1 @ sk4 ) ) ),
inference(cnf,[status(esa)],[16]) ).
thf(19,plain,
( ( sk2 @ sk3 )
| ~ ( sk1 @ sk4 )
| ~ ( sk1 @ sk4 ) ),
inference(cnfConj,[status(thm)],[18]) ).
thf(21,plain,
( ( sk2 @ sk3 )
| ~ ( sk1 @ sk4 ) ),
inference(simp,[status(thm)],[19]) ).
thf(7,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
= sk1 )
| ! [A: a] :
( ( sk2 @ A )
=> ( sk1 @ A ) ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(9,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
= sk1 )
| ! [A: a] :
( ( sk2 @ A )
=> ( sk1 @ A ) ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(13,plain,
! [A: a] :
( ( ( ^ [B: a] :
( ( sk1 @ B )
| ( sk2 @ B ) ) )
= sk1 )
| ~ ( sk2 @ A )
| ( sk1 @ A ) ),
inference(cnf,[status(esa)],[9]) ).
thf(54,plain,
! [A: a] :
( ~ ( sk1 @ sk4 )
| ( ( ^ [B: a] :
( ( sk1 @ B )
| ( sk2 @ B ) ) )
= sk1 )
| ~ $true
| ( sk1 @ A )
| ( ( sk2 @ sk3 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[21,13]) ).
thf(55,plain,
! [A: a] :
( ~ ( sk1 @ sk4 )
| ( ( ^ [B: a] :
( ( sk1 @ B )
| ( sk2 @ B ) ) )
= sk1 )
| ( sk1 @ A )
| ( ( sk2 @ sk3 )
!= ( sk2 @ A ) ) ),
inference(simp,[status(thm)],[54]) ).
thf(56,plain,
( ~ ( sk1 @ sk4 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
= sk1 )
| ( sk1 @ sk3 ) ),
inference(pattern_uni,[status(thm)],[55:[bind(A,$thf( sk3 ))]]) ).
thf(12,plain,
( ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
!= sk1 )
| ~ ( sk1 @ sk3 ) ),
inference(cnfConj,[status(thm)],[10]) ).
thf(15,plain,
( ( ( ( sk1 @ sk5 )
| ( sk2 @ sk5 ) )
!= ( sk1 @ sk5 ) )
| ~ ( sk1 @ sk3 ) ),
inference(func_ext,[status(esa)],[12]) ).
thf(25,plain,
( ~ ( sk1 @ sk3 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ( sk1 @ sk5 ) ),
inference(bool_ext,[status(thm)],[15]) ).
thf(30,plain,
( ~ ( sk1 @ sk3 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 )
| ( sk1 @ sk5 ) ),
inference(cnf,[status(esa)],[25]) ).
thf(31,plain,
( ~ ( sk1 @ sk3 )
| ( sk1 @ sk5 )
| ( sk2 @ sk5 ) ),
inference(simp,[status(thm)],[30]) ).
thf(57,plain,
! [A: a] :
( ~ ( sk2 @ A )
| ( sk1 @ A )
| ( sk1 != sk1 )
| ~ ( sk1 @ sk3 )
| ( ( ^ [B: a] :
( ( sk1 @ B )
| ( sk2 @ B ) ) )
!= ( ^ [B: a] :
( ( sk1 @ B )
| ( sk2 @ B ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[13,12]) ).
thf(58,plain,
! [A: a] :
( ~ ( sk2 @ A )
| ( sk1 @ A )
| ~ ( sk1 @ sk3 )
| ( ( ^ [B: a] :
( ( sk1 @ B )
| ( sk2 @ B ) ) )
!= ( ^ [B: a] :
( ( sk1 @ B )
| ( sk2 @ B ) ) ) ) ),
inference(simp,[status(thm)],[57]) ).
thf(59,plain,
! [A: a] :
( ~ ( sk2 @ A )
| ( sk1 @ A )
| ~ ( sk1 @ sk3 ) ),
inference(pattern_uni,[status(thm)],[58:[]]) ).
thf(111,plain,
! [A: a] :
( ~ ( sk1 @ sk3 )
| ( sk1 @ sk5 )
| ~ $true
| ( sk1 @ A )
| ~ ( sk1 @ sk3 )
| ( ( sk2 @ sk5 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[31,59]) ).
thf(112,plain,
! [A: a] :
( ~ ( sk1 @ sk3 )
| ( sk1 @ sk5 )
| ( sk1 @ A )
| ( ( sk2 @ sk5 )
!= ( sk2 @ A ) ) ),
inference(simp,[status(thm)],[111]) ).
thf(113,plain,
( ~ ( sk1 @ sk3 )
| ( sk1 @ sk5 )
| ( sk1 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[112:[bind(A,$thf( sk5 ))]]) ).
thf(117,plain,
( ~ ( sk1 @ sk3 )
| ( sk1 @ sk5 ) ),
inference(simp,[status(thm)],[113]) ).
thf(24,plain,
( ~ ( sk1 @ sk3 )
| ~ ( ( sk1 @ sk5 )
| ( sk2 @ sk5 ) )
| ~ ( sk1 @ sk5 ) ),
inference(bool_ext,[status(thm)],[15]) ).
thf(26,plain,
( ( ~ ( sk1 @ sk3 )
| ~ ( sk1 @ sk5 )
| ~ ( sk1 @ sk5 ) )
& ( ~ ( sk1 @ sk3 )
| ~ ( sk2 @ sk5 )
| ~ ( sk1 @ sk5 ) ) ),
inference(cnf,[status(esa)],[24]) ).
thf(27,plain,
( ~ ( sk1 @ sk3 )
| ~ ( sk1 @ sk5 )
| ~ ( sk1 @ sk5 ) ),
inference(cnfConj,[status(thm)],[26]) ).
thf(29,plain,
( ~ ( sk1 @ sk3 )
| ~ ( sk1 @ sk5 ) ),
inference(simp,[status(thm)],[27]) ).
thf(141,plain,
( ~ ( sk1 @ sk3 )
| ~ ( sk1 @ sk3 )
| ~ $true
| ( ( sk1 @ sk5 )
!= ( sk1 @ sk5 ) ) ),
inference(paramod_ordered,[status(thm)],[117,29]) ).
thf(142,plain,
( ~ ( sk1 @ sk3 )
| ( ( sk1 @ sk5 )
!= ( sk1 @ sk5 ) ) ),
inference(simp,[status(thm)],[141]) ).
thf(143,plain,
~ ( sk1 @ sk3 ),
inference(pattern_uni,[status(thm)],[142:[]]) ).
thf(251,plain,
( ~ ( sk1 @ sk4 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
= sk1 )
| $false ),
inference(rewrite,[status(thm)],[56,143]) ).
thf(252,plain,
( ~ ( sk1 @ sk4 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
= sk1 ) ),
inference(simp,[status(thm)],[251]) ).
thf(266,plain,
( ~ ( sk1 @ sk4 )
| ( ( sk1 = sk1 )
!= ( ! [A: a] :
( ( sk2 @ A )
=> ( sk1 @ A ) ) ) )
| ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
!= ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[252,5]) ).
thf(267,plain,
( ~ ( sk1 @ sk4 )
| ~ ! [A: a] :
( ( sk2 @ A )
=> ( sk1 @ A ) )
| ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
!= ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) ) ) ),
inference(simp,[status(thm)],[266]) ).
thf(268,plain,
( ~ ( sk1 @ sk4 )
| ~ ! [A: a] :
( ( sk2 @ A )
=> ( sk1 @ A ) ) ),
inference(pattern_uni,[status(thm)],[267:[]]) ).
thf(272,plain,
( ( ~ ( sk1 @ sk4 )
| ( sk2 @ sk10 ) )
& ( ~ ( sk1 @ sk4 )
| ~ ( sk1 @ sk10 ) ) ),
inference(cnf,[status(esa)],[268]) ).
thf(274,plain,
( ~ ( sk1 @ sk4 )
| ~ ( sk1 @ sk10 ) ),
inference(cnfConj,[status(thm)],[272]) ).
thf(288,plain,
( ~ ( sk1 @ sk4 )
| ( ( sk1 @ sk10 )
!= ( sk1 @ sk4 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[274]) ).
thf(289,plain,
( ~ ( sk1 @ sk4 )
| ( ( sk1 @ sk10 )
!= ( sk1 @ sk4 ) ) ),
inference(simp,[status(thm)],[288]) ).
thf(17,plain,
( ( sk2 @ sk3 )
| ( sk1 @ sk4 )
| ( sk2 @ sk4 )
| ( sk1 @ sk4 ) ),
inference(bool_ext,[status(thm)],[14]) ).
thf(22,plain,
( ( sk2 @ sk3 )
| ( sk1 @ sk4 )
| ( sk2 @ sk4 )
| ( sk1 @ sk4 ) ),
inference(cnf,[status(esa)],[17]) ).
thf(23,plain,
( ( sk2 @ sk3 )
| ( sk1 @ sk4 )
| ( sk2 @ sk4 ) ),
inference(simp,[status(thm)],[22]) ).
thf(63,plain,
! [A: a] :
( ( sk2 @ sk3 )
| ( sk1 @ sk4 )
| ( ( ^ [B: a] :
( ( sk1 @ B )
| ( sk2 @ B ) ) )
= sk1 )
| ~ $true
| ( sk1 @ A )
| ( ( sk2 @ sk4 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[23,13]) ).
thf(64,plain,
! [A: a] :
( ( sk2 @ sk3 )
| ( sk1 @ sk4 )
| ( ( ^ [B: a] :
( ( sk1 @ B )
| ( sk2 @ B ) ) )
= sk1 )
| ( sk1 @ A )
| ( ( sk2 @ sk4 )
!= ( sk2 @ A ) ) ),
inference(simp,[status(thm)],[63]) ).
thf(65,plain,
( ( sk2 @ sk3 )
| ( sk1 @ sk4 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
= sk1 )
| ( sk1 @ sk4 ) ),
inference(pattern_uni,[status(thm)],[64:[bind(A,$thf( sk4 ))]]) ).
thf(66,plain,
( ( sk2 @ sk3 )
| ( sk1 @ sk4 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
= sk1 ) ),
inference(simp,[status(thm)],[65]) ).
thf(94,plain,
( ( sk2 @ sk3 )
| ( sk1 @ sk4 )
| ( sk1 != sk1 )
| ( sk2 @ sk3 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
!= ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[66,11]) ).
thf(95,plain,
( ( sk2 @ sk3 )
| ( sk1 @ sk4 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
!= ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) ) ) ),
inference(simp,[status(thm)],[94]) ).
thf(96,plain,
( ( sk2 @ sk3 )
| ( sk1 @ sk4 ) ),
inference(pattern_uni,[status(thm)],[95:[]]) ).
thf(102,plain,
! [A: a] :
( ( sk1 @ sk4 )
| ( ( ^ [B: a] :
( ( sk1 @ B )
| ( sk2 @ B ) ) )
= sk1 )
| ~ $true
| ( sk1 @ A )
| ( ( sk2 @ sk3 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[96,13]) ).
thf(103,plain,
! [A: a] :
( ( sk1 @ sk4 )
| ( ( ^ [B: a] :
( ( sk1 @ B )
| ( sk2 @ B ) ) )
= sk1 )
| ( sk1 @ A )
| ( ( sk2 @ sk3 )
!= ( sk2 @ A ) ) ),
inference(simp,[status(thm)],[102]) ).
thf(104,plain,
( ( sk1 @ sk4 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
= sk1 )
| ( sk1 @ sk3 ) ),
inference(pattern_uni,[status(thm)],[103:[bind(A,$thf( sk3 ))]]) ).
thf(177,plain,
( ( sk1 @ sk4 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
= sk1 )
| $false ),
inference(rewrite,[status(thm)],[104,143]) ).
thf(178,plain,
( ( sk1 @ sk4 )
| ( ( ^ [A: a] :
( ( sk1 @ A )
| ( sk2 @ A ) ) )
= sk1 ) ),
inference(simp,[status(thm)],[177]) ).
thf(203,plain,
! [A: a] :
( ( ( ( sk1 @ A )
| ( sk2 @ A ) )
= ( sk1 @ A ) )
| ( sk1 @ sk4 ) ),
inference(func_ext,[status(esa)],[178]) ).
thf(337,plain,
! [A: a] :
( ( sk1 @ sk4 )
| ( ( ( sk1 @ A )
| $true )
= ( sk1 @ A ) )
| ( sk1 @ sk4 )
| ( ( sk2 @ sk3 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[96,203]) ).
thf(338,plain,
! [A: a] :
( ( sk1 @ sk4 )
| ( sk1 @ A )
| ( ( sk2 @ sk3 )
!= ( sk2 @ A ) ) ),
inference(simp,[status(thm)],[337]) ).
thf(339,plain,
( ( sk1 @ sk4 )
| ( sk1 @ sk3 ) ),
inference(pattern_uni,[status(thm)],[338:[bind(A,$thf( sk3 ))]]) ).
thf(361,plain,
( ( sk1 @ sk4 )
| $false ),
inference(rewrite,[status(thm)],[339,143]) ).
thf(362,plain,
sk1 @ sk4,
inference(simp,[status(thm)],[361]) ).
thf(365,plain,
( ~ $true
| ~ ( sk1 @ sk10 ) ),
inference(rewrite,[status(thm)],[289,362]) ).
thf(366,plain,
~ ( sk1 @ sk10 ),
inference(simp,[status(thm)],[365]) ).
thf(290,plain,
( ~ ( sk1 @ sk4 )
| ( sk10 != sk4 ) ),
inference(simp,[status(thm)],[288]) ).
thf(373,plain,
( ~ $true
| ( sk10 != sk4 ) ),
inference(rewrite,[status(thm)],[290,362]) ).
thf(374,plain,
sk10 != sk4,
inference(simp,[status(thm)],[373]) ).
thf(50,plain,
! [B: a,A: a] :
( ( ( ( sk1 @ B )
| ( sk2 @ B ) )
= ( sk1 @ B ) )
| ~ ( sk2 @ A )
| ( sk1 @ A ) ),
inference(func_ext,[status(esa)],[13]) ).
thf(363,plain,
( ~ ( $true
| ( sk2 @ sk4 ) )
| ( sk2 @ sk3 ) ),
inference(rewrite,[status(thm)],[14,362]) ).
thf(364,plain,
sk2 @ sk3,
inference(simp,[status(thm)],[363]) ).
thf(446,plain,
$false,
inference(e,[status(thm)],[5,366,13,362,3,374,50,143,364]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU848^5 : TPTP v9.3.1. Released v4.0.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.09/0.19 % Computer : n011.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 14:40:01 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 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.89/0.79 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.20/0.96 % [INFO] Parsing done (174ms).
% 1.20/0.98 % [INFO] Running in sequential loop mode.
% 1.76/1.37 % [INFO] eprover registered as external prover.
% 1.76/1.38 % [INFO] Scanning for conjecture ...
% 1.93/1.46 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.09/1.50 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.09/1.50 % [INFO] Problem is higher-order (TPTP THF).
% 2.09/1.50 % [INFO] Type checking passed.
% 2.09/1.51 % [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 ...
% 6.94/3.09 % External prover 'e' found a proof!
% 6.94/3.09 % [INFO] Killing All external provers ...
% 6.94/3.09 % Time passed: 2745ms (effective reasoning time: 2106ms)
% 6.94/3.09 % 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)>
% 6.94/3.09 % Axioms used in derivation (0):
% 6.94/3.09 % No. of inferences in proof: 78
% 6.94/3.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2745 ms resp. 2106 ms w/o parsing
% 6.38/3.17 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.38/3.17 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------