%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ARI012_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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 09:33:52 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 : ARI012_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n011.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 20:41:01 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24 Running first-order model finding
% 0.09/0.24 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 % (3741892)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (3741906)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3645668935:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.20/0.27 % (3741906) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3741892-3741906"...
% 0.20/0.27 % (3741901)% WARNING: option uhcvi not known.
% 0.20/0.27 % (3741906)...printing done.
% 0.20/0.27 % (3741906)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 tff(f1,conjecture,(
% 0.20/0.27 ? [X0 : $int] : $less(X0,-2)),
% 0.20/0.27 file('/export/starexec/sandbox/benchmark/theBenchmark.p',something_less_n2)).
% 0.20/0.27 tff(f2,negated_conjecture,(
% 0.20/0.27 ~ ? [X0 : $int] : $less(X0,-2)),
% 0.20/0.27 inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.27 tff(f3,definition,(
% 0.20/0.27 ( ! [X0 : $int,X1 : $int] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 0.20/0.27 introduced(theory,[tha_commutativity])).
% 0.20/0.27 tff(f4,definition,(
% 0.20/0.27 ( ! [X2 : $int,X0 : $int,X1 : $int] : ($sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2)) )),
% 0.20/0.27 introduced(theory,[tha_associativity])).
% 0.20/0.27 tff(f7,definition,(
% 0.20/0.27 ( ! [X0 : $int] : (0 = $sum(X0,$uminus(X0))) )),
% 0.20/0.27 introduced(theory,[tha_inverse_op_unit])).
% 0.20/0.27 tff(f12,definition,(
% 0.20/0.27 ( ! [X0 : $int,X1 : $int] : ($less(X0,X1) | $less(X1,$sum(X0,1))) )),
% 0.20/0.27 introduced(theory,[tha_order_plus_one_dichotomy])).
% 0.20/0.27 tff(f15,plain,(
% 0.20/0.27 ! [X0 : $int] : ~$less(X0,-2)),
% 0.20/0.27 inference(ennf_transformation,[],[f2])).
% 0.20/0.27 tff(f16,plain,(
% 0.20/0.27 ( ! [X0 : $int] : (~$less(X0,-2)) )),
% 0.20/0.27 inference(cnf_transformation,[],[f15])).
% 0.20/0.27 tff(f23,plain,(
% 0.20/0.27 ( ! [X0 : $int] : ($less(-2,$sum(X0,1))) )),
% 0.20/0.27 inference(resolution,[],[f12,f16])).
% 0.20/0.27 tff(f31,plain,(
% 0.20/0.27 ( ! [X0 : $int] : ($less(-2,$sum(1,X0))) )),
% 0.20/0.27 inference(superposition,[],[f23,f3])).
% 0.20/0.27 tff(f89,plain,(
% 0.20/0.27 ( ! [X0 : $int,X1 : $int] : ($sum(0,X1) = $sum(X0,$sum($uminus(X0),X1))) )),
% 0.20/0.27 inference(superposition,[],[f4,f7])).
% 0.20/0.27 tff(f105,plain,(
% 0.20/0.27 ( ! [X0 : $int,X1 : $int] : ($sum(X0,$sum($uminus(X0),X1)) = X1) )),
% 0.20/0.27 inference(evaluation,[],[f89])).
% 0.20/0.27 tff(f178,plain,(
% 0.20/0.27 ( ! [X0 : $int] : ($less(-2,X0)) )),
% 0.20/0.27 inference(superposition,[],[f31,f105])).
% 0.20/0.27 tff(f199,plain,(
% 0.20/0.27 $false),
% 0.20/0.27 inference(resolution,[],[f178,f16])).
% 0.20/0.27 % SZS output end Proof for theBenchmark
% 0.20/0.27 % (3741906)------------------------------
% 0.20/0.27 % (3741906)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (3741906)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (3741906)CaDiCaL version: 2.1.3
% 0.20/0.27 % (3741906)Termination reason: Refutation
% 0.20/0.27 % (3741906)Time elapsed: 0.003 s
% 0.20/0.27 % (3741906)Peak memory usage: 12 MB
% 0.20/0.27 % (3741906)Instructions burned: 7 (million)
% 0.20/0.27 % (3741892)Success in time 0.018 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------