%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV136+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 : n012.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.08s 0.17s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 17 unt; 0 def)
% Number of atoms : 81 ( 9 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 65 ( 17 ~; 10 |; 34 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 23 ( 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1] :
( gt(X1,X0)
=> leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
fof(f29,axiom,
! [X0] : plus(X0,n1) = succ(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(f43,axiom,
! [X0,X1] :
( leq(succ(X0),X1)
=> gt(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_gt) ).
fof(f53,conjecture,
( ( 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(n0,pv1325) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0006) ).
fof(f54,negated_conjecture,
~ ( ( 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(n0,pv1325) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f84,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_1) ).
fof(f85,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox2/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(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)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f137,plain,
( ~ leq(n0,pv1325)
& 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)) ),
inference(flattening,[],[f136]) ).
fof(f195,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ gt(X1,X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f270,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f285,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(succ(X0),X1) ),
inference(cnf_transformation,[],[f126]) ).
fof(f305,plain,
leq(n2,pv1325),
inference(cnf_transformation,[],[f137]) ).
fof(f309,plain,
~ leq(n0,pv1325),
inference(cnf_transformation,[],[f137]) ).
fof(f339,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f84]) ).
fof(f340,plain,
n2 = succ(succ(n0)),
inference(cnf_transformation,[],[f85]) ).
fof(f362,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(plus(X0,n1),X1) ),
inference(definition_unfolding,[],[f285,f270]) ).
fof(f365,plain,
n1 = plus(n0,n1),
inference(definition_unfolding,[],[f339,f270]) ).
fof(f366,plain,
n2 = plus(plus(n0,n1),n1),
inference(definition_unfolding,[],[f340,f270,f270]) ).
fof(f376,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| gt(X1,X0) ),
inference(consistent_polarity_flipping,[],[f195]) ).
fof(f449,plain,
! [X0,X1] :
( leq(plus(X0,n1),X1)
| ~ gt(X1,X0) ),
inference(consistent_polarity_flipping,[],[f362]) ).
fof(f459,plain,
leq(n0,pv1325),
inference(consistent_polarity_flipping,[],[f309]) ).
fof(f463,plain,
~ leq(n2,pv1325),
inference(consistent_polarity_flipping,[],[f305]) ).
fof(f500,plain,
gt(pv1325,n0),
inference(resolution,[],[f376,f459]) ).
fof(f514,plain,
n2 = plus(n1,n1),
inference(superposition,[],[f366,f365]) ).
fof(f989,plain,
! [X0] :
( leq(n1,X0)
| ~ gt(X0,n0) ),
inference(superposition,[],[f449,f365]) ).
fof(f991,plain,
! [X0] :
( leq(n2,X0)
| ~ gt(X0,n1) ),
inference(superposition,[],[f449,f514]) ).
fof(f997,plain,
! [X0] :
( gt(X0,n1)
| ~ gt(X0,n0) ),
inference(resolution,[],[f989,f376]) ).
fof(f1071,plain,
~ gt(pv1325,n1),
inference(resolution,[],[f991,f463]) ).
fof(f1119,plain,
~ gt(pv1325,n0),
inference(resolution,[],[f997,f1071]) ).
fof(f1120,plain,
$false,
inference(resolution,[],[f1119,f500]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV136+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Mon Sep 28 09:59:19 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.13 Running first-order model finding
% 0.08/0.13 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.08/0.17 % (3275434)Will run a generic schedule for satisfiability detection.
% 0.08/0.17 % (3275440)% WARNING: option uhcvi not known.
% 0.08/0.17 % (3275440)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=9598323:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.17 % (3275441)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=149465653:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.17 % (3275439)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=266767271_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.17 % (3275445)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1276838250:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.17 % (3275442)dis+10_1_sil=32000:sp=arity:random_seed=3349125688:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.17 % (3275443)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=746855235:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.17 % (3275444)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3656607478:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.17 % (3275445) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3275434-3275445"...
% 0.08/0.17 % (3275442) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3275434-3275442"...
% 0.08/0.17 % (3275445)...printing done.
% 0.08/0.17 % (3275442)...printing done.
% 0.08/0.17 % (3275445)Refutation found. Thanks to Tanya!
% 0.08/0.17 % SZS status Theorem for theBenchmark
% 0.08/0.17 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.17 % (3275445)------------------------------
% 0.08/0.17 % (3275445)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.17 % (3275445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.17 % (3275445)CaDiCaL version: 2.1.3
% 0.08/0.17 % (3275445)Termination reason: Refutation
% 0.08/0.17 % (3275445)Time elapsed: 0.011 s
% 0.08/0.17 % (3275445)Peak memory usage: 12 MB
% 0.08/0.17 % (3275445)Instructions burned: 32 (million)
% 0.08/0.17 % (3275434)Success in time 0.033 s
% 0.08/0.17 % Vampire exiting
%------------------------------------------------------------------------------