%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET200^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 : n010.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:37 AM UTC 2026
% Result : Theorem 0.21s 0.28s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 8 unt; 0 typ; 2 def)
% Number of atoms : 164 ( 58 equ; 0 cnn)
% Maximal formula atoms : 8 ( 5 avg)
% Number of connectives : 190 ( 37 ~; 35 |; 20 &; 80 @)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 28 ( 28 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 38 !; 15 ?; 53 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_3,type,
sK0: a > $o ).
thf(func_def_4,type,
sK1: a > $o ).
thf(func_def_5,type,
sK2: a > $o ).
thf(func_def_6,type,
sK3: a > $o ).
thf(func_def_7,type,
sK4: a ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o,X2: a > $o,X3: a > $o] :
( ( ! [X4: a] :
( ( X2 @ X4 )
=> ( X3 @ X4 ) )
& ! [X4: a] :
( ( X0 @ X4 )
=> ( X1 @ X4 ) ) )
=> ! [X4: a] :
( ( ( X2 @ X4 )
| ( X0 @ X4 ) )
=> ( ( X3 @ X4 )
| ( X1 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_34_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o,X3: a > $o] :
( ( ! [X4: a] :
( ( X2 @ X4 )
=> ( X3 @ X4 ) )
& ! [X4: a] :
( ( X0 @ X4 )
=> ( X1 @ X4 ) ) )
=> ! [X4: a] :
( ( ( X2 @ X4 )
| ( X0 @ X4 ) )
=> ( ( X3 @ X4 )
| ( X1 @ X4 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o,X3: a > $o] :
( ( ! [X4: a] :
( ( X2 @ X4 )
=> ( X3 @ X4 ) )
& ! [X5: a] :
( ( X0 @ X5 )
=> ( X1 @ X5 ) ) )
=> ! [X6: a] :
( ( ( X2 @ X6 )
| ( X0 @ X6 ) )
=> ( ( X3 @ X6 )
| ( X1 @ X6 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o,X3: a > $o] :
( ( ! [X4: a] :
( ( ( X2 @ X4 )
= $true )
=> ( ( X3 @ X4 )
= $true ) )
& ! [X5: a] :
( ( ( X0 @ X5 )
= $true )
=> ( ( X1 @ X5 )
= $true ) ) )
=> ! [X6: a] :
( ( ( ( X2 @ X6 )
= $true )
| ( ( X0 @ X6 )
= $true ) )
=> ( ( ( X3 @ X6 )
= $true )
| ( ( X1 @ X6 )
= $true ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o,X3: a > $o] :
( ? [X6: a] :
( ( ( X3 @ X6 )
!= $true )
& ( ( X1 @ X6 )
!= $true )
& ( ( ( X2 @ X6 )
= $true )
| ( ( X0 @ X6 )
= $true ) ) )
& ! [X4: a] :
( ( ( X3 @ X4 )
= $true )
| ( ( X2 @ X4 )
!= $true ) )
& ! [X5: a] :
( ( ( X1 @ X5 )
= $true )
| ( ( X0 @ X5 )
!= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o,X3: a > $o] :
( ? [X6: a] :
( ( ( X3 @ X6 )
!= $true )
& ( ( X1 @ X6 )
!= $true )
& ( ( ( X2 @ X6 )
= $true )
| ( ( X0 @ X6 )
= $true ) ) )
& ! [X4: a] :
( ( ( X3 @ X4 )
= $true )
| ( ( X2 @ X4 )
!= $true ) )
& ! [X5: a] :
( ( ( X1 @ X5 )
= $true )
| ( ( X0 @ X5 )
!= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o,X3: a > $o] :
( ? [X4: a] :
( ( ( X3 @ X4 )
!= $true )
& ( ( X1 @ X4 )
!= $true )
& ( ( ( X2 @ X4 )
= $true )
| ( ( X0 @ X4 )
= $true ) ) )
& ! [X5: a] :
( ( $true
= ( X3 @ X5 ) )
| ( $true
!= ( X2 @ X5 ) ) )
& ! [X6: a] :
( ( ( X1 @ X6 )
= $true )
| ( ( X0 @ X6 )
!= $true ) ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
( ( $true
!= ( sK3 @ sK4 ) )
& ( $true
!= ( sK1 @ sK4 ) )
& ( ( $true
= ( sK2 @ sK4 ) )
| ( $true
= ( sK0 @ sK4 ) ) )
& ! [X5: a] :
( ( $true
= ( sK3 @ X5 ) )
| ( $true
!= ( sK2 @ X5 ) ) )
& ! [X6: a] :
( ( $true
= ( sK1 @ X6 ) )
| ( $true
!= ( sK0 @ X6 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f7]) ).
thf(f9,plain,
! [X6: a] :
( ( $true
!= ( sK0 @ X6 ) )
| ( $true
= ( sK1 @ X6 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f10,plain,
! [X5: a] :
( ( $true
!= ( sK2 @ X5 ) )
| ( $true
= ( sK3 @ X5 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f11,plain,
( ( $true
= ( sK2 @ sK4 ) )
| ( $true
= ( sK0 @ sK4 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f12,plain,
( $true
!= ( sK1 @ sK4 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f13,plain,
( $true
!= ( sK3 @ sK4 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f17,definition,
( spl5_1
<=> ( $true
= ( sK0 @ sK4 ) ) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
thf(f19,plain,
( ( $true
= ( sK0 @ sK4 ) )
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f17]) ).
thf(f21,definition,
( spl5_2
<=> ( $true
= ( sK2 @ sK4 ) ) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
thf(f23,plain,
( ( $true
= ( sK2 @ sK4 ) )
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f21]) ).
thf(f24,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f11,f21,f17]) ).
thf(f25,plain,
( ( $true != $true )
| ( $true
= ( sK3 @ sK4 ) )
| ~ spl5_2 ),
inference(constrained_superposition,[],[f10,f23]) ).
thf(f26,plain,
( ( $true
= ( sK3 @ sK4 ) )
| ~ spl5_2 ),
inference(trivial_inequality_removal,[],[f25]) ).
thf(f27,plain,
( $false
| ~ spl5_2 ),
inference(forward_subsumption_resolution,[],[f26,f13]) ).
thf(f28,plain,
~ spl5_2,
inference(avatar_contradiction_clause,[],[f27]) ).
thf(f29,plain,
( ( $true != $true )
| ( $true
= ( sK1 @ sK4 ) )
| ~ spl5_1 ),
inference(constrained_superposition,[],[f9,f19]) ).
thf(f30,plain,
( ( $true
= ( sK1 @ sK4 ) )
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f29]) ).
thf(f31,plain,
( $false
| ~ spl5_1 ),
inference(forward_subsumption_resolution,[],[f30,f12]) ).
thf(f32,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f31]) ).
cnf(s1,plain,
( spl5_1
| spl5_2 ),
inference(sat_conversion,[],[f24]) ).
cnf(s2,plain,
~ spl5_2,
inference(sat_conversion,[],[f28]) ).
cnf(s3,plain,
~ spl5_1,
inference(sat_conversion,[],[f32]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s2,s3]) ).
thf(f33,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET200^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n010.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 13:38:03 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.21/0.28 % (2859874)Will run a generic schedule for satisfiability detection.
% 0.21/0.28 % (2859880)% WARNING: option uhcvi not known.
% 0.21/0.28 % (2859880)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4096680302:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.28 % (2859879)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4211317897_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.28 % (2859882)dis+10_1_sil=32000:sp=arity:random_seed=112642996:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.28 % (2859881)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=58902962:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.28 % (2859884)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3751153126:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.28 % (2859880)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.28 % (2859883)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=325628554:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.28 % (2859880)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.21/0.28 % Exception at run slice level
% 0.21/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.28 % (2859883)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.28 % (2859885)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3695423496:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.28 % (2859880) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2859874-2859880"...
% 0.21/0.28 % (2859882) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2859874-2859882"...
% 0.21/0.28 % (2859884) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2859874-2859884"...
% 0.21/0.28 % (2859883) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2859874-2859883"...
% 0.21/0.28 % (2859881) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2859874-2859881"...
% 0.21/0.28 % (2859885) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2859874-2859885"...
% 0.21/0.28 % (2859882)...printing done.
% 0.21/0.28 % (2859880)...printing done.
% 0.21/0.28 % (2859884)...printing done.
% 0.21/0.28 % (2859883)...printing done.
% 0.21/0.28 % (2859885)...printing done.
% 0.21/0.28 % (2859881)...printing done.
% 0.21/0.28 % (2859882)Refutation found. Thanks to Tanya!
% 0.21/0.28 % SZS status Theorem for theBenchmark
% 0.21/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.28 % (2859882)------------------------------
% 0.21/0.28 % (2859882)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.28 % (2859882)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.28 % (2859882)CaDiCaL version: 2.1.3
% 0.21/0.28 % (2859882)Termination reason: Refutation
% 0.21/0.28 % (2859882)Time elapsed: 0.003 s
% 0.21/0.28 % (2859882)Peak memory usage: 12 MB
% 0.21/0.28 % (2859882)Instructions burned: 2 (million)
% 0.21/0.28 % (2859874)Success in time 0.042 s
% 0.21/0.28 % Vampire exiting
%------------------------------------------------------------------------------