%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:00 PM UTC 2026
% Result : Unsatisfiable 0.07s 0.26s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 57 ( 18 unt; 6 def)
% Number of atoms : 118 ( 5 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 106 ( 45 ~; 55 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( in_array_bounds(array,X0)
| less_than(upper_bound,X0)
| less_than(X0,lower_bound) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_bounds) ).
fof(f2,axiom,
! [X0,X1] :
( ~ less_than(successor(X0),successor(X1))
| less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',predecessor_less) ).
fof(f3,axiom,
! [X2,X0,X1] :
( ~ less_than(X1,X2)
| ~ less_than(X0,X1)
| less_than(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less) ).
fof(f4,axiom,
! [X0] : less_than(X0,successor(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_greater) ).
fof(f5,axiom,
( ~ in_array_bounds(array,index_of_maximal)
| maximal_value = array_value_at(array,index_of_maximal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',this_is_maximal) ).
fof(f6,axiom,
less_than(index_of_maximal,an_index),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_before_somewhere) ).
fof(f7,axiom,
~ less_than(an_index,lower_bound),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',somewhere_above_lower_bound) ).
fof(f8,axiom,
~ less_than(upper_bound,an_index),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',somewhere_below_upper_bound) ).
fof(f9,axiom,
~ less_than(index_of_maximal,lower_bound),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_above_lower_bound) ).
fof(f10,negated_conjecture,
( ~ in_array_bounds(array,an_index)
| less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| less_than(index_of_maximal,lower_bound)
| ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| maximal_value != array_value_at(array,index_of_maximal) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f11,plain,
( ~ in_array_bounds(array,an_index)
| less_than(successor(an_index),lower_bound)
| less_than(successor(upper_bound),successor(an_index))
| ~ less_than(index_of_maximal,successor(an_index))
| ~ in_array_bounds(array,index_of_maximal)
| maximal_value != array_value_at(array,index_of_maximal) ),
inference(forward_subsumption_resolution,[],[f10,f9]) ).
fof(f13,definition,
( spl0_1
<=> maximal_value = array_value_at(array,index_of_maximal) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f15,plain,
( maximal_value != array_value_at(array,index_of_maximal)
| spl0_1 ),
inference(avatar_component_clause,[],[f13]) ).
fof(f17,definition,
( spl0_2
<=> in_array_bounds(array,index_of_maximal) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f19,plain,
( ~ in_array_bounds(array,index_of_maximal)
| spl0_2 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f21,definition,
( spl0_3
<=> less_than(index_of_maximal,successor(an_index)) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f23,plain,
( ~ less_than(index_of_maximal,successor(an_index))
| spl0_3 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f25,definition,
( spl0_4
<=> less_than(successor(upper_bound),successor(an_index)) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f27,plain,
( less_than(successor(upper_bound),successor(an_index))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f29,definition,
( spl0_5
<=> less_than(successor(an_index),lower_bound) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f31,plain,
( less_than(successor(an_index),lower_bound)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f33,definition,
( spl0_6
<=> in_array_bounds(array,an_index) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f35,plain,
( ~ in_array_bounds(array,an_index)
| spl0_6 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f36,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| spl0_4
| spl0_5
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f11,f33,f29,f25,f21,f17,f13]) ).
fof(f53,plain,
( ~ in_array_bounds(array,index_of_maximal)
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f5,f15]) ).
fof(f54,plain,
( ~ spl0_2
| spl0_1 ),
inference(avatar_split_clause,[],[f53,f13,f17]) ).
fof(f64,plain,
( less_than(upper_bound,index_of_maximal)
| less_than(index_of_maximal,lower_bound)
| spl0_2 ),
inference(resolution,[],[f1,f19]) ).
fof(f65,plain,
( less_than(upper_bound,index_of_maximal)
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f64,f9]) ).
fof(f77,plain,
! [X0] :
( ~ less_than(X0,index_of_maximal)
| less_than(X0,an_index) ),
inference(resolution,[],[f3,f6]) ).
fof(f78,plain,
! [X0,X1] :
( less_than(X0,successor(X1))
| ~ less_than(X0,X1) ),
inference(resolution,[],[f3,f4]) ).
fof(f103,plain,
( less_than(upper_bound,an_index)
| spl0_2 ),
inference(resolution,[],[f77,f65]) ).
fof(f104,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f103,f8]) ).
fof(f105,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f104]) ).
fof(f114,plain,
( ~ less_than(index_of_maximal,an_index)
| spl0_3 ),
inference(resolution,[],[f78,f23]) ).
fof(f115,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[],[f114,f6]) ).
fof(f116,plain,
spl0_3,
inference(avatar_contradiction_clause,[],[f115]) ).
fof(f118,plain,
( less_than(upper_bound,an_index)
| ~ spl0_4 ),
inference(resolution,[],[f27,f2]) ).
fof(f120,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f118,f8]) ).
fof(f121,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f120]) ).
fof(f123,plain,
( ! [X0] :
( ~ less_than(X0,successor(an_index))
| less_than(X0,lower_bound) )
| ~ spl0_5 ),
inference(resolution,[],[f31,f3]) ).
fof(f128,plain,
( less_than(an_index,lower_bound)
| ~ spl0_5 ),
inference(resolution,[],[f123,f4]) ).
fof(f130,plain,
( $false
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f128,f7]) ).
fof(f131,plain,
~ spl0_5,
inference(avatar_contradiction_clause,[],[f130]) ).
fof(f134,plain,
( less_than(upper_bound,an_index)
| less_than(an_index,lower_bound)
| spl0_6 ),
inference(resolution,[],[f35,f1]) ).
fof(f135,plain,
( less_than(an_index,lower_bound)
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f134,f8]) ).
fof(f136,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f135,f7]) ).
fof(f137,plain,
spl0_6,
inference(avatar_contradiction_clause,[],[f136]) ).
cnf(s16,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| spl0_4
| spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f36]) ).
cnf(s32,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f54]) ).
cnf(s67,plain,
spl0_2,
inference(sat_conversion,[],[f105]) ).
cnf(s81,plain,
spl0_3,
inference(sat_conversion,[],[f116]) ).
cnf(s90,plain,
~ spl0_4,
inference(sat_conversion,[],[f121]) ).
cnf(s100,plain,
~ spl0_5,
inference(sat_conversion,[],[f131]) ).
cnf(s106,plain,
spl0_6,
inference(sat_conversion,[],[f137]) ).
cnf(s107,plain,
spl0_1,
inference(rat,[],[s32,s67]) ).
cnf(s108,plain,
$false,
inference(rat,[],[s16,s106,s100,s90,s81,s67,s107]) ).
fof(f138,plain,
$false,
inference(avatar_sat_refutation,[],[s108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n008.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 09:44:09 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/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.07/0.26 % (2138223)Will run a generic schedule for satisfiability detection.
% 0.07/0.26 % (2138234)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4091066841:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.26 % (2138234) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2138223-2138234"...
% 0.07/0.26 % (2138234)...printing done.
% 0.07/0.26 % (2138233)% WARNING: option uhcvi not known.
% 0.07/0.26 % (2138234)Refutation found. Thanks to Tanya!
% 0.07/0.26 % SZS status Unsatisfiable for theBenchmark
% 0.07/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.26 % (2138234)------------------------------
% 0.07/0.26 % (2138234)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.26 % (2138234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.26 % (2138234)CaDiCaL version: 2.1.3
% 0.07/0.26 % (2138234)Termination reason: Refutation
% 0.07/0.26 % (2138234)Time elapsed: 0.002 s
% 0.07/0.26 % (2138234)Peak memory usage: 12 MB
% 0.07/0.26 % (2138234)Instructions burned: 3 (million)
% 0.07/0.26 % (2138223)Success in time 0.03 s
% 0.07/0.26 % Vampire exiting
%------------------------------------------------------------------------------