%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV215+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 : n012.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:29 PM UTC 2026
% Result : Theorem 0.08s 0.16s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 3 unt; 0 def)
% Number of atoms : 382 ( 361 equ)
% Maximal formula atoms : 75 ( 38 avg)
% Number of connectives : 644 ( 272 ~; 101 |; 267 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 46 ( 23 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 8 ( 4 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
! [X0,X1] :
( ( leq(n0,X0)
& leq(n0,X1)
& leq(X0,n5)
& leq(X1,n5) )
=> ( ( ~ ( 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
& n2 = X0
& n2 = X1
& n4 = X1 )
=> n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0161) ).
fof(f54,negated_conjecture,
~ ! [X0,X1] :
( ( leq(n0,X0)
& leq(n0,X1)
& leq(X0,n5)
& leq(X1,n5) )
=> ( ( ~ ( 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
& n2 = X0
& n2 = X1
& n4 = X1 )
=> n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f143,plain,
? [X0,X1] :
( n0 != times(divide(n1,n400),a_select2(sigma,n2))
& ( 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
& n2 = X0
& n2 = X1
& n4 = X1
& leq(n0,X0)
& leq(n0,X1)
& leq(X0,n5)
& leq(X1,n5) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,plain,
? [X0,X1] :
( n0 != times(divide(n1,n400),a_select2(sigma,n2))
& ( 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
& n2 = X0
& n2 = X1
& n4 = X1
& leq(n0,X0)
& leq(n0,X1)
& leq(X0,n5)
& leq(X1,n5) ),
inference(flattening,[],[f143]) ).
fof(f197,plain,
( n0 != times(divide(n1,n400),a_select2(sigma,n2))
& ( 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
& n2 = sK31
& n2 = sK32
& n4 = sK32
& leq(n0,sK31)
& leq(n0,sK32)
& leq(sK31,n5)
& leq(sK32,n5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK31,sK32]),skolemize(X0,sK31),skolemize(X1,sK32)],[f144]) ).
fof(f312,plain,
n4 = sK32,
inference(cnf_transformation,[],[f197]) ).
fof(f314,plain,
n2 = sK31,
inference(cnf_transformation,[],[f197]) ).
fof(f329,plain,
( n2 != sK31
| n4 != sK32 ),
inference(cnf_transformation,[],[f197]) ).
fof(f486,plain,
( sK31 != sK31
| sK32 != sK32 ),
inference(definition_unfolding,[],[f329,f314,f312]) ).
fof(f540,plain,
$false,
inference(trivial_inequality_removal,[],[f486]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV215+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Mon Sep 28 10:12:19 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.12 Running first-order model finding
% 0.08/0.12 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.08/0.16 % (3280117)Will run a generic schedule for satisfiability detection.
% 0.08/0.16 % (3280123)% WARNING: option uhcvi not known.
% 0.08/0.16 % (3280125)dis+10_1_sil=32000:sp=arity:random_seed=169510591:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.16 % (3280122)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3496742009_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.16 % (3280128)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=498627917:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.16 % (3280123)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1487390489:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.16 % (3280124)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3606305486:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.16 % (3280126)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2962164295:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.16 % (3280127)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3138938422:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.16 % (3280125) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3280117-3280125"...
% 0.08/0.16 % (3280128) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3280117-3280128"...
% 0.08/0.16 % (3280127) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3280117-3280127"...
% 0.08/0.16 % (3280124) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3280117-3280124"...
% 0.08/0.16 % (3280123) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3280117-3280123"...
% 0.08/0.16 % (3280125)...printing done.
% 0.08/0.16 % (3280128)...printing done.
% 0.08/0.16 % (3280127)...printing done.
% 0.08/0.16 % (3280124)...printing done.
% 0.08/0.16 % (3280123)...printing done.
% 0.08/0.16 % (3280125)Refutation found. Thanks to Tanya!
% 0.08/0.16 % SZS status Theorem for theBenchmark
% 0.08/0.16 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.16 % (3280125)------------------------------
% 0.08/0.16 % (3280125)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.16 % (3280125)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.16 % (3280125)CaDiCaL version: 2.1.3
% 0.08/0.16 % (3280125)Termination reason: Refutation
% 0.08/0.16 % (3280125)Time elapsed: 0.003 s
% 0.08/0.16 % (3280125)Peak memory usage: 11 MB
% 0.08/0.16 % (3280125)Instructions burned: 9 (million)
% 0.08/0.16 % (3280117)Success in time 0.034 s
% 0.08/0.16 % Vampire exiting
%------------------------------------------------------------------------------