%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEU783^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 : n013.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:31:21 AM UTC 2026
% Result : Theorem 0.22s 0.27s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 264 ( 69 equ; 0 cnn)
% Maximal formula atoms : 7 ( 11 avg)
% Number of connectives : 319 ( 24 ~; 16 |; 24 &; 226 @)
% ( 2 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 11 con; 0-2 aty)
% Number of variables : 68 ( 0 ^; 52 !; 16 ?; 68 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
in: $i > $i > $o ).
thf(func_def_1,type,
binunion: $i > $i > $i ).
thf(func_def_2,type,
binunionIL: $o ).
thf(func_def_4,type,
kpair: $i > $i > $i ).
thf(func_def_5,type,
breln1: $i > $i > $o ).
thf(func_def_16,type,
vNOT: $o > $o ).
thf(f1,axiom,
( binunionIL
= ( ! [X0: $i,X2: $i,X1: $i] :
( ( in @ X2 @ X0 )
=> ( in @ X2 @ ( binunion @ X0 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIL) ).
thf(f2,conjecture,
( binunionIL
=> ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ! [X4: $i] :
( ( in @ X4 @ X0 )
=> ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
=> ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X1 @ X2 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1unionIL) ).
thf(f3,negated_conjecture,
~ ( binunionIL
=> ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ! [X4: $i] :
( ( in @ X4 @ X0 )
=> ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
=> ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X1 @ X2 ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f2]) ).
thf(f4,plain,
( binunionIL
= ( ! [X0: $i,X1: $i,X2: $i] :
( ( in @ X1 @ X0 )
=> ( in @ X1 @ ( binunion @ X0 @ X2 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f5,plain,
( ! [X2: $i,X1: $i,X0: $i] :
( ( ( in @ X1 @ X0 )
= $true )
=> ( ( in @ X1 @ ( binunion @ X0 @ X2 ) )
= $true ) )
<=> ( binunionIL = $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f6,plain,
~ ( binunionIL
=> ! [X0: $i,X1: $i] :
( ( breln1 @ X0 @ X1 )
=> ! [X2: $i] :
( ( breln1 @ X0 @ X2 )
=> ! [X3: $i] :
( ( in @ X3 @ X0 )
=> ! [X4: $i] :
( ( in @ X4 @ X0 )
=> ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
=> ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X1 @ X2 ) ) ) ) ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f7,plain,
~ ( ( binunionIL = $true )
=> ! [X0: $i,X1: $i] :
( ( ( breln1 @ X0 @ X1 )
= $true )
=> ! [X2: $i] :
( ( ( breln1 @ X0 @ X2 )
= $true )
=> ! [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
=> ! [X4: $i] :
( ( ( in @ X4 @ X0 )
= $true )
=> ( ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
= $true )
=> ( ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X1 @ X2 ) )
= $true ) ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
( ! [X1: $i,X2: $i,X0: $i] :
( ( ( in @ X1 @ X0 )
!= $true )
| ( ( in @ X1 @ ( binunion @ X0 @ X2 ) )
= $true ) )
<=> ( binunionIL = $true ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f9,plain,
( ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ? [X3: $i] :
( ? [X4: $i] :
( ( ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X1 @ X2 ) )
!= $true )
& ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
= $true )
& ( ( in @ X4 @ X0 )
= $true ) )
& ( ( in @ X3 @ X0 )
= $true ) )
& ( ( breln1 @ X0 @ X2 )
= $true ) )
& ( ( breln1 @ X0 @ X1 )
= $true ) )
& ( binunionIL = $true ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f10,plain,
( ? [X0: $i,X1: $i] :
( ? [X2: $i] :
( ( ( breln1 @ X0 @ X2 )
= $true )
& ? [X3: $i] :
( ( ( in @ X3 @ X0 )
= $true )
& ? [X4: $i] :
( ( ( in @ ( kpair @ X3 @ X4 ) @ ( binunion @ X1 @ X2 ) )
!= $true )
& ( ( in @ ( kpair @ X3 @ X4 ) @ X1 )
= $true )
& ( ( in @ X4 @ X0 )
= $true ) ) ) )
& ( ( breln1 @ X0 @ X1 )
= $true ) )
& ( binunionIL = $true ) ),
inference(flattening,[],[f9]) ).
thf(f11,plain,
( ( ! [X1: $i,X2: $i,X0: $i] :
( ( ( in @ X1 @ X0 )
!= $true )
| ( ( in @ X1 @ ( binunion @ X0 @ X2 ) )
= $true ) )
| ( binunionIL != $true ) )
& ( ( binunionIL = $true )
| ? [X1: $i,X2: $i,X0: $i] :
( ( ( in @ X1 @ X0 )
= $true )
& ( ( in @ X1 @ ( binunion @ X0 @ X2 ) )
!= $true ) ) ) ),
inference(nnf_transformation,[],[f8]) ).
thf(f12,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ X2 )
!= $true )
| ( ( in @ X0 @ ( binunion @ X2 @ X1 ) )
= $true ) )
| ( binunionIL != $true ) )
& ( ( binunionIL = $true )
| ? [X3: $i,X4: $i,X5: $i] :
( ( ( in @ X3 @ X5 )
= $true )
& ( ( in @ X3 @ ( binunion @ X5 @ X4 ) )
!= $true ) ) ) ),
inference(rectify,[],[f11]) ).
thf(f13,plain,
( ( ! [X0: $i,X1: $i,X2: $i] :
( ( ( in @ X0 @ X2 )
!= $true )
| ( ( in @ X0 @ ( binunion @ X2 @ X1 ) )
= $true ) )
| ( binunionIL != $true ) )
& ( ( binunionIL = $true )
| ( ( $true
= ( in @ sK0 @ sK2 ) )
& ( ( in @ sK0 @ ( binunion @ sK2 @ sK1 ) )
!= $true ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X3,sK0),skolemize(X4,sK1),skolemize(X5,sK2)],[f12]) ).
thf(f14,plain,
( ( ( breln1 @ sK3 @ sK5 )
= $true )
& ( ( in @ sK6 @ sK3 )
= $true )
& ( ( in @ ( kpair @ sK6 @ sK7 ) @ ( binunion @ sK4 @ sK5 ) )
!= $true )
& ( $true
= ( in @ ( kpair @ sK6 @ sK7 ) @ sK4 ) )
& ( ( in @ sK7 @ sK3 )
= $true )
& ( ( breln1 @ sK3 @ sK4 )
= $true )
& ( binunionIL = $true ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6),skolemize(X4,sK7)],[f10]) ).
thf(f17,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X0 @ X2 )
!= $true )
| ( ( in @ X0 @ ( binunion @ X2 @ X1 ) )
= $true )
| ( binunionIL != $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f18,plain,
binunionIL = $true,
inference(cnf_transformation,[],[f14]) ).
thf(f21,plain,
( $true
= ( in @ ( kpair @ sK6 @ sK7 ) @ sK4 ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f22,plain,
( ( in @ ( kpair @ sK6 @ sK7 ) @ ( binunion @ sK4 @ sK5 ) )
!= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f27,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X0 @ X2 )
!= $true )
| ( $true != $true )
| ( ( in @ X0 @ ( binunion @ X2 @ X1 ) )
= $true ) ),
inference(definition_unfolding,[],[f17,f18]) ).
thf(f30,plain,
! [X2: $i,X0: $i,X1: $i] :
( ( ( in @ X0 @ X2 )
!= $true )
| ( ( in @ X0 @ ( binunion @ X2 @ X1 ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f27]) ).
thf(f33,plain,
! [X0: $i] :
( ( ( in @ ( kpair @ sK6 @ sK7 ) @ ( binunion @ sK4 @ X0 ) )
= $true )
| ( $true != $true ) ),
inference(constrained_superposition,[],[f30,f21]) ).
thf(f36,plain,
! [X0: $i] :
( ( in @ ( kpair @ sK6 @ sK7 ) @ ( binunion @ sK4 @ X0 ) )
= $true ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f37,plain,
$true != $true,
inference(backward_demodulation,[],[f22,f36]) ).
thf(f38,plain,
$false,
inference(trivial_inequality_removal,[],[f37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU783^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 % Computer : n013.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 14:27:51 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running higher-order theorem proving
% 0.10/0.24 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.22/0.27 % (2195738)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.27 % (2195748)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2885418015:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.27 % (2195748) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2195738-2195748"...
% 0.22/0.27 % (2195748)...printing done.
% 0.22/0.27 % (2195748)Refutation found. Thanks to Tanya!
% 0.22/0.27 % SZS status Theorem for theBenchmark
% 0.22/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.27 % (2195748)------------------------------
% 0.22/0.27 % (2195748)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.27 % (2195748)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.27 % (2195748)CaDiCaL version: 2.1.3
% 0.22/0.27 % (2195748)Termination reason: Refutation
% 0.22/0.27 % (2195748)Time elapsed: 0.002 s
% 0.22/0.27 % (2195748)Peak memory usage: 13 MB
% 0.22/0.27 % (2195748)Instructions burned: 4 (million)
% 0.22/0.27 % (2195738)Success in time 0.026 s
% 0.22/0.27 % Vampire exiting
%------------------------------------------------------------------------------