%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV223+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 : n001.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:30 PM UTC 2026
% Result : Theorem 0.10s 0.26s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 3 unt; 0 def)
% Number of atoms : 541 ( 468 equ)
% Maximal formula atoms : 89 ( 49 avg)
% Number of connectives : 921 ( 391 ~; 174 |; 346 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 50 ( 27 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
& n1 = X5 )
& ~ ( n0 = X4
& n2 = X5 )
& ~ ( n0 = X4
& n3 = X5 )
& ~ ( n0 = X4
& n4 = X5 )
& ~ ( n0 = X4
& n5 = X5 )
& ~ ( n0 = X5
& n1 = X4 )
& ~ ( n0 = X5
& n2 = X4 )
& ~ ( n0 = X5
& n3 = X4 )
& ~ ( n0 = X5
& n4 = X4 )
& ~ ( n0 = X5
& n5 = X4 )
& ~ ( n1 = X4
& n1 = X5 )
& ~ ( n1 = X4
& n2 = X5 )
& ~ ( n1 = X4
& n3 = X5 )
& ~ ( n1 = X4
& n4 = X5 )
& ~ ( n1 = X4
& n5 = X5 )
& ~ ( n1 = X5
& n2 = X4 )
& ~ ( n1 = X5
& n3 = X4 )
& ~ ( n1 = X5
& n4 = X4 )
& ~ ( n1 = X5
& n5 = X4 )
& ~ ( n2 = X4
& n2 = X5 )
& ~ ( n2 = X4
& n3 = X5 )
& ~ ( n2 = X4
& n4 = X5 )
& ~ ( n2 = X4
& n5 = X5 )
& ~ ( n2 = X5
& n3 = X4 )
& ~ ( n2 = X5
& n4 = X4 )
& ~ ( n2 = X5
& n5 = X4 )
& ~ ( n3 = X4
& n3 = X5 )
& ~ ( n3 = X4
& n4 = X5 )
& ~ ( n3 = X4
& n5 = X5 )
& ~ ( n3 = X5
& n4 = X4 )
& ~ ( n3 = X5
& n5 = X4 )
& ~ ( n4 = X4
& n4 = X5 )
& ~ ( n4 = X4
& n5 = X5 )
& ~ ( n4 = X5
& n5 = X4 )
& ~ ( n5 = X4
& n5 = X5 )
& n0 = X4
& n0 = X5
& n3 = X4
& n5 = X5 )
=> a_select2(xinit_noise,n0) = n0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0481) ).
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
& n1 = X5 )
& ~ ( n0 = X4
& n2 = X5 )
& ~ ( n0 = X4
& n3 = X5 )
& ~ ( n0 = X4
& n4 = X5 )
& ~ ( n0 = X4
& n5 = X5 )
& ~ ( n0 = X5
& n1 = X4 )
& ~ ( n0 = X5
& n2 = X4 )
& ~ ( n0 = X5
& n3 = X4 )
& ~ ( n0 = X5
& n4 = X4 )
& ~ ( n0 = X5
& n5 = X4 )
& ~ ( n1 = X4
& n1 = X5 )
& ~ ( n1 = X4
& n2 = X5 )
& ~ ( n1 = X4
& n3 = X5 )
& ~ ( n1 = X4
& n4 = X5 )
& ~ ( n1 = X4
& n5 = X5 )
& ~ ( n1 = X5
& n2 = X4 )
& ~ ( n1 = X5
& n3 = X4 )
& ~ ( n1 = X5
& n4 = X4 )
& ~ ( n1 = X5
& n5 = X4 )
& ~ ( n2 = X4
& n2 = X5 )
& ~ ( n2 = X4
& n3 = X5 )
& ~ ( n2 = X4
& n4 = X5 )
& ~ ( n2 = X4
& n5 = X5 )
& ~ ( n2 = X5
& n3 = X4 )
& ~ ( n2 = X5
& n4 = X4 )
& ~ ( n2 = X5
& n5 = X4 )
& ~ ( n3 = X4
& n3 = X5 )
& ~ ( n3 = X4
& n4 = X5 )
& ~ ( n3 = X4
& n5 = X5 )
& ~ ( n3 = X5
& n4 = X4 )
& ~ ( n3 = X5
& n5 = X4 )
& ~ ( n4 = X4
& n4 = X5 )
& ~ ( n4 = X4
& n5 = X5 )
& ~ ( n4 = X5
& n5 = X4 )
& ~ ( n5 = X4
& n5 = X5 )
& n0 = X4
& n0 = X5
& n3 = X4
& n5 = X5 )
=> a_select2(xinit_noise,n0) = n0 ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f136,plain,
( ? [X4,X5] :
( n0 != a_select2(xinit_noise,n0)
& ( n0 != X4
| n1 != X5 )
& ( n0 != X4
| n2 != X5 )
& ( n0 != X4
| n3 != X5 )
& ( n0 != X4
| n4 != X5 )
& ( n0 != X4
| n5 != X5 )
& ( n0 != X5
| n1 != X4 )
& ( n0 != X5
| n2 != X4 )
& ( n0 != X5
| n3 != X4 )
& ( n0 != X5
| n4 != X4 )
& ( n0 != X5
| n5 != X4 )
& ( n1 != X4
| n1 != X5 )
& ( n1 != X4
| n2 != X5 )
& ( n1 != X4
| n3 != X5 )
& ( n1 != X4
| n4 != X5 )
& ( n1 != X4
| n5 != X5 )
& ( n1 != X5
| n2 != X4 )
& ( n1 != X5
| n3 != X4 )
& ( n1 != X5
| n4 != X4 )
& ( n1 != X5
| n5 != X4 )
& ( n2 != X4
| n2 != X5 )
& ( n2 != X4
| n3 != X5 )
& ( n2 != X4
| n4 != X5 )
& ( n2 != X4
| n5 != X5 )
& ( n2 != X5
| n3 != X4 )
& ( n2 != X5
| n4 != X4 )
& ( n2 != X5
| n5 != X4 )
& ( n3 != X4
| n3 != X5 )
& ( n3 != X4
| n4 != X5 )
& ( n3 != X4
| n5 != X5 )
& ( n3 != X5
| n4 != X4 )
& ( n3 != X5
| n5 != X4 )
& ( n4 != X4
| n4 != X5 )
& ( n4 != X4
| n5 != X5 )
& ( n4 != X5
| n5 != X4 )
& ( n5 != X4
| n5 != X5 )
& n0 = X4
& n0 = X5
& n3 = X4
& n5 = X5
& 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,n0)
& ( n0 != X4
| n1 != X5 )
& ( n0 != X4
| n2 != X5 )
& ( n0 != X4
| n3 != X5 )
& ( n0 != X4
| n4 != X5 )
& ( n0 != X4
| n5 != X5 )
& ( n0 != X5
| n1 != X4 )
& ( n0 != X5
| n2 != X4 )
& ( n0 != X5
| n3 != X4 )
& ( n0 != X5
| n4 != X4 )
& ( n0 != X5
| n5 != X4 )
& ( n1 != X4
| n1 != X5 )
& ( n1 != X4
| n2 != X5 )
& ( n1 != X4
| n3 != X5 )
& ( n1 != X4
| n4 != X5 )
& ( n1 != X4
| n5 != X5 )
& ( n1 != X5
| n2 != X4 )
& ( n1 != X5
| n3 != X4 )
& ( n1 != X5
| n4 != X4 )
& ( n1 != X5
| n5 != X4 )
& ( n2 != X4
| n2 != X5 )
& ( n2 != X4
| n3 != X5 )
& ( n2 != X4
| n4 != X5 )
& ( n2 != X4
| n5 != X5 )
& ( n2 != X5
| n3 != X4 )
& ( n2 != X5
| n4 != X4 )
& ( n2 != X5
| n5 != X4 )
& ( n3 != X4
| n3 != X5 )
& ( n3 != X4
| n4 != X5 )
& ( n3 != X4
| n5 != X5 )
& ( n3 != X5
| n4 != X4 )
& ( n3 != X5
| n5 != X4 )
& ( n4 != X4
| n4 != X5 )
& ( n4 != X4
| n5 != X5 )
& ( n4 != X5
| n5 != X4 )
& ( n5 != X4
| n5 != X5 )
& n0 = X4
& n0 = X5
& n3 = X4
& n5 = X5
& 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,n0)
& ( n0 != X0
| n1 != X1 )
& ( n0 != X0
| n2 != X1 )
& ( n0 != X0
| n3 != X1 )
& ( n0 != X0
| n4 != X1 )
& ( n0 != X0
| n5 != X1 )
& ( n0 != X1
| n1 != X0 )
& ( n0 != X1
| n2 != X0 )
& ( n0 != X1
| n3 != X0 )
& ( n0 != X1
| n4 != X0 )
& ( n0 != X1
| n5 != X0 )
& ( n1 != X0
| n1 != X1 )
& ( n1 != X0
| n2 != X1 )
& ( n1 != X0
| n3 != X1 )
& ( n1 != X0
| n4 != X1 )
& ( n1 != X0
| n5 != X1 )
& ( n1 != X1
| n2 != X0 )
& ( n1 != X1
| n3 != X0 )
& ( n1 != X1
| n4 != X0 )
& ( n1 != X1
| n5 != X0 )
& ( n2 != X0
| n2 != X1 )
& ( n2 != X0
| n3 != X1 )
& ( n2 != X0
| n4 != X1 )
& ( n2 != X0
| n5 != X1 )
& ( n2 != X1
| n3 != X0 )
& ( n2 != X1
| n4 != X0 )
& ( n2 != X1
| n5 != X0 )
& ( n3 != X0
| n3 != X1 )
& ( n3 != X0
| n4 != X1 )
& ( n3 != X0
| n5 != X1 )
& ( n3 != X1
| n4 != X0 )
& ( n3 != X1
| n5 != X0 )
& ( n4 != X0
| n4 != X1 )
& ( n4 != X0
| n5 != X1 )
& ( n4 != X1
| n5 != X0 )
& ( n5 != X0
| n5 != X1 )
& n0 = X0
& n0 = X1
& n3 = X0
& n5 = X1
& 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,n0)
& ( n0 != sK31
| n1 != sK32 )
& ( n0 != sK31
| n2 != sK32 )
& ( n0 != sK31
| n3 != sK32 )
& ( n0 != sK31
| n4 != sK32 )
& ( n0 != sK31
| n5 != sK32 )
& ( n0 != sK32
| n1 != sK31 )
& ( n0 != sK32
| n2 != sK31 )
& ( n0 != sK32
| n3 != sK31 )
& ( n0 != sK32
| n4 != sK31 )
& ( n0 != sK32
| n5 != sK31 )
& ( n1 != sK31
| n1 != sK32 )
& ( n1 != sK31
| n2 != sK32 )
& ( n1 != sK31
| n3 != sK32 )
& ( n1 != sK31
| n4 != sK32 )
& ( n1 != sK31
| n5 != sK32 )
& ( n1 != sK32
| n2 != sK31 )
& ( n1 != sK32
| n3 != sK31 )
& ( n1 != sK32
| n4 != sK31 )
& ( n1 != sK32
| n5 != sK31 )
& ( n2 != sK31
| n2 != sK32 )
& ( n2 != sK31
| n3 != sK32 )
& ( n2 != sK31
| n4 != sK32 )
& ( n2 != sK31
| n5 != sK32 )
& ( n2 != sK32
| n3 != sK31 )
& ( n2 != sK32
| n4 != sK31 )
& ( n2 != sK32
| n5 != sK31 )
& ( n3 != sK31
| n3 != sK32 )
& ( n3 != sK31
| n4 != sK32 )
& ( n3 != sK31
| n5 != sK32 )
& ( n3 != sK32
| n4 != sK31 )
& ( n3 != sK32
| n5 != sK31 )
& ( n4 != sK31
| n4 != sK32 )
& ( n4 != sK31
| n5 != sK32 )
& ( n4 != sK32
| n5 != sK31 )
& ( n5 != sK31
| n5 != sK32 )
& n0 = sK31
& n0 = sK32
& n3 = sK31
& n5 = sK32
& 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 = sK32,
inference(cnf_transformation,[],[f191]) ).
fof(f309,plain,
n3 = sK31,
inference(cnf_transformation,[],[f191]) ).
fof(f318,plain,
( n3 != sK31
| n5 != sK32 ),
inference(cnf_transformation,[],[f191]) ).
fof(f483,plain,
( sK31 != sK31
| sK32 != sK32 ),
inference(definition_unfolding,[],[f318,f309,f308]) ).
fof(f531,plain,
$false,
inference(trivial_inequality_removal,[],[f483]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV223+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.18 % Computer : n001.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Mon Sep 28 10:19:18 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21 Running first-order model finding
% 0.10/0.21 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.26 % (263506)Will run a generic schedule for satisfiability detection.
% 0.10/0.26 % (263514)dis+10_1_sil=32000:sp=arity:random_seed=1177193710:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.26 % (263514) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-263506-263514"...
% 0.10/0.26 % (263512)% WARNING: option uhcvi not known.
% 0.10/0.26 % (263514)...printing done.
% 0.10/0.26 % (263514)Refutation found. Thanks to Tanya!
% 0.10/0.26 % SZS status Theorem for theBenchmark
% 0.10/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.26 % (263514)------------------------------
% 0.10/0.26 % (263514)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.26 % (263514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.26 % (263514)CaDiCaL version: 2.1.3
% 0.10/0.26 % (263514)Termination reason: Refutation
% 0.10/0.26 % (263514)Time elapsed: 0.003 s
% 0.10/0.26 % (263514)Peak memory usage: 11 MB
% 0.10/0.26 % (263514)Instructions burned: 10 (million)
% 0.10/0.26 % (263506)Success in time 0.033 s
% 0.10/0.26 % Vampire exiting
%------------------------------------------------------------------------------