%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC016+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:04:18 PM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 74 ( 12 unt; 8 def)
% Number of atoms : 251 ( 42 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 281 ( 104 ~; 121 |; 38 &)
% ( 8 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 32 ( 0 sgn 20 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssList(X4)
=> ( ~ neq(X4,nil)
| ~ frontsegP(X3,X4)
| ~ frontsegP(X2,X4) ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X1,X5)
& frontsegP(X0,X5) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssList(X4)
=> ( ~ neq(X4,nil)
| ~ frontsegP(X3,X4)
| ~ frontsegP(X2,X4) ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& frontsegP(X1,X5)
& frontsegP(X0,X5) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( neq(X4,nil)
& frontsegP(X3,X4)
& frontsegP(X2,X4)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ frontsegP(X1,X5)
| ~ frontsegP(X0,X5) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( neq(X4,nil)
& frontsegP(X3,X4)
& frontsegP(X2,X4)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ frontsegP(X1,X5)
| ~ frontsegP(X0,X5) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f411,plain,
! [X5] :
( ~ frontsegP(sK47,X5)
| ~ frontsegP(sK48,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil = sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
! [X5] :
( ~ frontsegP(sK47,X5)
| ~ frontsegP(sK48,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil != sK47 ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( ~ neq(sK50,nil)
| ssList(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( ~ neq(sK50,nil)
| frontsegP(sK49,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( ~ neq(sK50,nil)
| frontsegP(sK50,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( ~ neq(sK50,nil)
| neq(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
( neq(sK48,nil)
| nil != sK47 ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
( neq(sK48,nil)
| nil = sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
( nil != sK50
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f428,plain,
( neq(sK50,nil)
| nil = sK50 ),
inference(definition_unfolding,[],[f418,f422,f422]) ).
fof(f429,plain,
( neq(sK50,nil)
| nil != sK49 ),
inference(definition_unfolding,[],[f417,f422,f421]) ).
fof(f430,plain,
! [X5] :
( ~ frontsegP(sK49,X5)
| ~ frontsegP(sK50,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil != sK49 ),
inference(definition_unfolding,[],[f412,f421,f422,f421]) ).
fof(f431,plain,
! [X5] :
( ~ frontsegP(sK49,X5)
| ~ frontsegP(sK50,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil = sK50 ),
inference(definition_unfolding,[],[f411,f421,f422,f422]) ).
fof(f541,plain,
( ~ neq(sK50,nil)
| nil = sK50 ),
inference(consistent_polarity_flipping,[],[f428]) ).
fof(f542,plain,
( ~ neq(sK50,nil)
| nil != sK49 ),
inference(consistent_polarity_flipping,[],[f429]) ).
fof(f543,plain,
( neq(sK50,nil)
| ~ neq(sK51,nil) ),
inference(consistent_polarity_flipping,[],[f416]) ).
fof(f544,plain,
( neq(sK50,nil)
| ~ frontsegP(sK50,sK51) ),
inference(consistent_polarity_flipping,[],[f415]) ).
fof(f545,plain,
( neq(sK50,nil)
| ~ frontsegP(sK49,sK51) ),
inference(consistent_polarity_flipping,[],[f414]) ).
fof(f546,plain,
( neq(sK50,nil)
| ssList(sK51) ),
inference(consistent_polarity_flipping,[],[f413]) ).
fof(f547,plain,
! [X5] :
( frontsegP(sK49,X5)
| frontsegP(sK50,X5)
| neq(X5,nil)
| ~ ssList(X5)
| nil != sK49 ),
inference(consistent_polarity_flipping,[],[f430]) ).
fof(f548,plain,
! [X5] :
( frontsegP(sK49,X5)
| frontsegP(sK50,X5)
| neq(X5,nil)
| ~ ssList(X5)
| nil = sK50 ),
inference(consistent_polarity_flipping,[],[f431]) ).
fof(f557,definition,
( spl52_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl52_1])],[avatar_definition]) ).
fof(f561,definition,
( spl52_2
<=> ! [X5] :
( frontsegP(sK49,X5)
| ~ ssList(X5)
| neq(X5,nil)
| frontsegP(sK50,X5) ) ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f562,plain,
( ! [X5] :
( neq(X5,nil)
| ~ ssList(X5)
| frontsegP(sK49,X5)
| frontsegP(sK50,X5) )
| ~ spl52_2 ),
inference(avatar_component_clause,[],[f561]) ).
fof(f563,plain,
( spl52_1
| spl52_2 ),
inference(avatar_split_clause,[],[f548,f561,f557]) ).
fof(f565,definition,
( spl52_3
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl52_3])],[avatar_definition]) ).
fof(f568,plain,
( ~ spl52_3
| spl52_2 ),
inference(avatar_split_clause,[],[f547,f561,f565]) ).
fof(f570,definition,
( spl52_4
<=> ssList(sK51) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f572,plain,
( ssList(sK51)
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f570]) ).
fof(f574,definition,
( spl52_5
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl52_5])],[avatar_definition]) ).
fof(f577,plain,
( spl52_4
| spl52_5 ),
inference(avatar_split_clause,[],[f546,f574,f570]) ).
fof(f579,definition,
( spl52_6
<=> frontsegP(sK49,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_6])],[avatar_definition]) ).
fof(f581,plain,
( ~ frontsegP(sK49,sK51)
| spl52_6 ),
inference(avatar_component_clause,[],[f579]) ).
fof(f582,plain,
( ~ spl52_6
| spl52_5 ),
inference(avatar_split_clause,[],[f545,f574,f579]) ).
fof(f584,definition,
( spl52_7
<=> frontsegP(sK50,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_7])],[avatar_definition]) ).
fof(f586,plain,
( ~ frontsegP(sK50,sK51)
| spl52_7 ),
inference(avatar_component_clause,[],[f584]) ).
fof(f587,plain,
( ~ spl52_7
| spl52_5 ),
inference(avatar_split_clause,[],[f544,f574,f584]) ).
fof(f589,definition,
( spl52_8
<=> neq(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl52_8])],[avatar_definition]) ).
fof(f591,plain,
( ~ neq(sK51,nil)
| spl52_8 ),
inference(avatar_component_clause,[],[f589]) ).
fof(f592,plain,
( ~ spl52_8
| spl52_5 ),
inference(avatar_split_clause,[],[f543,f574,f589]) ).
fof(f593,plain,
( ~ spl52_3
| ~ spl52_5 ),
inference(avatar_split_clause,[],[f542,f574,f565]) ).
fof(f594,plain,
( spl52_1
| ~ spl52_5 ),
inference(avatar_split_clause,[],[f541,f574,f557]) ).
fof(f595,plain,
( spl52_3
| ~ spl52_1 ),
inference(avatar_split_clause,[],[f419,f557,f565]) ).
fof(f632,plain,
( ~ ssList(sK51)
| frontsegP(sK49,sK51)
| frontsegP(sK50,sK51)
| ~ spl52_2
| spl52_8 ),
inference(resolution,[],[f562,f591]) ).
fof(f633,plain,
( frontsegP(sK49,sK51)
| frontsegP(sK50,sK51)
| ~ spl52_2
| ~ spl52_4
| spl52_8 ),
inference(forward_subsumption_resolution,[],[f632,f572]) ).
fof(f635,plain,
( frontsegP(sK50,sK51)
| ~ spl52_2
| ~ spl52_4
| spl52_6
| spl52_8 ),
inference(forward_subsumption_resolution,[],[f633,f581]) ).
fof(f645,plain,
( $false
| ~ spl52_2
| ~ spl52_4
| spl52_6
| spl52_7
| spl52_8 ),
inference(forward_subsumption_resolution,[],[f635,f586]) ).
fof(f646,plain,
( ~ spl52_2
| ~ spl52_4
| spl52_6
| spl52_7
| spl52_8 ),
inference(avatar_contradiction_clause,[],[f645]) ).
cnf(s1,plain,
( spl52_1
| spl52_2 ),
inference(sat_conversion,[],[f563]) ).
cnf(s2,plain,
( spl52_2
| ~ spl52_3 ),
inference(sat_conversion,[],[f568]) ).
cnf(s3,plain,
( spl52_4
| spl52_5 ),
inference(sat_conversion,[],[f577]) ).
cnf(s4,plain,
( spl52_5
| ~ spl52_6 ),
inference(sat_conversion,[],[f582]) ).
cnf(s5,plain,
( spl52_5
| ~ spl52_7 ),
inference(sat_conversion,[],[f587]) ).
cnf(s6,plain,
( spl52_5
| ~ spl52_8 ),
inference(sat_conversion,[],[f592]) ).
cnf(s7,plain,
( ~ spl52_3
| ~ spl52_5 ),
inference(sat_conversion,[],[f593]) ).
cnf(s8,plain,
( spl52_1
| ~ spl52_5 ),
inference(sat_conversion,[],[f594]) ).
cnf(s9,plain,
( ~ spl52_1
| spl52_3 ),
inference(sat_conversion,[],[f595]) ).
cnf(s20,plain,
( ~ spl52_2
| ~ spl52_4
| spl52_6
| spl52_7
| spl52_8 ),
inference(sat_conversion,[],[f646]) ).
cnf(s25,plain,
spl52_1,
inference(rat,[],[s20,s3,s4,s5,s6,s1,s8]) ).
cnf(s26,plain,
spl52_3,
inference(rat,[],[s9,s25]) ).
cnf(s27,plain,
~ spl52_5,
inference(rat,[],[s7,s26]) ).
cnf(s28,plain,
spl52_2,
inference(rat,[],[s2,s26]) ).
cnf(s29,plain,
~ spl52_8,
inference(rat,[],[s6,s27]) ).
cnf(s30,plain,
~ spl52_7,
inference(rat,[],[s5,s27]) ).
cnf(s31,plain,
~ spl52_6,
inference(rat,[],[s4,s27]) ).
cnf(s32,plain,
spl52_4,
inference(rat,[],[s3,s27]) ).
cnf(s33,plain,
$false,
inference(rat,[],[s20,s29,s30,s31,s32,s28]) ).
fof(f647,plain,
$false,
inference(avatar_sat_refutation,[],[s33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC016+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.10/0.38 % Computer : n008.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 07:27:09 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 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.16/0.47 % (2077906)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (2077911)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3908955619_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47 % (2077912)% WARNING: option uhcvi not known.
% 0.16/0.47 % (2077915)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3238122673:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47 % (2077912)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=290214994:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47 % (2077913)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3548249773:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47 % (2077914)dis+10_1_sil=32000:sp=arity:random_seed=2197724375:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47 % (2077917)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3634177064:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.47 % (2077916)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2981869488:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.47 % TRYING [1]
% 0.16/0.47 % TRYING [2]
% 0.16/0.47 % TRYING [3]
% 0.16/0.47 % (2077912) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2077906-2077912"...
% 0.16/0.47 % (2077914) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2077906-2077914"...
% 0.16/0.47 % (2077913) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2077906-2077913"...
% 0.16/0.47 % (2077912)...printing done.
% 0.16/0.47 % (2077914)...printing done.
% 0.16/0.47 % (2077912)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48 % (2077912)------------------------------
% 0.16/0.48 % (2077912)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.48 % (2077912)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.48 % (2077912)CaDiCaL version: 2.1.3
% 0.16/0.48 % (2077912)Termination reason: Refutation
% 0.16/0.48 % (2077912)Time elapsed: 0.007 s
% 0.16/0.48 % (2077912)Peak memory usage: 13 MB
% 0.16/0.48 % (2077912)Instructions burned: 11 (million)
% 0.16/0.48 % (2077906)Success in time 0.048 s
% 0.16/0.48 % Vampire exiting
%------------------------------------------------------------------------------