%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEV396^5 : TPTP v9.3.1. Released v4.0.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 : 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 : Wed Sep 30 08:37:14 AM UTC 2026
% Result : Theorem 6.32s 2.34s
% Output : Refutation 6.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 3
% Syntax : Number of formulae : 85 ( 8 unt; 0 typ; 2 def)
% Number of atoms : 439 ( 82 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 659 ( 128 ~; 153 |; 48 &; 317 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 50 ( 30 ^; 18 !; 0 ?; 50 :)
% ( 0 !>; 0 ?*; 0 @-; 2 @+)
% Comments :
%------------------------------------------------------------------------------
thf(cR_decl,type,
cR: $i > $o ).
thf(cS_decl,type,
cS: $i > $o ).
thf(sk1_decl,type,
sk1: $i ).
thf(sk2_decl,type,
sk2: $i ).
thf(sk3_decl,type,
sk3: $i ).
thf(sk6_decl,type,
sk6: $i ).
thf(sk7_decl,type,
sk7: $i ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i] :
~ ( ( cR @ A )
=> ( cS @ A ) ) ) ) ).
thf(sk6_def,definition,
( sk6
= ( @+[A: $i] :
~ ( ( cR @ A )
=> ( cS @ A ) ) ) ) ).
thf(1,conjecture,
( ( ! [A: $i] :
( ( cR @ A )
=> ( cS @ A ) ) )
= ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
= cR ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM31_pme) ).
thf(2,negated_conjecture,
( ( ! [A: $i] :
( ( cR @ A )
=> ( cS @ A ) ) )
!= ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
= cR ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [A: $i] :
( ( cR @ A )
=> ( cS @ A ) ) )
!= ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
= cR ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [A: $i] :
( ( cR @ A )
=> ( cS @ A ) ) )
!= ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
= cR ) ),
inference(lifteq,[status(thm)],[3]) ).
thf(6,plain,
( ! [A: $i] :
( ( cR @ A )
=> ( cS @ A ) )
| ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
= cR ) ),
inference(bool_ext,[status(thm)],[4]) ).
thf(8,plain,
( ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
= cR )
| ! [A: $i] :
( ( cR @ A )
=> ( cS @ A ) ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(12,plain,
! [A: $i] :
( ( ( ^ [B: $i] :
( ( cR @ B )
& ( cS @ B ) ) )
= cR )
| ~ ( cR @ A )
| ( cS @ A ) ),
inference(cnf,[status(esa)],[8]) ).
thf(56,plain,
! [B: $i,A: $i] :
( ( ( ( cR @ B )
& ( cS @ B ) )
= ( cR @ B ) )
| ~ ( cR @ A )
| ( cS @ A ) ),
inference(func_ext,[status(esa)],[12]) ).
thf(5,plain,
( ~ ! [A: $i] :
( ( cR @ A )
=> ( cS @ A ) )
| ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
!= cR ) ),
inference(bool_ext,[status(thm)],[4]) ).
thf(7,plain,
( ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
!= cR )
| ~ ! [A: $i] :
( ( cR @ A )
=> ( cS @ A ) ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(9,plain,
( ( ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
!= cR )
| ( cR @ sk1 ) )
& ( ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
!= cR )
| ~ ( cS @ sk1 ) ) ),
inference(cnf,[status(esa)],[7]) ).
thf(11,plain,
( ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
!= cR )
| ~ ( cS @ sk1 ) ),
inference(cnfConj,[status(thm)],[9]) ).
thf(14,plain,
( ( ( ( cR @ sk3 )
& ( cS @ sk3 ) )
!= ( cR @ sk3 ) )
| ~ ( cS @ sk1 ) ),
inference(func_ext,[status(esa)],[11]) ).
thf(10,plain,
( ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
!= cR )
| ( cR @ sk1 ) ),
inference(cnfConj,[status(thm)],[9]) ).
thf(13,plain,
( ( ( ( cR @ sk2 )
& ( cS @ sk2 ) )
!= ( cR @ sk2 ) )
| ( cR @ sk1 ) ),
inference(func_ext,[status(esa)],[10]) ).
thf(16,plain,
( ( cR @ sk1 )
| ( ( cR @ sk2 )
& ( cS @ sk2 ) )
| ( cR @ sk2 ) ),
inference(bool_ext,[status(thm)],[13]) ).
thf(17,plain,
( ( ( cR @ sk1 )
| ( cR @ sk2 )
| ( cR @ sk2 ) )
& ( ( cR @ sk1 )
| ( cS @ sk2 )
| ( cR @ sk2 ) ) ),
inference(cnf,[status(esa)],[16]) ).
thf(18,plain,
( ( cR @ sk1 )
| ( cR @ sk2 )
| ( cR @ sk2 ) ),
inference(cnfConj,[status(thm)],[17]) ).
thf(20,plain,
( ( cR @ sk1 )
| ( cR @ sk2 ) ),
inference(simp,[status(thm)],[18]) ).
thf(60,plain,
! [A: $i] :
( ( cR @ sk1 )
| ( ( ^ [B: $i] :
( ( cR @ B )
& ( cS @ B ) ) )
= cR )
| ~ $true
| ( cS @ A )
| ( ( cR @ sk2 )
!= ( cR @ A ) ) ),
inference(paramod_ordered,[status(thm)],[20,12]) ).
thf(61,plain,
! [A: $i] :
( ( cR @ sk1 )
| ( ( ^ [B: $i] :
( ( cR @ B )
& ( cS @ B ) ) )
= cR )
| ( cS @ A )
| ( ( cR @ sk2 )
!= ( cR @ A ) ) ),
inference(simp,[status(thm)],[60]) ).
thf(62,plain,
( ( cR @ sk1 )
| ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
= cR )
| ( cS @ sk2 ) ),
inference(pattern_uni,[status(thm)],[61:[bind(A,$thf( sk2 ))]]) ).
thf(109,plain,
( ( cR @ sk1 )
| ( cS @ sk2 )
| ( cR != cR )
| ( cR @ sk1 )
| ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
!= ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[62,10]) ).
thf(110,plain,
( ( cR @ sk1 )
| ( cS @ sk2 )
| ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
!= ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) ) ) ),
inference(simp,[status(thm)],[109]) ).
thf(111,plain,
( ( cR @ sk1 )
| ( cS @ sk2 ) ),
inference(pattern_uni,[status(thm)],[110:[]]) ).
thf(15,plain,
( ( cR @ sk1 )
| ~ ( ( cR @ sk2 )
& ( cS @ sk2 ) )
| ~ ( cR @ sk2 ) ),
inference(bool_ext,[status(thm)],[13]) ).
thf(21,plain,
( ( cR @ sk1 )
| ~ ( cR @ sk2 )
| ~ ( cS @ sk2 )
| ~ ( cR @ sk2 ) ),
inference(cnf,[status(esa)],[15]) ).
thf(22,plain,
( ( cR @ sk1 )
| ~ ( cR @ sk2 )
| ~ ( cS @ sk2 ) ),
inference(simp,[status(thm)],[21]) ).
thf(82,plain,
( ( cR @ sk1 )
| ( cR @ sk1 )
| ~ $true
| ~ ( cS @ sk2 )
| ( ( cR @ sk2 )
!= ( cR @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[20,22]) ).
thf(83,plain,
( ( cR @ sk1 )
| ~ ( cS @ sk2 )
| ( ( cR @ sk2 )
!= ( cR @ sk2 ) ) ),
inference(simp,[status(thm)],[82]) ).
thf(84,plain,
( ( cR @ sk1 )
| ~ ( cS @ sk2 ) ),
inference(pattern_uni,[status(thm)],[83:[]]) ).
thf(131,plain,
( ( cR @ sk1 )
| ( cR @ sk1 )
| ~ $true
| ( ( cS @ sk2 )
!= ( cS @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[111,84]) ).
thf(132,plain,
( ( cR @ sk1 )
| ( ( cS @ sk2 )
!= ( cS @ sk2 ) ) ),
inference(simp,[status(thm)],[131]) ).
thf(133,plain,
cR @ sk1,
inference(pattern_uni,[status(thm)],[132:[]]) ).
thf(175,plain,
! [A: $i] :
( ( ( ^ [B: $i] :
( ( cR @ B )
& ( cS @ B ) ) )
= cR )
| ~ $true
| ( cS @ A )
| ( ( cR @ sk1 )
!= ( cR @ A ) ) ),
inference(paramod_ordered,[status(thm)],[133,12]) ).
thf(176,plain,
! [A: $i] :
( ( ( ^ [B: $i] :
( ( cR @ B )
& ( cS @ B ) ) )
= cR )
| ( cS @ A )
| ( ( cR @ sk1 )
!= ( cR @ A ) ) ),
inference(simp,[status(thm)],[175]) ).
thf(177,plain,
( ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
= cR )
| ( cS @ sk1 ) ),
inference(pattern_uni,[status(thm)],[176:[bind(A,$thf( sk1 ))]]) ).
thf(201,plain,
( ( cS @ sk1 )
| ( ( cR = cR )
!= ( ! [A: $i] :
( ( cR @ A )
=> ( cS @ A ) ) ) )
| ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
!= ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[177,4]) ).
thf(202,plain,
( ( cS @ sk1 )
| ~ ! [A: $i] :
( ( cR @ A )
=> ( cS @ A ) )
| ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
!= ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) ) ) ),
inference(simp,[status(thm)],[201]) ).
thf(203,plain,
( ( cS @ sk1 )
| ~ ! [A: $i] :
( ( cR @ A )
=> ( cS @ A ) ) ),
inference(pattern_uni,[status(thm)],[202:[]]) ).
thf(204,plain,
( ( ( cS @ sk1 )
| ( cR @ sk6 ) )
& ( ( cS @ sk1 )
| ~ ( cS @ sk6 ) ) ),
inference(cnf,[status(esa)],[203]) ).
thf(205,plain,
( ( cS @ sk1 )
| ( cR @ sk6 ) ),
inference(cnfConj,[status(thm)],[204]) ).
thf(24,plain,
( ~ ( cS @ sk1 )
| ( ( cR @ sk3 )
& ( cS @ sk3 ) )
| ( cR @ sk3 ) ),
inference(bool_ext,[status(thm)],[14]) ).
thf(27,plain,
( ( ~ ( cS @ sk1 )
| ( cR @ sk3 )
| ( cR @ sk3 ) )
& ( ~ ( cS @ sk1 )
| ( cS @ sk3 )
| ( cR @ sk3 ) ) ),
inference(cnf,[status(esa)],[24]) ).
thf(28,plain,
( ~ ( cS @ sk1 )
| ( cR @ sk3 )
| ( cR @ sk3 ) ),
inference(cnfConj,[status(thm)],[27]) ).
thf(30,plain,
( ~ ( cS @ sk1 )
| ( cR @ sk3 ) ),
inference(simp,[status(thm)],[28]) ).
thf(220,plain,
( ( cR @ sk6 )
| ~ $true
| ( cR @ sk3 )
| ( ( cS @ sk1 )
!= ( cS @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[205,30]) ).
thf(221,plain,
( ( cR @ sk6 )
| ( cR @ sk3 )
| ( ( cS @ sk1 )
!= ( cS @ sk1 ) ) ),
inference(simp,[status(thm)],[220]) ).
thf(222,plain,
( ( cR @ sk6 )
| ( cR @ sk3 ) ),
inference(pattern_uni,[status(thm)],[221:[]]) ).
thf(246,plain,
( ( cR @ sk3 )
| ( ( cR @ sk6 )
!= ( cR @ sk3 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[222]) ).
thf(252,plain,
( ( cR @ sk3 )
| ( ( cR @ sk6 )
!= ( cR @ sk3 ) ) ),
inference(simp,[status(thm)],[246]) ).
thf(23,plain,
( ~ ( cS @ sk1 )
| ~ ( ( cR @ sk3 )
& ( cS @ sk3 ) )
| ~ ( cR @ sk3 ) ),
inference(bool_ext,[status(thm)],[14]) ).
thf(25,plain,
( ~ ( cS @ sk1 )
| ~ ( cR @ sk3 )
| ~ ( cS @ sk3 )
| ~ ( cR @ sk3 ) ),
inference(cnf,[status(esa)],[23]) ).
thf(26,plain,
( ~ ( cS @ sk1 )
| ~ ( cR @ sk3 )
| ~ ( cS @ sk3 ) ),
inference(simp,[status(thm)],[25]) ).
thf(31,plain,
( ~ ( cS @ sk1 )
| ~ ( cR @ sk3 )
| ( ( cS @ sk3 )
!= ( cS @ sk1 ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[26]) ).
thf(32,plain,
( ~ ( cS @ sk1 )
| ~ ( cR @ sk3 )
| ( ( cS @ sk3 )
!= ( cS @ sk1 ) ) ),
inference(simp,[status(thm)],[31]) ).
thf(253,plain,
( ( cR @ sk3 )
| ( sk6 != sk3 ) ),
inference(simp,[status(thm)],[246]) ).
thf(280,plain,
( ( sk6 != sk3 )
| ~ ( cS @ sk1 )
| ~ $true
| ~ ( cS @ sk3 )
| ( ( cR @ sk3 )
!= ( cR @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[253,26]) ).
thf(281,plain,
( ( sk6 != sk3 )
| ~ ( cS @ sk1 )
| ~ ( cS @ sk3 )
| ( ( cR @ sk3 )
!= ( cR @ sk3 ) ) ),
inference(simp,[status(thm)],[280]) ).
thf(282,plain,
( ( sk6 != sk3 )
| ~ ( cS @ sk1 )
| ~ ( cS @ sk3 ) ),
inference(pattern_uni,[status(thm)],[281:[]]) ).
thf(209,plain,
( ( cR @ sk6 )
| ( ( ( cR @ sk3 )
& ( cS @ sk3 ) )
!= ( cR @ sk3 ) )
| ~ $true
| ( ( cS @ sk1 )
!= ( cS @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[205,14]) ).
thf(210,plain,
( ( cR @ sk6 )
| ( ( ( cR @ sk3 )
& ( cS @ sk3 ) )
!= ( cR @ sk3 ) )
| ( ( cS @ sk1 )
!= ( cS @ sk1 ) ) ),
inference(simp,[status(thm)],[209]) ).
thf(211,plain,
( ( cR @ sk6 )
| ( ( ( cR @ sk3 )
& ( cS @ sk3 ) )
!= ( cR @ sk3 ) ) ),
inference(pattern_uni,[status(thm)],[210:[]]) ).
thf(217,plain,
( ( cR @ sk6 )
| ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
!= cR )
| ~ $true
| ( ( cS @ sk1 )
!= ( cS @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[205,11]) ).
thf(218,plain,
( ( cR @ sk6 )
| ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
!= cR )
| ( ( cS @ sk1 )
!= ( cS @ sk1 ) ) ),
inference(simp,[status(thm)],[217]) ).
thf(219,plain,
( ( cR @ sk6 )
| ( ( ^ [A: $i] :
( ( cR @ A )
& ( cS @ A ) ) )
!= cR ) ),
inference(pattern_uni,[status(thm)],[218:[]]) ).
thf(283,plain,
( ( ( ( cR @ sk7 )
& ( cS @ sk7 ) )
!= ( cR @ sk7 ) )
| ( cR @ sk6 ) ),
inference(func_ext,[status(esa)],[219]) ).
thf(414,plain,
( ( cR @ sk6 )
| ( ( ( cR @ sk7 )
& $true )
!= ( cR @ sk7 ) )
| ( cR @ sk6 )
| ( ( cS @ sk7 )
!= ( cS @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[205,283]) ).
thf(415,plain,
( ( cR @ sk6 )
| ( ( cS @ sk7 )
!= ( cS @ sk1 ) ) ),
inference(simp,[status(thm)],[414]) ).
thf(428,plain,
( ( cR @ sk6 )
| ( sk7 != sk1 ) ),
inference(simp,[status(thm)],[415]) ).
thf(206,plain,
( ( cS @ sk1 )
| ~ ( cS @ sk6 ) ),
inference(cnfConj,[status(thm)],[204]) ).
thf(173,plain,
( ~ ( cS @ sk1 )
| ~ $true
| ( ( cS @ sk3 )
!= ( cS @ sk1 ) )
| ( ( cR @ sk3 )
!= ( cR @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[133,32]) ).
thf(174,plain,
( ~ ( cS @ sk1 )
| ( ( cS @ sk3 )
!= ( cS @ sk1 ) )
| ( ( cR @ sk3 )
!= ( cR @ sk1 ) ) ),
inference(simp,[status(thm)],[173]) ).
thf(183,plain,
( ~ ( cS @ sk1 )
| ( sk3 != sk1 )
| ( sk3 != sk1 ) ),
inference(simp,[status(thm)],[174]) ).
thf(186,plain,
( ~ ( cS @ sk1 )
| ( sk3 != sk1 ) ),
inference(simp,[status(thm)],[183]) ).
thf(228,plain,
( ( cR @ sk6 )
| ~ $true
| ( sk3 != sk1 )
| ( ( cS @ sk1 )
!= ( cS @ sk1 ) ) ),
inference(paramod_ordered,[status(thm)],[205,186]) ).
thf(229,plain,
( ( cR @ sk6 )
| ( sk3 != sk1 )
| ( ( cS @ sk1 )
!= ( cS @ sk1 ) ) ),
inference(simp,[status(thm)],[228]) ).
thf(230,plain,
( ( cR @ sk6 )
| ( sk3 != sk1 ) ),
inference(pattern_uni,[status(thm)],[229:[]]) ).
thf(409,plain,
( ( cR @ sk6 )
| ( ( cR @ sk7 )
& ( cS @ sk7 ) )
| ( cR @ sk7 ) ),
inference(bool_ext,[status(thm)],[283]) ).
thf(431,plain,
( ( ( cR @ sk6 )
| ( cR @ sk7 )
| ( cR @ sk7 ) )
& ( ( cR @ sk6 )
| ( cS @ sk7 )
| ( cR @ sk7 ) ) ),
inference(cnf,[status(esa)],[409]) ).
thf(432,plain,
( ( cR @ sk6 )
| ( cR @ sk7 )
| ( cR @ sk7 ) ),
inference(cnfConj,[status(thm)],[431]) ).
thf(434,plain,
( ( cR @ sk6 )
| ( cR @ sk7 ) ),
inference(simp,[status(thm)],[432]) ).
thf(535,plain,
$false,
inference(e,[status(thm)],[56,14,252,205,32,12,3,282,177,11,30,222,211,253,133,428,206,219,230,434,26,186,4,283]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV396^5 : TPTP v9.3.1. Released v4.0.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.09/0.22 % Computer : n004.cluster.edu
% 0.09/0.22 % Model : x86_64 x86_64
% 0.09/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22 % Memory : 8046.5625MB
% 0.09/0.22 % OS : Linux 6.8.0-71-generic
% 0.09/0.22 % CPULimit : 300
% 0.09/0.22 % WCLimit : 300
% 0.09/0.22 % DateTime : Tue Sep 29 15:44:07 UTC 2026
% 0.09/0.23 % CPUTime :
% 0.09/0.23 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.79/0.62 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.02/0.71 % [INFO] Parsing done (94ms).
% 1.02/0.72 % [INFO] Running in sequential loop mode.
% 1.42/0.91 % [INFO] eprover registered as external prover.
% 1.42/0.92 % [INFO] Scanning for conjecture ...
% 1.42/0.96 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.42/0.98 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.42/0.98 % [INFO] Problem is higher-order (TPTP THF).
% 1.42/0.98 % [INFO] Type checking passed.
% 1.42/0.98 % [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.32/2.33 % External prover 'e' found a proof!
% 6.32/2.33 % [INFO] Killing All external provers ...
% 6.32/2.33 % Time passed: 1967ms (effective reasoning time: 1614ms)
% 6.32/2.33 % 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.32/2.34 % Axioms used in derivation (0):
% 6.32/2.34 % No. of inferences in proof: 83
% 6.32/2.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1967 ms resp. 1614 ms w/o parsing
% 6.32/2.37 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.32/2.37 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------