%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV152+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 : n002.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:20 PM UTC 2026
% Result : Theorem 0.21s 0.29s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 13 unt; 0 def)
% Number of atoms : 52 ( 10 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 44 ( 19 ~; 11 |; 10 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 30 ( 28 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(f5,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& leq(X1,X2) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
fof(f13,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> gt(succ(X1),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
fof(f28,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
fof(f29,axiom,
! [X0] : plus(X0,n1) = succ(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(f53,conjecture,
! [X0] :
( ( leq(n0,X0)
& leq(X0,tptp_minus_1) )
=> sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0002) ).
fof(f54,negated_conjecture,
~ ! [X0] :
( ( leq(n0,X0)
& leq(X0,tptp_minus_1) )
=> sum(n0,n4,a_select3(q,X0,tptp_sum_index)) = n1 ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f98,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f99,plain,
! [X0,X1,X2] :
( leq(X0,X2)
| ~ leq(X0,X1)
| ~ leq(X1,X2) ),
inference(flattening,[],[f98]) ).
fof(f136,plain,
? [X0] :
( n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index))
& leq(n0,X0)
& leq(X0,tptp_minus_1) ),
inference(ennf_transformation,[],[f54]) ).
fof(f137,plain,
? [X0] :
( n1 != sum(n0,n4,a_select3(q,X0,tptp_sum_index))
& leq(n0,X0)
& leq(X0,tptp_minus_1) ),
inference(flattening,[],[f136]) ).
fof(f158,plain,
! [X0,X1] :
( ( leq(X0,X1)
| ~ gt(succ(X1),X0) )
& ( gt(succ(X1),X0)
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f190,plain,
( n1 != sum(n0,n4,a_select3(q,sK31,tptp_sum_index))
& leq(n0,sK31)
& leq(sK31,tptp_minus_1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK31]),skolemize(X0,sK31)],[f137]) ).
fof(f193,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f195,plain,
! [X2,X0,X1] :
( ~ leq(X1,X2)
| ~ leq(X0,X1)
| leq(X0,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f202,plain,
! [X0,X1] :
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f158]) ).
fof(f270,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f271,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f301,plain,
leq(sK31,tptp_minus_1),
inference(cnf_transformation,[],[f190]) ).
fof(f302,plain,
leq(n0,sK31),
inference(cnf_transformation,[],[f190]) ).
fof(f341,plain,
! [X0,X1] :
( gt(plus(X1,n1),X0)
| ~ leq(X0,X1) ),
inference(definition_unfolding,[],[f202,f271]) ).
fof(f342,plain,
n0 = plus(tptp_minus_1,n1),
inference(definition_unfolding,[],[f270,f271]) ).
fof(f465,plain,
! [X0] : ~ leq(plus(X0,n1),X0),
inference(resolution,[],[f341,f193]) ).
fof(f475,plain,
~ leq(n0,tptp_minus_1),
inference(superposition,[],[f465,f342]) ).
fof(f568,plain,
! [X0] :
( ~ leq(X0,sK31)
| leq(X0,tptp_minus_1) ),
inference(resolution,[],[f195,f301]) ).
fof(f801,plain,
leq(n0,tptp_minus_1),
inference(resolution,[],[f568,f302]) ).
fof(f815,plain,
$false,
inference(forward_subsumption_resolution,[],[f801,f475]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV152+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 % Computer : n002.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 10:04:37 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.21/0.29 % (248700)Will run a generic schedule for satisfiability detection.
% 0.21/0.29 % (248705)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=281848958_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.29 % (248706)% WARNING: option uhcvi not known.
% 0.21/0.29 % (248708)dis+10_1_sil=32000:sp=arity:random_seed=471660385:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.29 % (248706)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3812874111:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.29 % (248707)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1347705445:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.29 % (248709)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1429445928:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.29 % (248711)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=97290407:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.29 % (248710)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3348462892:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.29 % TRYING [1]
% 0.21/0.29 % TRYING [2]
% 0.21/0.29 % (248708) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-248700-248708"...
% 0.21/0.29 % (248708)...printing done.
% 0.21/0.29 % (248708)Refutation found. Thanks to Tanya!
% 0.21/0.29 % SZS status Theorem for theBenchmark
% 0.21/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29 % (248708)------------------------------
% 0.21/0.29 % (248708)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (248708)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (248708)CaDiCaL version: 2.1.3
% 0.21/0.29 % (248708)Termination reason: Refutation
% 0.21/0.29 % (248708)Time elapsed: 0.014 s
% 0.21/0.29 % (248708)Peak memory usage: 12 MB
% 0.21/0.29 % (248708)Instructions burned: 23 (million)
% 0.21/0.29 % (248700)Success in time 0.049 s
% 0.21/0.29 % Vampire exiting
%------------------------------------------------------------------------------