%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV231+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:08:26 PM UTC 2026
% Result : Theorem 3.65s 1.32s
% Output : Refutation 3.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 3 unt; 0 def)
% Number of atoms : 277 ( 204 equ)
% Maximal formula atoms : 45 ( 25 avg)
% Number of connectives : 437 ( 171 ~; 86 |; 170 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 15 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 = X5
& n4 = X4 )
& ~ ( n0 = X5
& n5 = X4 )
& ~ ( n1 = X5
& n4 = X4 )
& ~ ( n1 = X5
& n5 = X4 )
& ~ ( n2 = X5
& n4 = X4 )
& ~ ( n2 = X5
& n5 = X4 )
& ~ ( 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 )
& n3 = X4
& n4 = X5
& n5 = X4
& n5 = X5 )
=> n0 = a_select2(xinit_noise,n5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0801) ).
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 = X5
& n4 = X4 )
& ~ ( n0 = X5
& n5 = X4 )
& ~ ( n1 = X5
& n4 = X4 )
& ~ ( n1 = X5
& n5 = X4 )
& ~ ( n2 = X5
& n4 = X4 )
& ~ ( n2 = X5
& n5 = X4 )
& ~ ( 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 )
& n3 = X4
& n4 = X5
& n5 = X4
& n5 = X5 )
=> n0 = a_select2(xinit_noise,n5) ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f87,plain,
( ? [X4,X5] :
( n0 != a_select2(xinit_noise,n5)
& ( n0 != X5
| n4 != X4 )
& ( n0 != X5
| n5 != X4 )
& ( n1 != X5
| n4 != X4 )
& ( n1 != X5
| n5 != X4 )
& ( n2 != X5
| n4 != X4 )
& ( n2 != X5
| n5 != X4 )
& ( 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 )
& n3 = X4
& n4 = X5
& n5 = 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(f88,plain,
( ? [X4,X5] :
( n0 != a_select2(xinit_noise,n5)
& ( n0 != X5
| n4 != X4 )
& ( n0 != X5
| n5 != X4 )
& ( n1 != X5
| n4 != X4 )
& ( n1 != X5
| n5 != X4 )
& ( n2 != X5
| n4 != X4 )
& ( n2 != X5
| n5 != X4 )
& ( 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 )
& n3 = X4
& n4 = X5
& n5 = 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,[],[f87]) ).
fof(f110,plain,
( ? [X0,X1] :
( n0 != a_select2(xinit_noise,n5)
& ( n0 != X1
| n4 != X0 )
& ( n0 != X1
| n5 != X0 )
& ( n1 != X1
| n4 != X0 )
& ( n1 != X1
| n5 != X0 )
& ( n2 != X1
| n4 != X0 )
& ( n2 != X1
| n5 != X0 )
& ( 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 )
& n3 = X0
& n4 = X1
& n5 = 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,[],[f88]) ).
fof(f111,plain,
( n0 != a_select2(xinit_noise,n5)
& ( n0 != sK1
| n4 != sK0 )
& ( n0 != sK1
| n5 != sK0 )
& ( n1 != sK1
| n4 != sK0 )
& ( n1 != sK1
| n5 != sK0 )
& ( n2 != sK1
| n4 != sK0 )
& ( n2 != sK1
| n5 != sK0 )
& ( n3 != sK0
| n5 != sK1 )
& ( n3 != sK1
| n4 != sK0 )
& ( n3 != sK1
| n5 != sK0 )
& ( n4 != sK0
| n4 != sK1 )
& ( n4 != sK0
| n5 != sK1 )
& ( n4 != sK1
| n5 != sK0 )
& ( n5 != sK0
| n5 != sK1 )
& n3 = sK0
& n4 = sK1
& n5 = sK0
& n5 = sK1
& leq(n0,sK0)
& leq(n0,sK1)
& leq(sK0,n5)
& leq(sK1,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,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f110]) ).
fof(f121,plain,
n5 = sK0,
inference(cnf_transformation,[],[f111]) ).
fof(f122,plain,
n4 = sK1,
inference(cnf_transformation,[],[f111]) ).
fof(f125,plain,
( n4 != sK1
| n5 != sK0 ),
inference(cnf_transformation,[],[f111]) ).
fof(f190,plain,
( sK1 != sK1
| sK0 != sK0 ),
inference(definition_unfolding,[],[f125,f122,f121]) ).
fof(f216,plain,
$false,
inference(trivial_inequality_removal,[],[f190]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV231+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n001.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 10:19:48 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 Running first-order theorem proving
% 0.07/0.21 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.65/1.32 % (264757)Detected formulas, will run a generic FOF schedule.
% 3.65/1.32 % (264779)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=340263265:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.65/1.32 % (264777)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=4196224536:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.65/1.32 % (264781)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2877540092:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.65/1.32 % (264783)dis-21_1_sil=8000:lcm=predicate:random_seed=818689421:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.65/1.32 % (264780)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=379752552:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.65/1.32 % (264782)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1460715473:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.65/1.32 % (264781)First to succeed.
% 3.65/1.32 % (264780)Also succeeded, but the first one will report.
% 3.65/1.32 % (264781)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-264757"
% 3.65/1.32 % (264783)Also succeeded, but the first one will report.
% 3.65/1.32 % (264782)Also succeeded, but the first one will report.
% 3.65/1.32 % (264778)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2830124847:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.65/1.32 % (264781)Refutation found. Thanks to Tanya!
% 3.65/1.32 % SZS status Theorem for theBenchmark
% 3.65/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 3.65/1.32 % (264781)------------------------------
% 3.65/1.32 % (264781)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.65/1.32 % (264781)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.65/1.32 % (264781)CaDiCaL version: 2.1.3
% 3.65/1.32 % (264781)Termination reason: Refutation
% 3.65/1.32 % (264781)Time elapsed: 0.003 s
% 3.65/1.32 % (264781)Peak memory usage: 88 MB
% 3.65/1.32 % (264781)Instructions burned: 3 (million)
% 3.65/1.32 % (264781)------------------------------
% 3.65/1.32 % (264781)------------------------------
% 3.65/1.32 % (264757)Success in time 0.413 s
% 3.65/1.32 % Vampire exiting
%------------------------------------------------------------------------------