%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC054+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 : 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:04:28 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 65 ( 12 unt; 8 def)
% Number of atoms : 209 ( 32 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 254 ( 110 ~; 105 |; 25 &)
% ( 8 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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 : 24 ( 0 sgn 17 !; 7 ?)
% 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)
| ~ segmentP(X3,X4)
| ~ segmentP(X2,X4) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X1,X5)
& segmentP(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)
| ~ segmentP(X3,X4)
| ~ segmentP(X2,X4) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X1,X5)
& segmentP(X0,X5) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X3,X4)
& segmentP(X2,X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(X1,X5)
| ~ segmentP(X0,X5) ) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f410,plain,
! [X5] :
( ~ segmentP(sK47,X5)
| ~ segmentP(sK48,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil = sK48 ),
inference(cnf_transformation,[],[f221]) ).
fof(f411,plain,
! [X5] :
( ~ segmentP(sK47,X5)
| ~ segmentP(sK48,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil != sK47 ),
inference(cnf_transformation,[],[f221]) ).
fof(f412,plain,
( ~ neq(sK50,nil)
| segmentP(sK49,sK51) ),
inference(cnf_transformation,[],[f221]) ).
fof(f413,plain,
( ~ neq(sK50,nil)
| segmentP(sK50,sK51) ),
inference(cnf_transformation,[],[f221]) ).
fof(f414,plain,
( ~ neq(sK50,nil)
| neq(sK51,nil) ),
inference(cnf_transformation,[],[f221]) ).
fof(f415,plain,
( ~ neq(sK50,nil)
| ssList(sK51) ),
inference(cnf_transformation,[],[f221]) ).
fof(f416,plain,
( neq(sK48,nil)
| nil != sK47 ),
inference(cnf_transformation,[],[f221]) ).
fof(f417,plain,
( neq(sK48,nil)
| nil = sK48 ),
inference(cnf_transformation,[],[f221]) ).
fof(f418,plain,
( nil != sK50
| nil = sK49 ),
inference(cnf_transformation,[],[f221]) ).
fof(f419,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f221]) ).
fof(f420,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f221]) ).
fof(f427,plain,
( neq(sK50,nil)
| nil = sK50 ),
inference(definition_unfolding,[],[f417,f420,f420]) ).
fof(f428,plain,
( neq(sK50,nil)
| nil != sK49 ),
inference(definition_unfolding,[],[f416,f420,f419]) ).
fof(f429,plain,
! [X5] :
( ~ segmentP(sK49,X5)
| ~ segmentP(sK50,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil != sK49 ),
inference(definition_unfolding,[],[f411,f419,f420,f419]) ).
fof(f430,plain,
! [X5] :
( ~ segmentP(sK49,X5)
| ~ segmentP(sK50,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil = sK50 ),
inference(definition_unfolding,[],[f410,f419,f420,f420]) ).
fof(f464,definition,
( spl52_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl52_1])],[avatar_definition]) ).
fof(f468,definition,
( spl52_2
<=> ! [X5] :
( ~ segmentP(sK49,X5)
| ~ ssList(X5)
| ~ neq(X5,nil)
| ~ segmentP(sK50,X5) ) ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f469,plain,
( ! [X5] :
( ~ neq(X5,nil)
| ~ ssList(X5)
| ~ segmentP(sK49,X5)
| ~ segmentP(sK50,X5) )
| ~ spl52_2 ),
inference(avatar_component_clause,[],[f468]) ).
fof(f470,plain,
( spl52_1
| spl52_2 ),
inference(avatar_split_clause,[],[f430,f468,f464]) ).
fof(f472,definition,
( spl52_3
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl52_3])],[avatar_definition]) ).
fof(f475,plain,
( ~ spl52_3
| spl52_2 ),
inference(avatar_split_clause,[],[f429,f468,f472]) ).
fof(f477,definition,
( spl52_4
<=> segmentP(sK49,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f479,plain,
( segmentP(sK49,sK51)
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f477]) ).
fof(f481,definition,
( spl52_5
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl52_5])],[avatar_definition]) ).
fof(f484,plain,
( spl52_4
| ~ spl52_5 ),
inference(avatar_split_clause,[],[f412,f481,f477]) ).
fof(f486,definition,
( spl52_6
<=> segmentP(sK50,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_6])],[avatar_definition]) ).
fof(f488,plain,
( segmentP(sK50,sK51)
| ~ spl52_6 ),
inference(avatar_component_clause,[],[f486]) ).
fof(f489,plain,
( spl52_6
| ~ spl52_5 ),
inference(avatar_split_clause,[],[f413,f481,f486]) ).
fof(f491,definition,
( spl52_7
<=> neq(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl52_7])],[avatar_definition]) ).
fof(f493,plain,
( neq(sK51,nil)
| ~ spl52_7 ),
inference(avatar_component_clause,[],[f491]) ).
fof(f494,plain,
( spl52_7
| ~ spl52_5 ),
inference(avatar_split_clause,[],[f414,f481,f491]) ).
fof(f496,definition,
( spl52_8
<=> ssList(sK51) ),
introduced(definition,[new_symbols(definition,[spl52_8])],[avatar_definition]) ).
fof(f498,plain,
( ssList(sK51)
| ~ spl52_8 ),
inference(avatar_component_clause,[],[f496]) ).
fof(f499,plain,
( spl52_8
| ~ spl52_5 ),
inference(avatar_split_clause,[],[f415,f481,f496]) ).
fof(f500,plain,
( ~ spl52_3
| spl52_5 ),
inference(avatar_split_clause,[],[f428,f481,f472]) ).
fof(f501,plain,
( spl52_1
| spl52_5 ),
inference(avatar_split_clause,[],[f427,f481,f464]) ).
fof(f502,plain,
( spl52_3
| ~ spl52_1 ),
inference(avatar_split_clause,[],[f418,f464,f472]) ).
fof(f536,plain,
( ~ ssList(sK51)
| ~ segmentP(sK49,sK51)
| ~ segmentP(sK50,sK51)
| ~ spl52_2
| ~ spl52_7 ),
inference(resolution,[],[f469,f493]) ).
fof(f537,plain,
( ~ segmentP(sK49,sK51)
| ~ segmentP(sK50,sK51)
| ~ spl52_2
| ~ spl52_7
| ~ spl52_8 ),
inference(forward_subsumption_resolution,[],[f536,f498]) ).
fof(f539,plain,
( ~ segmentP(sK50,sK51)
| ~ spl52_2
| ~ spl52_4
| ~ spl52_7
| ~ spl52_8 ),
inference(forward_subsumption_resolution,[],[f537,f479]) ).
fof(f549,plain,
( $false
| ~ spl52_2
| ~ spl52_4
| ~ spl52_6
| ~ spl52_7
| ~ spl52_8 ),
inference(forward_subsumption_resolution,[],[f539,f488]) ).
fof(f550,plain,
( ~ spl52_2
| ~ spl52_4
| ~ spl52_6
| ~ spl52_7
| ~ spl52_8 ),
inference(avatar_contradiction_clause,[],[f549]) ).
cnf(s1,plain,
( spl52_1
| spl52_2 ),
inference(sat_conversion,[],[f470]) ).
cnf(s2,plain,
( spl52_2
| ~ spl52_3 ),
inference(sat_conversion,[],[f475]) ).
cnf(s3,plain,
( spl52_4
| ~ spl52_5 ),
inference(sat_conversion,[],[f484]) ).
cnf(s4,plain,
( ~ spl52_5
| spl52_6 ),
inference(sat_conversion,[],[f489]) ).
cnf(s5,plain,
( ~ spl52_5
| spl52_7 ),
inference(sat_conversion,[],[f494]) ).
cnf(s6,plain,
( ~ spl52_5
| spl52_8 ),
inference(sat_conversion,[],[f499]) ).
cnf(s7,plain,
( ~ spl52_3
| spl52_5 ),
inference(sat_conversion,[],[f500]) ).
cnf(s8,plain,
( spl52_1
| spl52_5 ),
inference(sat_conversion,[],[f501]) ).
cnf(s9,plain,
( ~ spl52_1
| spl52_3 ),
inference(sat_conversion,[],[f502]) ).
cnf(s19,plain,
( ~ spl52_2
| ~ spl52_4
| ~ spl52_6
| ~ spl52_7
| ~ spl52_8 ),
inference(sat_conversion,[],[f550]) ).
cnf(s23,plain,
spl52_1,
inference(rat,[],[s19,s3,s4,s5,s6,s1,s8]) ).
cnf(s24,plain,
spl52_3,
inference(rat,[],[s9,s23]) ).
cnf(s25,plain,
spl52_5,
inference(rat,[],[s7,s24]) ).
cnf(s26,plain,
spl52_2,
inference(rat,[],[s2,s24]) ).
cnf(s27,plain,
spl52_8,
inference(rat,[],[s6,s25]) ).
cnf(s28,plain,
spl52_7,
inference(rat,[],[s5,s25]) ).
cnf(s29,plain,
spl52_6,
inference(rat,[],[s4,s25]) ).
cnf(s30,plain,
spl52_4,
inference(rat,[],[s3,s25]) ).
cnf(s31,plain,
$false,
inference(rat,[],[s19,s27,s28,s29,s30,s26]) ).
fof(f551,plain,
$false,
inference(avatar_sat_refutation,[],[s31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC054+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.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 07:38:01 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 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.10/0.44 % (624339)Will run a generic schedule for satisfiability detection.
% 0.10/0.44 % (624348)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2943400317:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.44 % (624345)% WARNING: option uhcvi not known.
% 0.10/0.44 % (624348) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-624339-624348"...
% 0.10/0.44 % (624344)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1072584194_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.44 % (624346)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3366949299:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.44 % (624348)...printing done.
% 0.10/0.44 % (624347)dis+10_1_sil=32000:sp=arity:random_seed=3940008933:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.44 % (624349)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=484802748:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.44 % (624350)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2879433386:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.44 % (624348)Refutation found. Thanks to Tanya!
% 0.10/0.44 % SZS status Theorem for theBenchmark
% 0.10/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.44 % (624348)------------------------------
% 0.10/0.44 % (624348)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44 % (624348)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44 % (624348)CaDiCaL version: 2.1.3
% 0.10/0.44 % (624348)Termination reason: Refutation
% 0.10/0.44 % (624348)Time elapsed: 0.007 s
% 0.10/0.44 % (624348)Peak memory usage: 13 MB
% 0.10/0.44 % (624348)Instructions burned: 19 (million)
% 0.10/0.44 % (624339)Success in time 0.033 s
% 0.10/0.44 % Vampire exiting
%------------------------------------------------------------------------------