%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM799^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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:33 AM UTC 2026
% Result : Theorem 0.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 23 ( 22 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 144 ( 6 ~; 0 |; 0 &; 138 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 93 ( 93 >; 0 *; 0 +; 0 <<)
% Number of symbols : 24 ( 22 usr; 1 con; 0-4 aty)
% Number of variables : 71 ( 64 ^; 5 !; 2 ?; 71 :)
% 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(func_def_21,type,
sK1: ( ( $i > $i ) > $i > $i ) > $i > $i ).
thf(f5,axiom,
( four
= ( ^ [X0: $i > $i,X1: $i] : ( X0 @ ( X0 @ ( X0 @ ( X0 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax',four_ax) ).
thf(f6,axiom,
( five
= ( ^ [X0: $i > $i,X1: $i] : ( X0 @ ( X0 @ ( X0 @ ( X0 @ ( X0 @ X1 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax',five_ax) ).
thf(f8,axiom,
( seven
= ( ^ [X0: $i > $i,X1: $i] : ( X0 @ ( X0 @ ( X0 @ ( X0 @ ( X0 @ ( X0 @ ( X0 @ X1 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax',seven_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/sandbox2/benchmark/Axioms/NUM006^0.ax',plus_ax) ).
thf(f14,axiom,
( mult
= ( ^ [X0: ( $i > $i ) > $i > $i,X1: ( $i > $i ) > $i > $i,X2: $i > $i,X3: $i] : ( X0 @ ( X1 @ X2 ) @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax',mult_ax) ).
thf(f15,conjecture,
? [X0: ( $i > $i ) > $i > $i] :
( ( mult @ X0 @ four )
= ( plus @ five @ seven ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(f16,negated_conjecture,
~ ? [X0: ( $i > $i ) > $i > $i] :
( ( mult @ X0 @ four )
= ( plus @ five @ seven ) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
thf(f21,plain,
( four
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f22,plain,
( five
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f24,plain,
( seven
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ) ) ),
inference(fool_elimination,[],[f8]) ).
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(f30,plain,
( mult
= ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ ( Y1 @ Y2 ) @ Y3 ) ) ),
inference(fool_elimination,[],[f14]) ).
thf(f31,plain,
! [X0: ( $i > $i ) > $i > $i] :
( ( mult @ X0 @ four )
!= ( plus @ five @ seven ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f36,plain,
( four
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f37,plain,
( five
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f22]) ).
thf(f39,plain,
( seven
= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ) ) ),
inference(cnf_transformation,[],[f24]) ).
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(f45,plain,
( mult
= ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ ( Y1 @ Y2 ) @ Y3 ) ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f46,plain,
! [X0: ( $i > $i ) > $i > $i] :
( ( mult @ X0 @ four )
!= ( plus @ five @ seven ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f47,plain,
! [X0: ( $i > $i ) > $i > $i] :
( ( ^ [Y0: ( $i > $i ) > $i > $i,Y1: ( $i > $i ) > $i > $i,Y2: $i > $i,Y3: $i] : ( Y0 @ ( Y1 @ Y2 ) @ Y3 )
@ X0
@ ^ [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 ) )
@ ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) )
@ ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ) ) ),
inference(definition_unfolding,[],[f46,f45,f36,f44,f37,f39]) ).
thf(f48,plain,
! [X0: ( $i > $i ) > $i > $i] :
( ( ^ [Y0: $i > $i] :
( X0
@ ^ [Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) )
!= ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(beta-eta_normalization,[],[f47]) ).
thf(f50,plain,
! [X0: ( $i > $i ) > $i > $i] :
( ( ^ [Y0: $i > $i,Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) )
!= ( ^ [Y0: $i > $i] :
( X0
@ ^ [Y1: $i] : ( Y0 @ ( Y0 @ ( Y0 @ ( Y0 @ Y1 ) ) ) ) ) ) ),
inference(equality_resolution,[],[f48]) ).
thf(f53,plain,
$false,
inference(equality_resolution,[],[f50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM799^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n001.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 13:06:21 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.22 Running first-order model finding
% 0.09/0.22 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.19/0.27 % (1202025)Will run a generic schedule for satisfiability detection.
% 0.19/0.27 % (1202034)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3516760405:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.27 % (1202034)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.27 % (1202034) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1202025-1202034"...
% 0.19/0.27 % (1202034)...printing done.
% 0.19/0.27 % (1202034)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27 % (1202034)------------------------------
% 0.19/0.27 % (1202034)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (1202034)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (1202034)CaDiCaL version: 2.1.3
% 0.19/0.27 % (1202034)Termination reason: Refutation
% 0.19/0.27 % (1202034)Time elapsed: 0.002 s
% 0.19/0.27 % (1202034)Peak memory usage: 12 MB
% 0.19/0.27 % (1202034)Instructions burned: 5 (million)
% 0.19/0.27 % (1202025)Success in time 0.036 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------