%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM676^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 : 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:19:17 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.03 % Problem : NUM676^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n010.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:36:18 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 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.07/0.25 % (2792226)Will run a generic schedule for satisfiability detection.
% 0.07/0.25 % (2792232)% WARNING: option uhcvi not known.
% 0.07/0.25 % (2792232)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=790122999:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.25 % (2792232)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.07/0.25 % (2792232)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.07/0.25 % (2792232) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2792226-2792232"...
% 0.07/0.25 % (2792232)...printing done.
% 0.07/0.25 % (2792232)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, nat: $tType).
% 0.07/0.25 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.07/0.25 thf(func_def_0, type, x: nat).
% 0.07/0.25 thf(func_def_1, type, y: nat).
% 0.07/0.25 thf(func_def_2, type, z: nat).
% 0.07/0.25 thf(func_def_3, type, u: nat).
% 0.07/0.25 thf(func_def_4, type, more: (nat > nat > $o)).
% 0.07/0.25 thf(func_def_6, type, pl: (nat > nat > nat)).
% 0.07/0.25 thf(func_def_9, type, vNOT: ($o > $o)).
% 0.07/0.25 thf(f1,axiom,(
% 0.07/0.25 (x = y)),
% 0.07/0.25 file('/export/starexec/sandbox/benchmark/theBenchmark.p',i)).
% 0.07/0.25 thf(f2,axiom,(
% 0.07/0.25 (more @ z @ u)),
% 0.07/0.25 file('/export/starexec/sandbox/benchmark/theBenchmark.p',m)).
% 0.07/0.25 thf(f3,axiom,(
% 0.07/0.25 ! [X0 : nat,X1 : nat,X2 : nat] : ((more @ X0 @ X1) => (more @ (pl @ X2 @ X0) @ (pl @ X2 @ X1)))),
% 0.07/0.25 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19d)).
% 0.07/0.25 thf(f4,conjecture,(
% 0.07/0.25 (more @ (pl @ x @ z) @ (pl @ y @ u))),
% 0.07/0.25 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz19g)).
% 0.07/0.25 thf(f5,negated_conjecture,(
% 0.07/0.25 ~(more @ (pl @ x @ z) @ (pl @ y @ u))),
% 0.07/0.25 inference(negated_conjecture,[status(cth)],[f4])).
% 0.07/0.25 thf(f6,plain,(
% 0.07/0.25 (more @ z @ u)),
% 0.07/0.25 inference(rectify,[],[f2])).
% 0.07/0.25 thf(f7,plain,(
% 0.07/0.25 (((more @ z @ u)) = $true)),
% 0.07/0.25 inference(fool_elimination,[],[f6])).
% 0.07/0.25 thf(f8,plain,(
% 0.07/0.25 ! [X0 : nat,X1 : nat,X2 : nat] : ((more @ X0 @ X1) => (more @ (pl @ X2 @ X0) @ (pl @ X2 @ X1)))),
% 0.07/0.25 inference(rectify,[],[f3])).
% 0.07/0.25 thf(f9,plain,(
% 0.07/0.25 ! [X0 : nat,X1 : nat,X2 : nat] : ((((more @ X0 @ X1)) = $true) => (((more @ (pl @ X2 @ X0) @ (pl @ X2 @ X1))) = $true))),
% 0.07/0.25 inference(fool_elimination,[],[f8])).
% 0.07/0.25 thf(f10,plain,(
% 0.07/0.25 ~(more @ (pl @ x @ z) @ (pl @ y @ u))),
% 0.07/0.25 inference(rectify,[],[f5])).
% 0.07/0.25 thf(f11,plain,(
% 0.07/0.25 ~ (((more @ (pl @ x @ z) @ (pl @ y @ u))) = $true)),
% 0.07/0.25 inference(fool_elimination,[],[f10])).
% 0.07/0.25 thf(f12,plain,(
% 0.07/0.25 (((more @ (pl @ x @ z) @ (pl @ y @ u))) != $true)),
% 0.07/0.25 inference(flattening,[],[f11])).
% 0.07/0.25 thf(f13,plain,(
% 0.07/0.25 ! [X0 : nat,X1 : nat,X2 : nat] : ((((more @ (pl @ X2 @ X0) @ (pl @ X2 @ X1))) = $true) | (((more @ X0 @ X1)) != $true))),
% 0.07/0.25 inference(ennf_transformation,[],[f9])).
% 0.07/0.25 thf(f14,plain,(
% 0.07/0.25 (x = y)),
% 0.07/0.25 inference(cnf_transformation,[],[f1])).
% 0.07/0.25 thf(f15,plain,(
% 0.07/0.25 (((more @ z @ u)) = $true)),
% 0.07/0.25 inference(cnf_transformation,[],[f7])).
% 0.07/0.25 thf(f16,plain,(
% 0.07/0.25 ( ! [X2 : nat,X0 : nat,X1 : nat] : ((((more @ X0 @ X1)) != $true) | (((more @ (pl @ X2 @ X0) @ (pl @ X2 @ X1))) = $true)) )),
% 0.07/0.25 inference(cnf_transformation,[],[f13])).
% 0.07/0.25 thf(f17,plain,(
% 0.07/0.25 (((more @ (pl @ x @ z) @ (pl @ y @ u))) != $true)),
% 0.07/0.25 inference(cnf_transformation,[],[f12])).
% 0.07/0.25 thf(f19,definition,(
% 0.07/0.25 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.07/0.25 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.07/0.25 thf(f20,plain,(
% 0.07/0.25 ($true != ((more @ (pl @ y @ z) @ (pl @ y @ u))))),
% 0.07/0.25 inference(definition_unfolding,[],[f17,f14])).
% 0.07/0.25 thf(f23,plain,(
% 0.07/0.25 ($true != $true) | ($false = ((more @ (pl @ y @ z) @ (pl @ y @ u))))),
% 0.07/0.25 inference(constrained_superposition,[],[f20,f19])).
% 0.07/0.25 thf(f25,plain,(
% 0.07/0.25 ($false = ((more @ (pl @ y @ z) @ (pl @ y @ u))))),
% 0.07/0.25 inference(trivial_inequality_removal,[],[f23])).
% 0.07/0.25 thf(f35,plain,(
% 0.07/0.25 ( ! [X0 : nat] : (($true != $true) | ($true = ((more @ (pl @ X0 @ z) @ (pl @ X0 @ u))))) )),
% 0.07/0.25 inference(constrained_superposition,[],[f16,f15])).
% 0.07/0.25 thf(f36,plain,(
% 0.07/0.25 ( ! [X0 : nat] : (($true = ((more @ (pl @ X0 @ z) @ (pl @ X0 @ u))))) )),
% 0.07/0.25 inference(trivial_inequality_removal,[],[f35])).
% 0.07/0.25 thf(f40,plain,(
% 0.07/0.25 ($true = $false)),
% 0.07/0.25 inference(constrained_superposition,[],[f25,f36])).
% 0.07/0.25 thf(f43,plain,(
% 0.07/0.25 $false),
% 0.07/0.25 inference(trivial_inequality_removal,[],[f40])).
% 0.07/0.25 % SZS output end Proof for theBenchmark
% 0.07/0.25 % (2792232)------------------------------
% 0.07/0.25 % (2792232)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.25 % (2792232)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.25 % (2792232)CaDiCaL version: 2.1.3
% 0.07/0.25 % (2792232)Termination reason: Refutation
% 0.07/0.25 % (2792232)Time elapsed: 0.002 s
% 0.07/0.25 % (2792232)Peak memory usage: 12 MB
% 0.07/0.25 % (2792232)Instructions burned: 3 (million)
% 0.07/0.25 % (2792226)Success in time 0.032 s
% 0.07/0.25 % Vampire exiting
%------------------------------------------------------------------------------