%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM419^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:19:09 AM UTC 2026
% Result : Theorem 0.26s 0.31s
% Output : Refutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 16 ( 15 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 68 ( 5 ~; 0 |; 0 &; 63 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 56 ( 56 >; 0 *; 0 +; 0 <<)
% Number of symbols : 23 ( 21 usr; 1 con; 0-4 aty)
% Number of variables : 42 ( 36 ^; 4 !; 2 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
zero: ( $i > $i ) > $i > $i ).
thf(func_def_1,type,
one: ( $i > $i ) > $i > $i ).
thf(func_def_2,type,
two: ( $i > $i ) > $i > $i ).
thf(func_def_3,type,
three: ( $i > $i ) > $i > $i ).
thf(func_def_4,type,
four: ( $i > $i ) > $i > $i ).
thf(func_def_5,type,
five: ( $i > $i ) > $i > $i ).
thf(func_def_6,type,
six: ( $i > $i ) > $i > $i ).
thf(func_def_7,type,
seven: ( $i > $i ) > $i > $i ).
thf(func_def_8,type,
eight: ( $i > $i ) > $i > $i ).
thf(func_def_9,type,
nine: ( $i > $i ) > $i > $i ).
thf(func_def_10,type,
ten: ( $i > $i ) > $i > $i ).
thf(func_def_11,type,
succ: ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).
thf(func_def_12,type,
plus: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).
thf(func_def_13,type,
mult: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).
thf(func_def_15,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_17,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_18,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_19,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_20,type,
sK0: ( ( $i > $i ) > $i > $i ) > $i > $i ).
thf(f4,axiom,
( three
= ( ^ [X0: $i > $i,X1: $i] : ( X0 @ ( X0 @ ( X0 @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM006^0.ax',three_ax) ).
thf(f5,axiom,
( four
= ( ^ [X0: $i > $i,X1: $i] : ( X0 @ ( X0 @ ( X0 @ ( X0 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM006^0.ax',four_ax) ).
thf(f13,axiom,
( plus
= ( ^ [X0: ( $i > $i ) > $i > $i,X1: ( $i > $i ) > $i > $i,X2: $i > $i,X3: $i] : ( X0 @ X2 @ ( X1 @ X2 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM006^0.ax',plus_ax) ).
thf(f15,conjecture,
? [X0: ( $i > $i ) > $i > $i] :
( ( plus @ X0 @ three )
= four ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(f16,negated_conjecture,
~ ? [X0: ( $i > $i ) > $i > $i] :
( ( plus @ X0 @ three )
= four ),
inference(negated_conjecture,[status(cth)],[f15]) ).
thf(f20,plain,
( three
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f21,plain,
( four
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f29,plain,
( plus
= ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ Y2 @ ( Y1 @ Y2 @ Y3 ) ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f31,plain,
! [X0: ( $i > $i ) > $i > $i] :
( four
!= ( plus @ X0 @ three ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f35,plain,
( three
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f36,plain,
( four
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f44,plain,
( plus
= ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ Y2 @ ( Y1 @ Y2 @ Y3 ) ) ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f46,plain,
! [X0: ( $i > $i ) > $i > $i] :
( four
!= ( plus @ X0 @ three ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f47,plain,
! [X0: ( $i > $i ) > $i > $i] :
( ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) )
!= ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ Y2 @ ( Y1 @ Y2 @ Y3 ) )
@ X0
@ ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ),
inference(definition_unfolding,[],[f46,f36,f44,f35]) ).
thf(f48,plain,
! [X0: ( $i > $i ) > $i > $i] :
( ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) )
!= ( ^ [Y0: $i > $i,Y1: $i] : ( X0 @ Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f47]) ).
thf(f51,plain,
$false,
inference(equality_resolution,[],[f48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM419^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.22 % Computer : n019.cluster.edu
% 0.11/0.22 % Model : x86_64 x86_64
% 0.11/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.22 % Memory : 8046.5625MB
% 0.11/0.22 % OS : Linux 6.8.0-71-generic
% 0.11/0.22 % CPULimit : 300
% 0.11/0.22 % WCLimit : 300
% 0.11/0.22 % DateTime : Tue Sep 29 12:02:18 UTC 2026
% 0.11/0.22 % CPUTime :
% 0.11/0.22 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.28 Running first-order model finding
% 0.26/0.28 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.26/0.31 % (667184)Will run a generic schedule for satisfiability detection.
% 0.26/0.31 % (667195)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=341666562:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.26/0.31 % (667192)dis+10_1_sil=32000:sp=arity:random_seed=3179566694:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.26/0.31 % (667195) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-667184-667195"...
% 0.26/0.31 % (667195)...printing done.
% 0.26/0.31 % (667192) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-667184-667192"...
% 0.26/0.31 % (667195)Refutation found. Thanks to Tanya!
% 0.26/0.31 % SZS status Theorem for theBenchmark
% 0.26/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.31 % (667195)------------------------------
% 0.26/0.31 % (667195)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.31 % (667195)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.31 % (667195)CaDiCaL version: 2.1.3
% 0.26/0.31 % (667195)Termination reason: Refutation
% 0.26/0.31 % (667195)Time elapsed: 0.003 s
% 0.26/0.31 % (667195)Peak memory usage: 12 MB
% 0.26/0.31 % (667195)Instructions burned: 3 (million)
% 0.26/0.31 % (667184)Success in time 0.026 s
% 0.26/0.31 % Vampire exiting
%------------------------------------------------------------------------------