%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV217+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 : 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 01:08:24 PM UTC 2026
% Result : Theorem 0.20s 0.91s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 12 unt; 2 def)
% Number of atoms : 316 ( 279 equ)
% Maximal formula atoms : 58 ( 13 avg)
% Number of connectives : 506 ( 214 ~; 80 |; 206 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 6 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
! [X0,X1] :
( ( leq(n0,X0)
& leq(n0,X1)
& leq(X0,n5)
& leq(X1,n5) )
=> ( ( ~ ( n0 = X0
& n4 = X1 )
& ~ ( n0 = X0
& n5 = X1 )
& ~ ( n0 = X1
& n3 = X0 )
& ~ ( n0 = X1
& n4 = X0 )
& ~ ( n0 = X1
& n5 = X0 )
& ~ ( n1 = X0
& n4 = X1 )
& ~ ( n1 = X0
& n5 = X1 )
& ~ ( n1 = X1
& n3 = X0 )
& ~ ( n1 = X1
& n4 = X0 )
& ~ ( n1 = X1
& n5 = X0 )
& ~ ( 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 )
& n2 = X0
& n2 = X1
& n3 = X1 )
=> times(divide(n1,n400),a_select2(sigma,n2)) = n0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0241) ).
fof(f54,negated_conjecture,
~ ! [X0,X1] :
( ( leq(n0,X0)
& leq(n0,X1)
& leq(X0,n5)
& leq(X1,n5) )
=> ( ( ~ ( n0 = X0
& n4 = X1 )
& ~ ( n0 = X0
& n5 = X1 )
& ~ ( n0 = X1
& n3 = X0 )
& ~ ( n0 = X1
& n4 = X0 )
& ~ ( n0 = X1
& n5 = X0 )
& ~ ( n1 = X0
& n4 = X1 )
& ~ ( n1 = X0
& n5 = X1 )
& ~ ( n1 = X1
& n3 = X0 )
& ~ ( n1 = X1
& n4 = X0 )
& ~ ( n1 = X1
& n5 = X0 )
& ~ ( 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 )
& n2 = X0
& n2 = X1
& n3 = X1 )
=> times(divide(n1,n400),a_select2(sigma,n2)) = n0 ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f98,plain,
? [X0,X1] :
( n0 != times(divide(n1,n400),a_select2(sigma,n2))
& ( n0 != X0
| n4 != X1 )
& ( n0 != X0
| n5 != X1 )
& ( n0 != X1
| n3 != X0 )
& ( n0 != X1
| n4 != X0 )
& ( n0 != X1
| n5 != X0 )
& ( n1 != X0
| n4 != X1 )
& ( n1 != X0
| n5 != X1 )
& ( n1 != X1
| n3 != X0 )
& ( n1 != X1
| n4 != X0 )
& ( n1 != X1
| n5 != X0 )
& ( 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 )
& n2 = X0
& n2 = X1
& n3 = X1
& leq(n0,X0)
& leq(n0,X1)
& leq(X0,n5)
& leq(X1,n5) ),
inference(ennf_transformation,[],[f54]) ).
fof(f99,plain,
? [X0,X1] :
( n0 != times(divide(n1,n400),a_select2(sigma,n2))
& ( n0 != X0
| n4 != X1 )
& ( n0 != X0
| n5 != X1 )
& ( n0 != X1
| n3 != X0 )
& ( n0 != X1
| n4 != X0 )
& ( n0 != X1
| n5 != X0 )
& ( n1 != X0
| n4 != X1 )
& ( n1 != X0
| n5 != X1 )
& ( n1 != X1
| n3 != X0 )
& ( n1 != X1
| n4 != X0 )
& ( n1 != X1
| n5 != X0 )
& ( 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 )
& n2 = X0
& n2 = X1
& n3 = X1
& leq(n0,X0)
& leq(n0,X1)
& leq(X0,n5)
& leq(X1,n5) ),
inference(flattening,[],[f98]) ).
fof(f141,plain,
( n0 != times(divide(n1,n400),a_select2(sigma,n2))
& ( n0 != sK0
| n4 != sK1 )
& ( n0 != sK0
| n5 != sK1 )
& ( n0 != sK1
| n3 != sK0 )
& ( n0 != sK1
| n4 != sK0 )
& ( n0 != sK1
| n5 != sK0 )
& ( n1 != sK0
| n4 != sK1 )
& ( n1 != sK0
| n5 != sK1 )
& ( n1 != sK1
| n3 != sK0 )
& ( n1 != sK1
| n4 != sK0 )
& ( n1 != sK1
| n5 != sK0 )
& ( n2 != sK0
| n3 != sK1 )
& ( n2 != sK0
| n4 != sK1 )
& ( n2 != sK0
| n5 != sK1 )
& ( n2 != sK1
| n3 != sK0 )
& ( n2 != sK1
| n4 != sK0 )
& ( n2 != sK1
| n5 != sK0 )
& ( n3 != sK0
| n3 != sK1 )
& ( n3 != sK0
| n4 != sK1 )
& ( 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 )
& n2 = sK0
& n2 = sK1
& n3 = sK1
& leq(n0,sK0)
& leq(n0,sK1)
& leq(sK0,n5)
& leq(sK1,n5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f99]) ).
fof(f158,plain,
n3 = sK1,
inference(cnf_transformation,[],[f141]) ).
fof(f159,plain,
n2 = sK1,
inference(cnf_transformation,[],[f141]) ).
fof(f160,plain,
n2 = sK0,
inference(cnf_transformation,[],[f141]) ).
fof(f172,plain,
( n2 != sK1
| n3 != sK0 ),
inference(cnf_transformation,[],[f141]) ).
fof(f293,plain,
( sK0 != sK1
| sK0 != sK1 ),
inference(definition_unfolding,[],[f172,f160,f158]) ).
fof(f301,plain,
sK0 = sK1,
inference(definition_unfolding,[],[f159,f160]) ).
fof(f344,definition,
! [X0,X1] :
( sQ13_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ13_eqProxy])],[equality_proxy_definition]) ).
fof(f359,plain,
( ~ sQ13_eqProxy(sK0,sK1)
| ~ sQ13_eqProxy(sK0,sK1) ),
inference(equality_proxy_replacement,[],[f293,f344,f344]) ).
fof(f371,plain,
sQ13_eqProxy(sK0,sK1),
inference(equality_proxy_replacement,[],[f301,f344]) ).
fof(f433,plain,
~ sQ13_eqProxy(sK0,sK1),
inference(duplicate_literal_removal,[],[f359]) ).
fof(f456,definition,
( spl14_6
<=> sQ13_eqProxy(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl14_6])],[avatar_definition]) ).
fof(f457,plain,
( ~ sQ13_eqProxy(sK0,sK1)
| spl14_6 ),
inference(avatar_component_clause,[],[f456]) ).
fof(f463,plain,
~ spl14_6,
inference(avatar_split_clause,[],[f433,f456]) ).
fof(f492,plain,
( $false
| spl14_6 ),
inference(resolution,[],[f371,f457]) ).
fof(f493,plain,
spl14_6,
inference(avatar_contradiction_clause,[],[f492]) ).
cnf(s12,plain,
~ spl14_6,
inference(sat_conversion,[],[f463]) ).
cnf(s26,plain,
spl14_6,
inference(sat_conversion,[],[f493]) ).
cnf(s29,plain,
$false,
inference(rat,[],[s12,s26]) ).
fof(f494,plain,
$false,
inference(avatar_sat_refutation,[],[s29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV217+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.19 % Computer : n011.cluster.edu
% 0.12/0.19 % Model : x86_64 x86_64
% 0.12/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.19 % Memory : 8046.5625MB
% 0.12/0.19 % OS : Linux 6.8.0-71-generic
% 0.12/0.19 % CPULimit : 300
% 0.12/0.19 % WCLimit : 300
% 0.12/0.19 % DateTime : Mon Sep 28 10:13:01 UTC 2026
% 0.12/0.19 % CPUTime :
% 0.12/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.23 Running first-order theorem proving
% 0.12/0.23 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
% 0.20/0.91 % (3300111)Detected formulas, will run a generic FOF schedule.
% 0.20/0.91 % (3300122)dis-21_1_sil=8000:lcm=predicate:random_seed=300963510: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)
% 0.20/0.91 % (3300122)First to succeed.
% 0.20/0.91 % (3300122)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3300111"
% 0.20/0.91 % (3300116)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=272824373:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.20/0.91 % (3300121)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1911526189:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.20/0.91 % (3300118)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=1389749266:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.20/0.91 % (3300117)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=2913918092:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.20/0.91 % (3300119)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=895244874:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.20/0.91 % (3300120)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2557478326:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.20/0.91 % (3300120)Also succeeded, but the first one will report.
% 0.20/0.91 % (3300119)Also succeeded, but the first one will report.
% 0.20/0.91 % (3300121)Also succeeded, but the first one will report.
% 0.20/0.91 % (3300122)Refutation found. Thanks to Tanya!
% 0.20/0.91 % SZS status Theorem for theBenchmark
% 0.20/0.91 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.91 % (3300122)------------------------------
% 0.20/0.91 % (3300122)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/0.91 % (3300122)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.91 % (3300122)CaDiCaL version: 2.1.3
% 0.20/0.91 % (3300122)Termination reason: Refutation
% 0.20/0.91 % (3300122)Time elapsed: 0.003 s
% 0.20/0.91 % (3300122)Peak memory usage: 90 MB
% 0.20/0.91 % (3300122)Instructions burned: 9 (million)
% 0.20/0.91 % (3300122)------------------------------
% 0.20/0.91 % (3300122)------------------------------
% 0.20/0.91 % (3300111)Success in time 0.286 s
% 0.20/0.91 % Vampire exiting
%------------------------------------------------------------------------------