%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC116+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 : n026.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:44 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 54 ( 13 unt; 6 def)
% Number of atoms : 180 ( 47 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 203 ( 77 ~; 69 |; 39 &)
% ( 8 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 24 ( 0 sgn 16 !; 8 ?)
% 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
| ( nil != X2
& nil = X3 )
| ( nil = X1
& nil = X0 )
| ( neq(X0,nil)
& segmentP(X1,X0) )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) ) ) ) ) ) ) ),
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 )
| ( nil = X1
& nil = X0 )
| ( neq(X0,nil)
& segmentP(X1,X0) )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ segmentP(X3,X2) ) ) ) ) ) ) ),
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
& ( nil = X2
| nil != X3 )
& ( nil != X1
| nil != X0 )
& ( ~ neq(X0,nil)
| ~ segmentP(X1,X0) )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& segmentP(X3,X2) ) )
& 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 )
& ( nil != X1
| nil != X0 )
& ( ~ neq(X0,nil)
| ~ segmentP(X1,X0) )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& segmentP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f273,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& ( nil = sK55
| nil != sK56 )
& ( nil != sK54
| nil != sK53 )
& ( ~ neq(sK53,nil)
| ~ segmentP(sK54,sK53) )
& ( ~ neq(sK56,nil)
| ( neq(sK55,nil)
& segmentP(sK56,sK55) ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f387,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f499,plain,
ssList(sK56),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( ~ neq(sK56,nil)
| segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( ~ neq(sK56,nil)
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( ~ neq(sK53,nil)
| ~ segmentP(sK54,sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( nil != sK54
| nil != sK53 ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
( nil = sK55
| nil != sK56 ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
( nil != sK56
| nil != sK55 ),
inference(definition_unfolding,[],[f503,f506,f505]) ).
fof(f508,plain,
( ~ neq(sK55,nil)
| ~ segmentP(sK56,sK55) ),
inference(definition_unfolding,[],[f502,f505,f506,f505]) ).
fof(f546,definition,
( spl57_1
<=> segmentP(sK56,sK55) ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f550,definition,
( spl57_2
<=> neq(sK56,nil) ),
introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).
fof(f552,plain,
( ~ neq(sK56,nil)
| spl57_2 ),
inference(avatar_component_clause,[],[f550]) ).
fof(f553,plain,
( spl57_1
| ~ spl57_2 ),
inference(avatar_split_clause,[],[f500,f550,f546]) ).
fof(f555,definition,
( spl57_3
<=> neq(sK55,nil) ),
introduced(definition,[new_symbols(definition,[spl57_3])],[avatar_definition]) ).
fof(f558,plain,
( spl57_3
| ~ spl57_2 ),
inference(avatar_split_clause,[],[f501,f550,f555]) ).
fof(f559,plain,
( ~ spl57_1
| ~ spl57_3 ),
inference(avatar_split_clause,[],[f508,f555,f546]) ).
fof(f561,definition,
( spl57_4
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl57_4])],[avatar_definition]) ).
fof(f565,definition,
( spl57_5
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl57_5])],[avatar_definition]) ).
fof(f567,plain,
( nil != sK56
| spl57_5 ),
inference(avatar_component_clause,[],[f565]) ).
fof(f568,plain,
( ~ spl57_4
| ~ spl57_5 ),
inference(avatar_split_clause,[],[f507,f565,f561]) ).
fof(f569,plain,
( ~ spl57_5
| spl57_4 ),
inference(avatar_split_clause,[],[f504,f561,f565]) ).
fof(f571,definition,
( spl57_6
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl57_6])],[avatar_definition]) ).
fof(f572,plain,
( ssList(nil)
| ~ spl57_6 ),
inference(avatar_component_clause,[],[f571]) ).
fof(f604,plain,
spl57_6,
inference(avatar_split_clause,[],[f389,f571]) ).
fof(f987,plain,
( nil = sK56
| ~ ssList(nil)
| ~ ssList(sK56)
| spl57_2 ),
inference(resolution,[],[f387,f552]) ).
fof(f992,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| spl57_2
| spl57_5 ),
inference(forward_subsumption_resolution,[],[f987,f567]) ).
fof(f993,plain,
( ~ ssList(sK56)
| spl57_2
| spl57_5
| ~ spl57_6 ),
inference(forward_subsumption_resolution,[],[f992,f572]) ).
fof(f994,plain,
( $false
| spl57_2
| spl57_5
| ~ spl57_6 ),
inference(forward_subsumption_resolution,[],[f993,f499]) ).
fof(f995,plain,
( spl57_2
| spl57_5
| ~ spl57_6 ),
inference(avatar_contradiction_clause,[],[f994]) ).
cnf(s1,plain,
( spl57_1
| ~ spl57_2 ),
inference(sat_conversion,[],[f553]) ).
cnf(s2,plain,
( ~ spl57_2
| spl57_3 ),
inference(sat_conversion,[],[f558]) ).
cnf(s3,plain,
( ~ spl57_1
| ~ spl57_3 ),
inference(sat_conversion,[],[f559]) ).
cnf(s4,plain,
( ~ spl57_4
| ~ spl57_5 ),
inference(sat_conversion,[],[f568]) ).
cnf(s5,plain,
( spl57_4
| ~ spl57_5 ),
inference(sat_conversion,[],[f569]) ).
cnf(s14,plain,
spl57_6,
inference(sat_conversion,[],[f604]) ).
cnf(s30,plain,
( spl57_2
| spl57_5
| ~ spl57_6 ),
inference(sat_conversion,[],[f995]) ).
cnf(s35,plain,
~ spl57_5,
inference(rat,[],[s4,s5]) ).
cnf(s36,plain,
spl57_2,
inference(rat,[],[s30,s14,s35]) ).
cnf(s37,plain,
spl57_3,
inference(rat,[],[s2,s36]) ).
cnf(s38,plain,
spl57_1,
inference(rat,[],[s1,s36]) ).
cnf(s39,plain,
$false,
inference(rat,[],[s3,s37,s38]) ).
fof(f996,plain,
$false,
inference(avatar_sat_refutation,[],[s39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC116+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.11/0.37 % Computer : n026.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 08:02:09 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.11/0.45 % (3684139)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (3684147)dis+10_1_sil=32000:sp=arity:random_seed=1937717348:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.45 % (3684145)% WARNING: option uhcvi not known.
% 0.11/0.45 % (3684144)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3098773951_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.45 % (3684145)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2299773793:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.45 % (3684150)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3607861539:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45 % (3684148)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2701737607:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45 % (3684146)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2184955677:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45 % (3684147) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3684139-3684147"...
% 0.11/0.45 % (3684149)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1783394001:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45 % (3684147)...printing done.
% 0.11/0.45 % (3684147)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (3684147)------------------------------
% 0.11/0.45 % (3684147)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (3684147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (3684147)CaDiCaL version: 2.1.3
% 0.11/0.45 % (3684147)Termination reason: Refutation
% 0.11/0.45 % (3684147)Time elapsed: 0.009 s
% 0.11/0.45 % (3684147)Peak memory usage: 13 MB
% 0.11/0.45 % (3684147)Instructions burned: 22 (million)
% 0.11/0.45 % (3684139)Success in time 0.035 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------