%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ANA107^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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 07:46:04 AM UTC 2026
% Result : Theorem 0.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA107^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.18 % Computer : n017.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 17:37:23 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22 Running first-order model finding
% 0.10/0.22 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.19/0.27 % (659114)Will run a generic schedule for satisfiability detection.
% 0.19/0.27 % (659120)% WARNING: option uhcvi not known.
% 0.19/0.27 % (659120)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3117852178:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27 % (659120)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.27 % (659120)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.27 % (659120) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-659114-659120"...
% 0.19/0.27 % (659120)...printing done.
% 0.19/0.27 % (659120)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% 0.19/0.27 thf(type_def_5, type, 'type/realax/real': $tType).
% 0.19/0.27 thf(type_def_6, type, 'type/nums/num': $tType).
% 0.19/0.27 thf(type_def_7, type, sTfun: ($tType * $tType) > $tType).
% 0.19/0.27 thf(func_def_0, type, 'const/sets/FINITE': !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.19/0.27 thf(func_def_1, type, 'const/realax/real_le': ('type/realax/real' > 'type/realax/real' > $o)).
% 0.19/0.27 thf(func_def_2, type, 'const/realax/real_abs': ('type/realax/real' > 'type/realax/real')).
% 0.19/0.27 thf(func_def_3, type, 'const/iterate/sum': !>[X0: $tType]:(((X0 > $o) > (X0 > 'type/realax/real') > 'type/realax/real'))).
% 0.19/0.27 thf(func_def_4, type, 'const/iterate/..': ('type/nums/num' > 'type/nums/num' > 'type/nums/num' > $o)).
% 0.19/0.27 thf(func_def_8, type, db0: !>[X0: $tType]:(X0)).
% 0.19/0.27 thf(func_def_9, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.19/0.27 thf(func_def_10, type, sK0: ('type/nums/num' > 'type/realax/real')).
% 0.19/0.27 thf(func_def_11, type, sK1: 'type/nums/num').
% 0.19/0.27 thf(func_def_12, type, sK2: 'type/nums/num').
% 0.19/0.27 thf(f1,axiom,(
% 0.19/0.27 ! [X0 : $tType,X1 : (X0 > 'type/realax/real'),X2 : (X0 > $o)] : (('const/sets/FINITE' @ X0 @ X2) => ('const/realax/real_le' @ ('const/realax/real_abs' @ ('const/iterate/sum' @ X0 @ X2 @ X1)) @ ('const/iterate/sum' @ X0 @ X2 @ (^[X3 : X0] : (('const/realax/real_abs' @ (X1 @ X3)))))))),
% 0.19/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/SUM_ABS_')).
% 0.19/0.27 thf(f2,axiom,(
% 0.19/0.27 ! [X0 : 'type/nums/num',X1 : 'type/nums/num'] : ('const/sets/FINITE' @ 'type/nums/num' @ ('const/iterate/..' @ X0 @ X1))),
% 0.19/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/FINITE_NUMSEG_')).
% 0.19/0.27 thf(f3,conjecture,(
% 0.19/0.27 ! [X0 : ('type/nums/num' > 'type/realax/real'),X1 : 'type/nums/num',X2 : 'type/nums/num'] : ('const/realax/real_le' @ ('const/realax/real_abs' @ ('const/iterate/sum' @ 'type/nums/num' @ ('const/iterate/..' @ X1 @ X2) @ X0)) @ ('const/iterate/sum' @ 'type/nums/num' @ ('const/iterate/..' @ X1 @ X2) @ (^[X3 : 'type/nums/num'] : (('const/realax/real_abs' @ (X0 @ X3))))))),
% 0.19/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/SUM_ABS_NUMSEG_')).
% 0.19/0.27 thf(f4,negated_conjecture,(
% 0.19/0.27 ~ ! [X0 : ('type/nums/num' > 'type/realax/real'),X1 : 'type/nums/num',X2 : 'type/nums/num'] : ('const/realax/real_le' @ ('const/realax/real_abs' @ ('const/iterate/sum' @ 'type/nums/num' @ ('const/iterate/..' @ X1 @ X2) @ X0)) @ ('const/iterate/sum' @ 'type/nums/num' @ ('const/iterate/..' @ X1 @ X2) @ (^[X3 : 'type/nums/num'] : (('const/realax/real_abs' @ (X0 @ X3))))))),
% 0.19/0.27 inference(negated_conjecture,[status(cth)],[f3])).
% 0.19/0.27 thf(f5,plain,(
% 0.19/0.27 ! [X0 : $tType,X1 : (X0 > 'type/realax/real'),X2 : (X0 > $o)] : (('const/sets/FINITE' @ X0 @ X2) => ('const/realax/real_le' @ ('const/realax/real_abs' @ ('const/iterate/sum' @ X0 @ X2 @ X1)) @ ('const/iterate/sum' @ X0 @ X2 @ (^[X3 : X0] : (('const/realax/real_abs' @ (X1 @ X3)))))))),
% 0.19/0.27 inference(rectify,[],[f1])).
% 0.19/0.27 thf(f6,plain,(
% 0.19/0.27 ! [X0 : $tType,X1 : (X0 > 'type/realax/real'),X2 : (X0 > $o)] : (((('const/sets/FINITE' @ X0 @ X2)) = $true) => ($true = (('const/realax/real_le' @ ('const/realax/real_abs' @ ('const/iterate/sum' @ X0 @ X2 @ X1)) @ ('const/iterate/sum' @ X0 @ X2 @ (^[Y0 : X0]: ('const/realax/real_abs' @ (X1 @ Y0))))))))),
% 0.19/0.27 inference(fool_elimination,[],[f5])).
% 0.19/0.27 thf(f7,plain,(
% 0.19/0.27 ! [X0 : 'type/nums/num',X1 : 'type/nums/num'] : ('const/sets/FINITE' @ 'type/nums/num' @ ('const/iterate/..' @ X0 @ X1))),
% 0.19/0.27 inference(rectify,[],[f2])).
% 0.19/0.27 thf(f8,plain,(
% 0.19/0.27 ! [X0 : 'type/nums/num',X1 : 'type/nums/num'] : ((('const/sets/FINITE' @ 'type/nums/num' @ ('const/iterate/..' @ X0 @ X1))) = $true)),
% 0.19/0.27 inference(fool_elimination,[],[f7])).
% 0.19/0.27 thf(f9,plain,(
% 0.19/0.27 ~ ! [X0 : ('type/nums/num' > 'type/realax/real'),X1 : 'type/nums/num',X2 : 'type/nums/num'] : ('const/realax/real_le' @ ('const/realax/real_abs' @ ('const/iterate/sum' @ 'type/nums/num' @ ('const/iterate/..' @ X1 @ X2) @ X0)) @ ('const/iterate/sum' @ 'type/nums/num' @ ('const/iterate/..' @ X1 @ X2) @ (^[X3 : 'type/nums/num'] : (('const/realax/real_abs' @ (X0 @ X3))))))),
% 0.19/0.27 inference(rectify,[],[f4])).
% 0.19/0.27 thf(f10,plain,(
% 0.19/0.27 ~ ! [X0 : ('type/nums/num' > 'type/realax/real'),X1 : 'type/nums/num',X2 : 'type/nums/num'] : ($true = (('const/realax/real_le' @ ('const/realax/real_abs' @ ('const/iterate/sum' @ 'type/nums/num' @ ('const/iterate/..' @ X1 @ X2) @ X0)) @ ('const/iterate/sum' @ 'type/nums/num' @ ('const/iterate/..' @ X1 @ X2) @ (^[Y0 : 'type/nums/num']: ('const/realax/real_abs' @ (X0 @ Y0)))))))),
% 0.19/0.27 inference(fool_elimination,[],[f9])).
% 0.19/0.27 thf(f11,plain,(
% 0.19/0.27 ! [X0 : $tType,X1 : (X0 > 'type/realax/real'),X2 : (X0 > $o)] : (($true = (('const/realax/real_le' @ ('const/realax/real_abs' @ ('const/iterate/sum' @ X0 @ X2 @ X1)) @ ('const/iterate/sum' @ X0 @ X2 @ (^[Y0 : X0]: ('const/realax/real_abs' @ (X1 @ Y0))))))) | ((('const/sets/FINITE' @ X0 @ X2)) != $true))),
% 0.19/0.27 inference(ennf_transformation,[],[f6])).
% 0.19/0.27 thf(f12,plain,(
% 0.19/0.27 ? [X0 : ('type/nums/num' > 'type/realax/real'),X1 : 'type/nums/num',X2 : 'type/nums/num'] : ($true != (('const/realax/real_le' @ ('const/realax/real_abs' @ ('const/iterate/sum' @ 'type/nums/num' @ ('const/iterate/..' @ X1 @ X2) @ X0)) @ ('const/iterate/sum' @ 'type/nums/num' @ ('const/iterate/..' @ X1 @ X2) @ (^[Y0 : 'type/nums/num']: ('const/realax/real_abs' @ (X0 @ Y0)))))))),
% 0.19/0.27 inference(ennf_transformation,[],[f10])).
% 0.19/0.27 thf(f13,plain,(
% 0.19/0.27 ($true != (('const/realax/real_le' @ ('const/realax/real_abs' @ ('const/iterate/sum' @ 'type/nums/num' @ ('const/iterate/..' @ sK1 @ sK2) @ sK0)) @ ('const/iterate/sum' @ 'type/nums/num' @ ('const/iterate/..' @ sK1 @ sK2) @ (^[Y0 : 'type/nums/num']: ('const/realax/real_abs' @ (sK0 @ Y0)))))))),
% 0.19/0.27 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f12])).
% 0.19/0.27 thf(f14,plain,(
% 0.19/0.27 ( ! [X0 : $tType,X2 : (X0 > $o),X1 : (X0 > 'type/realax/real')] : (((('const/sets/FINITE' @ X0 @ X2)) != $true) | ($true = (('const/realax/real_le' @ ('const/realax/real_abs' @ ('const/iterate/sum' @ X0 @ X2 @ X1)) @ ('const/iterate/sum' @ X0 @ X2 @ (^[Y0 : X0]: ('const/realax/real_abs' @ (X1 @ Y0)))))))) )),
% 0.19/0.27 inference(cnf_transformation,[],[f11])).
% 0.19/0.27 thf(f15,plain,(
% 0.19/0.27 ( ! [X0 : 'type/nums/num',X1 : 'type/nums/num'] : (((('const/sets/FINITE' @ 'type/nums/num' @ ('const/iterate/..' @ X0 @ X1))) = $true)) )),
% 0.19/0.27 inference(cnf_transformation,[],[f8])).
% 0.19/0.27 thf(f16,plain,(
% 0.19/0.27 ($true != (('const/realax/real_le' @ ('const/realax/real_abs' @ ('const/iterate/sum' @ 'type/nums/num' @ ('const/iterate/..' @ sK1 @ sK2) @ sK0)) @ ('const/iterate/sum' @ 'type/nums/num' @ ('const/iterate/..' @ sK1 @ sK2) @ (^[Y0 : 'type/nums/num']: ('const/realax/real_abs' @ (sK0 @ Y0)))))))),
% 0.19/0.27 inference(cnf_transformation,[],[f13])).
% 0.19/0.27 thf(f18,definition,(
% 0.19/0.27 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.19/0.27 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.19/0.27 thf(f31,plain,(
% 0.19/0.27 ( ! [X0 : $tType,X2 : (X0 > 'type/realax/real'),X1 : (X0 > $o)] : (($true != $true) | ($true = (('const/realax/real_le' @ ('const/realax/real_abs' @ ('const/iterate/sum' @ X0 @ X1 @ X2)) @ ('const/iterate/sum' @ X0 @ X1 @ (^[Y0 : X0]: ('const/realax/real_abs' @ (X2 @ Y0))))))) | ($false = (('const/sets/FINITE' @ X0 @ X1)))) )),
% 0.19/0.27 inference(constrained_superposition,[],[f14,f18])).
% 0.19/0.27 thf(f34,plain,(
% 0.19/0.27 ( ! [X0 : $tType,X2 : (X0 > 'type/realax/real'),X1 : (X0 > $o)] : (($true = (('const/realax/real_le' @ ('const/realax/real_abs' @ ('const/iterate/sum' @ X0 @ X1 @ X2)) @ ('const/iterate/sum' @ X0 @ X1 @ (^[Y0 : X0]: ('const/realax/real_abs' @ (X2 @ Y0))))))) | ($false = (('const/sets/FINITE' @ X0 @ X1)))) )),
% 0.19/0.27 inference(trivial_inequality_removal,[],[f31])).
% 0.19/0.27 thf(f37,plain,(
% 0.19/0.27 ($true != $true) | ($false = (('const/sets/FINITE' @ 'type/nums/num' @ ('const/iterate/..' @ sK1 @ sK2))))),
% 0.19/0.27 inference(constrained_superposition,[],[f16,f34])).
% 0.19/0.27 thf(f38,plain,(
% 0.19/0.27 ($false = (('const/sets/FINITE' @ 'type/nums/num' @ ('const/iterate/..' @ sK1 @ sK2))))),
% 0.19/0.27 inference(trivial_inequality_removal,[],[f37])).
% 0.19/0.27 thf(f43,plain,(
% 0.19/0.27 ($true = $false)),
% 0.19/0.27 inference(constrained_superposition,[],[f15,f38])).
% 0.19/0.27 thf(f45,plain,(
% 0.19/0.27 $false),
% 0.19/0.27 inference(trivial_inequality_removal,[],[f43])).
% 0.19/0.27 % SZS output end Proof for theBenchmark
% 0.19/0.27 % (659120)------------------------------
% 0.19/0.27 % (659120)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (659120)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (659120)CaDiCaL version: 2.1.3
% 0.19/0.27 % (659120)Termination reason: Refutation
% 0.19/0.27 % (659120)Time elapsed: 0.002 s
% 0.19/0.27 % (659120)Peak memory usage: 12 MB
% 0.19/0.27 % (659120)Instructions burned: 5 (million)
% 0.19/0.27 % (659114)Success in time 0.046 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------