%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO506_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:31:22 PM UTC 2026
% Result : Theorem 0.10s 0.23s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO506_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.16 % Computer : n014.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Mon Sep 28 17:46:45 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19 Running first-order model finding
% 0.10/0.19 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.10/0.23 % (1993454)Will run a generic schedule for satisfiability detection.
% 0.10/0.23 % (1993467)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2671016081:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.23 % (1993467) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1993454-1993467"...
% 0.10/0.23 % (1993467)...printing done.
% 0.10/0.23 % (1993467)Refutation found. Thanks to Tanya!
% 0.10/0.23 % SZS status Theorem for theBenchmark
% 0.10/0.23 % SZS output start Proof for theBenchmark
% 0.10/0.23 tff(func_def_0, type, c: ($o * $i * $i) > $i).
% 0.10/0.23 tff(func_def_3, type, bG0: ($i * $i) > $o).
% 0.10/0.23 tff(f1,conjecture,(
% 0.10/0.23 ! [X0 : $i,X1 : $i] : c(X0 = X1,X0,X1) = X1 | ~ ! [X0 : $i,X1 : $i] : c($true,X0,X1) = X0 | ~ ! [X0 : $i,X1 : $i] : c($false,X0,X1) = X1),
% 0.10/0.23 file('/export/starexec/sandbox/benchmark/theBenchmark.p',claim)).
% 0.10/0.23 tff(f2,negated_conjecture,(
% 0.10/0.23 ~(! [X0 : $i,X1 : $i] : c(X0 = X1,X0,X1) = X1 | ~ ! [X0 : $i,X1 : $i] : c($true,X0,X1) = X0 | ~ ! [X0 : $i,X1 : $i] : c($false,X0,X1) = X1)),
% 0.10/0.23 inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.23 tff(f3,plain,(
% 0.10/0.23 ~(! [X0 : $i,X1 : $i] : c(X0 = X1,X0,X1) = X1 | ~ ! [X2 : $i,X3 : $i] : c($true,X2,X3) = X2 | ~ ! [X4 : $i,X5 : $i] : c($false,X4,X5) = X5)),
% 0.10/0.23 inference(rectify,[],[f2])).
% 0.10/0.23 tff(f4,definition,(
% 0.10/0.23 ! [X1 : $i,X0 : $i] : (X0 = X1 <=> ($true = bG0(X1,X0)))),
% 0.10/0.23 introduced(definition,[new_symbols(definition,[bG0])],[fool_formula_definition])).
% 0.10/0.23 tff(f5,plain,(
% 0.10/0.23 ~(! [X0 : $i,X1 : $i] : c(bG0(X1,X0),X0,X1) = X1 | ~ ! [X2 : $i,X3 : $i] : c($true,X2,X3) = X2 | ~ ! [X4 : $i,X5 : $i] : c($false,X4,X5) = X5)),
% 0.10/0.23 inference(fool_elimination,[],[f3,f4])).
% 0.10/0.23 tff(f6,plain,(
% 0.10/0.23 ! [X0 : $i,X1 : $i] : (X0 = X1 <=> ($true = bG0(X0,X1)))),
% 0.10/0.23 inference(rectify,[],[f4])).
% 0.10/0.23 tff(f7,plain,(
% 0.10/0.23 ? [X0 : $i,X1 : $i] : c(bG0(X1,X0),X0,X1) != X1 & ! [X2 : $i,X3 : $i] : c($true,X2,X3) = X2 & ! [X4 : $i,X5 : $i] : c($false,X4,X5) = X5),
% 0.10/0.23 inference(ennf_transformation,[],[f5])).
% 0.10/0.23 tff(f8,plain,(
% 0.10/0.23 ! [X0 : $i,X1 : $i] : ((X0 = X1 | ($true != bG0(X0,X1))) & (($true = bG0(X0,X1)) | X0 != X1))),
% 0.10/0.23 inference(nnf_transformation,[],[f6])).
% 0.10/0.23 tff(f9,plain,(
% 0.10/0.23 sK2 != c(bG0(sK2,sK1),sK1,sK2) & ! [X2 : $i,X3 : $i] : c($true,X2,X3) = X2 & ! [X4 : $i,X5 : $i] : c($false,X4,X5) = X5),
% 0.10/0.23 inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f7])).
% 0.10/0.23 tff(f11,plain,(
% 0.10/0.23 ( ! [X0 : $i,X1 : $i] : (($true != bG0(X0,X1)) | X0 = X1) )),
% 0.10/0.23 inference(cnf_transformation,[],[f8])).
% 0.10/0.23 tff(f12,plain,(
% 0.10/0.23 ( ! [X4 : $i,X5 : $i] : (c($false,X4,X5) = X5) )),
% 0.10/0.23 inference(cnf_transformation,[],[f9])).
% 0.10/0.23 tff(f13,plain,(
% 0.10/0.23 ( ! [X2 : $i,X3 : $i] : (c($true,X2,X3) = X2) )),
% 0.10/0.23 inference(cnf_transformation,[],[f9])).
% 0.10/0.23 tff(f14,plain,(
% 0.10/0.23 sK2 != c(bG0(sK2,sK1),sK1,sK2)),
% 0.10/0.23 inference(cnf_transformation,[],[f9])).
% 0.10/0.23 tff(f16,definition,(
% 0.10/0.23 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.10/0.23 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.10/0.23 tff(f27,plain,(
% 0.10/0.23 sK2 != c($true,sK1,sK2) | ($false = bG0(sK2,sK1))),
% 0.10/0.23 inference(superposition,[],[f14,f16])).
% 0.10/0.23 tff(f29,plain,(
% 0.10/0.23 sK1 != sK2 | ($false = bG0(sK2,sK1))),
% 0.10/0.23 inference(forward_demodulation,[],[f27,f13])).
% 0.10/0.23 tff(f31,definition,(
% 0.10/0.23 spl3_3 <=> ($false = bG0(sK2,sK1))),
% 0.10/0.23 introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition])).
% 0.10/0.23 tff(f33,plain,(
% 0.10/0.23 ($false = bG0(sK2,sK1)) | ~spl3_3),
% 0.10/0.23 inference(avatar_component_clause,[],[f31])).
% 0.10/0.23 tff(f35,definition,(
% 0.10/0.23 spl3_4 <=> sK1 = sK2),
% 0.10/0.23 introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition])).
% 0.10/0.23 tff(f37,plain,(
% 0.10/0.23 sK1 != sK2 | spl3_4),
% 0.10/0.23 inference(avatar_component_clause,[],[f35])).
% 0.10/0.23 tff(f38,plain,(
% 0.10/0.23 spl3_3 | ~spl3_4),
% 0.10/0.23 inference(avatar_split_clause,[],[f29,f35,f31])).
% 0.10/0.23 tff(f40,plain,(
% 0.10/0.23 sK2 != c($false,sK1,sK2) | ~spl3_3),
% 0.10/0.23 inference(superposition,[],[f14,f33])).
% 0.10/0.23 tff(f42,plain,(
% 0.10/0.23 $false | ~spl3_3),
% 0.10/0.23 inference(forward_subsumption_resolution,[],[f40,f12])).
% 0.10/0.23 tff(f43,plain,(
% 0.10/0.23 ~spl3_3),
% 0.10/0.23 inference(avatar_contradiction_clause,[],[f42])).
% 0.10/0.23 tff(f123,plain,(
% 0.10/0.23 ( ! [X0 : $i,X1 : $i] : (($true != $true) | X0 = X1 | ($false = bG0(X0,X1))) )),
% 0.10/0.23 inference(superposition,[],[f11,f16])).
% 0.10/0.23 tff(f124,plain,(
% 0.10/0.23 ( ! [X0 : $i,X1 : $i] : (($false = bG0(X0,X1)) | X0 = X1) )),
% 0.10/0.23 inference(trivial_inequality_removal,[],[f123])).
% 0.10/0.23 tff(f169,plain,(
% 0.10/0.23 sK2 != c($false,sK1,sK2) | sK1 = sK2),
% 0.10/0.23 inference(superposition,[],[f14,f124])).
% 0.10/0.23 tff(f174,plain,(
% 0.10/0.23 sK1 = sK2),
% 0.10/0.23 inference(forward_subsumption_resolution,[],[f169,f12])).
% 0.10/0.23 tff(f177,plain,(
% 0.10/0.23 $false | spl3_4),
% 0.10/0.23 inference(forward_subsumption_resolution,[],[f174,f37])).
% 0.10/0.23 tff(f178,plain,(
% 0.10/0.23 spl3_4),
% 0.10/0.23 inference(avatar_contradiction_clause,[],[f177])).
% 0.10/0.23 cnf(s20, plain, spl3_3 | ~spl3_4, inference(sat_conversion,[],[f38])).
% 0.10/0.23 cnf(s23, plain, ~spl3_3, inference(sat_conversion,[],[f43])).
% 0.10/0.23 cnf(s86, plain, spl3_4, inference(sat_conversion,[],[f178])).
% 0.10/0.23 cnf(s87, plain, $false, inference(rat,[],[s20,s86,s23])).
% 0.10/0.23 tff(f179,plain,(
% 0.10/0.23 $false),
% 0.10/0.23 inference(avatar_sat_refutation,[],[s87])).
% 0.10/0.23 % SZS output end Proof for theBenchmark
% 0.10/0.23 % (1993467)------------------------------
% 0.10/0.23 % (1993467)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.23 % (1993467)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.23 % (1993467)CaDiCaL version: 2.1.3
% 0.10/0.23 % (1993467)Termination reason: Refutation
% 0.10/0.23 % (1993467)Time elapsed: 0.002 s
% 0.10/0.23 % (1993467)Peak memory usage: 12 MB
% 0.10/0.23 % (1993467)Instructions burned: 4 (million)
% 0.10/0.23 % (1993454)Success in time 0.032 s
% 0.10/0.23 % Vampire exiting
%------------------------------------------------------------------------------