%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN983^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:42:04 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN983^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 % Computer : n002.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 16:22:22 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23 Running first-order model finding
% 0.10/0.23 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.20/0.27 % (1490439)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (1490445)% WARNING: option uhcvi not known.
% 0.20/0.27 % (1490445)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3312843508:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27 % (1490445)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.20/0.27 % (1490445)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.20/0.27 % (1490445) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1490439-1490445"...
% 0.20/0.27 % (1490445)...printing done.
% 0.20/0.27 % (1490445)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% 0.20/0.27 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.27 thf(func_def_0, type, a: $o).
% 0.20/0.27 thf(func_def_1, type, b: $o).
% 0.20/0.27 thf(func_def_2, type, p: ($o > $o)).
% 0.20/0.27 thf(func_def_6, type, vAND: ($o > $o > $o)).
% 0.20/0.27 thf(f1,conjecture,(
% 0.20/0.27 ((p @ b) & (p @ a)) => (p @ b & a)),
% 0.20/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm)).
% 0.20/0.27 thf(f2,negated_conjecture,(
% 0.20/0.27 ~(((p @ b) & (p @ a)) => (p @ b & a))),
% 0.20/0.27 inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.27 thf(f3,plain,(
% 0.20/0.27 ~(((p @ b) & (p @ a)) => (p @ b & a))),
% 0.20/0.27 inference(rectify,[],[f2])).
% 0.20/0.27 thf(f4,plain,(
% 0.20/0.27 ~(((((p @ b)) = $true) & (((p @ a)) = $true)) => ($true = ((p @ (a & b)))))),
% 0.20/0.27 inference(fool_elimination,[],[f3])).
% 0.20/0.27 thf(f5,plain,(
% 0.20/0.27 ($true != ((p @ (a & b)))) & ((((p @ b)) = $true) & (((p @ a)) = $true))),
% 0.20/0.27 inference(ennf_transformation,[],[f4])).
% 0.20/0.27 thf(f6,plain,(
% 0.20/0.27 ($true != ((p @ (a & b)))) & (((p @ b)) = $true) & (((p @ a)) = $true)),
% 0.20/0.27 inference(flattening,[],[f5])).
% 0.20/0.27 thf(f7,plain,(
% 0.20/0.27 (((p @ a)) = $true)),
% 0.20/0.27 inference(cnf_transformation,[],[f6])).
% 0.20/0.27 thf(f8,plain,(
% 0.20/0.27 (((p @ b)) = $true)),
% 0.20/0.27 inference(cnf_transformation,[],[f6])).
% 0.20/0.27 thf(f9,plain,(
% 0.20/0.27 ($true != ((p @ (a & b))))),
% 0.20/0.27 inference(cnf_transformation,[],[f6])).
% 0.20/0.27 thf(f11,definition,(
% 0.20/0.27 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.20/0.27 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.20/0.27 thf(f14,plain,(
% 0.20/0.27 ($true != ((p @ ($true & b)))) | (a = $false)),
% 0.20/0.27 inference(constrained_superposition,[],[f9,f11])).
% 0.20/0.27 thf(f24,plain,(
% 0.20/0.27 (((p @ b)) != $true) | (a = $false)),
% 0.20/0.27 inference(boolean_simplification,[],[f14])).
% 0.20/0.27 thf(f30,definition,(
% 0.20/0.27 spl0_1 <=> (a = $false)),
% 0.20/0.27 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.20/0.27 thf(f32,plain,(
% 0.20/0.27 (a = $false) | ~spl0_1),
% 0.20/0.27 inference(avatar_component_clause,[],[f30])).
% 0.20/0.27 thf(f45,plain,(
% 0.20/0.27 (a = $false)),
% 0.20/0.27 inference(forward_subsumption_resolution,[],[f24,f8])).
% 0.20/0.27 thf(f47,plain,(
% 0.20/0.27 spl0_1),
% 0.20/0.27 inference(avatar_split_clause,[],[f45,f30])).
% 0.20/0.27 thf(f49,plain,(
% 0.20/0.27 ($true != ((p @ ($false & b)))) | ~spl0_1),
% 0.20/0.27 inference(constrained_superposition,[],[f9,f32])).
% 0.20/0.27 thf(f50,plain,(
% 0.20/0.27 ($true = ((p @ $false))) | ~spl0_1),
% 0.20/0.27 inference(constrained_superposition,[],[f7,f32])).
% 0.20/0.27 thf(f51,plain,(
% 0.20/0.27 ($true != ((p @ $false))) | ~spl0_1),
% 0.20/0.27 inference(boolean_simplification,[],[f49])).
% 0.20/0.27 thf(f58,plain,(
% 0.20/0.27 $false | ~spl0_1),
% 0.20/0.27 inference(forward_subsumption_resolution,[],[f51,f50])).
% 0.20/0.27 thf(f59,plain,(
% 0.20/0.27 ~spl0_1),
% 0.20/0.27 inference(avatar_contradiction_clause,[],[f58])).
% 0.20/0.27 cnf(s5, plain, spl0_1, inference(sat_conversion,[],[f47])).
% 0.20/0.27 cnf(s6, plain, ~spl0_1, inference(sat_conversion,[],[f59])).
% 0.20/0.27 cnf(s7, plain, $false, inference(rat,[],[s5,s6])).
% 0.20/0.27 thf(f60,plain,(
% 0.20/0.27 $false),
% 0.20/0.27 inference(avatar_sat_refutation,[],[s7])).
% 0.20/0.27 % SZS output end Proof for theBenchmark
% 0.20/0.27 % (1490445)------------------------------
% 0.20/0.27 % (1490445)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (1490445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (1490445)CaDiCaL version: 2.1.3
% 0.20/0.27 % (1490445)Termination reason: Refutation
% 0.20/0.27 % (1490445)Time elapsed: 0.002 s
% 0.20/0.27 % (1490445)Peak memory usage: 13 MB
% 0.20/0.27 % (1490445)Instructions burned: 2 (million)
% 0.20/0.27 % (1490439)Success in time 0.036 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------