%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN983_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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 : Tue Sep 29 02:23:00 PM UTC 2026
% Result : Theorem 0.22s 0.28s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN983_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21 % Computer : n019.cluster.edu
% 0.10/0.21 % Model : x86_64 x86_64
% 0.10/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.21 % Memory : 8046.5625MB
% 0.10/0.21 % OS : Linux 6.8.0-71-generic
% 0.10/0.21 % CPULimit : 300
% 0.10/0.21 % WCLimit : 300
% 0.10/0.21 % DateTime : Mon Sep 28 17:19:24 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23 Running first-order model finding
% 0.10/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.22/0.28 % (4170615)Will run a generic schedule for satisfiability detection.
% 0.22/0.28 % (4170620)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=528869262_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.28 % Detected minimum model sizes of [1]
% 0.22/0.28 % Detected maximum model sizes of [5]
% 0.22/0.28 % TRYING [1]
% 0.22/0.28 % TRYING [2]
% 0.22/0.28 % TRYING [3]
% 0.22/0.28 % TRYING [4]
% 0.22/0.28 % TRYING [5]
% 0.22/0.28 % (4170620) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4170615-4170620"...
% 0.22/0.28 % (4170620)...printing done.
% 0.22/0.28 % (4170620)Refutation found. Thanks to Tanya!
% 0.22/0.28 % SZS status Theorem for theBenchmark
% 0.22/0.28 % SZS output start Proof for theBenchmark
% 0.22/0.28 tff(func_def_0, type, bG0: $o).
% 0.22/0.28 tff(func_def_3, type, bG1: $o).
% 0.22/0.28 tff(func_def_4, type, bG2: $o).
% 0.22/0.28 tff(pred_def_3, type, p: $o > $o).
% 0.22/0.28 tff(f1,conjecture,(
% 0.22/0.28 (p(a) & p(b)) => p(a & b)),
% 0.22/0.28 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm)).
% 0.22/0.28 tff(f2,negated_conjecture,(
% 0.22/0.28 ~((p(a) & p(b)) => p(a & b))),
% 0.22/0.28 inference(negated_conjecture,[status(cth)],[f1])).
% 0.22/0.28 tff(f3,definition,(
% 0.22/0.28 b <=> (bG0 = $true)),
% 0.22/0.28 introduced(definition,[new_symbols(definition,[bG0])],[fool_formula_definition])).
% 0.22/0.28 tff(f4,definition,(
% 0.22/0.28 a <=> ($true = bG1)),
% 0.22/0.28 introduced(definition,[new_symbols(definition,[bG1])],[fool_formula_definition])).
% 0.22/0.28 tff(f5,definition,(
% 0.22/0.28 (a & b) <=> ($true = bG2)),
% 0.22/0.28 introduced(definition,[new_symbols(definition,[bG2])],[fool_formula_definition])).
% 0.22/0.28 tff(f6,plain,(
% 0.22/0.28 ~((p(bG1) & p(bG0)) => p(bG2))),
% 0.22/0.28 inference(fool_elimination,[],[f2,f5,f4,f3])).
% 0.22/0.28 tff(f7,plain,(
% 0.22/0.28 ~p(bG2) & (p(bG1) & p(bG0))),
% 0.22/0.28 inference(ennf_transformation,[],[f6])).
% 0.22/0.28 tff(f8,plain,(
% 0.22/0.28 ~p(bG2) & p(bG1) & p(bG0)),
% 0.22/0.28 inference(flattening,[],[f7])).
% 0.22/0.28 tff(f9,plain,(
% 0.22/0.28 ((a & b) | ($true != bG2)) & (($true = bG2) | (~a | ~b))),
% 0.22/0.28 inference(nnf_transformation,[],[f5])).
% 0.22/0.28 tff(f10,plain,(
% 0.22/0.28 ((a & b) | ($true != bG2)) & (($true = bG2) | ~a | ~b)),
% 0.22/0.28 inference(flattening,[],[f9])).
% 0.22/0.28 tff(f11,plain,(
% 0.22/0.28 (a | ($true != bG1)) & (($true = bG1) | ~a)),
% 0.22/0.28 inference(nnf_transformation,[],[f4])).
% 0.22/0.28 tff(f12,plain,(
% 0.22/0.28 (b | (bG0 != $true)) & ((bG0 = $true) | ~b)),
% 0.22/0.28 inference(nnf_transformation,[],[f3])).
% 0.22/0.28 tff(f13,plain,(
% 0.22/0.28 ($true = bG2) | ~a | ~b),
% 0.22/0.28 inference(cnf_transformation,[],[f10])).
% 0.22/0.28 tff(f14,plain,(
% 0.22/0.28 b | ($true != bG2)),
% 0.22/0.28 inference(cnf_transformation,[],[f10])).
% 0.22/0.28 tff(f15,plain,(
% 0.22/0.28 a | ($true != bG2)),
% 0.22/0.28 inference(cnf_transformation,[],[f10])).
% 0.22/0.28 tff(f16,plain,(
% 0.22/0.28 ($true = bG1) | ~a),
% 0.22/0.28 inference(cnf_transformation,[],[f11])).
% 0.22/0.28 tff(f17,plain,(
% 0.22/0.28 a | ($true != bG1)),
% 0.22/0.28 inference(cnf_transformation,[],[f11])).
% 0.22/0.28 tff(f18,plain,(
% 0.22/0.28 (bG0 = $true) | ~b),
% 0.22/0.28 inference(cnf_transformation,[],[f12])).
% 0.22/0.28 tff(f19,plain,(
% 0.22/0.28 b | (bG0 != $true)),
% 0.22/0.28 inference(cnf_transformation,[],[f12])).
% 0.22/0.28 tff(f20,plain,(
% 0.22/0.28 p(bG0)),
% 0.22/0.28 inference(cnf_transformation,[],[f8])).
% 0.22/0.28 tff(f21,plain,(
% 0.22/0.28 p(bG1)),
% 0.22/0.28 inference(cnf_transformation,[],[f8])).
% 0.22/0.28 tff(f22,plain,(
% 0.22/0.28 ~p(bG2)),
% 0.22/0.28 inference(cnf_transformation,[],[f8])).
% 0.22/0.28 tff(f23,definition,(
% 0.22/0.28 ($true != $false)),
% 0.22/0.28 introduced(theory,[fool_distinctness_axiom])).
% 0.22/0.28 tff(f24,definition,(
% 0.22/0.28 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.22/0.28 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.22/0.28 tff(f25,plain,(
% 0.22/0.28 ~b | ($true != bG2)),
% 0.22/0.28 inference(consistent_polarity_flipping,[],[f14])).
% 0.22/0.28 tff(f26,plain,(
% 0.22/0.28 ($true = bG2) | ~a | b),
% 0.22/0.28 inference(consistent_polarity_flipping,[],[f13])).
% 0.22/0.28 tff(f27,plain,(
% 0.22/0.28 ~b | (bG0 != $true)),
% 0.22/0.28 inference(consistent_polarity_flipping,[],[f19])).
% 0.22/0.28 tff(f28,plain,(
% 0.22/0.28 (bG0 = $true) | b),
% 0.22/0.28 inference(consistent_polarity_flipping,[],[f18])).
% 0.22/0.28 tff(f29,plain,(
% 0.22/0.28 p(bG2)),
% 0.22/0.28 inference(consistent_polarity_flipping,[],[f22])).
% 0.22/0.28 tff(f30,plain,(
% 0.22/0.28 ~p(bG1)),
% 0.22/0.28 inference(consistent_polarity_flipping,[],[f21])).
% 0.22/0.28 tff(f31,plain,(
% 0.22/0.28 ~p(bG0)),
% 0.22/0.28 inference(consistent_polarity_flipping,[],[f20])).
% 0.22/0.28 tff(f43,plain,(
% 0.22/0.28 $false),
% 0.22/0.28 inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f24,f23,f15,f25,f26,f17,f16,f27,f28,f29,f30,f31])).
% 0.22/0.28 % SZS output end Proof for theBenchmark
% 0.22/0.28 % (4170620)------------------------------
% 0.22/0.28 % (4170620)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.28 % (4170620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.28 % (4170620)CaDiCaL version: 2.1.3
% 0.22/0.28 % (4170620)Termination reason: Refutation
% 0.22/0.28 % (4170620)Time elapsed: 0.001 s
% 0.22/0.28 % (4170620)Peak memory usage: 11 MB
% 0.22/0.28 % (4170620)Instructions burned: 2 (million)
% 0.22/0.28 % (4170615)Success in time 0.03 s
% 0.22/0.28 % Vampire exiting
%------------------------------------------------------------------------------