%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC049+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 : 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:26 PM UTC 2026
% Result : Theorem 0.41s 0.46s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 72 ( 18 unt; 6 def)
% Number of atoms : 217 ( 41 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 234 ( 89 ~; 94 |; 32 &)
% ( 8 <=>; 11 =>; 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 : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 35 ( 0 sgn 25 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X1,X4)
& rearsegP(X0,X4) )
| ( nil != X2
& nil = X3 )
| ( nil = X1
& nil = X0 )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) ) ) ) ) ) ),
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
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& rearsegP(X1,X4)
& rearsegP(X0,X4) )
| ( nil != X2
& nil = X3 )
| ( nil = X1
& nil = X0 )
| ( neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ rearsegP(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(f163,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4) )
& ( nil = X2
| nil != X3 )
& ( nil != X1
| nil != X0 )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(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
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ rearsegP(X0,X4) )
& ( nil = X2
| nil != X3 )
& ( nil != X1
| nil != X0 )
& ( ~ neq(X3,nil)
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f303,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
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) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( rearsegP(sK50,sK49)
| ~ neq(sK50,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( neq(sK49,nil)
| ~ neq(sK50,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( nil != sK50
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( nil != sK47
| nil != sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
ssList(sK48),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
ssList(sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
ssList(sK49),
inference(definition_unfolding,[],[f421,f417]) ).
fof(f423,plain,
ssList(sK50),
inference(definition_unfolding,[],[f420,f418]) ).
fof(f424,plain,
( nil != sK49
| nil != sK50 ),
inference(definition_unfolding,[],[f415,f417,f418]) ).
fof(f425,plain,
! [X4] :
( ~ rearsegP(sK49,X4)
| ~ rearsegP(sK50,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f411,f417,f418]) ).
fof(f531,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ssList(X1)
| X0 = X1
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f303]) ).
fof(f533,plain,
~ ssList(nil),
inference(consistent_polarity_flipping,[],[f306]) ).
fof(f577,plain,
! [X0] :
( rearsegP(X0,X0)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f350]) ).
fof(f634,plain,
~ ssList(sK49),
inference(consistent_polarity_flipping,[],[f422]) ).
fof(f635,plain,
~ ssList(sK50),
inference(consistent_polarity_flipping,[],[f423]) ).
fof(f638,plain,
( ~ neq(sK49,nil)
| neq(sK50,nil) ),
inference(consistent_polarity_flipping,[],[f413]) ).
fof(f639,plain,
( rearsegP(sK50,sK49)
| neq(sK50,nil) ),
inference(consistent_polarity_flipping,[],[f412]) ).
fof(f640,plain,
! [X4] :
( ~ rearsegP(sK50,X4)
| ~ rearsegP(sK49,X4)
| neq(X4,nil)
| ssList(X4) ),
inference(consistent_polarity_flipping,[],[f425]) ).
fof(f649,definition,
( spl51_1
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f651,plain,
( neq(sK50,nil)
| ~ spl51_1 ),
inference(avatar_component_clause,[],[f649]) ).
fof(f653,definition,
( spl51_2
<=> rearsegP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f655,plain,
( rearsegP(sK50,sK49)
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f653]) ).
fof(f656,plain,
( spl51_1
| spl51_2 ),
inference(avatar_split_clause,[],[f639,f653,f649]) ).
fof(f658,definition,
( spl51_3
<=> neq(sK49,nil) ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f660,plain,
( ~ neq(sK49,nil)
| spl51_3 ),
inference(avatar_component_clause,[],[f658]) ).
fof(f661,plain,
( spl51_1
| ~ spl51_3 ),
inference(avatar_split_clause,[],[f638,f658,f649]) ).
fof(f663,definition,
( spl51_4
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f667,definition,
( spl51_5
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_5])],[avatar_definition]) ).
fof(f669,plain,
( nil != sK50
| spl51_5 ),
inference(avatar_component_clause,[],[f667]) ).
fof(f670,plain,
( spl51_4
| ~ spl51_5 ),
inference(avatar_split_clause,[],[f414,f667,f663]) ).
fof(f671,plain,
( ~ spl51_5
| ~ spl51_4 ),
inference(avatar_split_clause,[],[f424,f663,f667]) ).
fof(f677,definition,
( spl51_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_7])],[avatar_definition]) ).
fof(f678,plain,
( ~ ssList(nil)
| spl51_7 ),
inference(avatar_component_clause,[],[f677]) ).
fof(f706,plain,
~ spl51_7,
inference(avatar_split_clause,[],[f533,f677]) ).
fof(f707,plain,
( ~ rearsegP(sK49,sK49)
| neq(sK49,nil)
| ssList(sK49)
| ~ spl51_2 ),
inference(resolution,[],[f640,f655]) ).
fof(f708,plain,
( ~ rearsegP(sK49,sK49)
| ssList(sK49)
| ~ spl51_2
| spl51_3 ),
inference(forward_subsumption_resolution,[],[f707,f660]) ).
fof(f709,plain,
( ~ rearsegP(sK49,sK49)
| ~ spl51_2
| spl51_3 ),
inference(forward_subsumption_resolution,[],[f708,f634]) ).
fof(f711,plain,
( ssList(sK49)
| ~ spl51_2
| spl51_3 ),
inference(resolution,[],[f577,f709]) ).
fof(f713,plain,
( $false
| ~ spl51_2
| spl51_3 ),
inference(forward_subsumption_resolution,[],[f711,f634]) ).
fof(f714,plain,
( ~ spl51_2
| spl51_3 ),
inference(avatar_contradiction_clause,[],[f713]) ).
fof(f847,plain,
( ssList(nil)
| nil = sK50
| ssList(sK50)
| ~ spl51_1 ),
inference(resolution,[],[f531,f651]) ).
fof(f855,plain,
( nil = sK50
| ssList(sK50)
| ~ spl51_1
| spl51_7 ),
inference(forward_subsumption_resolution,[],[f847,f678]) ).
fof(f856,plain,
( ssList(sK50)
| ~ spl51_1
| spl51_5
| spl51_7 ),
inference(forward_subsumption_resolution,[],[f855,f669]) ).
fof(f857,plain,
( $false
| ~ spl51_1
| spl51_5
| spl51_7 ),
inference(forward_subsumption_resolution,[],[f856,f635]) ).
fof(f858,plain,
( ~ spl51_1
| spl51_5
| spl51_7 ),
inference(avatar_contradiction_clause,[],[f857]) ).
cnf(s1,plain,
( spl51_1
| spl51_2 ),
inference(sat_conversion,[],[f656]) ).
cnf(s2,plain,
( spl51_1
| ~ spl51_3 ),
inference(sat_conversion,[],[f661]) ).
cnf(s3,plain,
( spl51_4
| ~ spl51_5 ),
inference(sat_conversion,[],[f670]) ).
cnf(s4,plain,
( ~ spl51_4
| ~ spl51_5 ),
inference(sat_conversion,[],[f671]) ).
cnf(s13,plain,
~ spl51_7,
inference(sat_conversion,[],[f706]) ).
cnf(s14,plain,
( ~ spl51_2
| spl51_3 ),
inference(sat_conversion,[],[f714]) ).
cnf(s21,plain,
( ~ spl51_1
| spl51_5
| spl51_7 ),
inference(sat_conversion,[],[f858]) ).
cnf(s28,plain,
spl51_1,
inference(rat,[],[s14,s1,s2]) ).
cnf(s29,plain,
spl51_5,
inference(rat,[],[s21,s13,s28]) ).
cnf(s30,plain,
~ spl51_4,
inference(rat,[],[s4,s29]) ).
cnf(s31,plain,
$false,
inference(rat,[],[s3,s29,s30]) ).
fof(f859,plain,
$false,
inference(avatar_sat_refutation,[],[s31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC049+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 % Computer : n019.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 28 07:37:59 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/0.42 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.41/0.46 % (3832999)Will run a generic schedule for satisfiability detection.
% 0.41/0.46 % (3833012)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3875544174:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.41/0.46 % (3833007)% WARNING: option uhcvi not known.
% 0.41/0.46 % (3833007)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1196814757:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.41/0.46 % (3833011)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3981635906:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.41/0.46 % (3833008)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2352783899:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.41/0.46 % (3833009)dis+10_1_sil=32000:sp=arity:random_seed=2696634198:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.41/0.46 % (3833010)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1759377154:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.41/0.46 % (3833006)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=278968439_2999 on theBenchmark for (2999ds/0Mi)
% 0.41/0.46 % (3833007) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3832999-3833007"...
% 0.41/0.46 % (3833007)...printing done.
% 0.41/0.46 % (3833010) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3832999-3833010"...
% 0.41/0.46 % (3833007)Refutation found. Thanks to Tanya!
% 0.41/0.46 % SZS status Theorem for theBenchmark
% 0.41/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.41/0.46 % (3833007)------------------------------
% 0.41/0.46 % (3833007)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.41/0.46 % (3833007)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.41/0.46 % (3833007)CaDiCaL version: 2.1.3
% 0.41/0.47 % (3833007)Termination reason: Refutation
% 0.41/0.47 % (3833007)Time elapsed: 0.012 s
% 0.41/0.47 % (3833007)Peak memory usage: 13 MB
% 0.41/0.47 % (3833007)Instructions burned: 17 (million)
% 0.41/0.47 % (3832999)Success in time 0.038 s
% 0.41/0.47 % Vampire exiting
%------------------------------------------------------------------------------