%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC387+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 : n015.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:05:49 PM UTC 2026
% Result : Theorem 0.19s 0.28s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 66 ( 14 unt; 7 def)
% Number of atoms : 205 ( 55 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 232 ( 93 ~; 86 |; 32 &)
% ( 9 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 21 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X0
& memberP(X1,X4) )
| ( nil != X2
& nil = X3 )
| ( nil = X1
& nil = X0 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X2
| ~ memberP(X3,X5) ) )
& neq(X3,nil) ) ) ) ) ) ),
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
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X0
& memberP(X1,X4) )
| ( nil != X2
& nil = X3 )
| ( nil = X1
& nil = X0 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X2
| ~ memberP(X3,X5) ) )
& neq(X3,nil) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| cons(X4,nil) != X0
| ~ memberP(X1,X4) )
& ( nil = X2
| nil != X3 )
& ( nil != X1
| nil != X0 )
& ( ? [X5] :
( cons(X5,nil) = X2
& memberP(X3,X5)
& ssItem(X5) )
| ~ neq(X3,nil) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| cons(X4,nil) != X0
| ~ memberP(X1,X4) )
& ( nil = X2
| nil != X3 )
& ( nil != X1
| nil != X0 )
& ( ? [X5] :
( cons(X5,nil) = X2
& memberP(X3,X5)
& ssItem(X5) )
| ~ neq(X3,nil) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f303,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f411,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( ~ neq(sK50,nil)
| memberP(sK50,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( ~ neq(sK50,nil)
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
! [X4] :
( ~ memberP(sK48,X4)
| cons(X4,nil) != sK47
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( nil != sK50
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( nil != sK47
| nil != sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
( nil != sK49
| nil != sK50 ),
inference(definition_unfolding,[],[f416,f418,f419]) ).
fof(f426,plain,
! [X4] :
( ~ memberP(sK50,X4)
| cons(X4,nil) != sK49
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f414,f419,f418]) ).
fof(f567,plain,
! [X4] :
( cons(X4,nil) != sK49
| memberP(sK50,X4)
| ~ ssItem(X4) ),
inference(consistent_polarity_flipping,[],[f426]) ).
fof(f568,plain,
( ~ neq(sK50,nil)
| ~ memberP(sK50,sK51) ),
inference(consistent_polarity_flipping,[],[f412]) ).
fof(f577,definition,
( spl52_1
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl52_1])],[avatar_definition]) ).
fof(f579,plain,
( ssItem(sK51)
| ~ spl52_1 ),
inference(avatar_component_clause,[],[f577]) ).
fof(f581,definition,
( spl52_2
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f583,plain,
( ~ neq(sK50,nil)
| spl52_2 ),
inference(avatar_component_clause,[],[f581]) ).
fof(f584,plain,
( spl52_1
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f411,f581,f577]) ).
fof(f586,definition,
( spl52_3
<=> memberP(sK50,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_3])],[avatar_definition]) ).
fof(f588,plain,
( ~ memberP(sK50,sK51)
| spl52_3 ),
inference(avatar_component_clause,[],[f586]) ).
fof(f589,plain,
( ~ spl52_3
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f568,f581,f586]) ).
fof(f591,definition,
( spl52_4
<=> sK49 = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f593,plain,
( sK49 = cons(sK51,nil)
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f591]) ).
fof(f594,plain,
( spl52_4
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f413,f581,f591]) ).
fof(f596,definition,
( spl52_5
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl52_5])],[avatar_definition]) ).
fof(f600,definition,
( spl52_6
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl52_6])],[avatar_definition]) ).
fof(f602,plain,
( nil != sK50
| spl52_6 ),
inference(avatar_component_clause,[],[f600]) ).
fof(f603,plain,
( spl52_5
| ~ spl52_6 ),
inference(avatar_split_clause,[],[f415,f600,f596]) ).
fof(f604,plain,
( ~ spl52_6
| ~ spl52_5 ),
inference(avatar_split_clause,[],[f425,f596,f600]) ).
fof(f610,definition,
( spl52_8
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl52_8])],[avatar_definition]) ).
fof(f611,plain,
( ssList(nil)
| ~ spl52_8 ),
inference(avatar_component_clause,[],[f610]) ).
fof(f639,plain,
spl52_8,
inference(avatar_split_clause,[],[f306,f610]) ).
fof(f708,plain,
( ~ ssList(nil)
| nil = sK50
| ~ ssList(sK50)
| spl52_2 ),
inference(resolution,[],[f303,f583]) ).
fof(f713,plain,
( nil = sK50
| ~ ssList(sK50)
| spl52_2
| ~ spl52_8 ),
inference(forward_subsumption_resolution,[],[f708,f611]) ).
fof(f714,plain,
( ~ ssList(sK50)
| spl52_2
| spl52_6
| ~ spl52_8 ),
inference(forward_subsumption_resolution,[],[f713,f602]) ).
fof(f715,plain,
( $false
| spl52_2
| spl52_6
| ~ spl52_8 ),
inference(forward_subsumption_resolution,[],[f714,f417]) ).
fof(f716,plain,
( spl52_2
| spl52_6
| ~ spl52_8 ),
inference(avatar_contradiction_clause,[],[f715]) ).
fof(f722,plain,
( sK49 != sK49
| memberP(sK50,sK51)
| ~ ssItem(sK51)
| ~ spl52_4 ),
inference(superposition,[],[f567,f593]) ).
fof(f729,plain,
( memberP(sK50,sK51)
| ~ ssItem(sK51)
| ~ spl52_4 ),
inference(trivial_inequality_removal,[],[f722]) ).
fof(f735,plain,
( ~ ssItem(sK51)
| spl52_3
| ~ spl52_4 ),
inference(forward_subsumption_resolution,[],[f729,f588]) ).
fof(f744,plain,
( $false
| ~ spl52_1
| spl52_3
| ~ spl52_4 ),
inference(forward_subsumption_resolution,[],[f735,f579]) ).
fof(f745,plain,
( ~ spl52_1
| spl52_3
| ~ spl52_4 ),
inference(avatar_contradiction_clause,[],[f744]) ).
cnf(s1,plain,
( spl52_1
| ~ spl52_2 ),
inference(sat_conversion,[],[f584]) ).
cnf(s2,plain,
( ~ spl52_2
| ~ spl52_3 ),
inference(sat_conversion,[],[f589]) ).
cnf(s3,plain,
( ~ spl52_2
| spl52_4 ),
inference(sat_conversion,[],[f594]) ).
cnf(s4,plain,
( spl52_5
| ~ spl52_6 ),
inference(sat_conversion,[],[f603]) ).
cnf(s5,plain,
( ~ spl52_5
| ~ spl52_6 ),
inference(sat_conversion,[],[f604]) ).
cnf(s14,plain,
spl52_8,
inference(sat_conversion,[],[f639]) ).
cnf(s16,plain,
( spl52_2
| spl52_6
| ~ spl52_8 ),
inference(sat_conversion,[],[f716]) ).
cnf(s17,plain,
( ~ spl52_1
| spl52_3
| ~ spl52_4 ),
inference(sat_conversion,[],[f745]) ).
cnf(s24,plain,
~ spl52_6,
inference(rat,[],[s4,s5]) ).
cnf(s25,plain,
spl52_2,
inference(rat,[],[s16,s14,s24]) ).
cnf(s26,plain,
spl52_4,
inference(rat,[],[s3,s25]) ).
cnf(s27,plain,
~ spl52_3,
inference(rat,[],[s2,s25]) ).
cnf(s28,plain,
spl52_1,
inference(rat,[],[s1,s25]) ).
cnf(s30,plain,
$false,
inference(rat,[],[s17,s28,s26,s27]) ).
fof(f747,plain,
$false,
inference(avatar_sat_refutation,[],[s30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC387+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.08/0.18 % Computer : n015.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:29:02 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.22 Running first-order model finding
% 0.08/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.19/0.28 % (2497640)Will run a generic schedule for satisfiability detection.
% 0.19/0.28 % (2497647)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2875206214:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.28 % (2497646)% WARNING: option uhcvi not known.
% 0.19/0.28 % (2497645)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3929553746_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.28 % (2497646)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3822259241:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.28 % (2497648)dis+10_1_sil=32000:sp=arity:random_seed=4292794047:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.28 % (2497650)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3832891267:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.28 % (2497649)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2084843359:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.28 % (2497651)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1267559978:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.28 % (2497646) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2497640-2497646"...
% 0.19/0.28 % (2497646)...printing done.
% 0.19/0.28 % (2497646)Refutation found. Thanks to Tanya!
% 0.19/0.28 % SZS status Theorem for theBenchmark
% 0.19/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.28 % (2497646)------------------------------
% 0.19/0.28 % (2497646)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.28 % (2497646)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.28 % (2497646)CaDiCaL version: 2.1.3
% 0.19/0.28 % (2497646)Termination reason: Refutation
% 0.19/0.28 % (2497646)Time elapsed: 0.011 s
% 0.19/0.28 % (2497646)Peak memory usage: 13 MB
% 0.19/0.28 % (2497646)Instructions burned: 17 (million)
% 0.19/0.28 % (2497640)Success in time 0.049 s
% 0.19/0.28 % Vampire exiting
%------------------------------------------------------------------------------