%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV617_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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:26:08 PM UTC 2026
% Result : Theorem 0.12s 0.26s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 38 ( 22 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 22 ( 13 ~; 6 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 26 ( 24 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-4 aty)
% Number of variables : 25 ( 25 !; 0 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
complex: $tType ).
tff(type_def_6,type,
bool: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(type_def_8,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
fFT_Mirabelle_root: nat > complex ).
tff(func_def_1,type,
inverse_divide:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_2,type,
minus_minus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_3,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_4,type,
times_times:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_5,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_6,type,
power_power:
!>[X0: $tType] : ( ( X0 * nat ) > X0 ) ).
tff(func_def_7,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_8,type,
fFalse: bool ).
tff(func_def_9,type,
fTrue: bool ).
tff(func_def_10,type,
k: nat ).
tff(func_def_11,type,
n: nat ).
tff(pred_def_1,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
power:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
field:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
mult_zero:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
group_add:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
semiring_0:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
zero_neq_one:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
division_ring:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
no_zero_divisors:
!>[X0: $tType] : $o ).
tff(pred_def_14,type,
linordered_field:
!>[X0: $tType] : $o ).
tff(pred_def_15,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_16,type,
field_inverse_zero:
!>[X0: $tType] : $o ).
tff(pred_def_17,type,
ordered_ab_group_add:
!>[X0: $tType] : $o ).
tff(pred_def_18,type,
ring_n68954251visors:
!>[X0: $tType] : $o ).
tff(pred_def_19,type,
ring_11004092258visors:
!>[X0: $tType] : $o ).
tff(pred_def_20,type,
divisi14063676e_zero:
!>[X0: $tType] : $o ).
tff(pred_def_21,type,
linord1117847801e_zero:
!>[X0: $tType] : $o ).
tff(pred_def_22,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_23,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_24,type,
pp: bool > $o ).
tff(f4,axiom,
! [X0: nat] : ( power_power(complex,fFT_Mirabelle_root(X0),X0) = one_one(complex) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_root__unity) ).
tff(f6,axiom,
! [X0: $tType] :
( monoid_mult(X0)
=> ! [X1: nat] : ( power_power(X0,one_one(X0),X1) = one_one(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_5_power__one) ).
tff(f7,axiom,
! [X0: $tType] :
( division_ring(X0)
=> ! [X1: X0] : ( inverse_divide(X0,zero_zero(X0),X1) = zero_zero(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_6_divide__zero__left) ).
tff(f10,axiom,
! [X0: $tType] :
( group_add(X0)
=> ! [X1: X0] : ( minus_minus(X0,X1,X1) = zero_zero(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_9_diff__self) ).
tff(f115,axiom,
division_ring(complex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Complex_Ocomplex___Fields_Odivision__ring) ).
tff(f117,axiom,
monoid_mult(complex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Complex_Ocomplex___Groups_Omonoid__mult) ).
tff(f119,axiom,
group_add(complex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Complex_Ocomplex___Groups_Ogroup__add) ).
tff(f127,conjecture,
inverse_divide(complex,minus_minus(complex,power_power(complex,power_power(complex,fFT_Mirabelle_root(n),n),k),one_one(complex)),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),one_one(complex))) = zero_zero(complex),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f128,negated_conjecture,
( ( ~ inverse_divide(complex,minus_minus(complex,power_power(complex,power_power(complex,fFT_Mirabelle_root(n),n),k),one_one(complex)),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),one_one(complex))) ) = zero_zero(complex) ),
inference(negated_conjecture,[status(cth)],[f127]) ).
tff(f129,plain,
inverse_divide(complex,minus_minus(complex,power_power(complex,power_power(complex,fFT_Mirabelle_root(n),n),k),one_one(complex)),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),one_one(complex))) != zero_zero(complex),
inference(flattening,[],[f128]) ).
tff(f143,plain,
! [X0: $tType] :
( ! [X1: nat] : ( power_power(X0,one_one(X0),X1) = one_one(X0) )
| ~ monoid_mult(X0) ),
inference(ennf_transformation,[],[f6]) ).
tff(f144,plain,
! [X0: $tType] :
( ! [X1: X0] : ( inverse_divide(X0,zero_zero(X0),X1) = zero_zero(X0) )
| ~ division_ring(X0) ),
inference(ennf_transformation,[],[f7]) ).
tff(f148,plain,
! [X0: $tType] :
( ! [X1: X0] : ( minus_minus(X0,X1,X1) = zero_zero(X0) )
| ~ group_add(X0) ),
inference(ennf_transformation,[],[f10]) ).
tff(f251,plain,
! [X0: nat] : ( one_one(complex) = power_power(complex,fFT_Mirabelle_root(X0),X0) ),
inference(cnf_transformation,[],[f4]) ).
tff(f254,plain,
! [X0: $tType,X1: nat] :
( ~ monoid_mult(X0)
| ( one_one(X0) = power_power(X0,one_one(X0),X1) ) ),
inference(cnf_transformation,[],[f143]) ).
tff(f255,plain,
! [X0: $tType,X1: X0] :
( ~ division_ring(X0)
| ( zero_zero(X0) = inverse_divide(X0,zero_zero(X0),X1) ) ),
inference(cnf_transformation,[],[f144]) ).
tff(f260,plain,
! [X0: $tType,X1: X0] :
( ~ group_add(X0)
| ( zero_zero(X0) = minus_minus(X0,X1,X1) ) ),
inference(cnf_transformation,[],[f148]) ).
tff(f397,plain,
division_ring(complex),
inference(cnf_transformation,[],[f115]) ).
tff(f399,plain,
monoid_mult(complex),
inference(cnf_transformation,[],[f117]) ).
tff(f401,plain,
group_add(complex),
inference(cnf_transformation,[],[f119]) ).
tff(f409,plain,
inverse_divide(complex,minus_minus(complex,power_power(complex,power_power(complex,fFT_Mirabelle_root(n),n),k),one_one(complex)),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),one_one(complex))) != zero_zero(complex),
inference(cnf_transformation,[],[f129]) ).
tff(f426,plain,
zero_zero(complex) != inverse_divide(complex,minus_minus(complex,power_power(complex,one_one(complex),k),one_one(complex)),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),one_one(complex))),
inference(superposition,[],[f409,f251]) ).
tff(f444,plain,
! [X0: complex] : ( zero_zero(complex) = minus_minus(complex,X0,X0) ),
inference(resolution,[],[f260,f401]) ).
tff(f481,plain,
! [X0: nat] : ( one_one(complex) = power_power(complex,one_one(complex),X0) ),
inference(resolution,[],[f254,f399]) ).
tff(f494,plain,
! [X0: complex] : ( zero_zero(complex) = inverse_divide(complex,zero_zero(complex),X0) ),
inference(resolution,[],[f255,f397]) ).
tff(f584,plain,
zero_zero(complex) != inverse_divide(complex,minus_minus(complex,one_one(complex),one_one(complex)),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),one_one(complex))),
inference(superposition,[],[f426,f481]) ).
tff(f586,plain,
! [X0: nat] : ( zero_zero(complex) != inverse_divide(complex,minus_minus(complex,power_power(complex,fFT_Mirabelle_root(X0),X0),power_power(complex,fFT_Mirabelle_root(X0),X0)),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),power_power(complex,fFT_Mirabelle_root(X0),X0))) ),
inference(superposition,[],[f584,f251]) ).
tff(f603,plain,
! [X0: nat] : ( zero_zero(complex) != inverse_divide(complex,zero_zero(complex),minus_minus(complex,power_power(complex,fFT_Mirabelle_root(n),k),power_power(complex,fFT_Mirabelle_root(X0),X0))) ),
inference(superposition,[],[f586,f444]) ).
tff(f609,plain,
$false,
inference(forward_subsumption_resolution,[],[f603,f494]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV617_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.17 % Computer : n013.cluster.edu
% 0.12/0.17 % Model : x86_64 x86_64
% 0.12/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.17 % Memory : 8046.5625MB
% 0.12/0.17 % OS : Linux 6.8.0-71-generic
% 0.12/0.17 % CPULimit : 300
% 0.12/0.17 % WCLimit : 300
% 0.12/0.17 % DateTime : Mon Sep 28 12:03:06 UTC 2026
% 0.12/0.18 % CPUTime :
% 0.12/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.21 Running first-order model finding
% 0.12/0.21 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.26 % (1132033)Will run a generic schedule for satisfiability detection.
% 0.12/0.26 % (1132043)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1477481699:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.26 % (1132039)% WARNING: option uhcvi not known.
% 0.12/0.26 % (1132043) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1132033-1132043"...
% 0.12/0.26 % (1132038)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=158736277_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.26 % (1132039)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=696952214:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.26 % (1132040)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2317151649:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.26 % (1132041)dis+10_1_sil=32000:sp=arity:random_seed=2527228744:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.26 % (1132042)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1776657814:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.26 % (1132043)...printing done.
% 0.12/0.26 % (1132044)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=543900227:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.26 % (1132043)Refutation found. Thanks to Tanya!
% 0.12/0.26 % SZS status Theorem for theBenchmark
% 0.12/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.26 % (1132043)------------------------------
% 0.12/0.26 % (1132043)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.26 % (1132043)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.26 % (1132043)CaDiCaL version: 2.1.3
% 0.12/0.26 % (1132043)Termination reason: Refutation
% 0.12/0.26 % (1132043)Time elapsed: 0.007 s
% 0.12/0.26 % (1132043)Peak memory usage: 12 MB
% 0.12/0.26 % (1132043)Instructions burned: 18 (million)
% 0.12/0.26 % (1132033)Success in time 0.037 s
% 0.12/0.26 % Vampire exiting
%------------------------------------------------------------------------------