%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV163+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:22 PM UTC 2026
% Result : Theorem 0.20s 0.29s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 19 unt; 1 def)
% Number of atoms : 113 ( 25 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 104 ( 36 ~; 28 |; 30 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 11 con; 0-3 aty)
% Number of variables : 35 ( 0 sgn 32 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
=> leq(X0,succ(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ) ).
fof(f13,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> gt(succ(X1),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
fof(f28,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
fof(f29,axiom,
! [X0] : plus(X0,n1) = succ(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(f53,conjecture,
( ( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X0] :
( ( leq(n0,X0)
& leq(X0,pred(pv10)) )
=> sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 ) )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,tptp_minus_1) )
=> a_select3(q,pv10,X1) = divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0013) ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,n135299)
& ! [X0] :
( ( leq(n0,X0)
& leq(X0,pred(pv10)) )
=> sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 ) )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,tptp_minus_1) )
=> a_select3(q,pv10,X1) = divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f85,axiom,
! [X0] :
( ( leq(n0,X0)
& leq(X0,n0) )
=> X0 = n0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',finite_domain_0) ).
fof(f110,plain,
! [X0,X1] :
( leq(X0,succ(X1))
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f143,plain,
( ? [X1] :
( a_select3(q,pv10,X1) != divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
& leq(n0,X1)
& leq(X1,tptp_minus_1) )
& leq(n0,pv10)
& leq(pv10,n135299)
& ! [X0] :
( sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1
| ~ leq(n0,X0)
| ~ leq(X0,pred(pv10)) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,plain,
( ? [X1] :
( a_select3(q,pv10,X1) != divide(sqrt(times(minus(a_select3(center,X1,n0),a_select2(x,pv10)),minus(a_select3(center,X1,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
& leq(n0,X1)
& leq(X1,tptp_minus_1) )
& leq(n0,pv10)
& leq(pv10,n135299)
& ! [X0] :
( sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1
| ~ leq(n0,X0)
| ~ leq(X0,pred(pv10)) ) ),
inference(flattening,[],[f143]) ).
fof(f149,plain,
! [X0] :
( X0 = n0
| ~ leq(n0,X0)
| ~ leq(X0,n0) ),
inference(ennf_transformation,[],[f85]) ).
fof(f150,plain,
! [X0] :
( X0 = n0
| ~ leq(n0,X0)
| ~ leq(X0,n0) ),
inference(flattening,[],[f149]) ).
fof(f165,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ~ gt(succ(X1),X0) )
& ( gt(succ(X1),X0)
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f197,plain,
( ? [X0] :
( a_select3(q,pv10,X0) != divide(sqrt(times(minus(a_select3(center,X0,n0),a_select2(x,pv10)),minus(a_select3(center,X0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
& leq(n0,X0)
& leq(X0,tptp_minus_1) )
& leq(n0,pv10)
& leq(pv10,n135299)
& ! [X1] :
( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
| ~ leq(n0,X1)
| ~ leq(X1,pred(pv10)) ) ),
inference(rectify,[],[f144]) ).
fof(f198,plain,
( a_select3(q,pv10,sK31) != divide(sqrt(times(minus(a_select3(center,sK31,n0),a_select2(x,pv10)),minus(a_select3(center,sK31,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
& leq(n0,sK31)
& leq(sK31,tptp_minus_1)
& leq(n0,pv10)
& leq(pv10,n135299)
& ! [X1] :
( n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index))
| ~ leq(n0,X1)
| ~ leq(X1,pred(pv10)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK31]),skolemize(X0,sK31)],[f197]) ).
fof(f201,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f209,plain,
! [X0,X1] :
( leq(X0,succ(X1))
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f210,plain,
! [X0,X1] :
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f165]) ).
fof(f278,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f279,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f312,plain,
leq(sK31,tptp_minus_1),
inference(cnf_transformation,[],[f198]) ).
fof(f313,plain,
leq(n0,sK31),
inference(cnf_transformation,[],[f198]) ).
fof(f345,plain,
! [X0] :
( ~ leq(n0,X0)
| n0 = X0
| ~ leq(X0,n0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f357,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| leq(X0,plus(X1,n1)) ),
inference(definition_unfolding,[],[f209,f279]) ).
fof(f359,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| gt(plus(X1,n1),X0) ),
inference(definition_unfolding,[],[f210,f279]) ).
fof(f360,plain,
n0 = plus(tptp_minus_1,n1),
inference(definition_unfolding,[],[f278,f279]) ).
fof(f767,plain,
leq(sK31,plus(tptp_minus_1,n1)),
inference(resolution,[],[f357,f312]) ).
fof(f768,plain,
leq(sK31,n0),
inference(forward_demodulation,[],[f767,f360]) ).
fof(f842,plain,
gt(plus(tptp_minus_1,n1),sK31),
inference(resolution,[],[f359,f312]) ).
fof(f846,plain,
gt(n0,sK31),
inference(forward_demodulation,[],[f842,f360]) ).
fof(f1071,definition,
( spl32_19
<=> n0 = sK31 ),
introduced(definition,[new_symbols(definition,[spl32_19])],[avatar_definition]) ).
fof(f1072,plain,
( n0 != sK31
| spl32_19 ),
inference(avatar_component_clause,[],[f1071]) ).
fof(f1073,plain,
( n0 = sK31
| ~ spl32_19 ),
inference(avatar_component_clause,[],[f1071]) ).
fof(f1137,plain,
( n0 = sK31
| ~ leq(sK31,n0) ),
inference(resolution,[],[f345,f313]) ).
fof(f1256,plain,
( gt(n0,n0)
| ~ spl32_19 ),
inference(superposition,[],[f846,f1073]) ).
fof(f1257,plain,
( $false
| ~ spl32_19 ),
inference(forward_subsumption_resolution,[],[f1256,f201]) ).
fof(f1258,plain,
~ spl32_19,
inference(avatar_contradiction_clause,[],[f1257]) ).
fof(f1288,plain,
( ~ leq(sK31,n0)
| spl32_19 ),
inference(forward_subsumption_resolution,[],[f1137,f1072]) ).
fof(f1298,plain,
( $false
| spl32_19 ),
inference(forward_subsumption_resolution,[],[f1288,f768]) ).
fof(f1299,plain,
spl32_19,
inference(avatar_contradiction_clause,[],[f1298]) ).
cnf(s21,plain,
~ spl32_19,
inference(sat_conversion,[],[f1258]) ).
cnf(s23,plain,
spl32_19,
inference(sat_conversion,[],[f1299]) ).
cnf(s24,plain,
$false,
inference(rat,[],[s21,s23]) ).
fof(f1300,plain,
$false,
inference(avatar_sat_refutation,[],[s24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV163+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n008.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 10:04:24 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.20/0.29 % (2148964)Will run a generic schedule for satisfiability detection.
% 0.20/0.29 % (2148973)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4151891698:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.29 % (2148970)% WARNING: option uhcvi not known.
% 0.20/0.29 % (2148969)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1997644181_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.29 % (2148970)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2789831919:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.29 % (2148972)dis+10_1_sil=32000:sp=arity:random_seed=1744844841:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.29 % (2148971)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=384144500:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.29 % (2148975)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3935909719:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.29 % (2148974)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2135126148:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.29 % (2148974) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2148964-2148974"...
% 0.20/0.29 % (2148974)...printing done.
% 0.20/0.29 % (2148973)Instruction limit reached!
% 0.20/0.29 % (2148973)------------------------------
% 0.20/0.29 % (2148973)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (2148973)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (2148973)CaDiCaL version: 2.1.3
% 0.20/0.29 % (2148973)Termination reason: Instruction limit
% 0.20/0.29 % (2148973)Termination phase: Saturation
% 0.20/0.29 % (2148973)Time elapsed: 0.035 s
% 0.20/0.29 % (2148973)Peak memory usage: 13 MB
% 0.20/0.29 % (2148973)Instructions burned: 116 (million)
% 0.20/0.29 % (2148974)Refutation found. Thanks to Tanya!
% 0.20/0.29 % SZS status Theorem for theBenchmark
% 0.20/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.29 % (2148974)------------------------------
% 0.20/0.29 % (2148974)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (2148974)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (2148974)CaDiCaL version: 2.1.3
% 0.20/0.29 % (2148974)Termination reason: Refutation
% 0.20/0.29 % (2148974)Time elapsed: 0.025 s
% 0.20/0.29 % (2148974)Peak memory usage: 13 MB
% 0.20/0.29 % (2148974)Instructions burned: 43 (million)
% 0.20/0.29 % (2148964)Success in time 0.061 s
% 0.20/0.29 % Vampire exiting
%------------------------------------------------------------------------------