%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM677^1 : 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 : 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:17 AM UTC 2026
% Result : Theorem 0.21s 0.27s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM677^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n011.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 12:35:46 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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.21/0.27 % (29384)Will run a generic schedule for satisfiability detection.
% 0.21/0.27 % (29390)% WARNING: option uhcvi not known.
% 0.21/0.27 % (29392)dis+10_1_sil=32000:sp=arity:random_seed=1430674471:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.27 % (29389)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=525435661_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.27 % (29391)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2204403860:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.27 % (29390)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1256522397:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.27 % (29393)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1443815340:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.27 % (29394)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1056281647:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.27 % (29390)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.27 % Exception at run slice level
% 0.21/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.27 % (29393)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.21/0.27 % (29390)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.21/0.27 % (29393) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-29384-29393"...
% 0.21/0.27 % (29392) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-29384-29392"...
% 0.21/0.27 % (29394) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-29384-29394"...
% 0.21/0.27 % (29390) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-29384-29390"...
% 0.21/0.27 % (29391) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-29384-29391"...
% 0.21/0.27 % (29393)...printing done.
% 0.21/0.27 % (29392)...printing done.
% 0.21/0.27 % (29394)...printing done.
% 0.21/0.27 % (29390)...printing done.
% 0.21/0.27 % (29393)Refutation found. Thanks to Tanya!
% 0.21/0.27 % SZS status Theorem for theBenchmark
% 0.21/0.27 % SZS output start Proof for theBenchmark
% 0.21/0.27 thf(type_def_5, type, nat: $tType).
% 0.21/0.27 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.21/0.27 thf(func_def_0, type, x: nat).
% 0.21/0.27 thf(func_def_1, type, y: nat).
% 0.21/0.27 thf(func_def_2, type, z: nat).
% 0.21/0.27 thf(func_def_3, type, u: nat).
% 0.21/0.27 thf(func_def_4, type, more: (nat > nat > $o)).
% 0.21/0.27 thf(func_def_6, type, pl: (nat > nat > nat)).
% 0.21/0.27 thf(func_def_9, type, vNOT: ($o > $o)).
% 0.21/0.27 thf(f1,axiom,(
% 0.21/0.27 (x = y)),
% 0.21/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',i)).
% 0.21/0.27 thf(f2,axiom,(
% 0.21/0.27 (more @ z @ u)),
% 0.21/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m)).
% 0.21/0.27 thf(f3,axiom,(
% 0.21/0.27 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : ((X0 = X1) => ((more @ X2 @ X3) => (more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))))),
% 0.21/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19g)).
% 0.21/0.27 thf(f4,axiom,(
% 0.21/0.27 ! [X0 : nat,X1 : nat] : (((pl @ X0 @ X1)) = ((pl @ X1 @ X0)))),
% 0.21/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz6)).
% 0.21/0.27 thf(f5,conjecture,(
% 0.21/0.27 (more @ (pl @ z @ x) @ (pl @ u @ y))),
% 0.21/0.27 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19h)).
% 0.21/0.27 thf(f6,negated_conjecture,(
% 0.21/0.27 ~(more @ (pl @ z @ x) @ (pl @ u @ y))),
% 0.21/0.27 inference(negated_conjecture,[status(cth)],[f5])).
% 0.21/0.27 thf(f7,plain,(
% 0.21/0.27 (more @ z @ u)),
% 0.21/0.27 inference(rectify,[],[f2])).
% 0.21/0.27 thf(f8,plain,(
% 0.21/0.27 (((more @ z @ u)) = $true)),
% 0.21/0.27 inference(fool_elimination,[],[f7])).
% 0.21/0.27 thf(f9,plain,(
% 0.21/0.27 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : ((X0 = X1) => ((more @ X2 @ X3) => (more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))))),
% 0.21/0.27 inference(rectify,[],[f3])).
% 0.21/0.27 thf(f10,plain,(
% 0.21/0.27 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : ((X0 = X1) => ((((more @ X2 @ X3)) = $true) => (((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true)))),
% 0.21/0.27 inference(fool_elimination,[],[f9])).
% 0.21/0.27 thf(f11,plain,(
% 0.21/0.27 ~(more @ (pl @ z @ x) @ (pl @ u @ y))),
% 0.21/0.27 inference(rectify,[],[f6])).
% 0.21/0.27 thf(f12,plain,(
% 0.21/0.27 ~ (((more @ (pl @ z @ x) @ (pl @ u @ y))) = $true)),
% 0.21/0.27 inference(fool_elimination,[],[f11])).
% 0.21/0.27 thf(f13,plain,(
% 0.21/0.27 (((more @ (pl @ z @ x) @ (pl @ u @ y))) != $true)),
% 0.21/0.27 inference(flattening,[],[f12])).
% 0.21/0.27 thf(f14,plain,(
% 0.21/0.27 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : (((((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true) | (((more @ X2 @ X3)) != $true)) | (X0 != X1))),
% 0.21/0.27 inference(ennf_transformation,[],[f10])).
% 0.21/0.27 thf(f15,plain,(
% 0.21/0.27 ! [X0 : nat,X1 : nat,X2 : nat,X3 : nat] : ((((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true) | (((more @ X2 @ X3)) != $true) | (X0 != X1))),
% 0.21/0.27 inference(flattening,[],[f14])).
% 0.21/0.27 thf(f16,plain,(
% 0.21/0.27 (x = y)),
% 0.21/0.27 inference(cnf_transformation,[],[f1])).
% 0.21/0.27 thf(f17,plain,(
% 0.21/0.27 (((more @ z @ u)) = $true)),
% 0.21/0.27 inference(cnf_transformation,[],[f8])).
% 0.21/0.27 thf(f18,plain,(
% 0.21/0.27 ( ! [X2 : nat,X3 : nat,X0 : nat,X1 : nat] : ((((more @ (pl @ X0 @ X2) @ (pl @ X1 @ X3))) = $true) | (((more @ X2 @ X3)) != $true) | (X0 != X1)) )),
% 0.21/0.27 inference(cnf_transformation,[],[f15])).
% 0.21/0.27 thf(f19,plain,(
% 0.21/0.27 ( ! [X0 : nat,X1 : nat] : ((((pl @ X0 @ X1)) = ((pl @ X1 @ X0)))) )),
% 0.21/0.27 inference(cnf_transformation,[],[f4])).
% 0.21/0.27 thf(f20,plain,(
% 0.21/0.27 (((more @ (pl @ z @ x) @ (pl @ u @ y))) != $true)),
% 0.21/0.27 inference(cnf_transformation,[],[f13])).
% 0.21/0.27 thf(f22,definition,(
% 0.21/0.27 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.21/0.27 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.21/0.27 thf(f23,plain,(
% 0.21/0.27 ($true != ((more @ (pl @ z @ y) @ (pl @ u @ y))))),
% 0.21/0.27 inference(definition_unfolding,[],[f20,f16])).
% 0.21/0.27 thf(f24,plain,(
% 0.21/0.27 ( ! [X2 : nat,X3 : nat,X1 : nat] : (($true = ((more @ (pl @ X1 @ X2) @ (pl @ X1 @ X3)))) | (((more @ X2 @ X3)) != $true)) )),
% 0.21/0.27 inference(equality_resolution,[],[f18])).
% 0.21/0.27 thf(f27,plain,(
% 0.21/0.27 ($true != $true) | ($false = ((more @ (pl @ z @ y) @ (pl @ u @ y))))),
% 0.21/0.27 inference(constrained_superposition,[],[f23,f22])).
% 0.21/0.27 thf(f29,plain,(
% 0.21/0.27 ($false = ((more @ (pl @ z @ y) @ (pl @ u @ y))))),
% 0.21/0.27 inference(trivial_inequality_removal,[],[f27])).
% 0.21/0.27 thf(f34,plain,(
% 0.21/0.27 ($false = ((more @ (pl @ y @ z) @ (pl @ u @ y))))),
% 0.21/0.27 inference(forward_demodulation,[],[f29,f19])).
% 0.21/0.27 thf(f35,plain,(
% 0.21/0.27 ($false = ((more @ (pl @ y @ z) @ (pl @ y @ u))))),
% 0.21/0.27 inference(forward_demodulation,[],[f34,f19])).
% 0.21/0.27 thf(f55,plain,(
% 0.21/0.27 ($true = $false) | (((more @ z @ u)) != $true)),
% 0.21/0.27 inference(constrained_superposition,[],[f35,f24])).
% 0.21/0.27 thf(f56,plain,(
% 0.21/0.27 (((more @ z @ u)) != $true)),
% 0.21/0.27 inference(trivial_inequality_removal,[],[f55])).
% 0.21/0.27 thf(f58,plain,(
% 0.21/0.27 $false),
% 0.21/0.27 inference(forward_subsumption_resolution,[],[f56,f17])).
% 0.21/0.27 % SZS output end Proof for theBenchmark
% 0.21/0.27 % (29393)------------------------------
% 0.21/0.27 % (29393)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27 % (29393)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27 % (29393)CaDiCaL version: 2.1.3
% 0.21/0.27 % (29393)Termination reason: Refutation
% 0.21/0.27 % (29393)Time elapsed: 0.003 s
% 0.21/0.27 % (29393)Peak memory usage: 12 MB
% 0.21/0.27 % (29393)Instructions burned: 4 (million)
% 0.21/0.27 % (29384)Success in time 0.038 s
% 0.21/0.27 % Vampire exiting
%------------------------------------------------------------------------------