%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEU883^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 : n004.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:34:20 AM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 37 ( 18 equ; 0 cnn)
% Maximal formula atoms : 1 ( 5 avg)
% Number of connectives : 59 ( 5 ~; 0 |; 12 &; 36 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 2 con; 0-4 aty)
% ( 0 !!; 6 ??; 0 @@+; 0 @@-)
% Number of variables : 24 ( 18 ^; 0 !; 6 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(type_def_7,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
f: b > a ).
thf(func_def_1,type,
g: b > $o ).
thf(func_def_3,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_4,type,
vAND: $o > $o > $o ).
thf(func_def_5,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_6,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_7,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_8,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(f1,conjecture,
( ( ^ [X0: a] :
? [X1: b] :
( ( X0
= ( f @ X1 ) )
& ( g @ X1 ) ) )
= ( ^ [X0: a] :
? [X2: b] :
( ( X0
= ( f @ X2 ) )
& ( g @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5212_pme) ).
thf(f2,negated_conjecture,
( ( ^ [X0: a] :
? [X1: b] :
( ( X0
= ( f @ X1 ) )
& ( g @ X1 ) ) )
!= ( ^ [X0: a] :
? [X2: b] :
( ( X0
= ( f @ X2 ) )
& ( g @ X2 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
( ( ^ [X0: a] :
? [X1: b] :
( ( X0
= ( f @ X1 ) )
& ( g @ X1 ) ) )
!= ( ^ [X2: a] :
? [X3: b] :
( ( ( f @ X3 )
= X2 )
& ( g @ X3 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( g @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( g @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( g @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( g @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) ) ),
inference(flattening,[],[f4]) ).
thf(f6,plain,
( ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( g @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) )
!= ( ^ [Y0: a] :
( ?? @ b
@ ^ [Y1: b] :
( ( g @ Y1 )
& ( ( f @ Y1 )
= Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f9,plain,
$false,
inference(trivial_inequality_removal,[],[f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU883^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n004.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 14:43:52 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 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.09/0.26 % (1383141)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (1383148)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4078886399:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.26 % (1383148) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1383141-1383148"...
% 0.09/0.26 % (1383148)...printing done.
% 0.09/0.26 % (1383148)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26 % (1383148)------------------------------
% 0.09/0.26 % (1383148)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (1383148)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (1383148)CaDiCaL version: 2.1.3
% 0.09/0.26 % (1383148)Termination reason: Refutation
% 0.09/0.26 % (1383148)Time elapsed: 0.001 s
% 0.09/0.26 % (1383148)Peak memory usage: 11 MB
% 0.09/0.26 % (1383148)Instructions burned: 1 (million)
% 0.09/0.26 % (1383141)Success in time 0.023 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------