%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SEV272^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:39:14 AM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 78 ( 21 equ; 0 cnn)
% Maximal formula atoms : 1 ( 4 avg)
% Number of connectives : 238 ( 18 ~; 0 |; 26 &; 142 @)
% ( 0 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 162 ( 162 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 13 usr; 3 con; 0-4 aty)
% ( 16 !!; 8 ??; 0 @@+; 0 @@-)
% Number of variables : 78 ( 62 ^; 12 !; 4 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
cSUCC: ( ( $i > $o ) > $o ) > ( $i > $o ) > $o ).
thf(func_def_1,type,
cZERO: ( $i > $o ) > $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,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_6,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_7,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_8,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_9,type,
vNOT: $o > $o ).
thf(func_def_10,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_11,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_12,type,
vIMP: $o > $o > $o ).
thf(f1,axiom,
( cSUCC
= ( ^ [X0: ( $i > $o ) > $o,X1: $i > $o] :
? [X2: $i] :
( ( X0
@ ^ [X3: $i] :
( ( X1 @ X3 )
& ( X3 != X2 ) ) )
& ( X1 @ X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cSUCC_def) ).
thf(f2,axiom,
( cZERO
= ( ^ [X0: $i > $o] :
~ ? [X1: $i] : ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cZERO_def) ).
thf(f3,conjecture,
( ( ^ [X0: ( $i > $o ) > $o] :
! [X1: ( ( $i > $o ) > $o ) > $o] :
( ( ! [X2: ( $i > $o ) > $o] :
( ( X1 @ X2 )
=> ( X1 @ ( cSUCC @ X2 ) ) )
& ( X1 @ cZERO ) )
=> ( X1 @ X0 ) ) )
= ( ^ [X3: ( $i > $o ) > $o] :
! [X4: ( ( $i > $o ) > $o ) > $o] :
( ( ! [X2: ( $i > $o ) > $o] :
( ( X4 @ X2 )
=> ( X4 @ ( cSUCC @ X2 ) ) )
& ( X4 @ cZERO ) )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX6007A_pme) ).
thf(f4,negated_conjecture,
( ( ^ [X0: ( $i > $o ) > $o] :
! [X1: ( ( $i > $o ) > $o ) > $o] :
( ( ! [X2: ( $i > $o ) > $o] :
( ( X1 @ X2 )
=> ( X1 @ ( cSUCC @ X2 ) ) )
& ( X1 @ cZERO ) )
=> ( X1 @ X0 ) ) )
!= ( ^ [X3: ( $i > $o ) > $o] :
! [X4: ( ( $i > $o ) > $o ) > $o] :
( ( ! [X2: ( $i > $o ) > $o] :
( ( X4 @ X2 )
=> ( X4 @ ( cSUCC @ X2 ) ) )
& ( X4 @ cZERO ) )
=> ( X4 @ X3 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
( cSUCC
= ( ^ [X0: ( $i > $o ) > $o,X1: $i > $o] :
? [X2: $i] :
( ( X0
@ ^ [X3: $i] :
( ( X1 @ X3 )
& ( X3 != X2 ) ) )
& ( X1 @ X2 ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
( cSUCC
= ( ^ [Y0: ( $i > $o ) > $o,Y1: $i > $o] :
( ?? @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0
@ ^ [Y3: $i] :
( ( Y2 != Y3 )
& ( Y1 @ Y3 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
( cZERO
= ( ^ [X0: $i > $o] :
~ ? [X1: $i] : ( X0 @ X1 ) ) ),
inference(rectify,[],[f2]) ).
thf(f8,plain,
( cZERO
= ( ^ [Y0: $i > $o] :
~ ( ?? @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
( ( ^ [X0: ( $i > $o ) > $o] :
! [X1: ( ( $i > $o ) > $o ) > $o] :
( ( ! [X2: ( $i > $o ) > $o] :
( ( X1 @ X2 )
=> ( X1 @ ( cSUCC @ X2 ) ) )
& ( X1 @ cZERO ) )
=> ( X1 @ X0 ) ) )
!= ( ^ [X3: ( $i > $o ) > $o] :
! [X4: ( ( $i > $o ) > $o ) > $o] :
( ( ! [X5: ( $i > $o ) > $o] :
( ( X4 @ X5 )
=> ( X4 @ ( cSUCC @ X5 ) ) )
& ( X4 @ cZERO ) )
=> ( X4 @ X3 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f10,plain,
( ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( Y1 @ cZERO )
& ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cSUCC @ Y2 ) ) ) ) )
=> ( Y1 @ Y0 ) ) ) )
!= ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( Y1 @ cZERO )
& ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cSUCC @ Y2 ) ) ) ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f11,plain,
( ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( Y1 @ cZERO )
& ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cSUCC @ Y2 ) ) ) ) )
=> ( Y1 @ Y0 ) ) ) )
!= ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( Y1 @ cZERO )
& ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cSUCC @ Y2 ) ) ) ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(flattening,[],[f10]) ).
thf(f12,plain,
( cSUCC
= ( ^ [Y0: ( $i > $o ) > $o,Y1: $i > $o] :
( ?? @ $i
@ ^ [Y2: $i] :
( ( Y1 @ Y2 )
& ( Y0
@ ^ [Y3: $i] :
( ( Y2 != Y3 )
& ( Y1 @ Y3 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f13,plain,
( cZERO
= ( ^ [Y0: $i > $o] :
~ ( ?? @ $i
@ ^ [Y1: $i] : ( Y0 @ Y1 ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f14,plain,
( ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( Y1 @ cZERO )
& ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cSUCC @ Y2 ) ) ) ) )
=> ( Y1 @ Y0 ) ) ) )
!= ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( Y1 @ cZERO )
& ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1 @ ( cSUCC @ Y2 ) ) ) ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f17,plain,
( ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( Y1
@ ^ [Y2: $i > $o] :
~ ( ?? @ $i
@ ^ [Y3: $i] : ( Y2 @ Y3 ) ) )
& ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1
@ ( ^ [Y3: ( $i > $o ) > $o,Y4: $i > $o] :
( ?? @ $i
@ ^ [Y5: $i] :
( ( Y4 @ Y5 )
& ( Y3
@ ^ [Y6: $i] :
( ( Y5 != Y6 )
& ( Y4 @ Y6 ) ) ) ) )
@ Y2 ) ) ) ) )
=> ( Y1 @ Y0 ) ) ) )
!= ( ^ [Y0: ( $i > $o ) > $o] :
( !! @ ( ( ( $i > $o ) > $o ) > $o )
@ ^ [Y1: ( ( $i > $o ) > $o ) > $o] :
( ( ( Y1
@ ^ [Y2: $i > $o] :
~ ( ?? @ $i
@ ^ [Y3: $i] : ( Y2 @ Y3 ) ) )
& ( !! @ ( ( $i > $o ) > $o )
@ ^ [Y2: ( $i > $o ) > $o] :
( ( Y1 @ Y2 )
=> ( Y1
@ ( ^ [Y3: ( $i > $o ) > $o,Y4: $i > $o] :
( ?? @ $i
@ ^ [Y5: $i] :
( ( Y4 @ Y5 )
& ( Y3
@ ^ [Y6: $i] :
( ( Y5 != Y6 )
& ( Y4 @ Y6 ) ) ) ) )
@ Y2 ) ) ) ) )
=> ( Y1 @ Y0 ) ) ) ) ),
inference(definition_unfolding,[],[f14,f13,f12,f13,f12]) ).
thf(f18,plain,
$false,
inference(trivial_inequality_removal,[],[f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV272^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 % Computer : n010.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Tue Sep 29 15:30:33 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/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.20/0.28 % (2996210)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (2996226)dis+10_1_sil=32000:sp=arity:random_seed=2693283296:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28 % (2996226) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2996210-2996226"...
% 0.20/0.28 % (2996226)...printing done.
% 0.20/0.28 % (2996226)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (2996226)------------------------------
% 0.20/0.28 % (2996226)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (2996226)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (2996226)CaDiCaL version: 2.1.3
% 0.20/0.28 % (2996226)Termination reason: Refutation
% 0.20/0.28 % (2996226)Time elapsed: 0.001 s
% 0.20/0.28 % (2996226)Peak memory usage: 11 MB
% 0.20/0.28 % (2996226)Instructions burned: 3 (million)
% 0.20/0.28 % (2996210)Success in time 0.032 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------