%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC105+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 : n002.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:41 PM UTC 2026
% Result : Theorem 0.15s 0.46s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 63 ( 11 unt; 3 def)
% Number of atoms : 200 ( 55 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 218 ( 81 ~; 83 |; 40 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 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 : 21 ( 0 sgn 13 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f52,axiom,
! [X0] :
( ssList(X0)
=> ( rearsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax52) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ( neq(X0,nil)
& rearsegP(X1,X0) ) ) )
| ( ( nil != X3
| nil != X2 )
& ( ~ 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
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ( neq(X0,nil)
& rearsegP(X1,X0) ) ) )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f167,plain,
! [X0] :
( ( rearsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ( ~ neq(X0,nil)
| ~ rearsegP(X1,X0) ) ) )
& ( ( nil = X3
& nil = X2 )
| ( 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
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ( ~ neq(X0,nil)
| ~ rearsegP(X1,X0) ) ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f284,plain,
! [X0] :
( ( ( rearsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ rearsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f167]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& ( ( nil = sK54
& nil != sK53 )
| ( neq(sK54,nil)
& ( ~ neq(sK53,nil)
| ~ rearsegP(sK54,sK53) ) ) )
& ( ( nil = sK56
& nil = sK55 )
| ( neq(sK55,nil)
& rearsegP(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(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f436,plain,
! [X0] :
( ~ rearsegP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f284]) ).
fof(f437,plain,
! [X0] :
( rearsegP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f284]) ).
fof(f498,plain,
ssList(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( nil = sK55
| rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( nil = sK56
| rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( nil = sK56
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
( nil != sK53
| ~ neq(sK53,nil)
| ~ rearsegP(sK54,sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
( nil != sK53
| neq(sK54,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
( nil = sK54
| ~ neq(sK53,nil)
| ~ rearsegP(sK54,sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f511,plain,
( nil = sK56
| ~ neq(sK55,nil)
| ~ rearsegP(sK56,sK55) ),
inference(definition_unfolding,[],[f506,f509,f508,f509,f508]) ).
fof(f512,plain,
( nil != sK55
| neq(sK56,nil) ),
inference(definition_unfolding,[],[f505,f508,f509]) ).
fof(f513,plain,
( nil != sK55
| ~ neq(sK55,nil)
| ~ rearsegP(sK56,sK55) ),
inference(definition_unfolding,[],[f504,f508,f508,f509,f508]) ).
fof(f534,plain,
( rearsegP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f437]) ).
fof(f551,definition,
( spl57_1
<=> rearsegP(sK56,sK55) ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f552,plain,
( rearsegP(sK56,sK55)
| ~ spl57_1 ),
inference(avatar_component_clause,[],[f551]) ).
fof(f553,plain,
( ~ rearsegP(sK56,sK55)
| spl57_1 ),
inference(avatar_component_clause,[],[f551]) ).
fof(f555,definition,
( spl57_2
<=> neq(sK55,nil) ),
introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).
fof(f557,plain,
( ~ neq(sK55,nil)
| spl57_2 ),
inference(avatar_component_clause,[],[f555]) ).
fof(f559,definition,
( spl57_3
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl57_3])],[avatar_definition]) ).
fof(f560,plain,
( nil = sK55
| ~ spl57_3 ),
inference(avatar_component_clause,[],[f559]) ).
fof(f561,plain,
( nil != sK55
| spl57_3 ),
inference(avatar_component_clause,[],[f559]) ).
fof(f562,plain,
( ~ spl57_1
| ~ spl57_2
| ~ spl57_3 ),
inference(avatar_split_clause,[],[f513,f559,f555,f551]) ).
fof(f577,plain,
( nil = sK55
| spl57_1 ),
inference(forward_subsumption_resolution,[],[f500,f553]) ).
fof(f578,plain,
( spl57_3
| spl57_1 ),
inference(avatar_split_clause,[],[f577,f551,f559]) ).
fof(f581,plain,
( nil = sK56
| spl57_1 ),
inference(forward_subsumption_resolution,[],[f502,f553]) ).
fof(f584,plain,
( ~ rearsegP(nil,sK55)
| spl57_1 ),
inference(superposition,[],[f553,f581]) ).
fof(f585,plain,
( ~ rearsegP(nil,nil)
| spl57_1
| ~ spl57_3 ),
inference(forward_demodulation,[],[f584,f560]) ).
fof(f588,plain,
( $false
| spl57_1
| ~ spl57_3 ),
inference(global_subsumption,[],[f585,f389,f534]) ).
fof(f589,plain,
( spl57_1
| ~ spl57_3 ),
inference(avatar_contradiction_clause,[],[f588]) ).
fof(f591,plain,
( ~ neq(nil,nil)
| spl57_2
| ~ spl57_3 ),
inference(forward_demodulation,[],[f557,f560]) ).
fof(f593,plain,
( nil = sK56
| ~ spl57_3 ),
inference(global_subsumption,[],[f511,f503,f502]) ).
fof(f596,plain,
( neq(sK56,nil)
| ~ spl57_3 ),
inference(forward_subsumption_resolution,[],[f512,f560]) ).
fof(f597,plain,
( neq(nil,nil)
| ~ spl57_3 ),
inference(forward_demodulation,[],[f596,f593]) ).
fof(f600,plain,
( $false
| spl57_2
| ~ spl57_3 ),
inference(global_subsumption,[],[f591,f597]) ).
fof(f601,plain,
( spl57_2
| ~ spl57_3 ),
inference(avatar_contradiction_clause,[],[f600]) ).
fof(f602,plain,
nil = sK56,
inference(global_subsumption,[],[f502,f511,f503]) ).
fof(f605,plain,
( rearsegP(nil,sK55)
| ~ spl57_1 ),
inference(superposition,[],[f552,f602]) ).
fof(f1459,plain,
( nil = sK55
| ~ ssList(sK55)
| ~ spl57_1 ),
inference(resolution,[],[f436,f605]) ).
fof(f1466,plain,
( ~ ssList(sK55)
| ~ spl57_1
| spl57_3 ),
inference(forward_subsumption_resolution,[],[f1459,f561]) ).
fof(f1467,plain,
( $false
| ~ spl57_1
| spl57_3 ),
inference(forward_subsumption_resolution,[],[f1466,f498]) ).
fof(f1468,plain,
( ~ spl57_1
| spl57_3 ),
inference(avatar_contradiction_clause,[],[f1467]) ).
cnf(s211,plain,
( ~ spl57_1
| ~ spl57_2
| ~ spl57_3 ),
inference(sat_conversion,[],[f562]) ).
cnf(s232,plain,
( spl57_1
| spl57_3 ),
inference(sat_conversion,[],[f578]) ).
cnf(s244,plain,
( spl57_1
| ~ spl57_3 ),
inference(sat_conversion,[],[f589]) ).
cnf(s256,plain,
( spl57_2
| ~ spl57_3 ),
inference(sat_conversion,[],[f601]) ).
cnf(s886,plain,
( ~ spl57_1
| spl57_3 ),
inference(sat_conversion,[],[f1468]) ).
cnf(s890,plain,
spl57_1,
inference(rat,[],[s232,s244]) ).
cnf(s891,plain,
spl57_3,
inference(rat,[],[s886,s890]) ).
cnf(s892,plain,
~ spl57_2,
inference(rat,[],[s211,s891,s890]) ).
cnf(s894,plain,
$false,
inference(rat,[],[s256,s891,s892]) ).
fof(f1469,plain,
$false,
inference(avatar_sat_refutation,[],[s894]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC105+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.09/0.37 % Computer : n002.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 28 07:56:22 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40 Running first-order model finding
% 0.09/0.40 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.15/0.46 % (198231)Will run a generic schedule for satisfiability detection.
% 0.15/0.46 % (198238)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3993598263:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.46 % (198237)% WARNING: option uhcvi not known.
% 0.15/0.46 % (198236)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1063653769_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.46 % (198237)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=909258901:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.46 % (198239)dis+10_1_sil=32000:sp=arity:random_seed=2828053197:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.46 % (198240)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3702785047:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.46 % (198242)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3833103867:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.46 % (198241)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3851088030:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.46 % (198238) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-198231-198238"...
% 0.15/0.46 % (198237) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-198231-198237"...
% 0.15/0.46 % (198238)...printing done.
% 0.15/0.46 % (198238)Refutation found. Thanks to Tanya!
% 0.15/0.46 % SZS status Theorem for theBenchmark
% 0.15/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.46 % (198238)------------------------------
% 0.15/0.46 % (198238)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.46 % (198238)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.46 % (198238)CaDiCaL version: 2.1.3
% 0.15/0.46 % (198238)Termination reason: Refutation
% 0.15/0.46 % (198238)Time elapsed: 0.018 s
% 0.15/0.46 % (198238)Peak memory usage: 13 MB
% 0.15/0.46 % (198238)Instructions burned: 43 (million)
% 0.15/0.46 % (198231)Success in time 0.049 s
% 0.15/0.46 % Vampire exiting
%------------------------------------------------------------------------------