%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV134+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 : n001.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:18 PM UTC 2026
% Result : Theorem 0.19s 0.28s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 20 unt; 0 def)
% Number of atoms : 86 ( 9 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 69 ( 16 ~; 7 |; 42 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 20 ( 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1] :
( gt(X1,X0)
=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(f29,axiom,
! [X0] : plus(X0,n1) = succ(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(f43,axiom,
! [X0,X1] :
( leq(succ(X0),X1)
=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt) ).
fof(f53,conjecture,
( ( ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7)) )
=> leq(n0,pv1325) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0004) ).
fof(f54,negated_conjecture,
~ ( ( ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7)) )
=> leq(n0,pv1325) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f84,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(f85,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_2) ).
fof(f100,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ gt(X1,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f126,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(succ(X0),X1) ),
inference(ennf_transformation,[],[f43]) ).
fof(f136,plain,
( ~ leq(n0,pv1325)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f137,plain,
( ~ leq(n0,pv1325)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7))
& leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7)) ),
inference(flattening,[],[f136]) ).
fof(f155,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(X0,X1) ),
inference(cnf_transformation,[],[f100]) ).
fof(f278,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f293,plain,
! [X0,X1] :
( ~ leq(succ(X0),X1)
| gt(X1,X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f314,plain,
leq(n2,pv1325),
inference(cnf_transformation,[],[f137]) ).
fof(f319,plain,
~ leq(n0,pv1325),
inference(cnf_transformation,[],[f137]) ).
fof(f349,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f84]) ).
fof(f350,plain,
n2 = succ(succ(n0)),
inference(cnf_transformation,[],[f85]) ).
fof(f372,plain,
! [X0,X1] :
( ~ leq(plus(X0,n1),X1)
| gt(X1,X0) ),
inference(definition_unfolding,[],[f293,f278]) ).
fof(f375,plain,
n1 = plus(n0,n1),
inference(definition_unfolding,[],[f349,f278]) ).
fof(f376,plain,
n2 = plus(plus(n0,n1),n1),
inference(definition_unfolding,[],[f350,f278,f278]) ).
fof(f386,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| gt(X1,X0) ),
inference(consistent_polarity_flipping,[],[f155]) ).
fof(f507,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(plus(X0,n1),X1) ),
inference(consistent_polarity_flipping,[],[f372]) ).
fof(f517,plain,
leq(n0,pv1325),
inference(consistent_polarity_flipping,[],[f319]) ).
fof(f522,plain,
~ leq(n2,pv1325),
inference(consistent_polarity_flipping,[],[f314]) ).
fof(f559,plain,
gt(pv1325,n0),
inference(resolution,[],[f386,f517]) ).
fof(f570,plain,
n2 = plus(n1,n1),
inference(forward_demodulation,[],[f376,f375]) ).
fof(f599,plain,
leq(plus(n0,n1),pv1325),
inference(resolution,[],[f507,f559]) ).
fof(f600,plain,
leq(n1,pv1325),
inference(forward_demodulation,[],[f599,f375]) ).
fof(f606,plain,
gt(pv1325,n1),
inference(resolution,[],[f600,f386]) ).
fof(f623,plain,
leq(plus(n1,n1),pv1325),
inference(resolution,[],[f606,f507]) ).
fof(f624,plain,
leq(n2,pv1325),
inference(forward_demodulation,[],[f623,f570]) ).
fof(f625,plain,
$false,
inference(forward_subsumption_resolution,[],[f624,f522]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV134+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.06/0.19 % Computer : n001.cluster.edu
% 0.06/0.19 % Model : x86_64 x86_64
% 0.06/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.19 % Memory : 8046.5625MB
% 0.06/0.19 % OS : Linux 6.8.0-71-generic
% 0.06/0.19 % CPULimit : 300
% 0.06/0.19 % WCLimit : 300
% 0.06/0.19 % DateTime : Mon Sep 28 10:05:03 UTC 2026
% 0.06/0.19 % CPUTime :
% 0.06/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.06/0.22 Running first-order model finding
% 0.06/0.22 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.19/0.28 % (258834)Will run a generic schedule for satisfiability detection.
% 0.19/0.28 % (258840)% WARNING: option uhcvi not known.
% 0.19/0.28 % (258840)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3665951259:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.28 % (258840) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-258834-258840"...
% 0.19/0.28 % (258839)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1265573247_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.28 % (258840)...printing done.
% 0.19/0.28 % (258841)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3457236037:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.28 % (258842)dis+10_1_sil=32000:sp=arity:random_seed=2080585750:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.28 % (258843)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3258743442:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.28 % (258840)Refutation found. Thanks to Tanya!
% 0.19/0.28 % SZS status Theorem for theBenchmark
% 0.19/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28 % (258840)------------------------------
% 0.19/0.28 % (258840)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (258840)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (258840)CaDiCaL version: 2.1.3
% 0.19/0.28 % (258840)Termination reason: Refutation
% 0.19/0.28 % (258840)Time elapsed: 0.006 s
% 0.19/0.28 % (258840)Peak memory usage: 12 MB
% 0.19/0.28 % (258840)Instructions burned: 17 (million)
% 0.19/0.28 % (258834)Success in time 0.042 s
% 0.19/0.28 % Vampire exiting
%------------------------------------------------------------------------------