%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV156+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 : n003.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:21 PM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 10 unt; 0 def)
% Number of atoms : 78 ( 23 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 76 ( 16 ~; 11 |; 38 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 12 con; 0-3 aty)
% Number of variables : 24 ( 22 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(f10,axiom,
! [X0,X1] :
( leq(X0,pred(X1))
<=> gt(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
fof(f39,axiom,
! [X0] : minus(X0,n1) = pred(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(f53,conjecture,
( ( pv70 = 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,pv10)
& leq(n0,pv12)
& leq(pv10,n135299)
& leq(pv12,n4)
& ! [X0] :
( ( leq(n0,X0)
& leq(X0,pred(pv12)) )
=> 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)))))) )
& ! [X1] :
( ( leq(n0,X1)
& leq(X1,pred(pv10)) )
=> sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1 ) )
=> ! [X2] :
( ( leq(n0,X2)
& leq(X2,pred(pv10)) )
=> ( pv10 = X2
=> sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,X2,tptp_sum_index))) = n1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0006) ).
fof(f54,negated_conjecture,
~ ( ( pv70 = 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,pv10)
& leq(n0,pv12)
& leq(pv10,n135299)
& leq(pv12,n4)
& ! [X0] :
( ( leq(n0,X0)
& leq(X0,pred(pv12)) )
=> 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)))))) )
& ! [X1] :
( ( leq(n0,X1)
& leq(X1,pred(pv10)) )
=> sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1 ) )
=> ! [X2] :
( ( leq(n0,X2)
& leq(X2,pred(pv10)) )
=> ( pv10 = X2
=> sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,X2,tptp_sum_index))) = n1 ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f143,plain,
( ? [X2] :
( n1 != sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,X2,tptp_sum_index)))
& pv10 = X2
& leq(n0,X2)
& leq(X2,pred(pv10)) )
& pv70 = 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,pv10)
& leq(n0,pv12)
& leq(pv10,n135299)
& leq(pv12,n4)
& ! [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,pred(pv12)) )
& ! [X1] :
( sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1
| ~ leq(n0,X1)
| ~ leq(X1,pred(pv10)) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,plain,
( ? [X2] :
( n1 != sum(n0,n4,cond(tptp_term_equals(pv12,tptp_sum_index),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70),a_select3(q,X2,tptp_sum_index)))
& pv10 = X2
& leq(n0,X2)
& leq(X2,pred(pv10)) )
& pv70 = 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,pv10)
& leq(n0,pv12)
& leq(pv10,n135299)
& leq(pv12,n4)
& ! [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,pred(pv12)) )
& ! [X1] :
( sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1
| ~ leq(n0,X1)
| ~ leq(X1,pred(pv10)) ) ),
inference(flattening,[],[f143]) ).
fof(f159,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f165,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(X0,pred(X1)) ),
inference(cnf_transformation,[],[f10]) ).
fof(f295,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[],[f39]) ).
fof(f315,plain,
leq(sK31,pred(pv10)),
inference(cnf_transformation,[],[f144]) ).
fof(f317,plain,
pv10 = sK31,
inference(cnf_transformation,[],[f144]) ).
fof(f365,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(X0,minus(X1,n1)) ),
inference(definition_unfolding,[],[f165,f295]) ).
fof(f392,plain,
leq(sK31,minus(sK31,n1)),
inference(definition_unfolding,[],[f315,f295,f317]) ).
fof(f405,plain,
! [X0,X1] :
( leq(X0,minus(X1,n1))
| gt(X1,X0) ),
inference(consistent_polarity_flipping,[],[f365]) ).
fof(f539,plain,
~ leq(sK31,minus(sK31,n1)),
inference(consistent_polarity_flipping,[],[f392]) ).
fof(f590,plain,
gt(sK31,sK31),
inference(resolution,[],[f405,f539]) ).
fof(f592,plain,
$false,
inference(forward_subsumption_resolution,[],[f590,f159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV156+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n003.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:02:57 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.09/0.26 % (1484055)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (1484061)% WARNING: option uhcvi not known.
% 0.09/0.26 % (1484061)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=705658748:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.26 % (1484061) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1484055-1484061"...
% 0.09/0.26 % (1484061)...printing done.
% 0.09/0.26 % (1484061)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.26 % (1484061)------------------------------
% 0.21/0.26 % (1484061)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.26 % (1484061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.26 % (1484061)CaDiCaL version: 2.1.3
% 0.21/0.26 % (1484061)Termination reason: Refutation
% 0.21/0.26 % (1484061)Time elapsed: 0.005 s
% 0.21/0.26 % (1484061)Peak memory usage: 12 MB
% 0.21/0.26 % (1484061)Instructions burned: 17 (million)
% 0.21/0.26 % (1484055)Success in time 0.034 s
% 0.21/0.26 % Vampire exiting
%------------------------------------------------------------------------------