%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC047+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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:26 PM UTC 2026
% Result : Theorem 0.07s 0.37s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 51 ( 12 unt; 3 def)
% Number of atoms : 168 ( 37 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 195 ( 78 ~; 79 |; 26 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 34 ( 0 sgn 24 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax49) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| X3 != X2
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X1,X4)
& rearsegP(X0,X4) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| X3 != X2
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X1,X4)
& rearsegP(X0,X4) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f163,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& X2 = X3
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& X2 = X3
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f350,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(cnf_transformation,[],[f163]) ).
fof(f411,plain,
! [X4] :
( ~ rearsegP(sK47,X4)
| ~ rearsegP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
! [X4] :
( ~ rearsegP(sK47,X4)
| ~ rearsegP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK47 ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( neq(sK48,nil)
| nil != sK47 ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( neq(sK48,nil)
| nil = sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
sK49 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
ssList(sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
sK47 = sK50,
inference(definition_unfolding,[],[f417,f416]) ).
fof(f423,plain,
ssList(sK50),
inference(definition_unfolding,[],[f421,f422]) ).
fof(f426,plain,
( neq(sK50,nil)
| nil = sK50 ),
inference(definition_unfolding,[],[f414,f418,f418]) ).
fof(f427,plain,
( neq(sK50,nil)
| nil != sK50 ),
inference(definition_unfolding,[],[f413,f418,f422]) ).
fof(f428,plain,
! [X4] :
( ~ rearsegP(sK50,X4)
| ~ rearsegP(sK50,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK50 ),
inference(definition_unfolding,[],[f412,f422,f418,f422]) ).
fof(f429,plain,
! [X4] :
( ~ rearsegP(sK50,X4)
| ~ rearsegP(sK50,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK50 ),
inference(definition_unfolding,[],[f411,f422,f418,f418]) ).
fof(f580,plain,
! [X0] :
( rearsegP(X0,X0)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f350]) ).
fof(f637,plain,
~ ssList(sK50),
inference(consistent_polarity_flipping,[],[f423]) ).
fof(f641,plain,
! [X4] :
( ~ rearsegP(sK50,X4)
| ~ rearsegP(sK50,X4)
| ~ neq(X4,nil)
| ssList(X4)
| nil != sK50 ),
inference(consistent_polarity_flipping,[],[f428]) ).
fof(f642,plain,
! [X4] :
( ~ rearsegP(sK50,X4)
| ~ rearsegP(sK50,X4)
| ~ neq(X4,nil)
| ssList(X4)
| nil = sK50 ),
inference(consistent_polarity_flipping,[],[f429]) ).
fof(f643,plain,
! [X4] :
( ~ rearsegP(sK50,X4)
| ~ neq(X4,nil)
| ssList(X4)
| nil = sK50 ),
inference(duplicate_literal_removal,[],[f642]) ).
fof(f644,plain,
! [X4] :
( ~ rearsegP(sK50,X4)
| ~ neq(X4,nil)
| ssList(X4)
| nil != sK50 ),
inference(duplicate_literal_removal,[],[f641]) ).
fof(f653,definition,
( spl51_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f657,definition,
( spl51_2
<=> ! [X4] :
( ~ rearsegP(sK50,X4)
| ssList(X4)
| ~ neq(X4,nil) ) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f658,plain,
( ! [X4] :
( ~ rearsegP(sK50,X4)
| ssList(X4)
| ~ neq(X4,nil) )
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f657]) ).
fof(f659,plain,
( spl51_1
| spl51_2 ),
inference(avatar_split_clause,[],[f643,f657,f653]) ).
fof(f660,plain,
( ~ spl51_1
| spl51_2 ),
inference(avatar_split_clause,[],[f644,f657,f653]) ).
fof(f662,definition,
( spl51_3
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f664,plain,
( neq(sK50,nil)
| ~ spl51_3 ),
inference(avatar_component_clause,[],[f662]) ).
fof(f665,plain,
( ~ spl51_1
| spl51_3 ),
inference(avatar_split_clause,[],[f427,f662,f653]) ).
fof(f666,plain,
( spl51_1
| spl51_3 ),
inference(avatar_split_clause,[],[f426,f662,f653]) ).
fof(f702,plain,
( ssList(sK50)
| ssList(sK50)
| ~ neq(sK50,nil)
| ~ spl51_2 ),
inference(resolution,[],[f580,f658]) ).
fof(f703,plain,
( ssList(sK50)
| ~ neq(sK50,nil)
| ~ spl51_2 ),
inference(duplicate_literal_removal,[],[f702]) ).
fof(f704,plain,
( ~ neq(sK50,nil)
| ~ spl51_2 ),
inference(forward_subsumption_resolution,[],[f703,f637]) ).
fof(f705,plain,
( $false
| ~ spl51_2
| ~ spl51_3 ),
inference(forward_subsumption_resolution,[],[f704,f664]) ).
fof(f706,plain,
( ~ spl51_2
| ~ spl51_3 ),
inference(avatar_contradiction_clause,[],[f705]) ).
cnf(s1,plain,
( spl51_1
| spl51_2 ),
inference(sat_conversion,[],[f659]) ).
cnf(s2,plain,
( ~ spl51_1
| spl51_2 ),
inference(sat_conversion,[],[f660]) ).
cnf(s3,plain,
( ~ spl51_1
| spl51_3 ),
inference(sat_conversion,[],[f665]) ).
cnf(s4,plain,
( spl51_1
| spl51_3 ),
inference(sat_conversion,[],[f666]) ).
cnf(s14,plain,
( ~ spl51_2
| ~ spl51_3 ),
inference(sat_conversion,[],[f706]) ).
cnf(s19,plain,
spl51_1,
inference(rat,[],[s14,s1,s4]) ).
cnf(s20,plain,
spl51_3,
inference(rat,[],[s3,s19]) ).
cnf(s21,plain,
spl51_2,
inference(rat,[],[s2,s19]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s14,s20,s21]) ).
fof(f707,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC047+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.03/0.31 % Computer : n012.cluster.edu
% 0.03/0.31 % Model : x86_64 x86_64
% 0.03/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.31 % Memory : 8046.5625MB
% 0.03/0.31 % OS : Linux 6.8.0-71-generic
% 0.03/0.31 % CPULimit : 300
% 0.03/0.31 % WCLimit : 300
% 0.03/0.31 % DateTime : Mon Sep 28 07:35:19 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.33 Running first-order model finding
% 0.07/0.33 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.37 % (3217973)Will run a generic schedule for satisfiability detection.
% 0.07/0.37 % (3217979)% WARNING: option uhcvi not known.
% 0.07/0.37 % (3217979)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1629917855:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.37 % (3217978)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=86416446_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.37 % (3217981)dis+10_1_sil=32000:sp=arity:random_seed=1609568366:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.37 % (3217980)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3004794913:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.37 % (3217982)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1611626654:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.37 % (3217983)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=309861259:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.37 % (3217984)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=705701291:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.37 % (3217979) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3217973-3217979"...
% 0.07/0.37 % (3217981) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3217973-3217981"...
% 0.07/0.37 % (3217979)...printing done.
% 0.07/0.37 % (3217981)...printing done.
% 0.07/0.37 % (3217979)Refutation found. Thanks to Tanya!
% 0.07/0.37 % SZS status Theorem for theBenchmark
% 0.07/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.37 % (3217979)------------------------------
% 0.07/0.37 % (3217979)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.37 % (3217979)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.37 % (3217979)CaDiCaL version: 2.1.3
% 0.07/0.37 % (3217979)Termination reason: Refutation
% 0.07/0.37 % (3217979)Time elapsed: 0.004 s
% 0.07/0.37 % (3217979)Peak memory usage: 12 MB
% 0.07/0.37 % (3217979)Instructions burned: 10 (million)
% 0.07/0.37 % (3217973)Success in time 0.036 s
% 0.07/0.37 % Vampire exiting
%------------------------------------------------------------------------------