%------------------------------------------------------------------------------
% File : DT2H2X---1.9.5
% Problem : NUM816^5 : TPTP v9.2.1. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Feb 25 09:24:50 AM UTC 2026
% Result : Theorem 1.65s 1.40s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 3
% Syntax : Number of formulae : 37 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 201 ( 76 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 340 ( 37 ~; 18 |; 19 &; 218 @)
% ( 0 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 22 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 4 con; 0-2 aty)
% ( 16 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 72 ( 37 ^; 35 !; 0 ?; 72 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
cS: $i > $i ).
thf(func_def_2,type,
cEVEN1: $i > $o ).
thf(func_def_3,type,
cODD1: $i > $o ).
thf(func_def_15,type,
sK1: ( $i > $o ) > $i ).
thf(func_def_16,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f392,plain,
$false,
inference(equality_resolution,[status(thm)],[f389]) ).
thf(f389,plain,
! [X0: $i] :
( ( cS @ c0 )
!= ( cS @ X0 ) ),
inference(subsumption_resolution,[status(thm)],[f372,f16]) ).
thf(f16,plain,
! [X0: $i,X1: $i] :
( ( ( cS @ X1 )
!= ( cS @ X0 ) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f13,plain,
( ( ( cODD1 @ ( cS @ c0 ) )
!= $true )
& ! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( cS @ X1 )
!= ( cS @ X0 ) ) )
& ! [X2: $i] :
( c0
!= ( cS @ X2 ) ) ),
inference(flattening,[status(thm)],[f12]) ).
thf(f12,plain,
( ( ( cODD1 @ ( cS @ c0 ) )
!= $true )
& ! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( cS @ X1 )
!= ( cS @ X0 ) ) )
& ! [X2: $i] :
( c0
!= ( cS @ X2 ) ) ),
inference(ennf_transformation,[status(thm)],[f11]) ).
thf(f11,plain,
~ ( ( ! [X0: $i,X1: $i] :
( ( ( cS @ X1 )
= ( cS @ X0 ) )
=> ( X0 = X1 ) )
& ! [X2: $i] :
( c0
!= ( cS @ X2 ) ) )
=> ( ( cODD1 @ ( cS @ c0 ) )
= $true ) ),
inference(fool_elimination,[status(thm)],[f10]) ).
thf(f10,plain,
~ ( ( ! [X0: $i,X1: $i] :
( ( ( cS @ X1 )
= ( cS @ X0 ) )
=> ( X0 = X1 ) )
& ! [X2: $i] :
( c0
!= ( cS @ X2 ) ) )
=> ( cODD1 @ ( cS @ c0 ) ) ),
inference(rectify,[status(thm)],[f4]) ).
thf(f4,negated_conjecture,
~ ( ( ! [X5: $i,X4: $i] :
( ( ( cS @ X4 )
= ( cS @ X5 ) )
=> ( X4 = X5 ) )
& ! [X3: $i] :
( c0
!= ( cS @ X3 ) ) )
=> ( cODD1 @ ( cS @ c0 ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f3,conjecture,
( ( ! [X5: $i,X4: $i] :
( ( ( cS @ X4 )
= ( cS @ X5 ) )
=> ( X4 = X5 ) )
& ! [X3: $i] :
( c0
!= ( cS @ X3 ) ) )
=> ( cODD1 @ ( cS @ c0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.iir1RhgPKN/DTF2THF_32010.p',cTHM406) ).
thf(f372,plain,
! [X0: $i] :
( ( ( cS @ c0 )
!= ( cS @ X0 ) )
| ( c0 != X0 ) ),
inference(superposition,[status(thm)],[f15,f205]) ).
thf(f205,plain,
! [X0: $i] :
( ( ( cS
@ ( sK1
@ ^ [Y0: $i] :
( ( cS @ c0 )
!= Y0 ) ) )
= X0 )
| ( ( cS @ c0 )
!= ( cS @ X0 ) ) ),
inference(superposition,[status(thm)],[f16,f105]) ).
thf(f105,plain,
( ( cS @ c0 )
= ( cS
@ ( cS
@ ( sK1
@ ^ [Y0: $i] :
( ( cS @ c0 )
!= Y0 ) ) ) ) ),
inference(subsumption_resolution,[status(thm)],[f91,f15]) ).
thf(f91,plain,
( ( c0
= ( cS @ c0 ) )
| ( ( cS @ c0 )
= ( cS
@ ( cS
@ ( sK1
@ ^ [Y0: $i] :
( ( cS @ c0 )
!= Y0 ) ) ) ) ) ),
inference(equality_proxy_clausification,[status(thm)],[f90]) ).
thf(f90,plain,
( ( ( cS @ c0 )
= ( cS
@ ( cS
@ ( sK1
@ ^ [Y0: $i] :
( ( cS @ c0 )
!= Y0 ) ) ) ) )
| ( ( ( cS @ c0 )
= c0 )
= $true ) ),
inference(not_proxy_clausification,[status(thm)],[f89]) ).
thf(f89,plain,
( ( ( ( cS @ c0 )
!= c0 )
= $false )
| ( ( cS @ c0 )
= ( cS
@ ( cS
@ ( sK1
@ ^ [Y0: $i] :
( ( cS @ c0 )
!= Y0 ) ) ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f62]) ).
thf(f62,plain,
( ( ( cS @ c0 )
= ( cS
@ ( cS
@ ( sK1
@ ^ [Y0: $i] :
( ( cS @ c0 )
!= Y0 ) ) ) ) )
| ( ( ^ [Y0: $i] :
( ( cS @ c0 )
!= Y0 )
@ c0 )
= $false ) ),
inference(leibniz_equality_elimination,[status(thm)],[f29]) ).
thf(f29,plain,
! [X1: $i > $o] :
( ( ( X1 @ ( cS @ ( cS @ ( sK1 @ X1 ) ) ) )
= $false )
| ( $true
= ( X1 @ ( cS @ c0 ) ) )
| ( ( X1 @ c0 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f28]) ).
thf(f28,plain,
! [X1: $i > $o] :
( ( ( X1 @ c0 )
= $false )
| ( $true
= ( X1 @ ( cS @ c0 ) ) )
| ( ( ( X1 @ ( sK1 @ X1 ) )
=> ( X1 @ ( cS @ ( cS @ ( sK1 @ X1 ) ) ) ) )
= $false ) ),
inference(beta_eta_normalization,[status(thm)],[f27]) ).
thf(f27,plain,
! [X1: $i > $o] :
( ( $true
= ( X1 @ ( cS @ c0 ) ) )
| ( $false
= ( ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ ( cS @ Y0 ) ) ) )
@ ( sK1 @ X1 ) ) )
| ( ( X1 @ c0 )
= $false ) ),
inference(sigma_clausification,[status(thm)],[f26]) ).
thf(f26,plain,
! [X1: $i > $o] :
( ( ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ ( cS @ Y0 ) ) ) ) )
= $false )
| ( $true
= ( X1 @ ( cS @ c0 ) ) )
| ( ( X1 @ c0 )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f25]) ).
thf(f25,plain,
! [X1: $i > $o] :
( ( $true
= ( X1 @ ( cS @ c0 ) ) )
| ( ( ( X1 @ c0 )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ ( cS @ Y0 ) ) ) ) ) )
= $false ) ),
inference(binary_proxy_clausification,[status(thm)],[f24]) ).
thf(f24,plain,
! [X1: $i > $o] :
( ( ( ( X1 @ c0 )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ ( cS @ Y0 ) ) ) ) ) )
=> ( X1 @ ( cS @ c0 ) ) )
= $true ),
inference(beta_eta_normalization,[status(thm)],[f23]) ).
thf(f23,plain,
! [X1: $i > $o] :
( $true
= ( ^ [Y0: $i > $o] :
( ( ( Y0 @ c0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ ( cS @ Y1 ) ) ) ) ) )
=> ( Y0 @ ( cS @ c0 ) ) )
@ X1 ) ),
inference(pi_clausification,[status(thm)],[f22]) ).
thf(f22,plain,
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( Y0 @ c0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ ( cS @ Y1 ) ) ) ) ) )
=> ( Y0 @ ( cS @ c0 ) ) ) ) ),
inference(not_proxy_clausification,[status(thm)],[f21]) ).
thf(f21,plain,
( $true
!= ( ~ ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( Y0 @ c0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ ( cS @ Y1 ) ) ) ) ) )
=> ( Y0 @ ( cS @ c0 ) ) ) ) ) ),
inference(beta_eta_normalization,[status(thm)],[f20]) ).
thf(f20,plain,
( ( ^ [Y0: $i] :
~ ( ^ [Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( ( Y2 @ c0 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( Y2 @ Y3 )
=> ( Y2 @ ( cS @ ( cS @ Y3 ) ) ) ) ) )
=> ( Y2 @ Y1 ) ) )
@ Y0 )
@ ( cS @ c0 ) )
!= $true ),
inference(definition_unfolding,[status(thm)],[f17,f19]) ).
thf(f19,plain,
( cODD1
= ( ^ [Y0: $i] :
~ ( ^ [Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( ( Y2 @ c0 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( Y2 @ Y3 )
=> ( Y2 @ ( cS @ ( cS @ Y3 ) ) ) ) ) )
=> ( Y2 @ Y1 ) ) )
@ Y0 ) ) ),
inference(definition_unfolding,[status(thm)],[f18,f14]) ).
thf(f14,plain,
( cEVEN1
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( Y1 @ c0 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cS @ ( cS @ Y2 ) ) ) ) ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
thf(f9,plain,
( cEVEN1
= ( ^ [Y0: $i] :
( !! @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( Y1 @ c0 )
& ( !! @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cS @ ( cS @ Y2 ) ) ) ) ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[status(thm)],[f8]) ).
thf(f8,plain,
( ( ^ [X0: $i] :
! [X1: $i > $o] :
( ( ! [X2: $i] :
( ( X1 @ X2 )
=> ( X1 @ ( cS @ ( cS @ X2 ) ) ) )
& ( X1 @ c0 ) )
=> ( X1 @ X0 ) ) )
= cEVEN1 ),
inference(rectify,[status(thm)],[f1]) ).
thf(f1,axiom,
( ( ^ [X0: $i] :
! [X1: $i > $o] :
( ( ! [X2: $i] :
( ( X1 @ X2 )
=> ( X1 @ ( cS @ ( cS @ X2 ) ) ) )
& ( X1 @ c0 ) )
=> ( X1 @ X0 ) ) )
= cEVEN1 ),
file('/export/starexec/sandbox/tmp/tmp.iir1RhgPKN/DTF2THF_32010.p',cEVEN1_def) ).
thf(f18,plain,
( cODD1
= ( ^ [Y0: $i] :
~ ( cEVEN1 @ Y0 ) ) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
thf(f7,plain,
( cODD1
= ( ^ [Y0: $i] :
~ ( cEVEN1 @ Y0 ) ) ),
inference(fool_elimination,[status(thm)],[f6]) ).
thf(f6,plain,
( cODD1
= ( ^ [X0: $i] :
~ ( cEVEN1 @ X0 ) ) ),
inference(rectify,[status(thm)],[f2]) ).
thf(f2,axiom,
( cODD1
= ( ^ [X0: $i] :
~ ( cEVEN1 @ X0 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.iir1RhgPKN/DTF2THF_32010.p',cODD1_def) ).
thf(f17,plain,
( ( cODD1 @ ( cS @ c0 ) )
!= $true ),
inference(cnf_transformation,[status(thm)],[f13]) ).
thf(f15,plain,
! [X2: $i] :
( c0
!= ( cS @ X2 ) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM816^5 : TPTP v9.2.1. Bugfixed v5.2.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.17/0.34 % Computer : n013.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Tue Feb 24 11:15:23 EST 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.32/0.49 ---- Original DTF file ---
% 0.32/0.49 thf(spec,logic,$$dhol).
% 0.32/0.49 %------------------------------------------------------------------------------
% 0.32/0.49 % File : NUM816^5 : TPTP v9.2.1. Bugfixed v5.2.0.
% 0.32/0.49 % Domain : Number Theory (Induction on naturals)
% 0.32/0.49 % Problem : TPS problem from IND-THMS
% 0.32/0.49 % Version : Especial.
% 0.32/0.49 % English :
% 0.32/0.49
% 0.32/0.49 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.32/0.49 % Source : [Bro09]
% 0.32/0.49 % Names : tps_0817 [Bro09]
% 0.32/0.49
% 0.32/0.49 % Status : Theorem
% 0.32/0.49 % Rating : 0.33 v9.1.0, 0.25 v9.0.0, 0.30 v8.2.0, 0.54 v8.1.0, 0.45 v7.5.0, 0.29 v7.4.0, 0.44 v7.2.0, 0.38 v7.1.0, 0.50 v7.0.0, 0.57 v6.4.0, 0.50 v6.3.0, 0.60 v6.2.0, 0.71 v6.1.0, 0.57 v5.5.0, 1.00 v5.2.0
% 0.32/0.49 % Syntax : Number of formulae : 7 ( 2 unt; 4 typ; 2 def)
% 0.32/0.49 % Number of atoms : 9 ( 5 equ; 0 cnn)
% 0.32/0.49 % Maximal formula atoms : 4 ( 3 avg)
% 0.32/0.49 % Number of connectives : 20 ( 2 ~; 0 |; 2 &; 12 @)
% 0.32/0.49 % ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% 0.32/0.49 % Maximal formula depth : 6 ( 3 avg)
% 0.32/0.49 % Number of types : 2 ( 0 usr)
% 0.32/0.49 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.32/0.49 % Number of symbols : 5 ( 4 usr; 1 con; 0-2 aty)
% 0.32/0.49 % Number of variables : 7 ( 2 ^; 5 !; 0 ?; 7 :)
% 0.32/0.49 % SPC : TH0_THM_EQU_NAR
% 0.32/0.49
% 0.32/0.49 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.32/0.49 % project in the Department of Mathematical Sciences at Carnegie
% 0.32/0.49 % Mellon University. Distributed under the Creative Commons copyleft
% 0.32/0.49 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.32/0.49 % :
% 0.32/0.49 % Bugfixes : v5.2.0 - Added missing type declarations.
% 0.32/0.49 %------------------------------------------------------------------------------
% 0.32/0.49 thf(c0_type,type,
% 0.32/0.49 c0: $i ).
% 0.32/0.49
% 0.32/0.49 thf(cS_type,type,
% 0.32/0.49 cS: $i > $i ).
% 0.32/0.49
% 0.32/0.49 thf(cEVEN1_type,type,
% 0.32/0.49 cEVEN1: $i > $o ).
% 0.32/0.49
% 0.32/0.49 thf(cODD1_type,type,
% 0.32/0.49 cODD1: $i > $o ).
% 0.32/0.49
% 0.32/0.49 thf(cEVEN1_def,definition,
% 0.32/0.49 ( cEVEN1
% 0.32/0.49 = ( ^ [Xn: $i] :
% 0.32/0.49 ! [Xp: $i > $o] :
% 0.32/0.49 ( ( ( Xp @ c0 )
% 0.32/0.49 & ! [Xx: $i] :
% 0.32/0.49 ( ( Xp @ Xx )
% 0.32/0.49 => ( Xp @ ( cS @ ( cS @ Xx ) ) ) ) )
% 0.32/0.49 => ( Xp @ Xn ) ) ) ) ).
% 0.32/0.49
% 0.32/0.49 thf(cODD1_def,definition,
% 0.32/0.49 ( cODD1
% 0.32/0.49 = ( ^ [Xn: $i] :
% 0.32/0.49 ~ ( cEVEN1 @ Xn ) ) ) ).
% 0.32/0.49
% 0.32/0.49 thf(cTHM406,conjecture,
% 0.32/0.49 ( ( ! [Xu: $i] :
% 0.32/0.49 ( ( cS @ Xu )
% 0.32/0.49 != c0 )
% 0.32/0.49 & ! [Xv: $i,Xw: $i] :
% 0.32/0.49 ( ( ( cS @ Xv )
% 0.32/0.49 = ( cS @ Xw ) )
% 0.32/0.49 => ( Xv = Xw ) ) )
% 0.32/0.49 => ( cODD1 @ ( cS @ c0 ) ) ) ).
% 0.32/0.49
% 0.32/0.49 %------------------------------------------------------------------------------
% 0.32/0.49 ------------------------
% 1.45/1.37 ---- Embedded in THF ---
% 1.45/1.37 %%% This output was generated by embedproblem, version 1.9.5 (library version 1.9).
% 1.45/1.37 %%% Generated on Tue Feb 24 11:15:24 EST 2026
% 1.45/1.37 %%% using '$$dhol' embedding, version 1.3.0.
% 1.45/1.37 %%% Logic specification used:
% 1.45/1.37 %%% thf(spec, logic, $$dhol).
% 1.45/1.37
% 1.45/1.37 % SZS output start ListOfTHF for /export/starexec/sandbox/tmp/tmp.iir1RhgPKN/DTF2DTF32010.p
% See solution above
% 1.45/1.37 ------------------------
% 1.45/1.37 ---- Cleaned THF ---
% 1.45/1.38 thf(c0_type,type,
% 1.45/1.38 c0: $i ).
% 1.45/1.38
% 1.45/1.38 thf(cS_type,type,
% 1.45/1.38 cS: $i > $i ).
% 1.45/1.38
% 1.45/1.38 thf(cEVEN1_type,type,
% 1.45/1.38 cEVEN1: $i > $o ).
% 1.45/1.38
% 1.45/1.38 thf(cODD1_type,type,
% 1.45/1.38 cODD1: $i > $o ).
% 1.45/1.38
% 1.45/1.38 thf(cEVEN1_def,definition,
% 1.45/1.38 ( cEVEN1
% 1.45/1.38 = ( ^ [Xn: $i] :
% 1.45/1.38 ! [Xp: $i > $o] :
% 1.45/1.38 ( ( ( Xp @ c0 )
% 1.45/1.38 & ! [Xx: $i] :
% 1.45/1.38 ( ( Xp @ Xx )
% 1.45/1.38 => ( Xp @ ( cS @ ( cS @ Xx ) ) ) ) )
% 1.45/1.38 => ( Xp @ Xn ) ) ) ) ).
% 1.45/1.38
% 1.45/1.38 thf(cODD1_def,definition,
% 1.45/1.38 ( cODD1
% 1.45/1.38 = ( ^ [Xn: $i] :
% 1.45/1.38 ~ ( cEVEN1 @ Xn ) ) ) ).
% 1.45/1.38
% 1.45/1.38 thf(cTHM406,conjecture,
% 1.45/1.38 ( ( ! [Xu: $i] :
% 1.45/1.38 ( ( cS @ Xu )
% 1.45/1.38 != c0 )
% 1.45/1.38 & ! [Xv: $i,Xw: $i] :
% 1.45/1.38 ( ( ( cS @ Xv )
% 1.45/1.38 = ( cS @ Xw ) )
% 1.45/1.38 => ( Xv = Xw ) ) )
% 1.45/1.38 => ( cODD1 @ ( cS @ c0 ) ) ) ).
% 1.45/1.38 ------------------------
% 1.45/1.39 % (32114)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_32010 for (3000ds/183Mi)
% 1.45/1.39 % (32120)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on DTF2THF_32010 for (3000ds/18Mi)
% 1.45/1.39 % (32115)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on DTF2THF_32010 for (3000ds/4Mi)
% 1.45/1.39 % (32118)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on DTF2THF_32010 for (3000ds/2Mi)
% 1.45/1.39 % (32116)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on DTF2THF_32010 for (3000ds/27Mi)
% 1.45/1.39 % (32117)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_32010 for (3000ds/2Mi)
% 1.45/1.39 % (32119)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on DTF2THF_32010 for (3000ds/275Mi)
% 1.45/1.40 % (32119)Refutation not found, incomplete strategy
% 1.45/1.40 % (32119)------------------------------
% 1.45/1.40 % (32119)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.45/1.40 % (32119)Termination reason: Refutation not found, incomplete strategy
% 1.45/1.40
% 1.45/1.40
% 1.45/1.40 % (32119)Memory used [KB]: 5500
% 1.45/1.40 % (32119)Time elapsed: 0.002 s
% 1.45/1.40 % (32119)Instructions burned: 1 (million)
% 1.45/1.40 % (32119)------------------------------
% 1.45/1.40 % (32119)------------------------------
% 1.45/1.40 % (32117)Instruction limit reached!
% 1.45/1.40 % (32117)------------------------------
% 1.45/1.40 % (32117)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.45/1.40 % (32117)Termination reason: Unknown
% 1.45/1.40 % (32117)Termination phase: Saturation
% 1.45/1.40
% 1.45/1.40 % (32117)Memory used [KB]: 5500
% 1.45/1.40 % (32117)Time elapsed: 0.003 s
% 1.45/1.40 % (32117)Instructions burned: 2 (million)
% 1.45/1.40 % (32117)------------------------------
% 1.45/1.40 % (32117)------------------------------
% 1.45/1.40 % (32118)Instruction limit reached!
% 1.45/1.40 % (32118)------------------------------
% 1.45/1.40 % (32118)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.45/1.40 % (32118)Termination reason: Unknown
% 1.45/1.40 % (32118)Termination phase: Saturation
% 1.45/1.40
% 1.45/1.40 % (32118)Memory used [KB]: 5500
% 1.45/1.40 % (32118)Time elapsed: 0.003 s
% 1.45/1.40 % (32118)Instructions burned: 3 (million)
% 1.45/1.40 % (32118)------------------------------
% 1.45/1.40 % (32118)------------------------------
% 1.45/1.40 % (32116)Refutation not found, incomplete strategy
% 1.45/1.40 % (32116)------------------------------
% 1.45/1.40 % (32116)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.45/1.40 % (32116)Termination reason: Refutation not found, incomplete strategy
% 1.45/1.40
% 1.45/1.40
% 1.45/1.40 % (32116)Memory used [KB]: 5500
% 1.45/1.40 % (32116)Time elapsed: 0.003 s
% 1.45/1.40 % (32116)Instructions burned: 2 (million)
% 1.45/1.40 % (32116)------------------------------
% 1.45/1.40 % (32116)------------------------------
% 1.65/1.40 % (32115)Instruction limit reached!
% 1.65/1.40 % (32115)------------------------------
% 1.65/1.40 % (32115)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.40 % (32115)Termination reason: Unknown
% 1.65/1.40 % (32115)Termination phase: Saturation
% 1.65/1.40
% 1.65/1.40 % (32115)Memory used [KB]: 5500
% 1.65/1.40 % (32115)Time elapsed: 0.004 s
% 1.65/1.40 % (32115)Instructions burned: 4 (million)
% 1.65/1.40 % (32115)------------------------------
% 1.65/1.40 % (32115)------------------------------
% 1.65/1.40 % (32114)First to succeed.
% 1.65/1.40 % (32114)Refutation found. Thanks to Tanya!
% 1.65/1.40 % SZS status Theorem for DTF2THF_32010
% 1.65/1.40 % SZS output start Proof for DTF2THF_32010
% 1.65/1.40 thf(func_def_1, type, cS: $i > $i).
% 1.65/1.40 thf(func_def_2, type, cEVEN1: $i > $o).
% 1.65/1.40 thf(func_def_3, type, cODD1: $i > $o).
% 1.65/1.40 thf(func_def_15, type, sK1: ($i > $o) > $i).
% 1.65/1.40 thf(func_def_16, type, ph2: !>[X0: $tType]:(X0)).
% 1.65/1.40 thf(f392,plain,(
% 1.65/1.40 $false),
% 1.65/1.40 inference(equality_resolution,[status(thm)],[f389])).
% 1.65/1.40 thf(f389,plain,(
% 1.65/1.40 ( ! [X0 : $i] : (((cS @ c0) != (cS @ X0))) )),
% 1.65/1.40 inference(subsumption_resolution,[status(thm)],[f372,f16])).
% 1.65/1.40 thf(f16,plain,(
% 1.65/1.40 ( ! [X0 : $i,X1 : $i] : (((cS @ X1) != (cS @ X0)) | (X0 = X1)) )),
% 1.65/1.40 inference(cnf_transformation,[status(thm)],[f13])).
% 1.65/1.40 thf(f13,plain,(
% 1.65/1.40 ((cODD1 @ (cS @ c0)) != $true) & ! [X0 : $i,X1 : $i] : ((X0 = X1) | ((cS @ X1) != (cS @ X0))) & ! [X2 : $i] : (c0 != (cS @ X2))),
% 1.65/1.40 inference(flattening,[status(thm)],[f12])).
% 1.65/1.40 thf(f12,plain,(
% 1.65/1.40 ((cODD1 @ (cS @ c0)) != $true) & (! [X0 : $i,X1 : $i] : ((X0 = X1) | ((cS @ X1) != (cS @ X0))) & ! [X2 : $i] : (c0 != (cS @ X2)))),
% 1.65/1.40 inference(ennf_transformation,[status(thm)],[f11])).
% 1.65/1.40 thf(f11,plain,(
% 1.65/1.40 ~((! [X0 : $i,X1 : $i] : (((cS @ X1) = (cS @ X0)) => (X0 = X1)) & ! [X2 : $i] : (c0 != (cS @ X2))) => ((cODD1 @ (cS @ c0)) = $true))),
% 1.65/1.40 inference(fool_elimination,[status(thm)],[f10])).
% 1.65/1.40 thf(f10,plain,(
% 1.65/1.40 ~((! [X0 : $i,X1 : $i] : (((cS @ X1) = (cS @ X0)) => (X0 = X1)) & ! [X2 : $i] : (c0 != (cS @ X2))) => (cODD1 @ (cS @ c0)))),
% 1.65/1.40 inference(rectify,[status(thm)],[f4])).
% 1.65/1.40 thf(f4,negated_conjecture,(
% 1.65/1.40 ~((! [X5 : $i,X4 : $i] : (((cS @ X4) = (cS @ X5)) => (X4 = X5)) & ! [X3 : $i] : (c0 != (cS @ X3))) => (cODD1 @ (cS @ c0)))),
% 1.65/1.40 inference(negated_conjecture,[status(cth)],[f3])).
% 1.65/1.40 thf(f3,conjecture,(
% 1.65/1.40 (! [X5 : $i,X4 : $i] : (((cS @ X4) = (cS @ X5)) => (X4 = X5)) & ! [X3 : $i] : (c0 != (cS @ X3))) => (cODD1 @ (cS @ c0))),
% 1.65/1.40 file('/export/starexec/sandbox/tmp/tmp.iir1RhgPKN/DTF2THF_32010.p',cTHM406)).
% 1.65/1.40 thf(f372,plain,(
% 1.65/1.40 ( ! [X0 : $i] : (((cS @ c0) != (cS @ X0)) | (c0 != X0)) )),
% 1.65/1.40 inference(superposition,[status(thm)],[f15,f205])).
% 1.65/1.40 thf(f205,plain,(
% 1.65/1.40 ( ! [X0 : $i] : (((cS @ (sK1 @ (^[Y0 : $i]: (~ ((cS @ c0) = Y0))))) = X0) | ((cS @ c0) != (cS @ X0))) )),
% 1.65/1.40 inference(superposition,[status(thm)],[f16,f105])).
% 1.65/1.40 thf(f105,plain,(
% 1.65/1.40 ((cS @ c0) = (cS @ (cS @ (sK1 @ (^[Y0 : $i]: (~ ((cS @ c0) = Y0)))))))),
% 1.65/1.40 inference(subsumption_resolution,[status(thm)],[f91,f15])).
% 1.65/1.40 thf(f91,plain,(
% 1.65/1.40 (c0 = (cS @ c0)) | ((cS @ c0) = (cS @ (cS @ (sK1 @ (^[Y0 : $i]: (~ ((cS @ c0) = Y0)))))))),
% 1.65/1.40 inference(equality_proxy_clausification,[status(thm)],[f90])).
% 1.65/1.40 thf(f90,plain,(
% 1.65/1.40 ((cS @ c0) = (cS @ (cS @ (sK1 @ (^[Y0 : $i]: (~ ((cS @ c0) = Y0))))))) | (((cS @ c0) = c0) = $true)),
% 1.65/1.40 inference(not_proxy_clausification,[status(thm)],[f89])).
% 1.65/1.40 thf(f89,plain,(
% 1.65/1.40 ((~ ((cS @ c0) = c0)) = $false) | ((cS @ c0) = (cS @ (cS @ (sK1 @ (^[Y0 : $i]: (~ ((cS @ c0) = Y0)))))))),
% 1.65/1.40 inference(beta_eta_normalization,[status(thm)],[f62])).
% 1.65/1.40 thf(f62,plain,(
% 1.65/1.40 ((cS @ c0) = (cS @ (cS @ (sK1 @ (^[Y0 : $i]: (~ ((cS @ c0) = Y0))))))) | (((^[Y0 : $i]: (~ ((cS @ c0) = Y0))) @ c0) = $false)),
% 1.65/1.40 inference(leibniz_equality_elimination,[status(thm)],[f29])).
% 1.65/1.40 thf(f29,plain,(
% 1.65/1.40 ( ! [X1 : $i > $o] : (((X1 @ (cS @ (cS @ (sK1 @ X1)))) = $false) | ($true = (X1 @ (cS @ c0))) | ((X1 @ c0) = $false)) )),
% 1.65/1.40 inference(binary_proxy_clausification,[status(thm)],[f28])).
% 1.65/1.40 thf(f28,plain,(
% 1.65/1.40 ( ! [X1 : $i > $o] : (((X1 @ c0) = $false) | ($true = (X1 @ (cS @ c0))) | (((X1 @ (sK1 @ X1)) => (X1 @ (cS @ (cS @ (sK1 @ X1))))) = $false)) )),
% 1.65/1.40 inference(beta_eta_normalization,[status(thm)],[f27])).
% 1.65/1.40 thf(f27,plain,(
% 1.65/1.40 ( ! [X1 : $i > $o] : (($true = (X1 @ (cS @ c0))) | ($false = ((^[Y0 : $i]: ((X1 @ Y0) => (X1 @ (cS @ (cS @ Y0))))) @ (sK1 @ X1))) | ((X1 @ c0) = $false)) )),
% 1.65/1.40 inference(sigma_clausification,[status(thm)],[f26])).
% 1.65/1.40 thf(f26,plain,(
% 1.65/1.40 ( ! [X1 : $i > $o] : (((!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0) => (X1 @ (cS @ (cS @ Y0)))))) = $false) | ($true = (X1 @ (cS @ c0))) | ((X1 @ c0) = $false)) )),
% 1.65/1.40 inference(binary_proxy_clausification,[status(thm)],[f25])).
% 1.65/1.40 thf(f25,plain,(
% 1.65/1.40 ( ! [X1 : $i > $o] : (($true = (X1 @ (cS @ c0))) | (((X1 @ c0) & (!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0) => (X1 @ (cS @ (cS @ Y0))))))) = $false)) )),
% 1.65/1.40 inference(binary_proxy_clausification,[status(thm)],[f24])).
% 1.65/1.40 thf(f24,plain,(
% 1.65/1.40 ( ! [X1 : $i > $o] : (((((X1 @ c0) & (!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0) => (X1 @ (cS @ (cS @ Y0))))))) => (X1 @ (cS @ c0))) = $true)) )),
% 1.65/1.40 inference(beta_eta_normalization,[status(thm)],[f23])).
% 1.65/1.40 thf(f23,plain,(
% 1.65/1.40 ( ! [X1 : $i > $o] : (($true = ((^[Y0 : $i > $o]: (((Y0 @ c0) & (!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (cS @ (cS @ Y1))))))) => (Y0 @ (cS @ c0)))) @ X1))) )),
% 1.65/1.40 inference(pi_clausification,[status(thm)],[f22])).
% 1.65/1.40 thf(f22,plain,(
% 1.65/1.40 ($true = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: (((Y0 @ c0) & (!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (cS @ (cS @ Y1))))))) => (Y0 @ (cS @ c0))))))),
% 1.65/1.40 inference(not_proxy_clausification,[status(thm)],[f21])).
% 1.65/1.40 thf(f21,plain,(
% 1.65/1.40 ($true != (~ (!! @ ($i > $o) @ (^[Y0 : $i > $o]: (((Y0 @ c0) & (!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (cS @ (cS @ Y1))))))) => (Y0 @ (cS @ c0)))))))),
% 1.65/1.40 inference(beta_eta_normalization,[status(thm)],[f20])).
% 1.65/1.40 thf(f20,plain,(
% 1.65/1.40 (((^[Y0 : $i]: (~ ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (((Y2 @ c0) & (!! @ $i @ (^[Y3 : $i]: ((Y2 @ Y3) => (Y2 @ (cS @ (cS @ Y3))))))) => (Y2 @ Y1))))) @ Y0))) @ (cS @ c0)) != $true)),
% 1.65/1.40 inference(definition_unfolding,[status(thm)],[f17,f19])).
% 1.65/1.40 thf(f19,plain,(
% 1.65/1.40 (cODD1 = (^[Y0 : $i]: (~ ((^[Y1 : $i]: (!! @ ($i > $o) @ (^[Y2 : $i > $o]: (((Y2 @ c0) & (!! @ $i @ (^[Y3 : $i]: ((Y2 @ Y3) => (Y2 @ (cS @ (cS @ Y3))))))) => (Y2 @ Y1))))) @ Y0))))),
% 1.65/1.40 inference(definition_unfolding,[status(thm)],[f18,f14])).
% 1.65/1.40 thf(f14,plain,(
% 1.65/1.40 (cEVEN1 = (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (((Y1 @ c0) & (!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) => (Y1 @ (cS @ (cS @ Y2))))))) => (Y1 @ Y0))))))),
% 1.65/1.40 inference(cnf_transformation,[status(thm)],[f9])).
% 1.65/1.40 thf(f9,plain,(
% 1.65/1.40 (cEVEN1 = (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (((Y1 @ c0) & (!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) => (Y1 @ (cS @ (cS @ Y2))))))) => (Y1 @ Y0))))))),
% 1.65/1.40 inference(fool_elimination,[status(thm)],[f8])).
% 1.65/1.40 thf(f8,plain,(
% 1.65/1.40 ((^[X0 : $i] : (! [X1 : $i > $o] : ((! [X2 : $i] : ((X1 @ X2) => (X1 @ (cS @ (cS @ X2)))) & (X1 @ c0)) => (X1 @ X0)))) = cEVEN1)),
% 1.65/1.40 inference(rectify,[status(thm)],[f1])).
% 1.65/1.40 thf(f1,axiom,(
% 1.65/1.40 ((^[X0 : $i] : (! [X1 : $i > $o] : ((! [X2 : $i] : ((X1 @ X2) => (X1 @ (cS @ (cS @ X2)))) & (X1 @ c0)) => (X1 @ X0)))) = cEVEN1)),
% 1.65/1.40 file('/export/starexec/sandbox/tmp/tmp.iir1RhgPKN/DTF2THF_32010.p',cEVEN1_def)).
% 1.65/1.40 thf(f18,plain,(
% 1.65/1.40 (cODD1 = (^[Y0 : $i]: (~ (cEVEN1 @ Y0))))),
% 1.65/1.40 inference(cnf_transformation,[status(thm)],[f7])).
% 1.65/1.40 thf(f7,plain,(
% 1.65/1.40 (cODD1 = (^[Y0 : $i]: (~ (cEVEN1 @ Y0))))),
% 1.65/1.40 inference(fool_elimination,[status(thm)],[f6])).
% 1.65/1.40 thf(f6,plain,(
% 1.65/1.40 (cODD1 = (^[X0 : $i] : (~(cEVEN1 @ X0))))),
% 1.65/1.40 inference(rectify,[status(thm)],[f2])).
% 1.65/1.40 thf(f2,axiom,(
% 1.65/1.40 (cODD1 = (^[X0 : $i] : (~(cEVEN1 @ X0))))),
% 1.65/1.40 file('/export/starexec/sandbox/tmp/tmp.iir1RhgPKN/DTF2THF_32010.p',cODD1_def)).
% 1.65/1.40 thf(f17,plain,(
% 1.65/1.40 ((cODD1 @ (cS @ c0)) != $true)),
% 1.65/1.40 inference(cnf_transformation,[status(thm)],[f13])).
% 1.65/1.40 thf(f15,plain,(
% 1.65/1.40 ( ! [X2 : $i] : ((c0 != (cS @ X2))) )),
% 1.65/1.40 inference(cnf_transformation,[status(thm)],[f13])).
% 1.65/1.40 % SZS output end Proof for DTF2THF_32010
% 1.65/1.40 % (32114)------------------------------
% 1.65/1.40 % (32114)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 1.65/1.40 % (32114)Termination reason: Refutation
% 1.65/1.40
% 1.65/1.40 % (32114)Memory used [KB]: 5628
% 1.65/1.40 % (32114)Time elapsed: 0.013 s
% 1.65/1.40 % (32114)Instructions burned: 31 (million)
% 1.65/1.40 % (32114)------------------------------
% 1.65/1.40 % (32114)------------------------------
% 1.65/1.40 % (32113)Success in time 0.02 s
%------------------------------------------------------------------------------