%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV131+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 : n005.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:17 PM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 8 unt; 2 def)
% Number of atoms : 122 ( 0 equ)
% Maximal formula atoms : 26 ( 7 avg)
% Number of connectives : 142 ( 37 ~; 27 |; 50 &)
% ( 2 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( ~ leq(tptp_float_0_001,pv1341)
& ( ~ 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(n0,s_best7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0001) ).
fof(f54,negated_conjecture,
~ ( ( ~ leq(tptp_float_0_001,pv1341)
& ( ~ 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(n0,s_best7) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f136,plain,
( ~ leq(n0,s_best7)
& ~ 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)
| 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(n0,s_best7)
& ~ 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)
| 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(f311,plain,
( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) ),
inference(cnf_transformation,[],[f137]) ).
fof(f312,plain,
~ leq(tptp_float_0_001,pv1341),
inference(cnf_transformation,[],[f137]) ).
fof(f313,plain,
~ leq(n0,s_best7),
inference(cnf_transformation,[],[f137]) ).
fof(f405,definition,
( spl31_7
<=> leq(n0,s_best7) ),
introduced(definition,[new_symbols(definition,[spl31_7])],[avatar_definition]) ).
fof(f410,definition,
( spl31_8
<=> leq(tptp_float_0_001,pv1341) ),
introduced(definition,[new_symbols(definition,[spl31_8])],[avatar_definition]) ).
fof(f418,plain,
( spl31_8
| spl31_7 ),
inference(avatar_split_clause,[],[f311,f405,f410]) ).
fof(f419,plain,
~ spl31_8,
inference(avatar_split_clause,[],[f312,f410]) ).
fof(f420,plain,
~ spl31_7,
inference(avatar_split_clause,[],[f313,f405]) ).
cnf(s12,plain,
( spl31_7
| spl31_8 ),
inference(sat_conversion,[],[f418]) ).
cnf(s13,plain,
~ spl31_8,
inference(sat_conversion,[],[f419]) ).
cnf(s14,plain,
~ spl31_7,
inference(sat_conversion,[],[f420]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s12,s13,s14]) ).
fof(f421,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV131+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17 % Computer : n005.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 09:59:17 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.08/0.25 % (684649)Will run a generic schedule for satisfiability detection.
% 0.08/0.25 % (684657)dis+10_1_sil=32000:sp=arity:random_seed=1410748898:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.25 % (684655)% WARNING: option uhcvi not known.
% 0.08/0.25 % (684657) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-684649-684657"...
% 0.08/0.25 % (684657)...printing done.
% 0.08/0.25 % (684657)Refutation found. Thanks to Tanya!
% 0.08/0.25 % SZS status Theorem for theBenchmark
% 0.08/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25 % (684657)------------------------------
% 0.08/0.25 % (684657)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25 % (684657)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25 % (684657)CaDiCaL version: 2.1.3
% 0.08/0.25 % (684657)Termination reason: Refutation
% 0.08/0.25 % (684657)Time elapsed: 0.003 s
% 0.08/0.25 % (684657)Peak memory usage: 12 MB
% 0.08/0.25 % (684657)Instructions burned: 9 (million)
% 0.08/0.25 % (684649)Success in time 0.035 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------