%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC050+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 : n019.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:27 PM UTC 2026
% Result : Theorem 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 50 ( 13 unt; 6 def)
% Number of atoms : 178 ( 10 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 221 ( 93 ~; 80 |; 32 &)
% ( 6 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 28 ( 0 sgn 16 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X1,X4)
& rearsegP(X0,X4) )
| ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ rearsegP(X3,X5)
| ~ rearsegP(X2,X5) ) ) )
& ( ~ neq(X1,nil)
| 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
| ( ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X1,X4)
& rearsegP(X0,X4) )
| ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ rearsegP(X3,X5)
| ~ rearsegP(X2,X5) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4) )
& ? [X5] :
( neq(X5,nil)
& rearsegP(X3,X5)
& rearsegP(X2,X5)
& ssList(X5) ) )
| ( neq(X1,nil)
& ~ 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
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4) )
& ? [X5] :
( neq(X5,nil)
& rearsegP(X3,X5)
& rearsegP(X2,X5)
& ssList(X5) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f411,plain,
! [X4] :
( ~ neq(sK50,nil)
| ~ rearsegP(sK47,X4)
| ~ rearsegP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( ~ neq(sK50,nil)
| ssList(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( ~ neq(sK50,nil)
| rearsegP(sK49,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( ~ neq(sK50,nil)
| rearsegP(sK50,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( ~ neq(sK50,nil)
| neq(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f432,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f421,f425]) ).
fof(f438,plain,
! [X4] :
( ~ neq(sK50,nil)
| ~ rearsegP(sK49,X4)
| ~ rearsegP(sK50,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f411,f424,f425]) ).
fof(f472,definition,
( spl52_1
<=> ! [X4] :
( ~ rearsegP(sK49,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK50,X4) ) ),
introduced(definition,[new_symbols(definition,[spl52_1])],[avatar_definition]) ).
fof(f473,plain,
( ! [X4] :
( ~ neq(X4,nil)
| ~ ssList(X4)
| ~ rearsegP(sK49,X4)
| ~ rearsegP(sK50,X4) )
| ~ spl52_1 ),
inference(avatar_component_clause,[],[f472]) ).
fof(f475,definition,
( spl52_2
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f478,plain,
( spl52_1
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f438,f475,f472]) ).
fof(f481,definition,
( spl52_3
<=> ssList(sK51) ),
introduced(definition,[new_symbols(definition,[spl52_3])],[avatar_definition]) ).
fof(f483,plain,
( ssList(sK51)
| ~ spl52_3 ),
inference(avatar_component_clause,[],[f481]) ).
fof(f484,plain,
( spl52_3
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f413,f475,f481]) ).
fof(f486,definition,
( spl52_4
<=> rearsegP(sK49,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f488,plain,
( rearsegP(sK49,sK51)
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f486]) ).
fof(f489,plain,
( spl52_4
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f414,f475,f486]) ).
fof(f491,definition,
( spl52_5
<=> rearsegP(sK50,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_5])],[avatar_definition]) ).
fof(f493,plain,
( rearsegP(sK50,sK51)
| ~ spl52_5 ),
inference(avatar_component_clause,[],[f491]) ).
fof(f494,plain,
( spl52_5
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f415,f475,f491]) ).
fof(f496,definition,
( spl52_6
<=> neq(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl52_6])],[avatar_definition]) ).
fof(f498,plain,
( neq(sK51,nil)
| ~ spl52_6 ),
inference(avatar_component_clause,[],[f496]) ).
fof(f499,plain,
( spl52_6
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f416,f475,f496]) ).
fof(f504,plain,
spl52_2,
inference(avatar_split_clause,[],[f432,f475]) ).
fof(f538,plain,
( ~ ssList(sK51)
| ~ rearsegP(sK49,sK51)
| ~ rearsegP(sK50,sK51)
| ~ spl52_1
| ~ spl52_6 ),
inference(resolution,[],[f473,f498]) ).
fof(f539,plain,
( ~ rearsegP(sK49,sK51)
| ~ rearsegP(sK50,sK51)
| ~ spl52_1
| ~ spl52_3
| ~ spl52_6 ),
inference(forward_subsumption_resolution,[],[f538,f483]) ).
fof(f541,plain,
( ~ rearsegP(sK50,sK51)
| ~ spl52_1
| ~ spl52_3
| ~ spl52_4
| ~ spl52_6 ),
inference(forward_subsumption_resolution,[],[f539,f488]) ).
fof(f551,plain,
( $false
| ~ spl52_1
| ~ spl52_3
| ~ spl52_4
| ~ spl52_5
| ~ spl52_6 ),
inference(forward_subsumption_resolution,[],[f541,f493]) ).
fof(f552,plain,
( ~ spl52_1
| ~ spl52_3
| ~ spl52_4
| ~ spl52_5
| ~ spl52_6 ),
inference(avatar_contradiction_clause,[],[f551]) ).
cnf(s1,plain,
( spl52_1
| ~ spl52_2 ),
inference(sat_conversion,[],[f478]) ).
cnf(s3,plain,
( ~ spl52_2
| spl52_3 ),
inference(sat_conversion,[],[f484]) ).
cnf(s4,plain,
( ~ spl52_2
| spl52_4 ),
inference(sat_conversion,[],[f489]) ).
cnf(s5,plain,
( ~ spl52_2
| spl52_5 ),
inference(sat_conversion,[],[f494]) ).
cnf(s6,plain,
( ~ spl52_2
| spl52_6 ),
inference(sat_conversion,[],[f499]) ).
cnf(s11,plain,
spl52_2,
inference(sat_conversion,[],[f504]) ).
cnf(s21,plain,
( ~ spl52_1
| ~ spl52_3
| ~ spl52_4
| ~ spl52_5
| ~ spl52_6 ),
inference(sat_conversion,[],[f552]) ).
cnf(s25,plain,
spl52_6,
inference(rat,[],[s6,s11]) ).
cnf(s26,plain,
spl52_5,
inference(rat,[],[s5,s11]) ).
cnf(s27,plain,
spl52_4,
inference(rat,[],[s4,s11]) ).
cnf(s28,plain,
spl52_3,
inference(rat,[],[s3,s11]) ).
cnf(s29,plain,
~ spl52_1,
inference(rat,[],[s21,s25,s26,s27,s28]) ).
cnf(s30,plain,
$false,
inference(rat,[],[s1,s11,s29]) ).
fof(f553,plain,
$false,
inference(avatar_sat_refutation,[],[s30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC050+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n019.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 07:37:59 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43 Running first-order model finding
% 0.11/0.43 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.18/0.48 % (3832849)Will run a generic schedule for satisfiability detection.
% 0.18/0.48 % (3832864)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2480849545:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.48 % (3832861)% WARNING: option uhcvi not known.
% 0.18/0.48 % (3832864) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3832849-3832864"...
% 0.18/0.48 % (3832864)...printing done.
% 0.18/0.48 % (3832861)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3597802862:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.48 % (3832862)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3974576470:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.48 % (3832860)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1898781039_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.48 % (3832863)dis+10_1_sil=32000:sp=arity:random_seed=2557770468:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.48 % (3832864)Refutation found. Thanks to Tanya!
% 0.18/0.48 % SZS status Theorem for theBenchmark
% 0.18/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48 % (3832864)------------------------------
% 0.18/0.48 % (3832864)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.48 % (3832864)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.48 % (3832864)CaDiCaL version: 2.1.3
% 0.18/0.48 % (3832864)Termination reason: Refutation
% 0.18/0.48 % (3832864)Time elapsed: 0.006 s
% 0.18/0.48 % (3832864)Peak memory usage: 13 MB
% 0.18/0.48 % (3832864)Instructions burned: 18 (million)
% 0.18/0.48 % (3832849)Success in time 0.038 s
% 0.18/0.48 % Vampire exiting
%------------------------------------------------------------------------------