%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC030+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 : n011.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:22 PM UTC 2026
% Result : Theorem 0.22s 0.53s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 87 ( 20 unt; 6 def)
% Number of atoms : 252 ( 105 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 266 ( 101 ~; 115 |; 28 &)
% ( 8 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 27 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,X5) != X3
| app(X5,X4) != X2 ) ) )
| ( ( nil != X1
| nil = X0 )
& ( nil != X0
| nil = X1 ) ) ) ) ) ) ),
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)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,X5) != X3
| app(X5,X4) != X2 ) ) )
| ( ( nil != X1
| nil = X0 )
& ( nil != X0
| nil = X1 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& app(X5,X4) = X2
& ssList(X5) )
& ssList(X4) )
& ( ( nil = X1
& nil != X0 )
| ( nil = X0
& nil != X1 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(X4,X5) = X3
& app(X5,X4) = X2
& ssList(X5) )
& ssList(X4) )
& ( ( nil = X1
& nil != X0 )
| ( nil = X0
& nil != X1 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f394,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil = X0
| nil != app(X0,X1) ),
inference(cnf_transformation,[],[f200]) ).
fof(f395,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil = X1
| nil != app(X0,X1) ),
inference(cnf_transformation,[],[f200]) ).
fof(f396,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil != X0
| nil != X1
| nil = app(X0,X1) ),
inference(cnf_transformation,[],[f200]) ).
fof(f411,plain,
ssList(sK52),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
sK49 = app(sK52,sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
sK50 = app(sK51,sK52),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
ssList(sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( nil = sK47
| nil = sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( nil != sK48
| nil != sK47 ),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
( nil != sK50
| nil != sK49 ),
inference(definition_unfolding,[],[f416,f419,f418]) ).
fof(f426,plain,
( nil = sK49
| nil = sK50 ),
inference(definition_unfolding,[],[f415,f418,f419]) ).
fof(f449,plain,
! [X1] :
( ~ ssList(nil)
| ~ ssList(X1)
| nil != X1
| nil = app(nil,X1) ),
inference(equality_resolution,[],[f396]) ).
fof(f450,plain,
( ~ ssList(nil)
| ~ ssList(nil)
| nil = app(nil,nil) ),
inference(equality_resolution,[],[f449]) ).
fof(f530,plain,
~ ssList(nil),
inference(consistent_polarity_flipping,[],[f306]) ).
fof(f602,plain,
( ssList(nil)
| ssList(nil)
| nil = app(nil,nil) ),
inference(consistent_polarity_flipping,[],[f450]) ).
fof(f603,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ssList(X1)
| nil = X1
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f395]) ).
fof(f604,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ssList(X1)
| nil = X0
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f394]) ).
fof(f623,plain,
~ ssList(sK51),
inference(consistent_polarity_flipping,[],[f414]) ).
fof(f624,plain,
~ ssList(sK52),
inference(consistent_polarity_flipping,[],[f411]) ).
fof(f626,plain,
( ssList(nil)
| nil = app(nil,nil) ),
inference(duplicate_literal_removal,[],[f602]) ).
fof(f633,definition,
( spl53_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl53_1])],[avatar_definition]) ).
fof(f637,definition,
( spl53_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl53_2])],[avatar_definition]) ).
fof(f639,plain,
( nil = sK49
| ~ spl53_2 ),
inference(avatar_component_clause,[],[f637]) ).
fof(f640,plain,
( spl53_1
| spl53_2 ),
inference(avatar_split_clause,[],[f426,f637,f633]) ).
fof(f641,plain,
( ~ spl53_2
| ~ spl53_1 ),
inference(avatar_split_clause,[],[f425,f633,f637]) ).
fof(f643,definition,
( spl53_3
<=> nil = app(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl53_3])],[avatar_definition]) ).
fof(f645,plain,
( nil = app(nil,nil)
| ~ spl53_3 ),
inference(avatar_component_clause,[],[f643]) ).
fof(f647,definition,
( spl53_4
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl53_4])],[avatar_definition]) ).
fof(f650,plain,
( spl53_3
| spl53_4 ),
inference(avatar_split_clause,[],[f626,f647,f643]) ).
fof(f676,plain,
~ spl53_4,
inference(avatar_split_clause,[],[f530,f647]) ).
fof(f679,plain,
( nil = app(sK52,sK51)
| ~ spl53_2 ),
inference(forward_demodulation,[],[f412,f639]) ).
fof(f945,definition,
( spl53_11
<=> nil = sK52 ),
introduced(definition,[new_symbols(definition,[spl53_11])],[avatar_definition]) ).
fof(f947,plain,
( nil = sK52
| ~ spl53_11 ),
inference(avatar_component_clause,[],[f945]) ).
fof(f954,definition,
( spl53_13
<=> nil = sK51 ),
introduced(definition,[new_symbols(definition,[spl53_13])],[avatar_definition]) ).
fof(f956,plain,
( nil = sK51
| ~ spl53_13 ),
inference(avatar_component_clause,[],[f954]) ).
fof(f1052,plain,
( sK50 = app(nil,sK52)
| ~ spl53_13 ),
inference(superposition,[],[f413,f956]) ).
fof(f1059,plain,
( sK50 = app(nil,nil)
| ~ spl53_11
| ~ spl53_13 ),
inference(forward_demodulation,[],[f1052,f947]) ).
fof(f1060,plain,
( nil = sK50
| ~ spl53_3
| ~ spl53_11
| ~ spl53_13 ),
inference(forward_demodulation,[],[f1059,f645]) ).
fof(f1063,plain,
( sK49 = app(sK52,nil)
| ~ spl53_13 ),
inference(forward_demodulation,[],[f412,f956]) ).
fof(f1084,plain,
( spl53_1
| ~ spl53_3
| ~ spl53_11
| ~ spl53_13 ),
inference(avatar_split_clause,[],[f1060,f954,f945,f643,f633]) ).
fof(f1085,plain,
( sK49 = app(nil,nil)
| ~ spl53_11
| ~ spl53_13 ),
inference(forward_demodulation,[],[f1063,f947]) ).
fof(f1086,plain,
( nil = sK49
| ~ spl53_3
| ~ spl53_11
| ~ spl53_13 ),
inference(forward_demodulation,[],[f1085,f645]) ).
fof(f1087,plain,
( spl53_2
| ~ spl53_3
| ~ spl53_11
| ~ spl53_13 ),
inference(avatar_split_clause,[],[f1086,f954,f945,f643,f637]) ).
fof(f1213,plain,
( nil != sK50
| ssList(sK52)
| nil = sK52
| ssList(sK51) ),
inference(superposition,[],[f603,f413]) ).
fof(f1243,plain,
( nil != sK50
| nil = sK52
| ssList(sK51) ),
inference(forward_subsumption_resolution,[],[f1213,f624]) ).
fof(f1252,plain,
( nil != nil
| ssList(sK51)
| nil = sK51
| ssList(sK52)
| ~ spl53_2 ),
inference(superposition,[],[f603,f679]) ).
fof(f1254,plain,
( ssList(sK51)
| nil = sK51
| ssList(sK52)
| ~ spl53_2 ),
inference(trivial_inequality_removal,[],[f1252]) ).
fof(f1255,plain,
( nil = sK51
| ssList(sK52)
| ~ spl53_2 ),
inference(forward_subsumption_resolution,[],[f1254,f623]) ).
fof(f1256,plain,
( nil = sK51
| ~ spl53_2 ),
inference(forward_subsumption_resolution,[],[f1255,f624]) ).
fof(f1257,plain,
( spl53_13
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f1256,f637,f954]) ).
fof(f1266,plain,
( nil != sK50
| ssList(sK52)
| nil = sK51
| ssList(sK51) ),
inference(superposition,[],[f604,f413]) ).
fof(f1271,plain,
( nil != sK49
| ssList(sK51)
| nil = sK52
| ssList(sK52) ),
inference(superposition,[],[f604,f412]) ).
fof(f1290,plain,
( nil != sK50
| nil = sK52 ),
inference(forward_subsumption_resolution,[],[f1243,f623]) ).
fof(f1291,plain,
( nil != sK49
| nil = sK52
| ssList(sK52) ),
inference(forward_subsumption_resolution,[],[f1271,f623]) ).
fof(f1292,plain,
( nil != sK50
| nil = sK51
| ssList(sK51) ),
inference(forward_subsumption_resolution,[],[f1266,f624]) ).
fof(f1293,plain,
( spl53_11
| ~ spl53_1 ),
inference(avatar_split_clause,[],[f1290,f633,f945]) ).
fof(f1294,plain,
( nil != sK49
| nil = sK52 ),
inference(forward_subsumption_resolution,[],[f1291,f624]) ).
fof(f1295,plain,
( nil != sK50
| nil = sK51 ),
inference(forward_subsumption_resolution,[],[f1292,f623]) ).
fof(f1296,plain,
( spl53_11
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f1294,f637,f945]) ).
fof(f1297,plain,
( spl53_13
| ~ spl53_1 ),
inference(avatar_split_clause,[],[f1295,f633,f954]) ).
cnf(s1,plain,
( spl53_1
| spl53_2 ),
inference(sat_conversion,[],[f640]) ).
cnf(s2,plain,
( ~ spl53_1
| ~ spl53_2 ),
inference(sat_conversion,[],[f641]) ).
cnf(s3,plain,
( spl53_3
| spl53_4 ),
inference(sat_conversion,[],[f650]) ).
cnf(s11,plain,
~ spl53_4,
inference(sat_conversion,[],[f676]) ).
cnf(s22,plain,
( spl53_1
| ~ spl53_3
| ~ spl53_11
| ~ spl53_13 ),
inference(sat_conversion,[],[f1084]) ).
cnf(s23,plain,
( spl53_2
| ~ spl53_3
| ~ spl53_11
| ~ spl53_13 ),
inference(sat_conversion,[],[f1087]) ).
cnf(s37,plain,
( ~ spl53_2
| spl53_13 ),
inference(sat_conversion,[],[f1257]) ).
cnf(s44,plain,
( ~ spl53_1
| spl53_11 ),
inference(sat_conversion,[],[f1293]) ).
cnf(s45,plain,
( ~ spl53_2
| spl53_11 ),
inference(sat_conversion,[],[f1296]) ).
cnf(s46,plain,
( ~ spl53_1
| spl53_13 ),
inference(sat_conversion,[],[f1297]) ).
cnf(s50,plain,
spl53_3,
inference(rat,[],[s3,s11]) ).
cnf(s51,plain,
spl53_1,
inference(rat,[],[s22,s37,s45,s1,s50]) ).
cnf(s52,plain,
spl53_13,
inference(rat,[],[s46,s51]) ).
cnf(s53,plain,
spl53_11,
inference(rat,[],[s44,s51]) ).
cnf(s54,plain,
~ spl53_2,
inference(rat,[],[s2,s51]) ).
cnf(s55,plain,
$false,
inference(rat,[],[s23,s52,s50,s53,s54]) ).
fof(f1298,plain,
$false,
inference(avatar_sat_refutation,[],[s55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC030+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.18/0.42 % Computer : n011.cluster.edu
% 0.18/0.42 % Model : x86_64 x86_64
% 0.18/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.42 % Memory : 8046.5625MB
% 0.18/0.42 % OS : Linux 6.8.0-71-generic
% 0.18/0.42 % CPULimit : 300
% 0.18/0.42 % WCLimit : 300
% 0.18/0.42 % DateTime : Mon Sep 28 07:32:00 UTC 2026
% 0.18/0.42 % CPUTime :
% 0.18/0.42 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.22/0.47 Running first-order model finding
% 0.22/0.47 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.22/0.53 % (3226975)Will run a generic schedule for satisfiability detection.
% 0.22/0.53 % (3226981)% WARNING: option uhcvi not known.
% 0.22/0.53 % (3226981)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4281063939:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.53 % (3226982)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3263791478:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.22/0.53 % (3226980)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2017491014_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.53 % (3226986)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2357792051:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.22/0.53 % (3226985)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2584640714:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.22/0.53 % (3226983)dis+10_1_sil=32000:sp=arity:random_seed=2900725118:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.22/0.53 % (3226984)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=515346978:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.22/0.53 % (3226981) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3226975-3226981"...
% 0.22/0.53 % (3226981)...printing done.
% 0.22/0.53 % (3226981)Refutation found. Thanks to Tanya!
% 0.22/0.53 % SZS status Theorem for theBenchmark
% 0.22/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.53 % (3226981)------------------------------
% 0.22/0.53 % (3226981)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.53 % (3226981)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.53 % (3226981)CaDiCaL version: 2.1.3
% 0.22/0.53 % (3226981)Termination reason: Refutation
% 0.22/0.53 % (3226981)Time elapsed: 0.021 s
% 0.22/0.53 % (3226981)Peak memory usage: 13 MB
% 0.22/0.53 % (3226981)Instructions burned: 37 (million)
% 0.22/0.53 % (3226975)Success in time 0.045 s
% 0.22/0.53 % Vampire exiting
%------------------------------------------------------------------------------