%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV143+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 : n020.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:19 PM UTC 2026
% Result : Theorem 0.20s 0.30s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 15 unt; 2 def)
% Number of atoms : 153 ( 5 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 162 ( 43 ~; 36 |; 54 &)
% ( 2 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(s_sworst7,n3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0013) ).
fof(f54,negated_conjecture,
~ ( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(s_sworst7,n3) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f84,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_1) ).
fof(f126,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(succ(X0),X1) ),
inference(ennf_transformation,[],[f43]) ).
fof(f136,plain,
( ~ leq(s_sworst7,n3)
& leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f137,plain,
( ~ leq(s_sworst7,n3)
& leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) ) ),
inference(flattening,[],[f136]) ).
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(f318,plain,
( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3) ),
inference(cnf_transformation,[],[f137]) ).
fof(f320,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[],[f137]) ).
fof(f322,plain,
~ leq(s_sworst7,n3),
inference(cnf_transformation,[],[f137]) ).
fof(f352,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f84]) ).
fof(f375,plain,
! [X0,X1] :
( ~ leq(plus(X0,n1),X1)
| gt(X1,X0) ),
inference(definition_unfolding,[],[f293,f278]) ).
fof(f378,plain,
n1 = plus(n0,n1),
inference(definition_unfolding,[],[f352,f278]) ).
fof(f510,plain,
! [X0,X1] :
( ~ gt(X1,X0)
| leq(plus(X0,n1),X1) ),
inference(consistent_polarity_flipping,[],[f375]) ).
fof(f520,plain,
leq(s_sworst7,n3),
inference(consistent_polarity_flipping,[],[f322]) ).
fof(f522,plain,
~ leq(n1,loopcounter),
inference(consistent_polarity_flipping,[],[f320]) ).
fof(f524,plain,
( gt(loopcounter,n0)
| ~ leq(s_sworst7,n3) ),
inference(consistent_polarity_flipping,[],[f318]) ).
fof(f587,definition,
( spl31_6
<=> leq(s_sworst7,n3) ),
introduced(definition,[new_symbols(definition,[spl31_6])],[avatar_definition]) ).
fof(f597,definition,
( spl31_8
<=> gt(loopcounter,n0) ),
introduced(definition,[new_symbols(definition,[spl31_8])],[avatar_definition]) ).
fof(f599,plain,
( gt(loopcounter,n0)
| ~ spl31_8 ),
inference(avatar_component_clause,[],[f597]) ).
fof(f604,plain,
( ~ spl31_6
| spl31_8 ),
inference(avatar_split_clause,[],[f524,f597,f587]) ).
fof(f607,plain,
spl31_6,
inference(avatar_split_clause,[],[f520,f587]) ).
fof(f678,plain,
( leq(plus(n0,n1),loopcounter)
| ~ spl31_8 ),
inference(resolution,[],[f510,f599]) ).
fof(f679,plain,
( leq(n1,loopcounter)
| ~ spl31_8 ),
inference(forward_demodulation,[],[f678,f378]) ).
fof(f682,plain,
( $false
| ~ spl31_8 ),
inference(forward_subsumption_resolution,[],[f679,f522]) ).
fof(f683,plain,
~ spl31_8,
inference(avatar_contradiction_clause,[],[f682]) ).
cnf(s11,plain,
( ~ spl31_6
| spl31_8 ),
inference(sat_conversion,[],[f604]) ).
cnf(s14,plain,
spl31_6,
inference(sat_conversion,[],[f607]) ).
cnf(s15,plain,
~ spl31_8,
inference(sat_conversion,[],[f683]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s11,s15,s14]) ).
fof(f684,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV143+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.10/0.20 % Computer : n020.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Mon Sep 28 10:01:05 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.24 Running first-order model finding
% 0.10/0.24 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.30 % (68946)Will run a generic schedule for satisfiability detection.
% 0.20/0.30 % (68953)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2474871376:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.30 % (68952)% WARNING: option uhcvi not known.
% 0.20/0.30 % (68951)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1047217287_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.30 % (68955)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=746877390:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.30 % (68956)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2586921669:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.30 % (68952)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2702179512:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.30 % (68954)dis+10_1_sil=32000:sp=arity:random_seed=3542645769:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.30 % (68957)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=966598404:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.30 % (68952) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-68946-68952"...
% 0.20/0.30 % (68952)...printing done.
% 0.20/0.30 % (68952)Refutation found. Thanks to Tanya!
% 0.20/0.30 % SZS status Theorem for theBenchmark
% 0.20/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.30 % (68952)------------------------------
% 0.20/0.30 % (68952)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30 % (68952)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30 % (68952)CaDiCaL version: 2.1.3
% 0.20/0.30 % (68952)Termination reason: Refutation
% 0.20/0.30 % (68952)Time elapsed: 0.011 s
% 0.20/0.30 % (68952)Peak memory usage: 13 MB
% 0.20/0.30 % (68952)Instructions burned: 17 (million)
% 0.20/0.30 % (68946)Success in time 0.047 s
% 0.20/0.30 % Vampire exiting
%------------------------------------------------------------------------------