%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC386+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 : n014.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:05:49 PM UTC 2026
% Result : Theorem 0.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 82 ( 13 unt; 8 def)
% Number of atoms : 249 ( 63 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 275 ( 108 ~; 112 |; 32 &)
% ( 10 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 9 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 29 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4) ) )
& ( nil != X3
| nil != X2 ) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X0
& memberP(X1,X5) ) ) ) ) ) ) ) ),
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
| ( ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4) ) )
& ( nil != X3
| nil != X2 ) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X0
& memberP(X1,X5) ) ) ) ) ) ) ) ),
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(f148,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X0
| ~ memberP(X1,X5) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X0
| ~ memberP(X1,X5) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f304,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(f336,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f411,plain,
! [X5] :
( ~ memberP(sK48,X5)
| cons(X5,nil) != sK47
| ~ ssItem(X5)
| nil = sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( nil = sK50
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( nil = sK50
| memberP(sK50,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
( nil = sK50
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( nil = sK49
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
( nil = sK49
| memberP(sK50,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
( neq(sK48,nil)
| nil != sK47 ),
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f423,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f430,plain,
( neq(sK50,nil)
| nil != sK49 ),
inference(definition_unfolding,[],[f419,f423,f422]) ).
fof(f432,plain,
! [X5] :
( ~ memberP(sK50,X5)
| cons(X5,nil) != sK49
| ~ ssItem(X5)
| nil = sK50 ),
inference(definition_unfolding,[],[f411,f423,f422,f423]) ).
fof(f447,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f304]) ).
fof(f546,plain,
! [X0] :
( memberP(nil,X0)
| ssItem(X0) ),
inference(consistent_polarity_flipping,[],[f336]) ).
fof(f591,plain,
( nil = sK49
| ~ memberP(sK50,sK51) ),
inference(consistent_polarity_flipping,[],[f417]) ).
fof(f592,plain,
( nil = sK49
| ~ ssItem(sK51) ),
inference(consistent_polarity_flipping,[],[f416]) ).
fof(f593,plain,
( nil = sK50
| ~ memberP(sK50,sK51) ),
inference(consistent_polarity_flipping,[],[f414]) ).
fof(f594,plain,
( nil = sK50
| ~ ssItem(sK51) ),
inference(consistent_polarity_flipping,[],[f413]) ).
fof(f596,plain,
! [X5] :
( memberP(sK50,X5)
| cons(X5,nil) != sK49
| ssItem(X5)
| nil = sK50 ),
inference(consistent_polarity_flipping,[],[f432]) ).
fof(f601,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f447]) ).
fof(f605,definition,
( spl52_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl52_1])],[avatar_definition]) ).
fof(f607,plain,
( nil = sK50
| ~ spl52_1 ),
inference(avatar_component_clause,[],[f605]) ).
fof(f609,definition,
( spl52_2
<=> ! [X5] :
( memberP(sK50,X5)
| ssItem(X5)
| cons(X5,nil) != sK49 ) ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f610,plain,
( ! [X5] :
( cons(X5,nil) != sK49
| ssItem(X5)
| memberP(sK50,X5) )
| ~ spl52_2 ),
inference(avatar_component_clause,[],[f609]) ).
fof(f611,plain,
( spl52_1
| spl52_2 ),
inference(avatar_split_clause,[],[f596,f609,f605]) ).
fof(f613,definition,
( spl52_3
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl52_3])],[avatar_definition]) ).
fof(f618,definition,
( spl52_4
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f621,plain,
( ~ spl52_4
| spl52_1 ),
inference(avatar_split_clause,[],[f594,f605,f618]) ).
fof(f623,definition,
( spl52_5
<=> memberP(sK50,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_5])],[avatar_definition]) ).
fof(f625,plain,
( ~ memberP(sK50,sK51)
| spl52_5 ),
inference(avatar_component_clause,[],[f623]) ).
fof(f626,plain,
( ~ spl52_5
| spl52_1 ),
inference(avatar_split_clause,[],[f593,f605,f623]) ).
fof(f628,definition,
( spl52_6
<=> sK49 = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl52_6])],[avatar_definition]) ).
fof(f630,plain,
( sK49 = cons(sK51,nil)
| ~ spl52_6 ),
inference(avatar_component_clause,[],[f628]) ).
fof(f631,plain,
( spl52_6
| spl52_1 ),
inference(avatar_split_clause,[],[f415,f605,f628]) ).
fof(f632,plain,
( ~ spl52_4
| spl52_3 ),
inference(avatar_split_clause,[],[f592,f613,f618]) ).
fof(f633,plain,
( ~ spl52_5
| spl52_3 ),
inference(avatar_split_clause,[],[f591,f613,f623]) ).
fof(f636,definition,
( spl52_7
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl52_7])],[avatar_definition]) ).
fof(f638,plain,
( neq(sK50,nil)
| ~ spl52_7 ),
inference(avatar_component_clause,[],[f636]) ).
fof(f639,plain,
( ~ spl52_3
| spl52_7 ),
inference(avatar_split_clause,[],[f430,f636,f613]) ).
fof(f646,definition,
( spl52_9
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl52_9])],[avatar_definition]) ).
fof(f647,plain,
( ssList(nil)
| ~ spl52_9 ),
inference(avatar_component_clause,[],[f646]) ).
fof(f675,plain,
spl52_9,
inference(avatar_split_clause,[],[f306,f646]) ).
fof(f676,plain,
( sK49 != sK49
| ssItem(sK51)
| memberP(sK50,sK51)
| ~ spl52_2
| ~ spl52_6 ),
inference(superposition,[],[f610,f630]) ).
fof(f681,plain,
( neq(nil,nil)
| ~ spl52_1
| ~ spl52_7 ),
inference(superposition,[],[f638,f607]) ).
fof(f682,plain,
( ~ memberP(nil,sK51)
| ~ spl52_1
| spl52_5 ),
inference(superposition,[],[f625,f607]) ).
fof(f685,plain,
( ssItem(sK51)
| ~ spl52_1
| spl52_5 ),
inference(resolution,[],[f546,f682]) ).
fof(f688,plain,
( ssItem(sK51)
| memberP(sK50,sK51)
| ~ spl52_2
| ~ spl52_6 ),
inference(trivial_inequality_removal,[],[f676]) ).
fof(f690,plain,
( ssItem(sK51)
| ~ spl52_2
| spl52_5
| ~ spl52_6 ),
inference(forward_subsumption_resolution,[],[f688,f625]) ).
fof(f692,plain,
( spl52_4
| ~ spl52_1
| spl52_5 ),
inference(avatar_split_clause,[],[f685,f623,f605,f618]) ).
fof(f693,plain,
( spl52_4
| ~ spl52_2
| spl52_5
| ~ spl52_6 ),
inference(avatar_split_clause,[],[f690,f628,f623,f609,f618]) ).
fof(f695,plain,
( ~ ssList(nil)
| ~ spl52_1
| ~ spl52_7 ),
inference(resolution,[],[f601,f681]) ).
fof(f696,plain,
( $false
| ~ spl52_1
| ~ spl52_7
| ~ spl52_9 ),
inference(forward_subsumption_resolution,[],[f695,f647]) ).
fof(f697,plain,
( ~ spl52_1
| ~ spl52_7
| ~ spl52_9 ),
inference(avatar_contradiction_clause,[],[f696]) ).
cnf(s1,plain,
( spl52_1
| spl52_2 ),
inference(sat_conversion,[],[f611]) ).
cnf(s3,plain,
( spl52_1
| ~ spl52_4 ),
inference(sat_conversion,[],[f621]) ).
cnf(s4,plain,
( spl52_1
| ~ spl52_5 ),
inference(sat_conversion,[],[f626]) ).
cnf(s5,plain,
( spl52_1
| spl52_6 ),
inference(sat_conversion,[],[f631]) ).
cnf(s6,plain,
( spl52_3
| ~ spl52_4 ),
inference(sat_conversion,[],[f632]) ).
cnf(s7,plain,
( spl52_3
| ~ spl52_5 ),
inference(sat_conversion,[],[f633]) ).
cnf(s9,plain,
( ~ spl52_3
| spl52_7 ),
inference(sat_conversion,[],[f639]) ).
cnf(s19,plain,
spl52_9,
inference(sat_conversion,[],[f675]) ).
cnf(s23,plain,
( ~ spl52_1
| spl52_4
| spl52_5 ),
inference(sat_conversion,[],[f692]) ).
cnf(s24,plain,
( ~ spl52_2
| spl52_4
| spl52_5
| ~ spl52_6 ),
inference(sat_conversion,[],[f693]) ).
cnf(s26,plain,
( ~ spl52_1
| ~ spl52_7
| ~ spl52_9 ),
inference(sat_conversion,[],[f697]) ).
cnf(s31,plain,
spl52_1,
inference(rat,[],[s24,s1,s3,s4,s5]) ).
cnf(s32,plain,
~ spl52_7,
inference(rat,[],[s26,s19,s31]) ).
cnf(s33,plain,
~ spl52_3,
inference(rat,[],[s9,s32]) ).
cnf(s35,plain,
~ spl52_5,
inference(rat,[],[s7,s33]) ).
cnf(s36,plain,
~ spl52_4,
inference(rat,[],[s6,s33]) ).
cnf(s37,plain,
$false,
inference(rat,[],[s23,s31,s35,s36]) ).
fof(f698,plain,
$false,
inference(avatar_sat_refutation,[],[s37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC386+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.07/0.17 % Computer : n014.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Mon Sep 28 09:24:01 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 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.19/0.27 % (1656320)Will run a generic schedule for satisfiability detection.
% 0.19/0.27 % (1656325)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1589892326_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.27 % (1656326)% WARNING: option uhcvi not known.
% 0.19/0.27 % TRYING [1]
% 0.19/0.27 % (1656326)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=970574115:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27 % (1656327)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1696983593:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.27 % (1656328)dis+10_1_sil=32000:sp=arity:random_seed=3743901912:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.27 % (1656330)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1093805017:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.27 % (1656329)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1158949982:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.27 % TRYING [2]
% 0.19/0.27 % (1656331)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1295835582:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.27 % TRYING [3]
% 0.19/0.27 % (1656326) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1656320-1656326"...
% 0.19/0.27 % (1656328) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1656320-1656328"...
% 0.19/0.27 % (1656326)...printing done.
% 0.19/0.27 % (1656328)...printing done.
% 0.19/0.27 % (1656326)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27 % (1656326)------------------------------
% 0.19/0.27 % (1656326)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (1656326)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (1656326)CaDiCaL version: 2.1.3
% 0.19/0.27 % (1656326)Termination reason: Refutation
% 0.19/0.27 % (1656326)Time elapsed: 0.008 s
% 0.19/0.27 % (1656326)Peak memory usage: 12 MB
% 0.19/0.27 % (1656326)Instructions burned: 12 (million)
% 0.19/0.27 % (1656320)Success in time 0.055 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------