%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV065+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 : n004.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:07 PM UTC 2026
% Result : Theorem 0.08s 0.25s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 18 unt; 5 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 78 ( 27 ~; 22 |; 22 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 2 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] : leq(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
fof(f53,conjecture,
( ( leq(n0,pv10)
& leq(n0,pv53)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,pv53)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0006) ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(n0,pv53)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,pv53)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1)) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f143,plain,
( ( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,pv53)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv53,minus(n5,n1)) )
& leq(n0,pv10)
& leq(n0,pv53)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,plain,
( ( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,pv53)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv53,minus(n5,n1)) )
& leq(n0,pv10)
& leq(n0,pv53)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1)) ),
inference(flattening,[],[f143]) ).
fof(f160,plain,
! [X0] : leq(X0,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f315,plain,
( ~ leq(pv53,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv53)
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f316,plain,
leq(pv53,minus(n5,n1)),
inference(cnf_transformation,[],[f144]) ).
fof(f317,plain,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[],[f144]) ).
fof(f318,plain,
leq(n0,pv53),
inference(cnf_transformation,[],[f144]) ).
fof(f319,plain,
leq(n0,pv10),
inference(cnf_transformation,[],[f144]) ).
fof(f391,definition,
( spl31_1
<=> leq(n0,n0) ),
introduced(definition,[new_symbols(definition,[spl31_1])],[avatar_definition]) ).
fof(f393,plain,
( ~ leq(n0,n0)
| spl31_1 ),
inference(avatar_component_clause,[],[f391]) ).
fof(f395,definition,
( spl31_2
<=> leq(n0,pv10) ),
introduced(definition,[new_symbols(definition,[spl31_2])],[avatar_definition]) ).
fof(f399,definition,
( spl31_3
<=> leq(n0,pv53) ),
introduced(definition,[new_symbols(definition,[spl31_3])],[avatar_definition]) ).
fof(f403,definition,
( spl31_4
<=> leq(pv10,minus(n135300,n1)) ),
introduced(definition,[new_symbols(definition,[spl31_4])],[avatar_definition]) ).
fof(f407,definition,
( spl31_5
<=> leq(pv53,minus(n5,n1)) ),
introduced(definition,[new_symbols(definition,[spl31_5])],[avatar_definition]) ).
fof(f410,plain,
( ~ spl31_1
| ~ spl31_2
| ~ spl31_3
| ~ spl31_4
| ~ spl31_5 ),
inference(avatar_split_clause,[],[f315,f407,f403,f399,f395,f391]) ).
fof(f411,plain,
spl31_5,
inference(avatar_split_clause,[],[f316,f407]) ).
fof(f412,plain,
spl31_4,
inference(avatar_split_clause,[],[f317,f403]) ).
fof(f413,plain,
spl31_3,
inference(avatar_split_clause,[],[f318,f399]) ).
fof(f414,plain,
spl31_2,
inference(avatar_split_clause,[],[f319,f395]) ).
fof(f418,plain,
( $false
| spl31_1 ),
inference(forward_subsumption_resolution,[],[f393,f160]) ).
fof(f419,plain,
spl31_1,
inference(avatar_contradiction_clause,[],[f418]) ).
cnf(s1,plain,
( ~ spl31_1
| ~ spl31_2
| ~ spl31_3
| ~ spl31_4
| ~ spl31_5 ),
inference(sat_conversion,[],[f410]) ).
cnf(s2,plain,
spl31_5,
inference(sat_conversion,[],[f411]) ).
cnf(s3,plain,
spl31_4,
inference(sat_conversion,[],[f412]) ).
cnf(s4,plain,
spl31_3,
inference(sat_conversion,[],[f413]) ).
cnf(s5,plain,
spl31_2,
inference(sat_conversion,[],[f414]) ).
cnf(s6,plain,
spl31_1,
inference(sat_conversion,[],[f419]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s1,s2,s3,s4,s5,s6]) ).
fof(f420,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV065+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n004.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 09:48:36 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.25 % (249147)Will run a generic schedule for satisfiability detection.
% 0.08/0.25 % (249156)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1635870665:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.25 % (249153)% WARNING: option uhcvi not known.
% 0.08/0.25 % (249156) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-249147-249156"...
% 0.08/0.25 % (249152)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1668717231_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.25 % (249156)...printing done.
% 0.08/0.25 % (249153)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1600900363:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.25 % (249154)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3147113830:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.25 % (249155)dis+10_1_sil=32000:sp=arity:random_seed=4173181781:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.25 % (249156)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 % (249156)------------------------------
% 0.08/0.25 % (249156)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25 % (249156)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25 % (249156)CaDiCaL version: 2.1.3
% 0.08/0.25 % (249156)Termination reason: Refutation
% 0.08/0.25 % (249156)Time elapsed: 0.006 s
% 0.08/0.25 % (249156)Peak memory usage: 13 MB
% 0.08/0.25 % (249156)Instructions burned: 23 (million)
% 0.08/0.25 % (249147)Success in time 0.032 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------