%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUN024^2 : TPTP v9.3.1. Released v6.4.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 : n026.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:19:48 AM UTC 2026
% Result : Theorem 6.74s 3.12s
% Output : Refutation 7.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 1
% Syntax : Number of formulae : 51 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 267 ( 231 equ; 0 cnn)
% Maximal formula atoms : 10 ( 5 avg)
% Number of connectives : 758 ( 113 ~; 44 |; 98 &; 474 @)
% ( 0 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 177 ( 0 ^; 154 !; 23 ?; 177 :)
% Comments :
%------------------------------------------------------------------------------
thf(zero_decl,type,
zero: $i ).
thf(s_decl,type,
s: $i > $i ).
thf(ite_decl,type,
ite: $o > $i > $i > $i ).
thf(h_decl,type,
h: $i > $i ).
thf(1,conjecture,
( ( ! [A: $o,B: $i,C: $i] :
( A
=> ( ( ite @ A @ B @ C )
= B ) )
& ! [A: $o,B: $i,C: $i] :
( ~ A
=> ( ( ite @ A @ B @ C )
= C ) )
& ! [A: $i] :
( ( s @ A )
!= zero )
& ! [A: $i] :
( ( s @ A )
!= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n10) ).
thf(2,negated_conjecture,
~ ( ( ! [A: $o,B: $i,C: $i] :
( A
=> ( ( ite @ A @ B @ C )
= B ) )
& ! [A: $o,B: $i,C: $i] :
( ~ A
=> ( ( ite @ A @ B @ C )
= C ) )
& ! [A: $i] :
( ( s @ A )
!= zero )
& ! [A: $i] :
( ( s @ A )
!= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ! [A: $o,B: $i,C: $i] :
( A
=> ( ( ite @ A @ B @ C )
= B ) )
& ! [A: $o,B: $i,C: $i] :
( ~ A
=> ( ( ite @ A @ B @ C )
= C ) )
& ! [A: $i] :
( ( s @ A )
!= zero )
& ! [A: $i] :
( ( s @ A )
!= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
~ ( ( ! [A: $i,B: $i] :
( $true
=> ( ( ite @ $true @ A @ B )
= A ) )
& ! [A: $i,B: $i] :
( ~ $false
=> ( ( ite @ $false @ A @ B )
= B ) )
& ! [A: $i] :
( ( s @ A )
!= zero )
& ! [A: $i] :
( ( s @ A )
!= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
inference(instance,[status(thm)],[3]) ).
thf(7,plain,
~ ( ( ! [A: $i,B: $i] :
( ( ite @ $true @ A @ B )
= A )
& ! [A: $i,B: $i] :
( ( ite @ $false @ A @ B )
= B )
& ! [A: $i] :
( ( s @ A )
!= zero )
& ! [A: $i] :
( ( s @ A )
!= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
inference(simp,[status(thm)],[6]) ).
thf(19,plain,
~ ( ( ! [A: $i,B: $i] :
( ( ite @ $true @ A @ B )
= A )
& ! [A: $i,B: $i] :
( ( ite @ $false @ A @ B )
= B )
& ~ ? [A: $i] :
( ( s @ A )
= zero )
& ~ ? [A: $i] :
( ( s @ A )
= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
inference(miniscope,[status(thm)],[7]) ).
thf(20,plain,
! [H: $i > $i,G: $i,F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( ite @ $true @ A @ B )
= A )
& ( ( ite @ $false @ C @ D )
= D )
& ( ( s @ E )
!= zero )
& ( ( s @ F )
!= F )
& ( ( h @ G )
= ( ite @ ( G = zero ) @ ( s @ zero ) @ zero ) )
& ( ( ( H @ zero )
!= ( s @ zero ) )
| ( ( H @ ( s @ zero ) )
!= zero )
| ( ( H @ ( s @ ( s @ zero ) ) )
!= zero ) ) ),
inference(cnf,[status(esa)],[19]) ).
thf(25,plain,
! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ),
inference(cnfConj,[status(thm)],[20]) ).
thf(56,plain,
! [A: $i] :
( ( ite @ ( A = zero ) @ ( s @ zero ) @ zero )
= ( h @ A ) ),
inference(lifteq,[status(thm)],[25]) ).
thf(57,plain,
! [A: $i] :
( ( ite @ ( A = zero ) @ ( s @ zero ) @ zero )
= ( h @ A ) ),
inference(simp,[status(thm)],[56]) ).
thf(22,plain,
! [B: $i,A: $i] :
( ( ite @ $false @ A @ B )
= B ),
inference(cnfConj,[status(thm)],[20]) ).
thf(43,plain,
! [B: $i,A: $i] :
( ( ite @ $false @ A @ B )
= B ),
inference(lifteq,[status(thm)],[22]) ).
thf(44,plain,
! [B: $i,A: $i] :
( ( ite @ $false @ A @ B )
= B ),
inference(simp,[status(thm)],[43]) ).
thf(110,plain,
! [C: $i,B: $i,A: $i] :
( ( ( h @ A )
= C )
| ( ( ite @ ( A = zero ) @ ( s @ zero ) @ zero )
!= ( ite @ $false @ B @ C ) ) ),
inference(paramod_ordered,[status(thm)],[57,44]) ).
thf(119,plain,
! [C: $i,B: $i,A: $i] :
( ( ( h @ A )
= C )
| ( A = zero )
| ( ( s @ zero )
!= B )
| ( zero != C ) ),
inference(simp,[status(thm)],[110]) ).
thf(130,plain,
! [C: $i,B: $i,A: $i] :
( ( A = zero )
| ( ( h @ A )
= C )
| ( ( s @ zero )
!= B )
| ( zero != C ) ),
inference(lifteq,[status(thm)],[119]) ).
thf(131,plain,
! [A: $i] :
( ( A = zero )
| ( ( h @ A )
= zero ) ),
inference(simp,[status(thm)],[130]) ).
thf(4,plain,
~ ( ( ! [A: $i,B: $i] :
( $true
=> ( ( ite @ $true @ A @ B )
= A ) )
& ! [A: $i,B: $i] :
( ~ $true
=> ( ( ite @ $true @ A @ B )
= B ) )
& ! [A: $i] :
( ( s @ A )
!= zero )
& ! [A: $i] :
( ( s @ A )
!= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
inference(instance,[status(thm)],[3]) ).
thf(5,plain,
~ ( ( ! [A: $i,B: $i] :
( ( ite @ $true @ A @ B )
= A )
& ! [A: $i] :
( ( s @ A )
!= zero )
& ! [A: $i] :
( ( s @ A )
!= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
inference(simp,[status(thm)],[4]) ).
thf(12,plain,
~ ( ( ! [A: $i,B: $i] :
( ( ite @ $true @ A @ B )
= A )
& ~ ? [A: $i] :
( ( s @ A )
= zero )
& ~ ? [A: $i] :
( ( s @ A )
= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
inference(miniscope,[status(thm)],[5]) ).
thf(13,plain,
! [F: $i > $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( ite @ $true @ A @ B )
= A )
& ( ( s @ C )
!= zero )
& ( ( s @ D )
!= D )
& ( ( h @ E )
= ( ite @ ( E = zero ) @ ( s @ zero ) @ zero ) )
& ( ( ( F @ zero )
!= ( s @ zero ) )
| ( ( F @ ( s @ zero ) )
!= zero )
| ( ( F @ ( s @ ( s @ zero ) ) )
!= zero ) ) ),
inference(cnf,[status(esa)],[12]) ).
thf(16,plain,
! [B: $i,A: $i] :
( ( ite @ $true @ A @ B )
= A ),
inference(cnfConj,[status(thm)],[13]) ).
thf(66,plain,
! [B: $i,A: $i] :
( ( ite @ $true @ A @ B )
= A ),
inference(lifteq,[status(thm)],[16]) ).
thf(113,plain,
! [C: $i,B: $i,A: $i] :
( ( A
= ( h @ C ) )
| ( ( ite @ $true @ A @ B )
!= ( ite @ ( C = zero ) @ ( s @ zero ) @ zero ) ) ),
inference(paramod_ordered,[status(thm)],[66,57]) ).
thf(121,plain,
! [C: $i,B: $i,A: $i] :
( ( A
= ( h @ C ) )
| ( C != zero )
| ( A
!= ( s @ zero ) )
| ( B != zero ) ),
inference(simp,[status(thm)],[113]) ).
thf(133,plain,
! [C: $i,B: $i,A: $i] :
( ( C != zero )
| ( A
= ( h @ C ) )
| ( A
!= ( s @ zero ) )
| ( B != zero ) ),
inference(lifteq,[status(thm)],[121]) ).
thf(134,plain,
( ( h @ zero )
= ( s @ zero ) ),
inference(simp,[status(thm)],[133]) ).
thf(10,plain,
~ ( ( ! [A: $i,B: $i] :
( $false
=> ( ( ite @ $false @ A @ B )
= A ) )
& ! [A: $i,B: $i] :
( ~ $false
=> ( ( ite @ $false @ A @ B )
= B ) )
& ! [A: $i] :
( ( s @ A )
!= zero )
& ! [A: $i] :
( ( s @ A )
!= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
inference(instance,[status(thm)],[3]) ).
thf(11,plain,
~ ( ( ! [A: $i,B: $i] :
( ( ite @ $false @ A @ B )
= B )
& ! [A: $i] :
( ( s @ A )
!= zero )
& ! [A: $i] :
( ( s @ A )
!= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
inference(simp,[status(thm)],[10]) ).
thf(33,plain,
~ ( ( ! [A: $i,B: $i] :
( ( ite @ $false @ A @ B )
= B )
& ~ ? [A: $i] :
( ( s @ A )
= zero )
& ~ ? [A: $i] :
( ( s @ A )
= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
inference(miniscope,[status(thm)],[11]) ).
thf(34,plain,
! [F: $i > $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( ite @ $false @ A @ B )
= B )
& ( ( s @ C )
!= zero )
& ( ( s @ D )
!= D )
& ( ( h @ E )
= ( ite @ ( E = zero ) @ ( s @ zero ) @ zero ) )
& ( ( ( F @ zero )
!= ( s @ zero ) )
| ( ( F @ ( s @ zero ) )
!= zero )
| ( ( F @ ( s @ ( s @ zero ) ) )
!= zero ) ) ),
inference(cnf,[status(esa)],[33]) ).
thf(39,plain,
! [A: $i > $i] :
( ( ( A @ zero )
!= ( s @ zero ) )
| ( ( A @ ( s @ zero ) )
!= zero )
| ( ( A @ ( s @ ( s @ zero ) ) )
!= zero ) ),
inference(cnfConj,[status(thm)],[34]) ).
thf(45,plain,
! [A: $i > $i] :
( ( ( A @ zero )
!= ( s @ zero ) )
| ( ( A @ ( s @ zero ) )
!= zero )
| ( ( A @ ( s @ ( s @ zero ) ) )
!= zero ) ),
inference(lifteq,[status(thm)],[39]) ).
thf(46,plain,
! [A: $i > $i] :
( ( ( A @ zero )
!= ( s @ zero ) )
| ( ( A @ ( s @ zero ) )
!= zero )
| ( ( A @ ( s @ ( s @ zero ) ) )
!= zero ) ),
inference(simp,[status(thm)],[45]) ).
thf(143,plain,
! [A: $i > $i] :
( ( ( s @ zero )
!= ( s @ zero ) )
| ( ( A @ ( s @ zero ) )
!= zero )
| ( ( A @ ( s @ ( s @ zero ) ) )
!= zero )
| ( ( h @ zero )
!= ( A @ zero ) ) ),
inference(paramod_ordered,[status(thm)],[134,46]) ).
thf(144,plain,
! [A: $i > $i] :
( ( ( A @ ( s @ zero ) )
!= zero )
| ( ( A @ ( s @ ( s @ zero ) ) )
!= zero )
| ( ( h @ zero )
!= ( A @ zero ) ) ),
inference(simp,[status(thm)],[143]) ).
thf(148,plain,
( ( ( h @ ( s @ zero ) )
!= zero )
| ( ( h @ ( s @ ( s @ zero ) ) )
!= zero ) ),
inference(pre_uni,[status(thm)],[144:[bind(A,$thf( h ))]]) ).
thf(173,plain,
! [A: $i] :
( ( A = zero )
| ( zero != zero )
| ( ( h @ ( s @ ( s @ zero ) ) )
!= zero )
| ( ( h @ A )
!= ( h @ ( s @ zero ) ) ) ),
inference(paramod_ordered,[status(thm)],[131,148]) ).
thf(174,plain,
! [A: $i] :
( ( A = zero )
| ( ( h @ ( s @ ( s @ zero ) ) )
!= zero )
| ( ( h @ A )
!= ( h @ ( s @ zero ) ) ) ),
inference(simp,[status(thm)],[173]) ).
thf(175,plain,
( ( ( s @ zero )
= zero )
| ( ( h @ ( s @ ( s @ zero ) ) )
!= zero ) ),
inference(pattern_uni,[status(thm)],[174:[bind(A,$thf( s @ zero ))]]) ).
thf(8,plain,
~ ( ( ! [A: $i,B: $i] :
( $false
=> ( ( ite @ $false @ A @ B )
= A ) )
& ! [A: $i,B: $i] :
( ~ $true
=> ( ( ite @ $true @ A @ B )
= B ) )
& ! [A: $i] :
( ( s @ A )
!= zero )
& ! [A: $i] :
( ( s @ A )
!= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
inference(instance,[status(thm)],[3]) ).
thf(9,plain,
~ ( ( ! [A: $i] :
( ( s @ A )
!= zero )
& ! [A: $i] :
( ( s @ A )
!= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
inference(simp,[status(thm)],[8]) ).
thf(27,plain,
~ ( ( ~ ? [A: $i] :
( ( s @ A )
= zero )
& ~ ? [A: $i] :
( ( s @ A )
= A )
& ! [A: $i] :
( ( h @ A )
= ( ite @ ( A = zero ) @ ( s @ zero ) @ zero ) ) )
=> ? [A: $i > $i] :
( ( ( A @ zero )
= ( s @ zero ) )
& ( ( A @ ( s @ zero ) )
= zero )
& ( ( A @ ( s @ ( s @ zero ) ) )
= zero ) ) ),
inference(miniscope,[status(thm)],[9]) ).
thf(28,plain,
! [D: $i > $i,C: $i,B: $i,A: $i] :
( ( ( s @ A )
!= zero )
& ( ( s @ B )
!= B )
& ( ( h @ C )
= ( ite @ ( C = zero ) @ ( s @ zero ) @ zero ) )
& ( ( ( D @ zero )
!= ( s @ zero ) )
| ( ( D @ ( s @ zero ) )
!= zero )
| ( ( D @ ( s @ ( s @ zero ) ) )
!= zero ) ) ),
inference(cnf,[status(esa)],[27]) ).
thf(29,plain,
! [A: $i] :
( ( s @ A )
!= zero ),
inference(cnfConj,[status(thm)],[28]) ).
thf(42,plain,
! [A: $i] :
( ( s @ A )
!= zero ),
inference(lifteq,[status(thm)],[29]) ).
thf(192,plain,
( ( h @ ( s @ ( s @ zero ) ) )
!= zero ),
inference(simplifyReflect,[status(thm)],[175,42]) ).
thf(194,plain,
! [A: $i] :
( ( A = zero )
| ( zero != zero )
| ( ( h @ A )
!= ( h @ ( s @ ( s @ zero ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[131,192]) ).
thf(195,plain,
! [A: $i] :
( ( A = zero )
| ( ( h @ A )
!= ( h @ ( s @ ( s @ zero ) ) ) ) ),
inference(simp,[status(thm)],[194]) ).
thf(196,plain,
( ( s @ ( s @ zero ) )
= zero ),
inference(pattern_uni,[status(thm)],[195:[bind(A,$thf( s @ ( s @ zero ) ))]]) ).
thf(198,plain,
$false,
inference(simplifyReflect,[status(thm)],[196,42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUN024^2 : TPTP v9.3.1. Released v6.4.0.
% 0.00/0.07 % 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.11/0.21 % Computer : n026.cluster.edu
% 0.11/0.21 % Model : x86_64 x86_64
% 0.11/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.21 % Memory : 8046.5625MB
% 0.11/0.21 % OS : Linux 6.8.0-71-generic
% 0.11/0.21 % CPULimit : 300
% 0.11/0.21 % WCLimit : 300
% 0.11/0.21 % DateTime : Tue Sep 29 13:08:57 UTC 2026
% 0.11/0.21 % CPUTime :
% 0.11/0.21 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.91/0.78 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.27/0.97 % [INFO] Parsing done (185ms).
% 1.27/0.99 % [INFO] Running in sequential loop mode.
% 2.08/1.41 % [INFO] eprover registered as external prover.
% 2.08/1.42 % [INFO] Scanning for conjecture ...
% 2.30/1.52 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.30/1.56 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.30/1.57 % [INFO] Problem is higher-order (TPTP THF).
% 2.30/1.57 % [INFO] Type checking passed.
% 2.30/1.58 % [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.74/3.12 % [INFO] Killing All external provers ...
% 6.74/3.12 % Time passed: 2766ms (effective reasoning time: 2125ms)
% 6.74/3.12 % 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.74/3.12 % Axioms used in derivation (0):
% 6.74/3.12 % No. of inferences in proof: 51
% 6.74/3.12 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2766 ms resp. 2125 ms w/o parsing
% 7.20/3.19 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.20/3.19 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------