%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET199^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 : n019.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.26s 0.33s
% Output : Refutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 99 ( 42 equ; 0 cnn)
% Maximal formula atoms : 7 ( 7 avg)
% Number of connectives : 134 ( 22 ~; 14 |; 20 &; 62 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 21 ( 21 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 0 ^; 33 !; 12 ?; 45 :)
% 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 ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( X2 @ X3 )
=> ( X1 @ X3 ) )
& ! [X3: a] :
( ( X2 @ X3 )
=> ( X0 @ X3 ) ) )
=> ! [X3: a] :
( ( X2 @ X3 )
=> ( ( X1 @ X3 )
| ( X0 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_39_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( X2 @ X3 )
=> ( X1 @ X3 ) )
& ! [X3: a] :
( ( X2 @ X3 )
=> ( X0 @ X3 ) ) )
=> ! [X3: a] :
( ( X2 @ X3 )
=> ( ( X1 @ X3 )
| ( X0 @ X3 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( X2 @ X3 )
=> ( X1 @ X3 ) )
& ! [X4: a] :
( ( X2 @ X4 )
=> ( X0 @ X4 ) ) )
=> ! [X5: a] :
( ( X2 @ X5 )
=> ( ( X1 @ X5 )
| ( X0 @ X5 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( ( X2 @ X3 )
= $true )
=> ( ( X1 @ X3 )
= $true ) )
& ! [X4: a] :
( ( ( X2 @ X4 )
= $true )
=> ( ( X0 @ X4 )
= $true ) ) )
=> ! [X5: a] :
( ( ( X2 @ X5 )
= $true )
=> ( ( ( X1 @ X5 )
= $true )
| ( ( X0 @ X5 )
= $true ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X5: a] :
( ( ( X1 @ X5 )
!= $true )
& ( ( X0 @ X5 )
!= $true )
& ( ( X2 @ X5 )
= $true ) )
& ! [X3: a] :
( ( ( X1 @ X3 )
= $true )
| ( ( X2 @ X3 )
!= $true ) )
& ! [X4: a] :
( ( ( X0 @ X4 )
= $true )
| ( ( X2 @ X4 )
!= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X5: a] :
( ( ( X1 @ X5 )
!= $true )
& ( ( X0 @ X5 )
!= $true )
& ( ( X2 @ X5 )
= $true ) )
& ! [X3: a] :
( ( ( X1 @ X3 )
= $true )
| ( ( X2 @ X3 )
!= $true ) )
& ! [X4: a] :
( ( ( X0 @ X4 )
= $true )
| ( ( X2 @ X4 )
!= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X3: a] :
( ( ( X1 @ X3 )
!= $true )
& ( ( X0 @ X3 )
!= $true )
& ( ( X2 @ X3 )
= $true ) )
& ! [X4: a] :
( ( $true
= ( X1 @ X4 ) )
| ( ( X2 @ X4 )
!= $true ) )
& ! [X5: a] :
( ( ( X0 @ X5 )
= $true )
| ( ( X2 @ X5 )
!= $true ) ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
( ( $true
!= ( sK1 @ sK3 ) )
& ( $true
!= ( sK0 @ sK3 ) )
& ( $true
= ( sK2 @ sK3 ) )
& ! [X4: a] :
( ( $true
= ( sK1 @ X4 ) )
| ( $true
!= ( sK2 @ X4 ) ) )
& ! [X5: a] :
( ( $true
= ( sK0 @ X5 ) )
| ( $true
!= ( sK2 @ X5 ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f7]) ).
thf(f9,plain,
! [X5: a] :
( ( $true
!= ( sK2 @ X5 ) )
| ( $true
= ( sK0 @ X5 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f11,plain,
( $true
= ( sK2 @ sK3 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f12,plain,
( $true
!= ( sK0 @ sK3 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f16,plain,
( ( $true != $true )
| ( $true
= ( sK0 @ sK3 ) ) ),
inference(constrained_superposition,[],[f9,f11]) ).
thf(f17,plain,
( $true
= ( sK0 @ sK3 ) ),
inference(trivial_inequality_removal,[],[f16]) ).
thf(f18,plain,
$false,
inference(forward_subsumption_resolution,[],[f17,f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET199^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.25 % Computer : n019.cluster.edu
% 0.11/0.25 % Model : x86_64 x86_64
% 0.11/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.25 % Memory : 8046.5625MB
% 0.11/0.25 % OS : Linux 6.8.0-71-generic
% 0.11/0.25 % CPULimit : 300
% 0.11/0.25 % WCLimit : 300
% 0.11/0.25 % DateTime : Tue Sep 29 13:37:48 UTC 2026
% 0.11/0.25 % CPUTime :
% 0.11/0.26 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.26/0.29 Running first-order model finding
% 0.26/0.29 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.26/0.33 % (772286)Will run a generic schedule for satisfiability detection.
% 0.26/0.33 % (772298)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=590414340:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.26/0.33 % (772294)% WARNING: option uhcvi not known.
% 0.26/0.33 % (772298) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-772286-772298"...
% 0.26/0.33 % (772293)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2161256240_3000 on theBenchmark for (3000ds/0Mi)
% 0.26/0.33 % (772295)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=699353021:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.26/0.33 % Exception at run slice level
% 0.26/0.33 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.26/0.33 % (772296)dis+10_1_sil=32000:sp=arity:random_seed=1302374702:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.26/0.33 % (772298)...printing done.
% 0.26/0.33 % (772297)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2459166818:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.26/0.33 % (772298)Refutation found. Thanks to Tanya!
% 0.26/0.33 % SZS status Theorem for theBenchmark
% 0.26/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.33 % (772298)------------------------------
% 0.26/0.33 % (772298)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.33 % (772298)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.33 % (772298)CaDiCaL version: 2.1.3
% 0.26/0.33 % (772298)Termination reason: Refutation
% 0.26/0.33 % (772298)Time elapsed: 0.002 s
% 0.26/0.33 % (772298)Peak memory usage: 12 MB
% 0.26/0.33 % (772298)Instructions burned: 1 (million)
% 0.26/0.33 % (772286)Success in time 0.027 s
% 0.26/0.33 % Vampire exiting
%------------------------------------------------------------------------------