%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PUZ082^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:21:00 AM UTC 2026
% Result : Theorem 0.23s 0.28s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ082^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 % Computer : n016.cluster.edu
% 0.08/0.21 % Model : x86_64 x86_64
% 0.08/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.21 % Memory : 8046.5625MB
% 0.08/0.21 % OS : Linux 6.8.0-71-generic
% 0.08/0.21 % CPULimit : 300
% 0.08/0.21 % WCLimit : 300
% 0.08/0.21 % DateTime : Tue Sep 29 13:26:34 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.24 Running first-order model finding
% 0.08/0.24 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.23/0.28 % (334481)Will run a generic schedule for satisfiability detection.
% 0.23/0.28 % (334487)% WARNING: option uhcvi not known.
% 0.23/0.28 % (334487)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3127086397:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.23/0.28 % (334487)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.23/0.28 % (334487)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.23/0.28 % (334487) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-334481-334487"...
% 0.23/0.28 % (334487)...printing done.
% 0.23/0.28 % (334487)Refutation found. Thanks to Tanya!
% 0.23/0.28 % SZS status Theorem for theBenchmark
% 0.23/0.28 % SZS output start Proof for theBenchmark
% 0.23/0.28 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.23/0.28 thf(func_def_1, type, says: ($i > $o > $o)).
% 0.23/0.28 thf(func_def_3, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.23/0.28 thf(func_def_4, type, vIMP: ($o > $o > $o)).
% 0.23/0.28 thf(func_def_5, type, db0: !>[X0: $tType]:(X0)).
% 0.23/0.28 thf(func_def_6, type, vNOT: ($o > $o)).
% 0.23/0.28 thf(func_def_7, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.23/0.28 thf(func_def_10, type, sK0: $o).
% 0.23/0.28 thf(f1,axiom,(
% 0.23/0.28 (says @ peter @ ! [X0 : $o] : ((says @ peter @ X0) => ~X0))),
% 0.23/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1)).
% 0.23/0.28 thf(f2,conjecture,(
% 0.23/0.28 ~ ! [X0 : $o] : ((says @ peter @ X0) => ~X0)),
% 0.23/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)).
% 0.23/0.28 thf(f3,negated_conjecture,(
% 0.23/0.28 ~ ~ ! [X0 : $o] : ((says @ peter @ X0) => ~X0)),
% 0.23/0.28 inference(negated_conjecture,[status(cth)],[f2])).
% 0.23/0.28 thf(f4,plain,(
% 0.23/0.28 (says @ peter @ ! [X0 : $o] : ((says @ peter @ X0) => ~X0))),
% 0.23/0.28 inference(rectify,[],[f1])).
% 0.23/0.28 thf(f5,plain,(
% 0.23/0.28 (((says @ peter @ (!! @ $o @ (^[Y0 : $o]: ((says @ peter @ Y0) => (~ Y0)))))) = $true)),
% 0.23/0.28 inference(fool_elimination,[],[f4])).
% 0.23/0.28 thf(f6,plain,(
% 0.23/0.28 ~ ~ ! [X0 : $o] : ((says @ peter @ X0) => ~X0)),
% 0.23/0.28 inference(rectify,[],[f3])).
% 0.23/0.28 thf(f7,plain,(
% 0.23/0.28 ~ ~ ! [X0 : $o] : ((((says @ peter @ X0)) = $true) => ~ ($true = X0))),
% 0.23/0.28 inference(fool_elimination,[],[f6])).
% 0.23/0.28 thf(f8,plain,(
% 0.23/0.28 ! [X0 : $o] : ((((says @ peter @ X0)) = $true) => ($true != X0))),
% 0.23/0.28 inference(flattening,[],[f7])).
% 0.23/0.28 thf(f9,plain,(
% 0.23/0.28 ! [X0 : $o] : (($true != X0) | (((says @ peter @ X0)) != $true))),
% 0.23/0.28 inference(ennf_transformation,[],[f8])).
% 0.23/0.28 thf(f10,plain,(
% 0.23/0.28 (((says @ peter @ (!! @ $o @ (^[Y0 : $o]: ((says @ peter @ Y0) => (~ Y0)))))) = $true)),
% 0.23/0.28 inference(cnf_transformation,[],[f5])).
% 0.23/0.28 thf(f11,plain,(
% 0.23/0.28 ( ! [X0 : $o] : (($true != X0) | (((says @ peter @ X0)) != $true)) )),
% 0.23/0.28 inference(cnf_transformation,[],[f9])).
% 0.23/0.28 thf(f13,definition,(
% 0.23/0.28 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.23/0.28 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.23/0.28 thf(f14,plain,(
% 0.23/0.28 ($true != ((says @ peter @ $true)))),
% 0.23/0.28 inference(equality_resolution,[],[f11])).
% 0.23/0.28 thf(f28,plain,(
% 0.23/0.28 ($true = ((says @ peter @ $true))) | (((!! @ $o @ (^[Y0 : $o]: ((says @ peter @ Y0) => (~ Y0))))) = $false)),
% 0.23/0.28 inference(constrained_superposition,[],[f10,f13])).
% 0.23/0.28 thf(f29,plain,(
% 0.23/0.28 ($true = ((says @ peter @ $true))) | ($false = (((^[Y0 : $o]: ((says @ peter @ Y0) => (~ Y0))) @ sK0)))),
% 0.23/0.28 inference(sigma_proxy_clausification,[],[f28])).
% 0.23/0.28 thf(f30,plain,(
% 0.23/0.28 ($true = ((says @ peter @ $true))) | ($false = (((says @ peter @ sK0) => (~ sK0))))),
% 0.23/0.28 inference(beta-eta_normalization,[],[f29])).
% 0.23/0.28 thf(f31,plain,(
% 0.23/0.28 ($true = ((says @ peter @ $true))) | ($false = ((~ sK0)))),
% 0.23/0.28 inference(imp_proxy_clausification,[],[f30])).
% 0.23/0.28 thf(f32,plain,(
% 0.23/0.28 ($true = ((says @ peter @ $true))) | ($true = ((says @ peter @ sK0)))),
% 0.23/0.28 inference(imp_proxy_clausification,[],[f30])).
% 0.23/0.28 thf(f33,plain,(
% 0.23/0.28 ($true = ((says @ peter @ $true))) | ($true = sK0)),
% 0.23/0.28 inference(not_proxy_clausification,[],[f31])).
% 0.23/0.28 thf(f34,plain,(
% 0.23/0.28 ($true = ((says @ peter @ sK0)))),
% 0.23/0.28 inference(forward_subsumption_resolution,[],[f32,f14])).
% 0.23/0.28 thf(f35,plain,(
% 0.23/0.28 ($true = sK0)),
% 0.23/0.28 inference(forward_subsumption_resolution,[],[f33,f14])).
% 0.23/0.28 thf(f40,plain,(
% 0.23/0.28 ($true = ((says @ peter @ $true)))),
% 0.23/0.28 inference(forward_demodulation,[],[f34,f35])).
% 0.23/0.28 thf(f41,plain,(
% 0.23/0.28 $false),
% 0.23/0.28 inference(forward_subsumption_resolution,[],[f40,f14])).
% 0.23/0.28 % SZS output end Proof for theBenchmark
% 0.23/0.28 % (334487)------------------------------
% 0.23/0.28 % (334487)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.28 % (334487)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.28 % (334487)CaDiCaL version: 2.1.3
% 0.23/0.28 % (334487)Termination reason: Refutation
% 0.23/0.28 % (334487)Time elapsed: 0.001 s
% 0.23/0.28 % (334487)Peak memory usage: 12 MB
% 0.23/0.28 % (334487)Instructions burned: 2 (million)
% 0.23/0.28 % (334481)Success in time 0.025 s
% 0.23/0.28 % Vampire exiting
%------------------------------------------------------------------------------