%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM817^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:35 AM UTC 2026
% Result : Theorem 0.36s 0.28s
% Output : Refutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 3
% Syntax : Number of formulae : 38 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 177 ( 82 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 317 ( 39 ~; 20 |; 21 &; 189 @)
% ( 0 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 22 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 14 usr; 4 con; 0-4 aty)
% ( 16 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 100 ( 38 ^; 58 !; 4 ?; 100 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
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_5,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_6,type,
vIMP: $o > $o > $o ).
thf(func_def_7,type,
vAND: $o > $o > $o ).
thf(func_def_8,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_9,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_10,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_11,type,
vNOT: $o > $o ).
thf(func_def_14,type,
sK0: ( $i > $o ) > $i ).
thf(func_def_15,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f1,axiom,
( cEVEN1
= ( ^ [X0: $i] :
! [X1: $i > $o] :
( ( ! [X2: $i] :
( ( X1 @ X2 )
=> ( X1 @ ( cS @ ( cS @ X2 ) ) ) )
& ( X1 @ c0 ) )
=> ( X1 @ X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEVEN1_def) ).
thf(f2,axiom,
( cODD1
= ( ^ [X0: $i] :
~ ( cEVEN1 @ X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cODD1_def) ).
thf(f3,conjecture,
( ( ! [X1: $i,X2: $i] :
( ( ( cS @ X1 )
= ( cS @ X2 ) )
=> ( X1 = X2 ) )
& ! [X0: $i] :
( ( cS @ X0 )
!= c0 ) )
=> ? [X3: $i] : ( cODD1 @ X3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM405) ).
thf(f4,negated_conjecture,
~ ( ( ! [X1: $i,X2: $i] :
( ( ( cS @ X1 )
= ( cS @ X2 ) )
=> ( X1 = X2 ) )
& ! [X0: $i] :
( ( cS @ X0 )
!= c0 ) )
=> ? [X3: $i] : ( cODD1 @ X3 ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( cEVEN1
= ( ^ [X0: $i] :
! [X1: $i > $o] :
( ( ! [X2: $i] :
( ( X1 @ X2 )
=> ( X1 @ ( cS @ ( cS @ X2 ) ) ) )
& ( X1 @ c0 ) )
=> ( X1 @ X0 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,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,[],[f5]) ).
thf(f7,plain,
( cODD1
= ( ^ [X0: $i] :
~ ( cEVEN1 @ X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( cODD1
= ( ^ [Y0: $i] :
~ ( cEVEN1 @ Y0 ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ( ( ! [X0: $i,X1: $i] :
( ( ( cS @ X0 )
= ( cS @ X1 ) )
=> ( X0 = X1 ) )
& ! [X2: $i] :
( c0
!= ( cS @ X2 ) ) )
=> ? [X3: $i] : ( cODD1 @ X3 ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ( ( ! [X0: $i,X1: $i] :
( ( ( cS @ X0 )
= ( cS @ X1 ) )
=> ( X0 = X1 ) )
& ! [X2: $i] :
( c0
!= ( cS @ X2 ) ) )
=> ? [X3: $i] :
( ( cODD1 @ X3 )
= $true ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ! [X3: $i] :
( ( cODD1 @ X3 )
!= $true )
& ! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( cS @ X0 )
!= ( cS @ X1 ) ) )
& ! [X2: $i] :
( c0
!= ( cS @ X2 ) ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f12,plain,
( ! [X3: $i] :
( ( cODD1 @ X3 )
!= $true )
& ! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( ( cS @ X0 )
!= ( cS @ X1 ) ) )
& ! [X2: $i] :
( c0
!= ( cS @ X2 ) ) ),
inference(flattening,[],[f11]) ).
thf(f13,plain,
( ! [X0: $i] :
( $true
!= ( cODD1 @ X0 ) )
& ! [X1: $i,X2: $i] :
( ( X1 = X2 )
| ( ( cS @ X2 )
!= ( cS @ X1 ) ) )
& ! [X3: $i] :
( c0
!= ( cS @ X3 ) ) ),
inference(rectify,[],[f12]) ).
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,[],[f6]) ).
thf(f15,plain,
( cODD1
= ( ^ [Y0: $i] :
~ ( cEVEN1 @ Y0 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f16,plain,
! [X3: $i] :
( c0
!= ( cS @ X3 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f17,plain,
! [X2: $i,X1: $i] :
( ( ( cS @ X2 )
!= ( cS @ X1 ) )
| ( X1 = X2 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f18,plain,
! [X0: $i] :
( $true
!= ( cODD1 @ X0 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f21,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,[],[f15,f14]) ).
thf(f22,plain,
! [X0: $i] :
( $true
!= ( ^ [Y0: $i] :
~ ( ^ [Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( ( Y2 @ c0 )
& ( !! @ $i
@ ^ [Y3: $i] :
( ( Y2 @ Y3 )
=> ( Y2 @ ( cS @ ( cS @ Y3 ) ) ) ) ) )
=> ( Y2 @ Y1 ) ) )
@ Y0 )
@ X0 ) ),
inference(definition_unfolding,[],[f18,f21]) ).
thf(f23,plain,
! [X0: $i] :
( $true
!= ( ~ ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( Y0 @ c0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ ( cS @ Y1 ) ) ) ) ) )
=> ( Y0 @ X0 ) ) ) ) ),
inference(beta-eta_normalization,[],[f22]) ).
thf(f24,plain,
! [X0: $i] :
( $true
= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( Y0 @ c0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ ( cS @ Y1 ) ) ) ) ) )
=> ( Y0 @ X0 ) ) ) ),
inference(not_proxy_clausification,[],[f23]) ).
thf(f25,plain,
! [X0: $i,X1: $i > $o] :
( $true
= ( ^ [Y0: $i > $o] :
( ( ( Y0 @ c0 )
& ( !! @ $i
@ ^ [Y1: $i] :
( ( Y0 @ Y1 )
=> ( Y0 @ ( cS @ ( cS @ Y1 ) ) ) ) ) )
=> ( Y0 @ X0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f24]) ).
thf(f26,plain,
! [X0: $i,X1: $i > $o] :
( $true
= ( ( ( X1 @ c0 )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ ( cS @ Y0 ) ) ) ) ) )
=> ( X1 @ X0 ) ) ),
inference(beta-eta_normalization,[],[f25]) ).
thf(f27,plain,
! [X0: $i,X1: $i > $o] :
( ( $false
= ( ( X1 @ c0 )
& ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ ( cS @ Y0 ) ) ) ) ) ) )
| ( ( X1 @ X0 )
= $true ) ),
inference(imp_proxy_clausification,[],[f26]) ).
thf(f28,plain,
! [X0: $i,X1: $i > $o] :
( ( $false
= ( !! @ $i
@ ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ ( cS @ Y0 ) ) ) ) ) )
| ( ( X1 @ X0 )
= $true )
| ( ( X1 @ c0 )
= $false ) ),
inference(and_proxy_clausification,[],[f27]) ).
thf(f29,plain,
! [X0: $i,X1: $i > $o] :
( ( $false
= ( ^ [Y0: $i] :
( ( X1 @ Y0 )
=> ( X1 @ ( cS @ ( cS @ Y0 ) ) ) )
@ ( sK0 @ X1 ) ) )
| ( ( X1 @ X0 )
= $true )
| ( ( X1 @ c0 )
= $false ) ),
inference(sigma_proxy_clausification,[],[f28]) ).
thf(f30,plain,
! [X0: $i,X1: $i > $o] :
( ( $false
= ( ( X1 @ ( sK0 @ X1 ) )
=> ( X1 @ ( cS @ ( cS @ ( sK0 @ X1 ) ) ) ) ) )
| ( ( X1 @ X0 )
= $true )
| ( ( X1 @ c0 )
= $false ) ),
inference(beta-eta_normalization,[],[f29]) ).
thf(f31,plain,
! [X0: $i,X1: $i > $o] :
( ( $false
= ( X1 @ ( cS @ ( cS @ ( sK0 @ X1 ) ) ) ) )
| ( ( X1 @ X0 )
= $true )
| ( ( X1 @ c0 )
= $false ) ),
inference(imp_proxy_clausification,[],[f30]) ).
thf(f106,plain,
! [X0: $i] :
( ( ( cS
@ ( cS
@ ( sK0
@ ^ [Y0: $i] : ( Y0 != X0 ) ) ) )
= X0 )
| ( $false
= ( ^ [Y0: $i] : ( Y0 != X0 )
@ c0 ) ) ),
inference(leibniz_equality_elimination,[],[f31]) ).
thf(f201,plain,
! [X0: $i] :
( ( ( cS
@ ( cS
@ ( sK0
@ ^ [Y0: $i] : ( Y0 != X0 ) ) ) )
= X0 )
| ( $false
= ( c0 != X0 ) ) ),
inference(beta-eta_normalization,[],[f106]) ).
thf(f202,plain,
! [X0: $i] :
( ( ( cS
@ ( cS
@ ( sK0
@ ^ [Y0: $i] : ( Y0 != X0 ) ) ) )
= X0 )
| ( $true
= ( c0 = X0 ) ) ),
inference(not_proxy_clausification,[],[f201]) ).
thf(f203,plain,
! [X0: $i] :
( ( ( cS
@ ( cS
@ ( sK0
@ ^ [Y0: $i] : ( Y0 != X0 ) ) ) )
= X0 )
| ( c0 = X0 ) ),
inference(equality_proxy_clausification,[],[f202]) ).
thf(f587,plain,
! [X0: $i,X1: $i] :
( ( ( cS @ X1 )
!= X0 )
| ( ( cS
@ ( sK0
@ ^ [Y0: $i] : ( Y0 != X0 ) ) )
= X1 )
| ( c0 = X0 ) ),
inference(constrained_superposition,[],[f17,f203]) ).
thf(f1521,plain,
! [X0: $i] :
( ( ( cS
@ ( sK0
@ ^ [Y0: $i] :
( Y0
!= ( cS @ X0 ) ) ) )
= X0 )
| ( c0
= ( cS @ X0 ) ) ),
inference(equality_resolution,[],[f587]) ).
thf(f1524,plain,
! [X0: $i] :
( ( cS
@ ( sK0
@ ^ [Y0: $i] :
( Y0
!= ( cS @ X0 ) ) ) )
= X0 ),
inference(forward_subsumption_resolution,[],[f1521,f16]) ).
thf(f2002,plain,
! [X0: $i] : ( c0 != X0 ),
inference(constrained_superposition,[],[f16,f1524]) ).
thf(f2172,plain,
$false,
inference(equality_resolution,[],[f2002]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM817^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n016.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 13:07:35 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 Running first-order model finding
% 0.08/0.20 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.36/0.28 % (309523)Will run a generic schedule for satisfiability detection.
% 0.36/0.28 % (309529)% WARNING: option uhcvi not known.
% 0.36/0.28 % (309529)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3128584974:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.36/0.28 % (309529)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.36/0.28 % (309529)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.36/0.28 % (309528)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=396783053_2999 on theBenchmark for (2999ds/0Mi)
% 0.36/0.28 % (309530)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3209016:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.36/0.28 % (309531)dis+10_1_sil=32000:sp=arity:random_seed=2331366766:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.36/0.28 % (309532)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1871694707:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.36/0.28 % (309533)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1597964883:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.36/0.28 % (309534)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=382415013:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.36/0.28 % Exception at run slice level% (309532)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.36/0.28
% 0.36/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.36/0.28 % (309542)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=800522573:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.36/0.28 % Exception at run slice level
% 0.36/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.36/0.28 % (309529) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-309523-309529"...
% 0.36/0.28 % (309529)...printing done.
% 0.36/0.28 % (309529)Refutation found. Thanks to Tanya!
% 0.36/0.28 % SZS status Theorem for theBenchmark
% 0.36/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.36/0.28 % (309529)------------------------------
% 0.36/0.28 % (309529)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.36/0.28 % (309529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.36/0.28 % (309529)CaDiCaL version: 2.1.3
% 0.36/0.28 % (309529)Termination reason: Refutation
% 0.36/0.28 % (309529)Time elapsed: 0.042 s
% 0.36/0.28 % (309529)Peak memory usage: 13 MB
% 0.36/0.28 % (309529)Instructions burned: 155 (million)
% 0.36/0.28 % (309523)Success in time 0.076 s
% 0.36/0.28 % Vampire exiting
%------------------------------------------------------------------------------