%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU932^5 : TPTP v9.3.1. Released v4.0.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:34:25 AM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 66 ( 52 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 130 ( 14 ~; 6 |; 19 &; 81 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 2 con; 0-4 aty)
% Number of variables : 62 ( 20 ^; 21 !; 21 ?; 62 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_2,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_3,type,
sK0: $i > $i ).
thf(func_def_4,type,
sK1: $i > $i ).
thf(f1,conjecture,
! [X0: $i > $i] :
( ? [X1: $i > $i] :
( ? [X2: $i] :
( ! [X3: $i] :
( ( ( X1 @ X3 )
= X3 )
=> ( X3 = X2 ) )
& ( ( X1 @ X2 )
= X2 ) )
& ( ( ^ [X2: $i] : ( X0 @ ( X1 @ X2 ) ) )
= ( ^ [X2: $i] : ( X1 @ ( X0 @ X2 ) ) ) ) )
=> ? [X4: $i] :
( ( X0 @ X4 )
= X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM141_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: $i > $i] :
( ? [X1: $i > $i] :
( ? [X2: $i] :
( ! [X3: $i] :
( ( ( X1 @ X3 )
= X3 )
=> ( X3 = X2 ) )
& ( ( X1 @ X2 )
= X2 ) )
& ( ( ^ [X2: $i] : ( X0 @ ( X1 @ X2 ) ) )
= ( ^ [X2: $i] : ( X1 @ ( X0 @ X2 ) ) ) ) )
=> ? [X4: $i] :
( ( X0 @ X4 )
= X4 ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: $i > $i] :
( ? [X1: $i > $i] :
( ? [X2: $i] :
( ! [X3: $i] :
( ( ( X1 @ X3 )
= X3 )
=> ( X3 = X2 ) )
& ( ( X1 @ X2 )
= X2 ) )
& ( ( ^ [X4: $i] : ( X0 @ ( X1 @ X4 ) ) )
= ( ^ [X5: $i] : ( X1 @ ( X0 @ X5 ) ) ) ) )
=> ? [X6: $i] :
( ( X0 @ X6 )
= X6 ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: $i > $i] :
( ? [X1: $i > $i] :
( ? [X2: $i] :
( ! [X3: $i] :
( ( ( X1 @ X3 )
= X3 )
=> ( X2 = X3 ) )
& ( ( X1 @ X2 )
= X2 ) )
& ( ( ^ [Y0: $i] : ( X0 @ ( X1 @ Y0 ) ) )
= ( ^ [Y0: $i] : ( X1 @ ( X0 @ Y0 ) ) ) ) )
=> ? [X6: $i] :
( ( X0 @ X6 )
= X6 ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ! [X0: $i > $i] :
( ? [X1: $i > $i] :
( ? [X2: $i] :
( ! [X3: $i] :
( ( ( X1 @ X3 )
= X3 )
=> ( X2 = X3 ) )
& ( ( X1 @ X2 )
= X2 ) )
& ( ( ^ [Y0: $i] : ( X0 @ ( X1 @ Y0 ) ) )
= ( ^ [Y0: $i] : ( X1 @ ( X0 @ Y0 ) ) ) ) )
=> ? [X4: $i] :
( ( X0 @ X4 )
= X4 ) ),
inference(rectify,[],[f4]) ).
thf(f6,plain,
? [X0: $i > $i] :
( ! [X4: $i] :
( ( X0 @ X4 )
!= X4 )
& ? [X1: $i > $i] :
( ? [X2: $i] :
( ! [X3: $i] :
( ( X2 = X3 )
| ( ( X1 @ X3 )
!= X3 ) )
& ( ( X1 @ X2 )
= X2 ) )
& ( ( ^ [Y0: $i] : ( X0 @ ( X1 @ Y0 ) ) )
= ( ^ [Y0: $i] : ( X1 @ ( X0 @ Y0 ) ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f7,plain,
? [X0: $i > $i] :
( ! [X1: $i] :
( ( X0 @ X1 )
!= X1 )
& ? [X2: $i > $i] :
( ? [X3: $i] :
( ! [X4: $i] :
( ( X3 = X4 )
| ( ( X2 @ X4 )
!= X4 ) )
& ( ( X2 @ X3 )
= X3 ) )
& ( ( ^ [Y0: $i] : ( X0 @ ( X2 @ Y0 ) ) )
= ( ^ [Y0: $i] : ( X2 @ ( X0 @ Y0 ) ) ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
( ! [X1: $i] :
( ( sK0 @ X1 )
!= X1 )
& ! [X4: $i] :
( ( sK2 = X4 )
| ( ( sK1 @ X4 )
!= X4 ) )
& ( sK2
= ( sK1 @ sK2 ) )
& ( ( ^ [Y0: $i] : ( sK0 @ ( sK1 @ Y0 ) ) )
= ( ^ [Y0: $i] : ( sK1 @ ( sK0 @ Y0 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X2,sK1),skolemize(X3,sK2)],[f7]) ).
thf(f9,plain,
( ( ^ [Y0: $i] : ( sK0 @ ( sK1 @ Y0 ) ) )
= ( ^ [Y0: $i] : ( sK1 @ ( sK0 @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f10,plain,
( sK2
= ( sK1 @ sK2 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f11,plain,
! [X4: $i] :
( ( ( sK1 @ X4 )
!= X4 )
| ( sK2 = X4 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f12,plain,
! [X1: $i] :
( ( sK0 @ X1 )
!= X1 ),
inference(cnf_transformation,[],[f8]) ).
thf(f13,plain,
! [X1: $i] :
( ( ^ [Y0: $i] : ( sK0 @ ( sK1 @ Y0 ) )
@ X1 )
= ( ^ [Y0: $i] : ( sK1 @ ( sK0 @ Y0 ) )
@ X1 ) ),
inference(argument_congruence,[],[f9]) ).
thf(f14,plain,
! [X1: $i] :
( ( sK0 @ ( sK1 @ X1 ) )
= ( sK1 @ ( sK0 @ X1 ) ) ),
inference(beta-eta_normalization,[],[f13]) ).
thf(f15,plain,
! [X0: $i] :
( ( ( sK0 @ X0 )
!= ( sK0 @ ( sK1 @ X0 ) ) )
| ( sK2
= ( sK0 @ X0 ) ) ),
inference(constrained_superposition,[],[f11,f14]) ).
thf(f16,plain,
( ( ( sK0 @ sK2 )
!= ( sK0 @ sK2 ) )
| ( sK2
= ( sK0 @ sK2 ) ) ),
inference(constrained_superposition,[],[f15,f10]) ).
thf(f18,plain,
( sK2
= ( sK0 @ sK2 ) ),
inference(trivial_inequality_removal,[],[f16]) ).
thf(f19,plain,
$false,
inference(forward_subsumption_resolution,[],[f18,f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU932^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % 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 14:51:49 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.21 Running first-order model finding
% 0.08/0.21 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.08/0.25 % (449286)Will run a generic schedule for satisfiability detection.
% 0.08/0.25 % (449292)% WARNING: option uhcvi not known.
% 0.08/0.25 % (449294)dis+10_1_sil=32000:sp=arity:random_seed=835205520:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.25 % (449295)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=36097236:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.25 % (449291)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1133828290_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.25 % (449292)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4250103153:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.25 % (449295)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.25 % (449293)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=572223553:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.25 % (449296)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=676449997:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.25 % (449292)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.25 % Exception at run slice level
% 0.08/0.25 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.25 % (449292)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.08/0.25 % (449295) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-449286-449295"...
% 0.08/0.25 % (449294) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-449286-449294"...
% 0.08/0.25 % (449292) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-449286-449292"...
% 0.08/0.25 % (449296) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-449286-449296"...
% 0.08/0.25 % (449297)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=118611961:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.25 % (449295)...printing done.
% 0.08/0.25 % (449294)...printing done.
% 0.08/0.25 % (449292)...printing done.
% 0.08/0.25 % (449297) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-449286-449297"...
% 0.08/0.25 % (449296)...printing done.
% 0.08/0.25 % (449294)Refutation found. Thanks to Tanya!
% 0.08/0.25 % SZS status Theorem for theBenchmark
% 0.08/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25 % (449294)------------------------------
% 0.08/0.25 % (449294)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25 % (449294)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25 % (449294)CaDiCaL version: 2.1.3
% 0.08/0.25 % (449294)Termination reason: Refutation
% 0.08/0.25 % (449294)Time elapsed: 0.002 s
% 0.08/0.25 % (449294)Peak memory usage: 12 MB
% 0.08/0.25 % (449294)Instructions burned: 2 (million)
% 0.08/0.25 % (449286)Success in time 0.033 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------