%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM669^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:18:29 AM UTC 2026
% Result : Theorem 0.29s 0.39s
% Output : Refutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 33 ( 11 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 56 ( 6 ~; 0 |; 0 &; 50 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 ^; 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
x: nat ).
thf(func_def_1,type,
more: nat > nat > $o ).
thf(func_def_2,type,
suc: nat > nat ).
thf(func_def_3,type,
pl: nat > nat > nat ).
thf(func_def_4,type,
n_1: nat ).
thf(f1,axiom,
! [X1: nat,X0: nat] : ( more @ ( pl @ X0 @ X1 ) @ X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz18) ).
thf(f2,axiom,
! [X0: nat] :
( ( pl @ X0 @ n_1 )
= ( suc @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz4a) ).
thf(f3,conjecture,
more @ ( suc @ x ) @ x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz18b) ).
thf(f4,negated_conjecture,
~ ( more @ ( suc @ x ) @ x ),
inference(negated_conjecture,[status(cth)],[f3]) ).
thf(f5,plain,
! [X0: nat,X1: nat] : ( more @ ( pl @ X1 @ X0 ) @ X1 ),
inference(rectify,[],[f1]) ).
thf(f6,plain,
! [X1: nat,X0: nat] :
( $true
= ( more @ ( pl @ X1 @ X0 ) @ X1 ) ),
inference(fool_elimination,[],[f5]) ).
thf(f7,plain,
~ ( more @ ( suc @ x ) @ x ),
inference(rectify,[],[f4]) ).
thf(f8,plain,
( ( more @ ( suc @ x ) @ x )
!= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f9,plain,
! [X0: nat] :
( ( pl @ X0 @ n_1 )
= ( suc @ X0 ) ),
inference(fool_elimination,[],[f2]) ).
thf(f10,plain,
( ( more @ ( suc @ x ) @ x )
!= $true ),
inference(flattening,[],[f8]) ).
thf(f11,plain,
! [X0: nat,X1: nat] :
( ( more @ ( pl @ X0 @ X1 ) @ X0 )
= $true ),
inference(rectify,[],[f6]) ).
thf(f12,plain,
! [X0: nat,X1: nat] :
( ( more @ ( pl @ X0 @ X1 ) @ X0 )
= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f13,plain,
! [X0: nat] :
( ( pl @ X0 @ n_1 )
= ( suc @ X0 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f14,plain,
( ( more @ ( suc @ x ) @ x )
!= $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f17,plain,
! [X0: nat] :
( $true
= ( more @ ( suc @ X0 ) @ X0 ) ),
inference(constrained_superposition,[],[f12,f13]) ).
thf(f18,plain,
$true != $true,
inference(constrained_superposition,[],[f14,f17]) ).
thf(f19,plain,
$false,
inference(trivial_inequality_removal,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM669^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.26 % Computer : n010.cluster.edu
% 0.10/0.26 % Model : x86_64 x86_64
% 0.10/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.26 % Memory : 8046.5625MB
% 0.10/0.26 % OS : Linux 6.8.0-71-generic
% 0.10/0.26 % CPULimit : 300
% 0.10/0.26 % WCLimit : 300
% 0.10/0.26 % DateTime : Tue Sep 29 12:34:48 UTC 2026
% 0.10/0.27 % CPUTime :
% 0.10/0.27 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.32 Running higher-order theorem proving
% 0.25/0.34 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.29/0.39 % (2788525)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.29/0.39 % (2788532)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1733815925:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.29/0.39 % (2788532) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2788525-2788532"...
% 0.29/0.39 % (2788532)...printing done.
% 0.29/0.39 % (2788532)Refutation found. Thanks to Tanya!
% 0.29/0.39 % SZS status Theorem for theBenchmark
% 0.29/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.29/0.39 % (2788532)------------------------------
% 0.29/0.39 % (2788532)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.29/0.39 % (2788532)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.29/0.39 % (2788532)CaDiCaL version: 2.1.3
% 0.29/0.39 % (2788532)Termination reason: Refutation
% 0.29/0.39 % (2788532)Time elapsed: 0.002 s
% 0.29/0.39 % (2788532)Peak memory usage: 12 MB
% 0.29/0.39 % (2788532)Instructions burned: 1 (million)
% 0.29/0.39 % (2788525)Success in time 0.036 s
% 0.29/0.39 % Vampire exiting
%------------------------------------------------------------------------------