%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW632_2 : TPTP v9.3.1. Released v6.1.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 : Tue Sep 29 01:40:33 PM UTC 2026
% Result : Theorem 0.22s 0.29s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW632_2 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.20 % Computer : n016.cluster.edu
% 0.13/0.20 % Model : x86_64 x86_64
% 0.13/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.20 % Memory : 8046.5625MB
% 0.13/0.20 % OS : Linux 6.8.0-71-generic
% 0.13/0.20 % CPULimit : 300
% 0.13/0.20 % WCLimit : 300
% 0.13/0.20 % DateTime : Mon Sep 28 14:28:03 UTC 2026
% 0.13/0.20 % CPUTime :
% 0.13/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.24 Running first-order model finding
% 0.13/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.22/0.29 % (3658623)Will run a generic schedule for satisfiability detection.
% 0.22/0.29 % (3658642)% WARNING: option uhcvi not known.
% 0.22/0.29 % (3658642)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2972092221:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.29 % (3658642) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3658623-3658642"...
% 0.22/0.29 % (3658642)...printing done.
% 0.22/0.29 % (3658642)Refutation found. Thanks to Tanya!
% 0.22/0.29 % SZS status Theorem for theBenchmark
% 0.22/0.29 % SZS output start Proof for theBenchmark
% 0.22/0.29 tff(type_def_5, type, uni: $tType).
% 0.22/0.29 tff(type_def_6, type, ty: $tType).
% 0.22/0.29 tff(type_def_7, type, bool: $tType).
% 0.22/0.29 tff(type_def_8, type, tuple0: $tType).
% 0.22/0.29 tff(func_def_0, type, witness: ty > uni).
% 0.22/0.29 tff(func_def_1, type, int: ty).
% 0.22/0.29 tff(func_def_2, type, real: ty).
% 0.22/0.29 tff(func_def_3, type, bool1: ty).
% 0.22/0.29 tff(func_def_4, type, true: bool).
% 0.22/0.29 tff(func_def_5, type, false: bool).
% 0.22/0.29 tff(func_def_6, type, match_bool: (ty * bool * uni * uni) > uni).
% 0.22/0.29 tff(func_def_7, type, tuple01: ty).
% 0.22/0.29 tff(func_def_8, type, tuple02: tuple0).
% 0.22/0.29 tff(func_def_9, type, qtmark: ty).
% 0.22/0.29 tff(func_def_12, type, power: ($int * $int) > $int).
% 0.22/0.29 tff(func_def_16, type, abs: $int > $int).
% 0.22/0.29 tff(func_def_18, type, div: ($int * $int) > $int).
% 0.22/0.29 tff(func_def_19, type, mod: ($int * $int) > $int).
% 0.22/0.29 tff(func_def_20, type, ref: ty > ty).
% 0.22/0.29 tff(func_def_21, type, mk_ref: (ty * uni) > uni).
% 0.22/0.29 tff(func_def_22, type, contents: (ty * uni) > uni).
% 0.22/0.29 tff(func_def_23, type, sK0: $int).
% 0.22/0.29 tff(func_def_24, type, sK1: $int).
% 0.22/0.29 tff(func_def_25, type, sK2: $int).
% 0.22/0.29 tff(func_def_26, type, sK3: $int).
% 0.22/0.29 tff(func_def_27, type, sK4: $int).
% 0.22/0.29 tff(pred_def_1, type, sort: (ty * uni) > $o).
% 0.22/0.29 tff(f9,axiom,(
% 0.22/0.29 ! [X0 : $int] : power(X0,0) = 1),
% 0.22/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',power_0)).
% 0.22/0.29 tff(f37,conjecture,(
% 0.22/0.29 ! [X0 : $int,X1 : $int] : ($lesseq(0,X1) => ! [X2 : $int,X3 : $int,X4 : $int] : (($lesseq(0,X2) & $product(X4,power(X3,X2)) = power(X0,X1)) => (~$less(0,X2) => X4 = power(X0,X1))))),
% 0.22/0.29 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wP_parameter_fast_exp_imperative)).
% 0.22/0.29 tff(f38,negated_conjecture,(
% 0.22/0.29 ~ ! [X0 : $int,X1 : $int] : ($lesseq(0,X1) => ! [X2 : $int,X3 : $int,X4 : $int] : (($lesseq(0,X2) & $product(X4,power(X3,X2)) = power(X0,X1)) => (~$less(0,X2) => X4 = power(X0,X1))))),
% 0.22/0.29 inference(negated_conjecture,[status(cth)],[f37])).
% 0.22/0.29 tff(f58,plain,(
% 0.22/0.29 ~ ! [X0 : $int,X1 : $int] : (~$less(X1,0) => ! [X2 : $int,X3 : $int,X4 : $int] : ((~$less(X2,0) & $product(X4,power(X3,X2)) = power(X0,X1)) => (~$less(0,X2) => X4 = power(X0,X1))))),
% 0.22/0.29 inference(theory_normalization,[],[f38])).
% 0.22/0.29 tff(f66,definition,(
% 0.22/0.29 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 0.22/0.29 introduced(theory,[tha_order_totality])).
% 0.22/0.29 tff(f112,plain,(
% 0.22/0.29 ? [X0 : $int,X1 : $int] : (? [X2 : $int,X3 : $int,X4 : $int] : ((power(X0,X1) != X4 & ~$less(0,X2)) & (~$less(X2,0) & $product(X4,power(X3,X2)) = power(X0,X1))) & ~$less(X1,0))),
% 0.22/0.29 inference(ennf_transformation,[],[f58])).
% 0.22/0.29 tff(f113,plain,(
% 0.22/0.29 ? [X0 : $int,X1 : $int] : (? [X2 : $int,X3 : $int,X4 : $int] : (power(X0,X1) != X4 & ~$less(0,X2) & ~$less(X2,0) & $product(X4,power(X3,X2)) = power(X0,X1)) & ~$less(X1,0))),
% 0.22/0.29 inference(flattening,[],[f112])).
% 0.22/0.29 tff(f122,plain,(
% 0.22/0.29 ( ! [X0 : $int] : (power(X0,0) = 1) )),
% 0.22/0.29 inference(cnf_transformation,[],[f9])).
% 0.22/0.29 tff(f155,plain,(
% 0.22/0.29 power(sK0,sK1) = $product(sK4,power(sK3,sK2))),
% 0.22/0.29 inference(cnf_transformation,[],[f113])).
% 0.22/0.29 tff(f156,plain,(
% 0.22/0.29 ~$less(sK2,0)),
% 0.22/0.29 inference(cnf_transformation,[],[f113])).
% 0.22/0.29 tff(f157,plain,(
% 0.22/0.29 ~$less(0,sK2)),
% 0.22/0.29 inference(cnf_transformation,[],[f113])).
% 0.22/0.29 tff(f158,plain,(
% 0.22/0.29 sK4 != power(sK0,sK1)),
% 0.22/0.29 inference(cnf_transformation,[],[f113])).
% 0.22/0.29 tff(f210,plain,(
% 0.22/0.29 $less(0,sK2) | 0 = sK2),
% 0.22/0.29 inference(resolution,[],[f66,f156])).
% 0.22/0.29 tff(f212,plain,(
% 0.22/0.29 0 = sK2),
% 0.22/0.29 inference(forward_subsumption_resolution,[],[f210,f157])).
% 0.22/0.29 tff(f250,plain,(
% 0.22/0.29 power(sK0,sK1) = $product(sK4,power(sK3,0))),
% 0.22/0.29 inference(superposition,[],[f155,f212])).
% 0.22/0.29 tff(f253,plain,(
% 0.22/0.29 power(sK0,sK1) = $product(sK4,1)),
% 0.22/0.29 inference(forward_demodulation,[],[f250,f122])).
% 0.22/0.29 tff(f254,plain,(
% 0.22/0.29 sK4 = power(sK0,sK1)),
% 0.22/0.29 inference(evaluation,[],[f253])).
% 0.22/0.29 tff(f255,plain,(
% 0.22/0.29 $false),
% 0.22/0.29 inference(forward_subsumption_resolution,[],[f254,f158])).
% 0.22/0.29 % SZS output end Proof for theBenchmark
% 0.22/0.29 % (3658642)------------------------------
% 0.22/0.29 % (3658642)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.29 % (3658642)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.29 % (3658642)CaDiCaL version: 2.1.3
% 0.22/0.29 % (3658642)Termination reason: Refutation
% 0.22/0.29 % (3658642)Time elapsed: 0.004 s
% 0.22/0.29 % (3658642)Peak memory usage: 12 MB
% 0.22/0.29 % (3658642)Instructions burned: 8 (million)
% 0.22/0.29 % (3658623)Success in time 0.045 s
% 0.22/0.29 % Vampire exiting
%------------------------------------------------------------------------------