%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM637^2 : 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 : n013.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:10 AM UTC 2026
% Result : Theorem 0.07s 0.25s
% Output : Refutation 0.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM637^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n013.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 12:10:22 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 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.07/0.25 % (2017451)Will run a generic schedule for satisfiability detection.
% 0.07/0.25 % (2017457)% WARNING: option uhcvi not known.
% 0.07/0.25 % (2017457)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2688763851:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.25 % (2017457)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.07/0.25 % (2017457)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.07/0.25 % (2017457) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2017451-2017457"...
% 0.07/0.25 % (2017457)...printing done.
% 0.07/0.25 % (2017457)Refutation found. Thanks to Tanya!
% 0.07/0.25 % SZS status Theorem for theBenchmark
% 0.07/0.25 % SZS output start Proof for theBenchmark
% 0.07/0.25 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.07/0.25 thf(func_def_1, type, succ: ($i > $i)).
% 0.07/0.25 thf(func_def_5, type, sK0: (($i > $o) > $i)).
% 0.07/0.25 thf(func_def_7, type, vNOT: ($o > $o)).
% 0.07/0.25 thf(func_def_8, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.07/0.25 thf(func_def_9, type, db0: !>[X0: $tType]:(X0)).
% 0.07/0.25 thf(func_def_10, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.07/0.25 thf(f3,axiom,(
% 0.07/0.25 ! [X0 : ($i > $o)] : ((! [X1 : $i] : ((X0 @ X1) => (X0 @ (succ @ X1))) & (X0 @ one)) => ! [X2 : $i] : (X0 @ X2))),
% 0.07/0.25 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',induction)).
% 0.07/0.25 thf(f4,conjecture,(
% 0.07/0.25 ! [X0 : $i] : ((X0 != one) => ? [X1 : $i] : (X0 = ((succ @ X1))))),
% 0.07/0.25 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz3)).
% 0.07/0.25 thf(f5,negated_conjecture,(
% 0.07/0.25 ~ ! [X0 : $i] : ((X0 != one) => ? [X1 : $i] : (X0 = ((succ @ X1))))),
% 0.07/0.25 inference(negated_conjecture,[status(cth)],[f4])).
% 0.07/0.25 thf(f6,plain,(
% 0.07/0.25 ! [X0 : ($i > $o)] : ((! [X1 : $i] : ((X0 @ X1) => (X0 @ (succ @ X1))) & (X0 @ one)) => ! [X2 : $i] : (X0 @ X2))),
% 0.07/0.25 inference(rectify,[],[f3])).
% 0.07/0.25 thf(f7,plain,(
% 0.07/0.25 ! [X0 : ($i > $o)] : ((! [X1 : $i] : ((((X0 @ X1)) = $true) => (((X0 @ (succ @ X1))) = $true)) & (((X0 @ one)) = $true)) => ! [X2 : $i] : (((X0 @ X2)) = $true))),
% 0.07/0.25 inference(fool_elimination,[],[f6])).
% 0.07/0.25 thf(f9,plain,(
% 0.07/0.25 ! [X0 : ($i > $o)] : (! [X2 : $i] : (((X0 @ X2)) = $true) | (? [X1 : $i] : ((((X0 @ (succ @ X1))) != $true) & (((X0 @ X1)) = $true)) | (((X0 @ one)) != $true)))),
% 0.07/0.25 inference(ennf_transformation,[],[f7])).
% 0.07/0.25 thf(f10,plain,(
% 0.07/0.25 ! [X0 : ($i > $o)] : (! [X2 : $i] : (((X0 @ X2)) = $true) | ? [X1 : $i] : ((((X0 @ (succ @ X1))) != $true) & (((X0 @ X1)) = $true)) | (((X0 @ one)) != $true))),
% 0.07/0.25 inference(flattening,[],[f9])).
% 0.07/0.25 thf(f11,plain,(
% 0.07/0.25 ? [X0 : $i] : (! [X1 : $i] : (((succ @ X1)) != X0) & (X0 != one))),
% 0.07/0.25 inference(ennf_transformation,[],[f5])).
% 0.07/0.25 thf(f12,plain,(
% 0.07/0.25 ! [X0 : ($i > $o)] : (! [X1 : $i] : (((X0 @ X1)) = $true) | ? [X2 : $i] : (($true != ((X0 @ (succ @ X2)))) & (((X0 @ X2)) = $true)) | (((X0 @ one)) != $true))),
% 0.07/0.25 inference(rectify,[],[f10])).
% 0.07/0.25 thf(f13,plain,(
% 0.07/0.25 ! [X0 : ($i > $o)] : (! [X1 : $i] : (((X0 @ X1)) = $true) | (($true != ((X0 @ (succ @ (sK0 @ X0))))) & ($true = ((X0 @ (sK0 @ X0))))) | (((X0 @ one)) != $true))),
% 0.07/0.25 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X2,sK0 @ X0)],[f12])).
% 0.07/0.25 thf(f14,plain,(
% 0.07/0.25 ! [X1 : $i] : (((succ @ X1)) != sK1) & (one != sK1)),
% 0.07/0.25 inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f11])).
% 0.07/0.25 thf(f18,plain,(
% 0.07/0.25 ( ! [X0 : ($i > $o),X1 : $i] : (($true != ((X0 @ (succ @ (sK0 @ X0))))) | (((X0 @ X1)) = $true) | (((X0 @ one)) != $true)) )),
% 0.07/0.25 inference(cnf_transformation,[],[f13])).
% 0.07/0.25 thf(f19,plain,(
% 0.07/0.25 (one != sK1)),
% 0.07/0.25 inference(cnf_transformation,[],[f14])).
% 0.07/0.25 thf(f20,plain,(
% 0.07/0.25 ( ! [X1 : $i] : ((((succ @ X1)) != sK1)) )),
% 0.07/0.25 inference(cnf_transformation,[],[f14])).
% 0.07/0.25 thf(f60,plain,(
% 0.07/0.25 ( ! [X0 : $i] : ((((succ @ (sK0 @ (^[Y0 : $i]: (~ (Y0 = X0)))))) = X0) | ($true != (((^[Y0 : $i]: (~ (Y0 = X0))) @ one)))) )),
% 0.07/0.25 inference(leibniz_equality_elimination,[],[f18])).
% 0.07/0.25 thf(f78,plain,(
% 0.07/0.25 ( ! [X0 : $i] : ((((succ @ (sK0 @ (^[Y0 : $i]: (~ (Y0 = X0)))))) = X0) | ($true != ((~ (one = X0))))) )),
% 0.07/0.25 inference(beta-eta_normalization,[],[f60])).
% 0.07/0.25 thf(f79,plain,(
% 0.07/0.25 ( ! [X0 : $i] : ((((succ @ (sK0 @ (^[Y0 : $i]: (~ (Y0 = X0)))))) = X0) | ($true = ((one = X0)))) )),
% 0.07/0.25 inference(not_proxy_clausification,[],[f78])).
% 0.07/0.25 thf(f80,plain,(
% 0.07/0.25 ( ! [X0 : $i] : ((((succ @ (sK0 @ (^[Y0 : $i]: (~ (Y0 = X0)))))) = X0) | (one = X0)) )),
% 0.07/0.25 inference(equality_proxy_clausification,[],[f79])).
% 0.07/0.25 thf(f180,plain,(
% 0.07/0.25 ( ! [X0 : $i] : ((sK1 != X0) | (one = X0)) )),
% 0.07/0.25 inference(constrained_superposition,[],[f20,f80])).
% 0.07/0.25 thf(f326,plain,(
% 0.07/0.25 (one = sK1)),
% 0.07/0.25 inference(equality_resolution,[],[f180])).
% 0.07/0.25 thf(f327,plain,(
% 0.07/0.25 $false),
% 0.07/0.25 inference(forward_subsumption_resolution,[],[f326,f19])).
% 0.07/0.25 % SZS output end Proof for theBenchmark
% 0.07/0.25 % (2017457)------------------------------
% 0.07/0.25 % (2017457)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (2017457)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (2017457)CaDiCaL version: 2.1.3
% 0.07/0.25 % (2017457)Termination reason: Refutation
% 0.07/0.25 % (2017457)Time elapsed: 0.004 s
% 0.07/0.25 % (2017457)Peak memory usage: 12 MB
% 0.07/0.25 % (2017457)Instructions burned: 13 (million)
% 0.07/0.25 % (2017451)Success in time 0.032 s
% 0.07/0.25 % Vampire exiting
%------------------------------------------------------------------------------