%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYN914-1 : TPTP v9.3.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:22:50 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.29s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 56
% Syntax : Number of formulae : 58 ( 56 unt; 0 def)
% Number of atoms : 76 ( 75 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 73 ( 55 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 21 con; 0-0 aty)
% Number of variables : 2 ( 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( X0 = a1
| X0 = a2
| X0 = a3
| X0 = a4
| X0 = a5
| X0 = a6
| X0 = a7
| X0 = a8
| X0 = a9
| X0 = a10 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_most_10) ).
fof(f2,plain,
! [X0] :
( a1 = X0
| a2 = X0
| a3 = X0
| a4 = X0
| a5 = X0
| a6 = X0
| a7 = X0
| a8 = X0
| a9 = X0
| a10 = X0 ),
inference(reorient_equations,[],[f1]) ).
fof(f3,negated_conjecture,
b1 != b2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_1_2) ).
fof(f4,negated_conjecture,
b1 != b3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_1_3) ).
fof(f5,negated_conjecture,
b1 != b4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_1_4) ).
fof(f6,negated_conjecture,
b1 != b5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_1_5) ).
fof(f7,negated_conjecture,
b1 != b6,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_1_6) ).
fof(f8,negated_conjecture,
b1 != b7,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_1_7) ).
fof(f9,negated_conjecture,
b1 != b8,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_1_8) ).
fof(f10,negated_conjecture,
b1 != b9,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_1_9) ).
fof(f11,negated_conjecture,
b1 != b10,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_1_10) ).
fof(f12,negated_conjecture,
b1 != b11,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_1_11) ).
fof(f13,negated_conjecture,
b2 != b3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_2_3) ).
fof(f14,negated_conjecture,
b2 != b4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_2_4) ).
fof(f15,negated_conjecture,
b2 != b5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_2_5) ).
fof(f16,negated_conjecture,
b2 != b6,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_2_6) ).
fof(f17,negated_conjecture,
b2 != b7,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_2_7) ).
fof(f18,negated_conjecture,
b2 != b8,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_2_8) ).
fof(f19,negated_conjecture,
b2 != b9,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_2_9) ).
fof(f20,negated_conjecture,
b2 != b10,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_2_10) ).
fof(f21,negated_conjecture,
b2 != b11,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_2_11) ).
fof(f22,negated_conjecture,
b3 != b4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_3_4) ).
fof(f23,negated_conjecture,
b3 != b5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_3_5) ).
fof(f24,negated_conjecture,
b3 != b6,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_3_6) ).
fof(f25,negated_conjecture,
b3 != b7,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_3_7) ).
fof(f26,negated_conjecture,
b3 != b8,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_3_8) ).
fof(f27,negated_conjecture,
b3 != b9,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_3_9) ).
fof(f28,negated_conjecture,
b3 != b10,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_3_10) ).
fof(f29,negated_conjecture,
b3 != b11,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_3_11) ).
fof(f30,negated_conjecture,
b4 != b5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_4_5) ).
fof(f31,negated_conjecture,
b4 != b6,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_4_6) ).
fof(f32,negated_conjecture,
b4 != b7,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_4_7) ).
fof(f33,negated_conjecture,
b4 != b8,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_4_8) ).
fof(f34,negated_conjecture,
b4 != b9,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_4_9) ).
fof(f35,negated_conjecture,
b4 != b10,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_4_10) ).
fof(f36,negated_conjecture,
b4 != b11,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_4_11) ).
fof(f37,negated_conjecture,
b5 != b6,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_5_6) ).
fof(f38,negated_conjecture,
b5 != b7,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_5_7) ).
fof(f39,negated_conjecture,
b5 != b8,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_5_8) ).
fof(f40,negated_conjecture,
b5 != b9,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_5_9) ).
fof(f41,negated_conjecture,
b5 != b10,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_5_10) ).
fof(f42,negated_conjecture,
b5 != b11,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_5_11) ).
fof(f43,negated_conjecture,
b6 != b7,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_6_7) ).
fof(f44,negated_conjecture,
b6 != b8,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_6_8) ).
fof(f45,negated_conjecture,
b6 != b9,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_6_9) ).
fof(f46,negated_conjecture,
b6 != b10,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_6_10) ).
fof(f47,negated_conjecture,
b6 != b11,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_6_11) ).
fof(f48,negated_conjecture,
b7 != b8,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_7_8) ).
fof(f49,negated_conjecture,
b7 != b9,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_7_9) ).
fof(f50,negated_conjecture,
b7 != b10,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_7_10) ).
fof(f51,negated_conjecture,
b7 != b11,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_7_11) ).
fof(f52,negated_conjecture,
b8 != b9,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_8_9) ).
fof(f53,negated_conjecture,
b8 != b10,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_8_10) ).
fof(f54,negated_conjecture,
b8 != b11,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_8_11) ).
fof(f55,negated_conjecture,
b9 != b10,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_9_10) ).
fof(f56,negated_conjecture,
b9 != b11,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_9_11) ).
fof(f57,negated_conjecture,
b10 != b11,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',at_least_11_10_11) ).
fof(f113,plain,
$false,
inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f2,f3,f4,f5,f6,f7,f8,f9,f10,f11,f12,f13,f14,f15,f16,f17,f18,f19,f20,f21,f22,f23,f24,f25,f26,f27,f28,f29,f30,f31,f32,f33,f34,f35,f36,f37,f38,f39,f40,f41,f42,f43,f44,f45,f46,f47,f48,f49,f50,f51,f52,f53,f54,f55,f56,f57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN914-1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n004.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 17:12:07 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/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.20/0.29 % (523328)Will run a generic schedule for satisfiability detection.
% 0.20/0.29 % (523337)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4264548590:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.29 % (523334)% WARNING: option uhcvi not known.
% 0.20/0.29 % (523333)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4165462118_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.29 % (523338)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2279645453:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.29 % (523334)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2683988943:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.29 % (523335)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3841666939:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.29 % (523336)dis+10_1_sil=32000:sp=arity:random_seed=1529094053:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.29 % Detected minimum model sizes of [11]
% 0.20/0.29 % Detected maximum model sizes of [21]
% 0.20/0.29 % TRYING [11]
% 0.20/0.29 % (523339)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=914280681:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.29 % TRYING [12]
% 0.20/0.29 % TRYING [13]
% 0.20/0.29 % TRYING [14]
% 0.20/0.29 % TRYING [15]
% 0.20/0.29 % TRYING [16]
% 0.20/0.29 % TRYING [17]
% 0.20/0.29 % TRYING [18]
% 0.20/0.29 % TRYING [19]
% 0.20/0.29 % TRYING [20]
% 0.20/0.29 % TRYING [21]
% 0.20/0.29 % (523337)Instruction limit reached!
% 0.20/0.29 % (523337)------------------------------
% 0.20/0.29 % (523337)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (523337)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (523337)CaDiCaL version: 2.1.3
% 0.20/0.29 % (523337)Termination reason: Instruction limit
% 0.20/0.29 % (523337)Termination phase: Saturation
% 0.20/0.29 % (523337)Time elapsed: 0.025 s
% 0.20/0.29 % (523337)Peak memory usage: 11 MB
% 0.20/0.29 % (523337)Instructions burned: 119 (million)
% 0.20/0.29 % (523333) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-523328-523333"...
% 0.20/0.29 % (523333)...printing done.
% 0.20/0.29 % (523333)Refutation found. Thanks to Tanya!
% 0.20/0.29 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.30 % (523333)------------------------------
% 0.20/0.30 % (523333)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (523333)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (523333)CaDiCaL version: 2.1.3
% 0.20/0.30 % (523333)Termination reason: Refutation
% 0.20/0.30 % (523333)Time elapsed: 0.021 s
% 0.20/0.30 % (523333)Peak memory usage: 11 MB
% 0.20/0.30 % (523333)Instructions burned: 55 (million)
% 0.20/0.30 % (523328)Success in time 0.058 s
% 0.20/0.30 % Vampire exiting
%------------------------------------------------------------------------------