%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM693^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:20 AM UTC 2026
% Result : Theorem 0.24s 0.33s
% Output : Refutation 0.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM693^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.24 % Computer : n011.cluster.edu
% 0.10/0.24 % Model : x86_64 x86_64
% 0.10/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.24 % Memory : 8046.5625MB
% 0.10/0.24 % OS : Linux 6.8.0-71-generic
% 0.10/0.24 % CPULimit : 300
% 0.10/0.24 % WCLimit : 300
% 0.10/0.24 % DateTime : Tue Sep 29 12:39:46 UTC 2026
% 0.10/0.25 % CPUTime :
% 0.10/0.25 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.24/0.30 Running first-order model finding
% 0.24/0.30 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.24/0.33 % (32070)Will run a generic schedule for satisfiability detection.
% 0.24/0.33 % (32076)% WARNING: option uhcvi not known.
% 0.24/0.33 % (32076)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=643003276:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.24/0.33 % (32076)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.24/0.33 % (32076)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.24/0.33 % (32076) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-32070-32076"...
% 0.24/0.33 % (32076)...printing done.
% 0.24/0.33 % (32076)Refutation found. Thanks to Tanya!
% 0.24/0.33 % SZS status Theorem for theBenchmark
% 0.24/0.33 % SZS output start Proof for theBenchmark
% 0.24/0.33 thf(type_def_5, type, nat: $tType).
% 0.24/0.33 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.24/0.33 thf(func_def_0, type, x: nat).
% 0.24/0.33 thf(func_def_1, type, more: (nat > nat > $o)).
% 0.24/0.33 thf(func_def_2, type, n_1: nat).
% 0.24/0.33 thf(func_def_3, type, suc: (nat > nat)).
% 0.24/0.33 thf(func_def_5, type, pl: (nat > nat > nat)).
% 0.24/0.33 thf(func_def_8, type, sK0: (nat > nat)).
% 0.24/0.33 thf(func_def_9, type, vNOT: ($o > $o)).
% 0.24/0.33 thf(f2,axiom,(
% 0.24/0.33 ! [X0 : nat] : ((X0 != n_1) => ~ ! [X1 : nat] : (X0 != ((suc @ X1))))),
% 0.24/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz3)).
% 0.24/0.33 thf(f3,axiom,(
% 0.24/0.33 ! [X0 : nat,X1 : nat] : (more @ (pl @ X0 @ X1) @ X0)),
% 0.24/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz18)).
% 0.24/0.33 thf(f4,axiom,(
% 0.24/0.33 ! [X0 : nat] : (((suc @ X0)) = ((pl @ n_1 @ X0)))),
% 0.24/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz4g)).
% 0.24/0.33 thf(f5,conjecture,(
% 0.24/0.33 ~(more @ x @ n_1) => (x = n_1)),
% 0.24/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz24)).
% 0.24/0.33 thf(f6,negated_conjecture,(
% 0.24/0.33 ~(~(more @ x @ n_1) => (x = n_1))),
% 0.24/0.33 inference(negated_conjecture,[status(cth)],[f5])).
% 0.24/0.33 thf(f9,plain,(
% 0.24/0.33 ! [X0 : nat,X1 : nat] : (more @ (pl @ X0 @ X1) @ X0)),
% 0.24/0.33 inference(rectify,[],[f3])).
% 0.24/0.33 thf(f10,plain,(
% 0.24/0.33 ! [X0 : nat,X1 : nat] : (((more @ (pl @ X0 @ X1) @ X0)) = $true)),
% 0.24/0.33 inference(fool_elimination,[],[f9])).
% 0.24/0.33 thf(f11,plain,(
% 0.24/0.33 ~(~(more @ x @ n_1) => (x = n_1))),
% 0.24/0.33 inference(rectify,[],[f6])).
% 0.24/0.33 thf(f12,plain,(
% 0.24/0.33 ~(~ (((more @ x @ n_1)) = $true) => (n_1 = x))),
% 0.24/0.33 inference(fool_elimination,[],[f11])).
% 0.24/0.33 thf(f14,plain,(
% 0.24/0.33 ~((((more @ x @ n_1)) != $true) => (n_1 = x))),
% 0.24/0.33 inference(flattening,[],[f12])).
% 0.24/0.33 thf(f16,plain,(
% 0.24/0.33 ! [X0 : nat] : (? [X1 : nat] : (((suc @ X1)) = X0) | (n_1 = X0))),
% 0.24/0.33 inference(ennf_transformation,[],[f2])).
% 0.24/0.33 thf(f17,plain,(
% 0.24/0.33 (n_1 != x) & (((more @ x @ n_1)) != $true)),
% 0.24/0.33 inference(ennf_transformation,[],[f14])).
% 0.24/0.33 thf(f18,plain,(
% 0.24/0.33 ! [X0 : nat] : ((((suc @ (sK0 @ X0))) = X0) | (n_1 = X0))),
% 0.24/0.33 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X1,sK0 @ X0)],[f16])).
% 0.24/0.33 thf(f20,plain,(
% 0.24/0.33 ( ! [X0 : nat] : ((((suc @ (sK0 @ X0))) = X0) | (n_1 = X0)) )),
% 0.24/0.33 inference(cnf_transformation,[],[f18])).
% 0.24/0.33 thf(f21,plain,(
% 0.24/0.33 ( ! [X0 : nat,X1 : nat] : ((((more @ (pl @ X0 @ X1) @ X0)) = $true)) )),
% 0.24/0.33 inference(cnf_transformation,[],[f10])).
% 0.24/0.33 thf(f22,plain,(
% 0.24/0.33 ( ! [X0 : nat] : ((((suc @ X0)) = ((pl @ n_1 @ X0)))) )),
% 0.24/0.33 inference(cnf_transformation,[],[f4])).
% 0.24/0.33 thf(f23,plain,(
% 0.24/0.33 (((more @ x @ n_1)) != $true)),
% 0.24/0.33 inference(cnf_transformation,[],[f17])).
% 0.24/0.33 thf(f24,plain,(
% 0.24/0.33 (n_1 != x)),
% 0.24/0.33 inference(cnf_transformation,[],[f17])).
% 0.24/0.33 thf(f37,plain,(
% 0.24/0.33 ( ! [X0 : nat] : (($true = ((more @ (suc @ X0) @ n_1)))) )),
% 0.24/0.33 inference(constrained_superposition,[],[f21,f22])).
% 0.24/0.33 thf(f41,plain,(
% 0.24/0.33 ( ! [X0 : nat] : (($true = ((more @ X0 @ n_1))) | (n_1 = X0)) )),
% 0.24/0.33 inference(constrained_superposition,[],[f37,f20])).
% 0.24/0.33 thf(f44,plain,(
% 0.24/0.33 ($true != $true) | (n_1 = x)),
% 0.24/0.33 inference(constrained_superposition,[],[f23,f41])).
% 0.24/0.33 thf(f45,plain,(
% 0.24/0.33 (n_1 = x)),
% 0.24/0.33 inference(trivial_inequality_removal,[],[f44])).
% 0.24/0.33 thf(f48,plain,(
% 0.24/0.33 $false),
% 0.24/0.33 inference(forward_subsumption_resolution,[],[f45,f24])).
% 0.24/0.33 % SZS output end Proof for theBenchmark
% 0.24/0.33 % (32076)------------------------------
% 0.24/0.33 % (32076)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.33 % (32076)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.33 % (32076)CaDiCaL version: 2.1.3
% 0.24/0.33 % (32076)Termination reason: Refutation
% 0.24/0.33 % (32076)Time elapsed: 0.002 s
% 0.24/0.33 % (32076)Peak memory usage: 12 MB
% 0.24/0.33 % (32076)Instructions burned: 2 (million)
% 0.24/0.33 % (32070)Success in time 0.024 s
% 0.24/0.33 % Vampire exiting
%------------------------------------------------------------------------------