%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV389^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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:39:26 AM UTC 2026
% Result : Theorem 0.19s 0.26s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 111 ( 29 equ; 0 cnn)
% Maximal formula atoms : 3 ( 6 avg)
% Number of connectives : 84 ( 8 ~; 4 |; 15 &; 47 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 20 ( 10 ^; 9 !; 1 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cS: $i > $o ).
thf(func_def_1,type,
cR: $i > $o ).
thf(func_def_3,type,
vAND: $o > $o > $o ).
thf(func_def_4,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_5,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f1,conjecture,
( ( cR
= ( ^ [X0: $i] :
( ( cS @ X0 )
& ( cR @ X0 ) ) ) )
=> ! [X0: $i] :
( ( cR @ X0 )
=> ( cS @ X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM37_pme) ).
thf(f2,negated_conjecture,
~ ( ( cR
= ( ^ [X0: $i] :
( ( cS @ X0 )
& ( cR @ X0 ) ) ) )
=> ! [X0: $i] :
( ( cR @ X0 )
=> ( cS @ X0 ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( cR
= ( ^ [X0: $i] :
( ( cS @ X0 )
& ( cR @ X0 ) ) ) )
=> ! [X1: $i] :
( ( cR @ X1 )
=> ( cS @ X1 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( cR
= ( ^ [Y0: $i] :
( ( cR @ Y0 )
& ( cS @ Y0 ) ) ) )
=> ! [X1: $i] :
( ( ( cR @ X1 )
= $true )
=> ( ( cS @ X1 )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ( ( cR
= ( ^ [Y0: $i] :
( ( cR @ Y0 )
& ( cS @ Y0 ) ) ) )
=> ! [X0: $i] :
( ( ( cR @ X0 )
= $true )
=> ( ( cS @ X0 )
= $true ) ) ),
inference(rectify,[],[f4]) ).
thf(f6,plain,
( ? [X0: $i] :
( ( ( cS @ X0 )
!= $true )
& ( ( cR @ X0 )
= $true ) )
& ( cR
= ( ^ [Y0: $i] :
( ( cR @ Y0 )
& ( cS @ Y0 ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f7,plain,
( ( $true
!= ( cS @ sK0 ) )
& ( $true
= ( cR @ sK0 ) )
& ( cR
= ( ^ [Y0: $i] :
( ( cR @ Y0 )
& ( cS @ Y0 ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f6]) ).
thf(f8,plain,
( cR
= ( ^ [Y0: $i] :
( ( cR @ Y0 )
& ( cS @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
( $true
= ( cR @ sK0 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f10,plain,
( $true
!= ( cS @ sK0 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f13,plain,
! [X1: $i] :
( ( cR @ X1 )
= ( ^ [Y0: $i] :
( ( cR @ Y0 )
& ( cS @ Y0 ) )
@ X1 ) ),
inference(argument_congruence,[],[f8]) ).
thf(f15,plain,
! [X1: $i] :
( ( ( cR @ X1 )
= $false )
| ( $true
= ( ^ [Y0: $i] :
( ( cR @ Y0 )
& ( cS @ Y0 ) )
@ X1 ) ) ),
inference(iff_proxy_clausification,[],[f13]) ).
thf(f16,plain,
! [X1: $i] :
( ( ( cR @ X1 )
= $false )
| ( $true
= ( ( cR @ X1 )
& ( cS @ X1 ) ) ) ),
inference(beta-eta_normalization,[],[f15]) ).
thf(f17,plain,
! [X1: $i] :
( ( ( cS @ X1 )
= $true )
| ( ( cR @ X1 )
= $false ) ),
inference(and_proxy_clausification,[],[f16]) ).
thf(f35,plain,
( ( $true != $true )
| ( ( cR @ sK0 )
= $false ) ),
inference(constrained_superposition,[],[f10,f17]) ).
thf(f36,plain,
( ( cR @ sK0 )
= $false ),
inference(trivial_inequality_removal,[],[f35]) ).
thf(f41,plain,
$true = $false,
inference(constrained_superposition,[],[f9,f36]) ).
thf(f42,plain,
$false,
inference(trivial_inequality_removal,[],[f41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV389^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n017.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 15:39:07 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.19/0.26 % (484869)Will run a generic schedule for satisfiability detection.
% 0.19/0.26 % (484874)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3228650741_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.26 % Exception at run slice level
% 0.19/0.26 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.26 % (484875)% WARNING: option uhcvi not known.
% 0.19/0.26 % (484876)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2320768629:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.26 % (484875)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2340168983:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.26 % (484875)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.26 % (484875)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.26 % (484878)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3714688296:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.26 % (484878)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.26 % (484875) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-484869-484875"...
% 0.19/0.26 % (484876) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-484869-484876"...
% 0.19/0.26 % (484878) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-484869-484878"...
% 0.19/0.26 % (484877)dis+10_1_sil=32000:sp=arity:random_seed=1371265998:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.26 % (484875)...printing done.
% 0.19/0.26 % (484876)...printing done.
% 0.19/0.26 % (484878)...printing done.
% 0.19/0.26 % (484882)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4122623881:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.19/0.26 % Exception at run slice level
% 0.19/0.26 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.26 % (484875)Refutation found. Thanks to Tanya!
% 0.19/0.26 % SZS status Theorem for theBenchmark
% 0.19/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.26 % (484875)------------------------------
% 0.19/0.26 % (484875)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.26 % (484875)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.26 % (484875)CaDiCaL version: 2.1.3
% 0.19/0.26 % (484875)Termination reason: Refutation
% 0.19/0.26 % (484875)Time elapsed: 0.003 s
% 0.19/0.26 % (484875)Peak memory usage: 12 MB
% 0.19/0.26 % (484875)Instructions burned: 2 (million)
% 0.19/0.26 % (484869)Success in time 0.048 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------