%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET724^4 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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:23:48 AM UTC 2026
% Result : Theorem 0.10s 0.24s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 24 unt; 0 typ; 0 def)
% Number of atoms : 87 ( 50 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 143 ( 9 ~; 0 |; 10 &; 110 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 32 >; 0 *; 0 +; 0 <<)
% Number of symbols : 30 ( 25 usr; 5 con; 0-4 aty)
% ( 4 !!; 6 ??; 0 @@+; 0 @@-)
% Number of variables : 63 ( 35 ^; 21 !; 7 ?; 63 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
fun_image: ( $i > $i ) > ( $i > $o ) > $i > $o ).
thf(func_def_2,type,
fun_composition: ( $i > $i ) > ( $i > $i ) > $i > $i ).
thf(func_def_3,type,
fun_inv_image: ( $i > $i ) > ( $i > $o ) > $i > $o ).
thf(func_def_4,type,
fun_injective: ( $i > $i ) > $o ).
thf(func_def_5,type,
fun_surjective: ( $i > $i ) > $o ).
thf(func_def_6,type,
fun_bijective: ( $i > $i ) > $o ).
thf(func_def_7,type,
fun_decreasing: ( $i > $i ) > ( $i > $i > $o ) > $o ).
thf(func_def_8,type,
fun_increasing: ( $i > $i ) > ( $i > $i > $o ) > $o ).
thf(func_def_9,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_10,type,
vAND: $o > $o > $o ).
thf(func_def_11,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_15,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_16,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_17,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_18,type,
vIMP: $o > $o > $o ).
thf(func_def_21,type,
sK0: $i > $i ).
thf(func_def_22,type,
sK1: $i > $i ).
thf(func_def_23,type,
sK2: $i > $i ).
thf(func_def_24,type,
vNOT: $o > $o ).
thf(func_def_25,type,
sK3: $i > $i ).
thf(f2,axiom,
( fun_composition
= ( ^ [X0: $i > $i,X1: $i > $i,X2: $i] : ( X1 @ ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^1.ax',fun_composition) ).
thf(f5,axiom,
( fun_surjective
= ( ^ [X0: $i > $i] :
! [X1: $i] :
? [X2: $i] :
( X1
= ( X0 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^1.ax',fun_surjective) ).
thf(f9,conjecture,
! [X0: $i > $i,X1: $i > $i,X2: $i > $i] :
( ( ( fun_surjective @ X0 )
& ( ( fun_composition @ X0 @ X1 )
= ( fun_composition @ X0 @ X2 ) ) )
=> ( X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(f10,negated_conjecture,
~ ! [X0: $i > $i,X1: $i > $i,X2: $i > $i] :
( ( ( fun_surjective @ X0 )
& ( ( fun_composition @ X0 @ X1 )
= ( fun_composition @ X0 @ X2 ) ) )
=> ( X1 = X2 ) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
thf(f13,plain,
( fun_composition
= ( ^ [Y0: $i > $i,Y1: $i > $i,Y2: $i] : ( Y1 @ ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f2]) ).
thf(f17,plain,
( fun_surjective
= ( ^ [Y0: $i > $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
= Y1 ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f24,plain,
~ ! [X0: $i > $i,X1: $i > $i,X2: $i > $i] :
( ( ( fun_surjective @ X0 )
& ( ( fun_composition @ X0 @ X1 )
= ( fun_composition @ X0 @ X2 ) ) )
=> ( X1 = X2 ) ),
inference(rectify,[],[f10]) ).
thf(f25,plain,
~ ! [X0: $i > $i,X1: $i > $i,X2: $i > $i] :
( ( ( ( fun_surjective @ X0 )
= $true )
& ( ( fun_composition @ X0 @ X1 )
= ( fun_composition @ X0 @ X2 ) ) )
=> ( X1 = X2 ) ),
inference(fool_elimination,[],[f24]) ).
thf(f26,plain,
? [X0: $i > $i,X1: $i > $i,X2: $i > $i] :
( ( X1 != X2 )
& ( ( fun_surjective @ X0 )
= $true )
& ( ( fun_composition @ X0 @ X1 )
= ( fun_composition @ X0 @ X2 ) ) ),
inference(ennf_transformation,[],[f25]) ).
thf(f27,plain,
? [X0: $i > $i,X1: $i > $i,X2: $i > $i] :
( ( X1 != X2 )
& ( ( fun_surjective @ X0 )
= $true )
& ( ( fun_composition @ X0 @ X1 )
= ( fun_composition @ X0 @ X2 ) ) ),
inference(flattening,[],[f26]) ).
thf(f28,plain,
( ( sK1 != sK2 )
& ( $true
= ( fun_surjective @ sK0 ) )
& ( ( fun_composition @ sK0 @ sK1 )
= ( fun_composition @ sK0 @ sK2 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f27]) ).
thf(f30,plain,
( fun_composition
= ( ^ [Y0: $i > $i,Y1: $i > $i,Y2: $i] : ( Y1 @ ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f33,plain,
( fun_surjective
= ( ^ [Y0: $i > $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
= Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f17]) ).
thf(f37,plain,
( ( fun_composition @ sK0 @ sK1 )
= ( fun_composition @ sK0 @ sK2 ) ),
inference(cnf_transformation,[],[f28]) ).
thf(f38,plain,
( $true
= ( fun_surjective @ sK0 ) ),
inference(cnf_transformation,[],[f28]) ).
thf(f39,plain,
sK1 != sK2,
inference(cnf_transformation,[],[f28]) ).
thf(f43,plain,
( $true
= ( ^ [Y0: $i > $i] :
( !! @ $i
@ ^ [Y1: $i] :
( ?? @ $i
@ ^ [Y2: $i] :
( ( Y0 @ Y2 )
= Y1 ) ) )
@ sK0 ) ),
inference(definition_unfolding,[],[f38,f33]) ).
thf(f44,plain,
( ( ^ [Y0: $i > $i,Y1: $i > $i,Y2: $i] : ( Y1 @ ( Y0 @ Y2 ) )
@ sK0
@ sK1 )
= ( ^ [Y0: $i > $i,Y1: $i > $i,Y2: $i] : ( Y1 @ ( Y0 @ Y2 ) )
@ sK0
@ sK2 ) ),
inference(definition_unfolding,[],[f37,f30,f30]) ).
thf(f45,plain,
( ( ^ [Y0: $i] : ( sK1 @ ( sK0 @ Y0 ) ) )
= ( ^ [Y0: $i] : ( sK2 @ ( sK0 @ Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f44]) ).
thf(f46,plain,
( $true
= ( !! @ $i
@ ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y1 )
= Y0 ) ) ) ),
inference(beta-eta_normalization,[],[f43]) ).
thf(f47,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ?? @ $i
@ ^ [Y1: $i] :
( ( sK0 @ Y1 )
= Y0 ) )
@ X1 ) ),
inference(pi_proxy_clausification,[],[f46]) ).
thf(f48,plain,
! [X1: $i] :
( $true
= ( ?? @ $i
@ ^ [Y0: $i] :
( ( sK0 @ Y0 )
= X1 ) ) ),
inference(beta-eta_normalization,[],[f47]) ).
thf(f49,plain,
! [X1: $i] :
( $true
= ( ^ [Y0: $i] :
( ( sK0 @ Y0 )
= X1 )
@ ( sK3 @ X1 ) ) ),
inference(sigma_proxy_clausification,[],[f48]) ).
thf(f50,plain,
! [X1: $i] :
( $true
= ( ( sK0 @ ( sK3 @ X1 ) )
= X1 ) ),
inference(beta-eta_normalization,[],[f49]) ).
thf(f51,plain,
! [X1: $i] :
( ( sK0 @ ( sK3 @ X1 ) )
= X1 ),
inference(equality_proxy_clausification,[],[f50]) ).
thf(f52,plain,
( ( sK1 @ sK4 )
!= ( sK2 @ sK4 ) ),
inference(negative_extensionality,[],[f39]) ).
thf(f53,plain,
! [X1: $i] :
( ( ^ [Y0: $i] : ( sK1 @ ( sK0 @ Y0 ) )
@ X1 )
= ( ^ [Y0: $i] : ( sK2 @ ( sK0 @ Y0 ) )
@ X1 ) ),
inference(argument_congruence,[],[f45]) ).
thf(f54,plain,
! [X1: $i] :
( ( sK1 @ ( sK0 @ X1 ) )
= ( sK2 @ ( sK0 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f53]) ).
thf(f55,plain,
! [X0: $i] :
( ( sK1 @ X0 )
= ( sK2 @ X0 ) ),
inference(constrained_superposition,[],[f54,f51]) ).
thf(f56,plain,
( ( sK1 @ sK4 )
!= ( sK1 @ sK4 ) ),
inference(constrained_superposition,[],[f52,f55]) ).
thf(f57,plain,
$false,
inference(trivial_inequality_removal,[],[f56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET724^4 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.17 % Computer : n007.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Sep 29 13:38:56 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 Running first-order model finding
% 0.10/0.19 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.24 % (3373290)Will run a generic schedule for satisfiability detection.
% 0.10/0.24 % (3373297)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3436484339:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.24 % (3373297) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3373290-3373297"...
% 0.10/0.24 % (3373297)...printing done.
% 0.10/0.24 % (3373297)Refutation found. Thanks to Tanya!
% 0.10/0.24 % SZS status Theorem for theBenchmark
% 0.10/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.24 % (3373297)------------------------------
% 0.10/0.24 % (3373297)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.24 % (3373297)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.24 % (3373297)CaDiCaL version: 2.1.3
% 0.10/0.24 % (3373297)Termination reason: Refutation
% 0.10/0.24 % (3373297)Time elapsed: 0.002 s
% 0.10/0.24 % (3373297)Peak memory usage: 12 MB
% 0.10/0.24 % (3373297)Instructions burned: 5 (million)
% 0.10/0.24 % (3373290)Success in time 0.036 s
% 0.10/0.24 % Vampire exiting
%------------------------------------------------------------------------------