%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO035^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:48:45 AM UTC 2026
% Result : Theorem 0.10s 0.27s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of formulae : 36 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 174 ( 70 equ; 10 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 141 ( 10 ~; 4 |; 2 &; 97 @)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 49 ( 49 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 14 usr; 6 con; 0-4 aty)
% ( 8 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 67 ( 46 ^; 19 !; 2 ?; 67 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
leibeq1: $i > $i > $o ).
thf(func_def_2,type,
leibeq2: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_3,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_4,type,
vIMP: $o > $o > $o ).
thf(func_def_5,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_6,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_7,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_9,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_14,type,
vNOT: $o > $o ).
thf(func_def_15,type,
sK2: $i > $o ).
thf(f1,axiom,
( leibeq1
= ( ^ [X0: $i,X1: $i] :
! [X2: $i > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leibeq1) ).
thf(f2,axiom,
( leibeq2
= ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: ( $i > $o ) > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leibeq2) ).
thf(f3,conjecture,
! [X0: $i,X1: $i] :
( ( leibeq2
@ ^ [X2: $i] : ( X2 = X0 )
@ ^ [X2: $i] : ( X2 = X1 ) )
=> ( leibeq1 @ X0 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f4,negated_conjecture,
~ ! [X0: $i,X1: $i] :
( ( leibeq2
@ ^ [X2: $i] : ( X2 = X0 )
@ ^ [X2: $i] : ( X2 = X1 ) )
=> ( leibeq1 @ X0 @ X1 ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( leibeq1
= ( ^ [X0: $i,X1: $i] :
! [X2: $i > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
( leibeq1
= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
( leibeq2
= ( ^ [X0: $i > $o,X1: $i > $o] :
! [X2: ( $i > $o ) > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( leibeq2
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
~ ! [X0: $i,X1: $i] :
( ( leibeq2
@ ^ [X2: $i] : ( X2 = X0 )
@ ^ [X3: $i] : ( X1 = X3 ) )
=> ( leibeq1 @ X0 @ X1 ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
~ ! [X0: $i,X1: $i] :
( ( ( leibeq2
@ ^ [Y0: $i] : ( X0 = Y0 )
@ ^ [Y0: $i] : ( X1 = Y0 ) )
= $true )
=> ( ( leibeq1 @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
? [X0: $i,X1: $i] :
( ( ( leibeq1 @ X0 @ X1 )
!= $true )
& ( ( leibeq2
@ ^ [Y0: $i] : ( X0 = Y0 )
@ ^ [Y0: $i] : ( X1 = Y0 ) )
= $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f12,plain,
( ( $true
!= ( leibeq1 @ sK0 @ sK1 ) )
& ( $true
= ( leibeq2
@ ^ [Y0: $i] : ( sK0 = Y0 )
@ ^ [Y0: $i] : ( sK1 = Y0 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f11]) ).
thf(f13,plain,
( leibeq1
= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f14,plain,
( leibeq2
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f15,plain,
( $true
= ( leibeq2
@ ^ [Y0: $i] : ( sK0 = Y0 )
@ ^ [Y0: $i] : ( sK1 = Y0 ) ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f16,plain,
( $true
!= ( leibeq1 @ sK0 @ sK1 ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f19,plain,
( $true
!= ( ^ [Y0: $i,Y1: $i] :
( !! @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) )
@ sK0
@ sK1 ) ),
inference(definition_unfolding,[],[f16,f13]) ).
thf(f20,plain,
( $true
= ( ^ [Y0: $i > $o,Y1: $i > $o] :
( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) )
@ ^ [Y0: $i] : ( sK0 = Y0 )
@ ^ [Y0: $i] : ( sK1 = Y0 ) ) ),
inference(definition_unfolding,[],[f15,f14]) ).
thf(f21,plain,
( $true
= ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y0: ( $i > $o ) > $o] :
( ( Y0 @ ( (=) @ sK0 ) )
=> ( Y0 @ ( (=) @ sK1 ) ) ) ) ),
inference(beta-eta_normalization,[],[f20]) ).
thf(f22,plain,
! [X1: ( $i > $o ) > $o] :
( $true
= ( ^ [Y0: ( $i > $o ) > $o] :
( ( Y0 @ ( (=) @ sK0 ) )
=> ( Y0 @ ( (=) @ sK1 ) ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f21]) ).
thf(f23,plain,
! [X1: ( $i > $o ) > $o] :
( $true
= ( ( X1 @ ( (=) @ sK0 ) )
=> ( X1 @ ( (=) @ sK1 ) ) ) ),
inference(beta-eta_normalization,[],[f22]) ).
thf(f24,plain,
! [X1: ( $i > $o ) > $o] :
( ( $true
= ( X1 @ ( (=) @ sK1 ) ) )
| ( $false
= ( X1 @ ( (=) @ sK0 ) ) ) ),
inference(imp_proxy_clausification,[],[f23]) ).
thf(f25,plain,
( $true
!= ( !! @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( Y0 @ sK0 )
=> ( Y0 @ sK1 ) ) ) ),
inference(beta-eta_normalization,[],[f19]) ).
thf(f26,plain,
( $false
= ( ^ [Y0: $i > $o] :
( ( Y0 @ sK0 )
=> ( Y0 @ sK1 ) )
@ sK2 ) ),
inference(sigma_proxy_clausification,[],[f25]) ).
thf(f27,plain,
( $false
= ( ( sK2 @ sK0 )
=> ( sK2 @ sK1 ) ) ),
inference(beta-eta_normalization,[],[f26]) ).
thf(f28,plain,
( $false
= ( sK2 @ sK1 ) ),
inference(imp_proxy_clausification,[],[f27]) ).
thf(f29,plain,
( $true
= ( sK2 @ sK0 ) ),
inference(imp_proxy_clausification,[],[f27]) ).
thf(f30,plain,
( ( (=) @ sK0 )
= ( (=) @ sK1 ) ),
inference(leibniz_equality_elimination,[],[f24]) ).
thf(f63,plain,
! [X1: $i] :
( ( sK0 = X1 )
= ( sK1 = X1 ) ),
inference(argument_congruence,[],[f30]) ).
thf(f66,plain,
! [X1: $i] :
( ( $false
= ( sK0 = X1 ) )
| ( $true
= ( sK1 = X1 ) ) ),
inference(iff_proxy_clausification,[],[f63]) ).
thf(f67,plain,
! [X1: $i] :
( ( sK0 != X1 )
| ( $true
= ( sK1 = X1 ) ) ),
inference(equality_proxy_clausification,[],[f66]) ).
thf(f68,plain,
! [X1: $i] :
( ( sK0 != X1 )
| ( sK1 = X1 ) ),
inference(equality_proxy_clausification,[],[f67]) ).
thf(f74,plain,
sK0 = sK1,
inference(equality_resolution,[],[f68]) ).
thf(f75,plain,
( $false
= ( sK2 @ sK0 ) ),
inference(constrained_superposition,[],[f28,f74]) ).
thf(f83,plain,
$true = $false,
inference(constrained_superposition,[],[f29,f75]) ).
thf(f84,plain,
$false,
inference(trivial_inequality_removal,[],[f83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO035^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 % Computer : n009.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 16:23:30 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22 Running first-order model finding
% 0.10/0.22 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.10/0.27 % (10228)Will run a generic schedule for satisfiability detection.
% 0.10/0.27 % (10243)% WARNING: option uhcvi not known.
% 0.10/0.27 % (10243)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=500807913:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.27 % (10245)dis+10_1_sil=32000:sp=arity:random_seed=320128200:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.27 % (10242)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3475423360_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.27 % (10244)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2977670093:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.27 % (10243)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.10/0.27 % Exception at run slice level% (10243)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.10/0.27
% 0.10/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.10/0.27 % (10243) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-10228-10243"...
% 0.10/0.27 % (10245) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-10228-10245"...
% 0.10/0.27 % (10244) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-10228-10244"...
% 0.10/0.27 % (10243)...printing done.
% 0.10/0.27 % (10245)...printing done.
% 0.10/0.27 % (10243)Refutation found. Thanks to Tanya!
% 0.10/0.27 % SZS status Theorem for theBenchmark
% 0.10/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.27 % (10243)------------------------------
% 0.10/0.27 % (10243)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.27 % (10243)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.27 % (10243)CaDiCaL version: 2.1.3
% 0.10/0.27 % (10243)Termination reason: Refutation
% 0.10/0.27 % (10243)Time elapsed: 0.005 s
% 0.10/0.27 % (10243)Peak memory usage: 12 MB
% 0.10/0.27 % (10243)Instructions burned: 5 (million)
% 0.10/0.27 % (10228)Success in time 0.048 s
% 0.10/0.27 % Vampire exiting
%------------------------------------------------------------------------------