%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV230+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n010.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:20:31 PM UTC 2026
% Result : Theorem 0.22s 0.33s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 232 ( 159 equ)
% Maximal formula atoms : 37 ( 16 avg)
% Number of connectives : 350 ( 132 ~; 70 |; 138 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 11 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-3 aty)
% Number of variables : 34 ( 28 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( ! [X0,X1] :
( ( leq(n0,X0)
& leq(n0,X1)
& leq(X0,n5)
& leq(X1,n5) )
=> a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) )
& ! [X2,X3] :
( ( leq(n0,X2)
& leq(n0,X3)
& leq(X2,n2)
& leq(X3,n2) )
=> a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2) ) )
=> ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,n5)
& leq(X5,n5) )
=> ( ( ~ ( n0 = X4
& n5 = X5 )
& ~ ( n1 = X4
& n5 = X5 )
& ~ ( n2 = X4
& n5 = X5 )
& ~ ( n2 = X5
& n5 = X4 )
& ~ ( n3 = X4
& n5 = X5 )
& ~ ( n3 = X5
& n5 = X4 )
& ~ ( n4 = X4
& n5 = X5 )
& ~ ( n4 = X5
& n5 = X4 )
& ~ ( n5 = X4
& n5 = X5 )
& n1 = X5
& n4 = X4
& n4 = X5
& n5 = X4 )
=> n0 = a_select2(xinit_noise,n4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0761) ).
fof(f54,negated_conjecture,
~ ( ( ! [X0,X1] :
( ( leq(n0,X0)
& leq(n0,X1)
& leq(X0,n5)
& leq(X1,n5) )
=> a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0) )
& ! [X2,X3] :
( ( leq(n0,X2)
& leq(n0,X3)
& leq(X2,n2)
& leq(X3,n2) )
=> a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2) ) )
=> ! [X4,X5] :
( ( leq(n0,X4)
& leq(n0,X5)
& leq(X4,n5)
& leq(X5,n5) )
=> ( ( ~ ( n0 = X4
& n5 = X5 )
& ~ ( n1 = X4
& n5 = X5 )
& ~ ( n2 = X4
& n5 = X5 )
& ~ ( n2 = X5
& n5 = X4 )
& ~ ( n3 = X4
& n5 = X5 )
& ~ ( n3 = X5
& n5 = X4 )
& ~ ( n4 = X4
& n5 = X5 )
& ~ ( n4 = X5
& n5 = X4 )
& ~ ( n5 = X4
& n5 = X5 )
& n1 = X5
& n4 = X4
& n4 = X5
& n5 = X4 )
=> n0 = a_select2(xinit_noise,n4) ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f136,plain,
( ? [X4,X5] :
( n0 != a_select2(xinit_noise,n4)
& ( n0 != X4
| n5 != X5 )
& ( n1 != X4
| n5 != X5 )
& ( n2 != X4
| n5 != X5 )
& ( n2 != X5
| n5 != X4 )
& ( n3 != X4
| n5 != X5 )
& ( n3 != X5
| n5 != X4 )
& ( n4 != X4
| n5 != X5 )
& ( n4 != X5
| n5 != X4 )
& ( n5 != X4
| n5 != X5 )
& n1 = X5
& n4 = X4
& n4 = X5
& n5 = X4
& leq(n0,X4)
& leq(n0,X5)
& leq(X4,n5)
& leq(X5,n5) )
& ! [X0,X1] :
( a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0)
| ~ leq(n0,X0)
| ~ leq(n0,X1)
| ~ leq(X0,n5)
| ~ leq(X1,n5) )
& ! [X2,X3] :
( a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2)
| ~ leq(n0,X2)
| ~ leq(n0,X3)
| ~ leq(X2,n2)
| ~ leq(X3,n2) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f137,plain,
( ? [X4,X5] :
( n0 != a_select2(xinit_noise,n4)
& ( n0 != X4
| n5 != X5 )
& ( n1 != X4
| n5 != X5 )
& ( n2 != X4
| n5 != X5 )
& ( n2 != X5
| n5 != X4 )
& ( n3 != X4
| n5 != X5 )
& ( n3 != X5
| n5 != X4 )
& ( n4 != X4
| n5 != X5 )
& ( n4 != X5
| n5 != X4 )
& ( n5 != X4
| n5 != X5 )
& n1 = X5
& n4 = X4
& n4 = X5
& n5 = X4
& leq(n0,X4)
& leq(n0,X5)
& leq(X4,n5)
& leq(X5,n5) )
& ! [X0,X1] :
( a_select3(q_ds1_filter,X0,X1) = a_select3(q_ds1_filter,X1,X0)
| ~ leq(n0,X0)
| ~ leq(n0,X1)
| ~ leq(X0,n5)
| ~ leq(X1,n5) )
& ! [X2,X3] :
( a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2)
| ~ leq(n0,X2)
| ~ leq(n0,X3)
| ~ leq(X2,n2)
| ~ leq(X3,n2) ) ),
inference(flattening,[],[f136]) ).
fof(f190,plain,
( ? [X0,X1] :
( n0 != a_select2(xinit_noise,n4)
& ( n0 != X0
| n5 != X1 )
& ( n1 != X0
| n5 != X1 )
& ( n2 != X0
| n5 != X1 )
& ( n2 != X1
| n5 != X0 )
& ( n3 != X0
| n5 != X1 )
& ( n3 != X1
| n5 != X0 )
& ( n4 != X0
| n5 != X1 )
& ( n4 != X1
| n5 != X0 )
& ( n5 != X0
| n5 != X1 )
& n1 = X1
& n4 = X0
& n4 = X1
& n5 = X0
& leq(n0,X0)
& leq(n0,X1)
& leq(X0,n5)
& leq(X1,n5) )
& ! [X2,X3] :
( a_select3(q_ds1_filter,X2,X3) = a_select3(q_ds1_filter,X3,X2)
| ~ leq(n0,X2)
| ~ leq(n0,X3)
| ~ leq(X2,n5)
| ~ leq(X3,n5) )
& ! [X4,X5] :
( a_select3(r_ds1_filter,X4,X5) = a_select3(r_ds1_filter,X5,X4)
| ~ leq(n0,X4)
| ~ leq(n0,X5)
| ~ leq(X4,n2)
| ~ leq(X5,n2) ) ),
inference(rectify,[],[f137]) ).
fof(f191,plain,
( n0 != a_select2(xinit_noise,n4)
& ( n0 != sK31
| n5 != sK32 )
& ( n1 != sK31
| n5 != sK32 )
& ( n2 != sK31
| n5 != sK32 )
& ( n2 != sK32
| n5 != sK31 )
& ( n3 != sK31
| n5 != sK32 )
& ( n3 != sK32
| n5 != sK31 )
& ( n4 != sK31
| n5 != sK32 )
& ( n4 != sK32
| n5 != sK31 )
& ( n5 != sK31
| n5 != sK32 )
& n1 = sK32
& n4 = sK31
& n4 = sK32
& n5 = sK31
& leq(n0,sK31)
& leq(n0,sK32)
& leq(sK31,n5)
& leq(sK32,n5)
& ! [X2,X3] :
( a_select3(q_ds1_filter,X2,X3) = a_select3(q_ds1_filter,X3,X2)
| ~ leq(n0,X2)
| ~ leq(n0,X3)
| ~ leq(X2,n5)
| ~ leq(X3,n5) )
& ! [X4,X5] :
( a_select3(r_ds1_filter,X4,X5) = a_select3(r_ds1_filter,X5,X4)
| ~ leq(n0,X4)
| ~ leq(n0,X5)
| ~ leq(X4,n2)
| ~ leq(X5,n2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK31,sK32]),skolemize(X0,sK31),skolemize(X1,sK32)],[f190]) ).
fof(f308,plain,
n5 = sK31,
inference(cnf_transformation,[],[f191]) ).
fof(f309,plain,
n4 = sK32,
inference(cnf_transformation,[],[f191]) ).
fof(f310,plain,
n4 = sK31,
inference(cnf_transformation,[],[f191]) ).
fof(f312,plain,
( n5 != sK31
| n5 != sK32 ),
inference(cnf_transformation,[],[f191]) ).
fof(f386,plain,
( sK31 != sK31
| sK31 != sK32 ),
inference(definition_unfolding,[],[f312,f308,f308]) ).
fof(f387,plain,
sK31 = sK32,
inference(definition_unfolding,[],[f309,f310]) ).
fof(f420,plain,
sK31 != sK32,
inference(trivial_inequality_removal,[],[f386]) ).
fof(f426,plain,
$false,
inference(global_subsumption,[],[f420,f387]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV230+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n010.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 10:14:32 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.25 Running first-order model finding
% 0.08/0.25 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.22/0.33 % (1827331)Will run a generic schedule for satisfiability detection.
% 0.22/0.33 % (1827336)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2318714922_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.33 % (1827337)% WARNING: option uhcvi not known.
% 0.22/0.33 % (1827340)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2955096687:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.33 % (1827342)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3836893036:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.33 % (1827337)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3697396480:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.33 % (1827339)dis+10_1_sil=32000:sp=arity:random_seed=3467768813:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.33 % (1827341)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2645853986:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.33 % (1827338)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4277131223:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.33 % (1827341) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1827331-1827341"...
% 0.22/0.33 % (1827338) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1827331-1827338"...
% 0.22/0.33 % (1827339) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1827331-1827339"...
% 0.22/0.33 % (1827341)...printing done.
% 0.22/0.33 % (1827338)...printing done.
% 0.22/0.33 % (1827337) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1827331-1827337"...
% 0.22/0.33 % (1827339)...printing done.
% 0.22/0.33 % (1827338)Refutation found. Thanks to Tanya!
% 0.22/0.33 % SZS status Theorem for theBenchmark
% 0.22/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.33 % (1827338)------------------------------
% 0.22/0.33 % (1827338)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.33 % (1827338)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.33 % (1827338)CaDiCaL version: 2.1.3
% 0.22/0.33 % (1827338)Termination reason: Refutation
% 0.22/0.33 % (1827338)Time elapsed: 0.010 s
% 0.22/0.33 % (1827338)Peak memory usage: 11 MB
% 0.22/0.33 % (1827338)Instructions burned: 9 (million)
% 0.22/0.33 % (1827331)Success in time 0.068 s
% 0.22/0.33 % Vampire exiting
%------------------------------------------------------------------------------