%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SET631^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 : n001.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:45 AM UTC 2026
% Result : Theorem 0.19s 0.28s
% Output : Refutation 0.19s
% 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 : 77 ( 32 equ; 0 cnn)
% Maximal formula atoms : 5 ( 5 avg)
% Number of connectives : 103 ( 23 ~; 5 |; 24 &; 46 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 37 ( 0 ^; 19 !; 18 ?; 37 :)
% 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 )
& ( X0 @ X3 ) )
=> ? [X3: a] :
( ( X1 @ X3 )
& ( X0 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_113_pme) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X3: a] :
( ~ ( X2 @ X3 )
& ( X1 @ X3 )
& ( X0 @ X3 ) )
=> ? [X3: a] :
( ( 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 )
& ( X0 @ X3 ) )
=> ? [X4: a] :
( ( X1 @ X4 )
& ( X0 @ X4 ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X3: a] :
( ( ( X2 @ X3 )
!= $true )
& ( ( X1 @ X3 )
= $true )
& ( ( X0 @ X3 )
= $true ) )
=> ? [X4: a] :
( ( ( X1 @ X4 )
= $true )
& ( ( X0 @ X4 )
= $true ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X3: a] :
( ( ( X2 @ X3 )
!= $true )
& ( ( X1 @ X3 )
= $true )
& ( ( X0 @ X3 )
= $true ) )
=> ? [X4: a] :
( ( ( X1 @ X4 )
= $true )
& ( ( X0 @ X4 )
= $true ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X4: a] :
( ( ( X1 @ X4 )
!= $true )
| ( ( X0 @ X4 )
!= $true ) )
& ? [X3: a] :
( ( ( X2 @ X3 )
!= $true )
& ( ( X1 @ X3 )
= $true )
& ( ( X0 @ X3 )
= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( ( X1 @ X3 )
!= $true )
| ( ( X0 @ X3 )
!= $true ) )
& ? [X4: a] :
( ( $true
!= ( X2 @ X4 ) )
& ( ( X1 @ X4 )
= $true )
& ( ( X0 @ X4 )
= $true ) ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
( ! [X3: a] :
( ( $true
!= ( sK1 @ X3 ) )
| ( $true
!= ( sK0 @ X3 ) ) )
& ( $true
!= ( sK2 @ sK3 ) )
& ( $true
= ( sK1 @ sK3 ) )
& ( $true
= ( sK0 @ sK3 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X4,sK3)],[f7]) ).
thf(f9,plain,
( $true
= ( sK0 @ sK3 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f10,plain,
( $true
= ( sK1 @ sK3 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f12,plain,
! [X3: a] :
( ( $true
!= ( sK1 @ X3 ) )
| ( $true
!= ( sK0 @ X3 ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f15,plain,
( ( $true != $true )
| ( $true
!= ( sK0 @ sK3 ) ) ),
inference(constrained_superposition,[],[f12,f10]) ).
thf(f16,plain,
( $true
!= ( sK0 @ sK3 ) ),
inference(trivial_inequality_removal,[],[f15]) ).
thf(f17,plain,
$false,
inference(forward_subsumption_resolution,[],[f16,f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET631^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n001.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 13:46:05 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.19/0.28 % (1259125)Will run a generic schedule for satisfiability detection.
% 0.19/0.28 % (1259130)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3349176096_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.28 % Exception at run slice level
% 0.19/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.28 % (1259131)% WARNING: option uhcvi not known.
% 0.19/0.28 % (1259131)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4211983308:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.28 % (1259132)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=810354914:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.28 % (1259133)dis+10_1_sil=32000:sp=arity:random_seed=3909733859:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.28 % (1259131)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.28 % (1259131)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.28 % (1259133) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1259125-1259133"...
% 0.19/0.28 % (1259131) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1259125-1259131"...
% 0.19/0.28 % (1259132) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1259125-1259132"...
% 0.19/0.28 % (1259133)...printing done.
% 0.19/0.28 % (1259131)...printing done.
% 0.19/0.28 % (1259132)...printing done.
% 0.19/0.28 % (1259138)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=286625998:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.19/0.28 % Exception at run slice level
% 0.19/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.28 % (1259131)Refutation found. Thanks to Tanya!
% 0.19/0.28 % SZS status Theorem for theBenchmark
% 0.19/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28 % (1259131)------------------------------
% 0.19/0.28 % (1259131)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (1259131)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (1259131)CaDiCaL version: 2.1.3
% 0.19/0.28 % (1259131)Termination reason: Refutation
% 0.19/0.28 % (1259131)Time elapsed: 0.002 s
% 0.19/0.28 % (1259131)Peak memory usage: 12 MB
% 0.19/0.28 % (1259131)Instructions burned: 1 (million)
% 0.19/0.28 % (1259125)Success in time 0.042 s
% 0.19/0.28 % Vampire exiting
%------------------------------------------------------------------------------