%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU608^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:30:18 AM UTC 2026
% Result : Theorem 0.08s 0.17s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 25 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 205 ( 58 equ; 0 cnn)
% Maximal formula atoms : 6 ( 8 avg)
% Number of connectives : 222 ( 35 ~; 16 |; 12 &; 142 @)
% ( 3 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 60 ( 0 ^; 48 !; 12 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
setminus: $i > $i > $i ).
thf(func_def_2,type,
setminusER: $o ).
thf(func_def_12,type,
vNOT: $o > $o ).
thf(f1,axiom,
! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( setminus @ X0 @ X1 ) )
=> ~ ( in @ X2 @ X1 ) )
= setminusER ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusER) ).
thf(f2,conjecture,
( setminusER
=> ! [X0: $i,X2: $i,X1: $i] :
( ( in @ X2 @ X1 )
=> ~ ( in @ X2 @ ( setminus @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusIRneg) ).
thf(f3,negated_conjecture,
~ ( setminusER
=> ! [X0: $i,X2: $i,X1: $i] :
( ( in @ X2 @ X1 )
=> ~ ( in @ X2 @ ( setminus @ X0 @ X1 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( setminus @ X0 @ X1 ) )
=> ~ ( in @ X2 @ X1 ) )
= setminusER ),
inference(rectify,[],[f1]) ).
thf(f5,plain,
( ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( setminus @ X0 @ X1 ) )
= $true )
=> ( ( in @ X2 @ X1 )
!= $true ) )
<=> ( setminusER = $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
~ ( setminusER
=> ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X1 @ X2 )
=> ~ ( in @ X1 @ ( setminus @ X0 @ X2 ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
~ ( ( setminusER = $true )
=> ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X1 @ X2 )
= $true )
=> ( ( in @ X1 @ ( setminus @ X0 @ X2 ) )
!= $true ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( ( setminusER = $true )
<=> ! [X0: $i,X2: $i,X1: $i] :
( ( ( in @ X2 @ ( setminus @ X0 @ X1 ) )
= $true )
=> ( ( in @ X2 @ X1 )
!= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f9,plain,
~ ( ( setminusER = $true )
=> ! [X0: $i,X2: $i,X1: $i] :
( ( ( in @ X1 @ X2 )
= $true )
=> ( ( in @ X1 @ ( setminus @ X0 @ X2 ) )
!= $true ) ) ),
inference(flattening,[],[f7]) ).
thf(f10,plain,
( ( setminusER = $true )
& ? [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X1 @ ( setminus @ X0 @ X2 ) )
= $true )
& ( ( in @ X1 @ X2 )
= $true ) ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f11,plain,
( ! [X1: $i,X0: $i,X2: $i] :
( ( ( in @ X2 @ ( setminus @ X0 @ X1 ) )
!= $true )
| ( ( in @ X2 @ X1 )
!= $true ) )
<=> ( setminusER = $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f12,plain,
( ( ! [X1: $i,X0: $i,X2: $i] :
( ( ( in @ X2 @ ( setminus @ X0 @ X1 ) )
!= $true )
| ( ( in @ X2 @ X1 )
!= $true ) )
| ( setminusER != $true ) )
& ( ( setminusER = $true )
| ? [X1: $i,X0: $i,X2: $i] :
( ( ( in @ X2 @ ( setminus @ X0 @ X1 ) )
= $true )
& ( ( in @ X2 @ X1 )
= $true ) ) ) ),
inference(nnf_transformation,[],[f11]) ).
thf(f13,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( setminus @ X1 @ X0 ) )
!= $true )
| ( ( in @ X2 @ X0 )
!= $true ) )
| ( setminusER != $true ) )
& ( ( setminusER = $true )
| ? [X3: $i,X4: $i,X5: $i] :
( ( ( in @ X5 @ ( setminus @ X4 @ X3 ) )
= $true )
& ( ( in @ X5 @ X3 )
= $true ) ) ) ),
inference(rectify,[],[f12]) ).
thf(f14,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( setminus @ X1 @ X0 ) )
!= $true )
| ( ( in @ X2 @ X0 )
!= $true ) )
| ( setminusER != $true ) )
& ( ( setminusER = $true )
| ( ( ( in @ sK2 @ ( setminus @ sK1 @ sK0 ) )
= $true )
& ( ( in @ sK2 @ sK0 )
= $true ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X3,sK0),skolemize(X4,sK1),skolemize(X5,sK2)],[f13]) ).
thf(f15,plain,
( ( setminusER = $true )
& ? [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X2 @ ( setminus @ X1 @ X0 ) )
= $true )
& ( ( in @ X2 @ X0 )
= $true ) ) ),
inference(rectify,[],[f10]) ).
thf(f16,plain,
( ( setminusER = $true )
& ( ( in @ sK5 @ ( setminus @ sK4 @ sK3 ) )
= $true )
& ( ( in @ sK5 @ sK3 )
= $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5)],[f15]) ).
thf(f19,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X2 @ ( setminus @ X1 @ X0 ) )
!= $true )
| ( ( in @ X2 @ X0 )
!= $true )
| ( setminusER != $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f20,plain,
( ( in @ sK5 @ sK3 )
= $true ),
inference(cnf_transformation,[],[f16]) ).
thf(f21,plain,
( ( in @ sK5 @ ( setminus @ sK4 @ sK3 ) )
= $true ),
inference(cnf_transformation,[],[f16]) ).
thf(f22,plain,
setminusER = $true,
inference(cnf_transformation,[],[f16]) ).
thf(f25,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X2 @ X0 )
!= $true )
| ( ( in @ X2 @ ( setminus @ X1 @ X0 ) )
!= $true )
| ( $true != $true ) ),
inference(definition_unfolding,[],[f19,f22]) ).
thf(f28,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X2 @ ( setminus @ X1 @ X0 ) )
!= $true )
| ( ( in @ X2 @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f25]) ).
thf(f29,plain,
( ( $true != $true )
| ( ( in @ sK5 @ sK3 )
!= $true ) ),
inference(constrained_superposition,[],[f28,f21]) ).
thf(f30,plain,
( ( in @ sK5 @ sK3 )
!= $true ),
inference(trivial_inequality_removal,[],[f29]) ).
thf(f31,plain,
$false,
inference(forward_subsumption_resolution,[],[f30,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU608^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Tue Sep 29 13:57:04 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.12 Running higher-order theorem proving
% 0.08/0.13 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.17 % (146568)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.08/0.17 % (146594)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.08/0.17 % (146594)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.08/0.17 % (146590)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1186732597:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.08/0.17 % (146588)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3892943109:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.08/0.17 % (146589)lrs+10_16_si=on:nwc=1.5:random_seed=474056319:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.08/0.17 % (146592)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3903126794:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.08/0.17 % (146594)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=2028935342:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.08/0.17 % (146591)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=4159383903:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.08/0.17 % (146593)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=1850819254:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.08/0.17 % (146590)Refutation not found, incomplete strategy
% 0.08/0.17 % (146590)------------------------------
% 0.08/0.17 % (146590)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.17 % (146590)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.17 % (146590)CaDiCaL version: 2.1.3
% 0.08/0.17 % (146590)Termination reason: Refutation not found, incomplete strategy
% 0.08/0.17 % (146590)Time elapsed: 0.001 s
% 0.08/0.17 % (146590)Peak memory usage: 12 MB
% 0.08/0.17 % (146590)Instructions burned: 1 (million)
% 0.08/0.17 % (146588) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-146568-146588"...
% 0.08/0.17 % (146592) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-146568-146592"...
% 0.08/0.17 % (146589) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-146568-146589"...
% 0.08/0.17 % (146593) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-146568-146593"...
% 0.08/0.17 % (146590)------------------------------
% 0.08/0.17 % (146590)------------------------------
% 0.08/0.17 % (146591) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-146568-146591"...
% 0.08/0.17 % (146588)...printing done.
% 0.08/0.17 % (146592)...printing done.
% 0.08/0.17 % (146589)...printing done.
% 0.08/0.17 % (146594) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-146568-146594"...
% 0.08/0.17 % (146593)...printing done.
% 0.08/0.17 % (146588)Refutation found. Thanks to Tanya!
% 0.08/0.17 % SZS status Theorem for theBenchmark
% 0.08/0.17 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.17 % (146588)------------------------------
% 0.08/0.17 % (146588)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.17 % (146588)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.17 % (146588)CaDiCaL version: 2.1.3
% 0.08/0.17 % (146588)Termination reason: Refutation
% 0.08/0.17 % (146588)Time elapsed: 0.001 s
% 0.08/0.17 % (146588)Peak memory usage: 12 MB
% 0.08/0.17 % (146588)Instructions burned: 2 (million)
% 0.08/0.17 % (146568)Success in time 0.031 s
% 0.08/0.17 % Vampire exiting
%------------------------------------------------------------------------------