%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC001+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 : n001.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:13 PM UTC 2026
% Result : Theorem 0.17s 0.46s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 50 ( 10 unt; 4 def)
% Number of atoms : 192 ( 12 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 226 ( 84 ~; 83 |; 45 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 27 ( 0 sgn 15 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ duplicatefreeP(X2)
| ? [X4] :
( ssItem(X4)
& ( ( ~ memberP(X3,X4)
& memberP(X2,X4) )
| ( ~ memberP(X2,X4)
& memberP(X3,X4) ) ) )
| ( ! [X5] :
( ssItem(X5)
=> ( ( ~ memberP(X1,X5)
& ~ memberP(X0,X5) )
| ( memberP(X1,X5)
& memberP(X0,X5) ) ) )
& duplicatefreeP(X0) ) ) ) ) ) ),
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
| ~ duplicatefreeP(X2)
| ? [X4] :
( ssItem(X4)
& ( ( ~ memberP(X3,X4)
& memberP(X2,X4) )
| ( ~ memberP(X2,X4)
& memberP(X3,X4) ) ) )
| ( ! [X5] :
( ssItem(X5)
=> ( ( ~ memberP(X1,X5)
& ~ memberP(X0,X5) )
| ( memberP(X1,X5)
& memberP(X0,X5) ) ) )
& duplicatefreeP(X0) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& duplicatefreeP(X2)
& ! [X4] :
( ~ ssItem(X4)
| ( ( memberP(X3,X4)
| ~ memberP(X2,X4) )
& ( memberP(X2,X4)
| ~ memberP(X3,X4) ) ) )
& ( ? [X5] :
( ( memberP(X1,X5)
| memberP(X0,X5) )
& ( ~ memberP(X1,X5)
| ~ memberP(X0,X5) )
& ssItem(X5) )
| ~ duplicatefreeP(X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& duplicatefreeP(X2)
& ! [X4] :
( ~ ssItem(X4)
| ( ( memberP(X3,X4)
| ~ memberP(X2,X4) )
& ( memberP(X2,X4)
| ~ memberP(X3,X4) ) ) )
& ( ? [X5] :
( ( memberP(X1,X5)
| memberP(X0,X5) )
& ( ~ memberP(X1,X5)
| ~ memberP(X0,X5) )
& ssItem(X5) )
| ~ duplicatefreeP(X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& duplicatefreeP(sK55)
& ! [X4] :
( ~ ssItem(X4)
| ( ( memberP(sK56,X4)
| ~ memberP(sK55,X4) )
& ( memberP(sK55,X4)
| ~ memberP(sK56,X4) ) ) )
& ( ( ( memberP(sK54,sK57)
| memberP(sK53,sK57) )
& ( ~ memberP(sK54,sK57)
| ~ memberP(sK53,sK57) )
& ssItem(sK57) )
| ~ duplicatefreeP(sK53) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X5,sK57)],[f222]) ).
fof(f500,plain,
( ssItem(sK57)
| ~ duplicatefreeP(sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( ~ memberP(sK54,sK57)
| ~ memberP(sK53,sK57)
| ~ duplicatefreeP(sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( memberP(sK54,sK57)
| memberP(sK53,sK57)
| ~ duplicatefreeP(sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
! [X4] :
( ~ ssItem(X4)
| memberP(sK55,X4)
| ~ memberP(sK56,X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
! [X4] :
( ~ ssItem(X4)
| memberP(sK56,X4)
| ~ memberP(sK55,X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
duplicatefreeP(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
( memberP(sK56,sK57)
| memberP(sK55,sK57)
| ~ duplicatefreeP(sK55) ),
inference(definition_unfolding,[],[f502,f507,f506,f506]) ).
fof(f509,plain,
( ~ memberP(sK56,sK57)
| ~ memberP(sK55,sK57)
| ~ duplicatefreeP(sK55) ),
inference(definition_unfolding,[],[f501,f507,f506,f506]) ).
fof(f510,plain,
( ssItem(sK57)
| ~ duplicatefreeP(sK55) ),
inference(definition_unfolding,[],[f500,f506]) ).
fof(f514,definition,
( spl58_1
<=> duplicatefreeP(sK55) ),
introduced(definition,[new_symbols(definition,[spl58_1])],[avatar_definition]) ).
fof(f518,definition,
( spl58_2
<=> ssItem(sK57) ),
introduced(definition,[new_symbols(definition,[spl58_2])],[avatar_definition]) ).
fof(f520,plain,
( ssItem(sK57)
| ~ spl58_2 ),
inference(avatar_component_clause,[],[f518]) ).
fof(f521,plain,
( ~ spl58_1
| spl58_2 ),
inference(avatar_split_clause,[],[f510,f518,f514]) ).
fof(f523,definition,
( spl58_3
<=> memberP(sK55,sK57) ),
introduced(definition,[new_symbols(definition,[spl58_3])],[avatar_definition]) ).
fof(f524,plain,
( memberP(sK55,sK57)
| ~ spl58_3 ),
inference(avatar_component_clause,[],[f523]) ).
fof(f525,plain,
( ~ memberP(sK55,sK57)
| spl58_3 ),
inference(avatar_component_clause,[],[f523]) ).
fof(f527,definition,
( spl58_4
<=> memberP(sK56,sK57) ),
introduced(definition,[new_symbols(definition,[spl58_4])],[avatar_definition]) ).
fof(f528,plain,
( memberP(sK56,sK57)
| ~ spl58_4 ),
inference(avatar_component_clause,[],[f527]) ).
fof(f529,plain,
( ~ memberP(sK56,sK57)
| spl58_4 ),
inference(avatar_component_clause,[],[f527]) ).
fof(f530,plain,
( ~ spl58_1
| ~ spl58_3
| ~ spl58_4 ),
inference(avatar_split_clause,[],[f509,f527,f523,f514]) ).
fof(f531,plain,
( ~ spl58_1
| spl58_3
| spl58_4 ),
inference(avatar_split_clause,[],[f508,f527,f523,f514]) ).
fof(f532,plain,
spl58_1,
inference(avatar_split_clause,[],[f505,f514]) ).
fof(f533,plain,
( memberP(sK55,sK57)
| ~ memberP(sK56,sK57)
| ~ spl58_2 ),
inference(resolution,[],[f503,f520]) ).
fof(f534,plain,
( ~ memberP(sK56,sK57)
| ~ spl58_2
| spl58_3 ),
inference(forward_subsumption_resolution,[],[f533,f525]) ).
fof(f535,plain,
( $false
| ~ spl58_2
| spl58_3
| ~ spl58_4 ),
inference(forward_subsumption_resolution,[],[f534,f528]) ).
fof(f536,plain,
( ~ spl58_2
| spl58_3
| ~ spl58_4 ),
inference(avatar_contradiction_clause,[],[f535]) ).
fof(f537,plain,
( memberP(sK56,sK57)
| ~ memberP(sK55,sK57)
| ~ spl58_2 ),
inference(resolution,[],[f504,f520]) ).
fof(f538,plain,
( ~ memberP(sK55,sK57)
| ~ spl58_2
| spl58_4 ),
inference(forward_subsumption_resolution,[],[f537,f529]) ).
fof(f539,plain,
( $false
| ~ spl58_2
| ~ spl58_3
| spl58_4 ),
inference(forward_subsumption_resolution,[],[f538,f524]) ).
fof(f540,plain,
( ~ spl58_2
| ~ spl58_3
| spl58_4 ),
inference(avatar_contradiction_clause,[],[f539]) ).
cnf(s1,plain,
( ~ spl58_1
| spl58_2 ),
inference(sat_conversion,[],[f521]) ).
cnf(s2,plain,
( ~ spl58_1
| ~ spl58_3
| ~ spl58_4 ),
inference(sat_conversion,[],[f530]) ).
cnf(s3,plain,
( ~ spl58_1
| spl58_3
| spl58_4 ),
inference(sat_conversion,[],[f531]) ).
cnf(s4,plain,
spl58_1,
inference(sat_conversion,[],[f532]) ).
cnf(s5,plain,
( ~ spl58_2
| spl58_3
| ~ spl58_4 ),
inference(sat_conversion,[],[f536]) ).
cnf(s6,plain,
( ~ spl58_2
| ~ spl58_3
| spl58_4 ),
inference(sat_conversion,[],[f540]) ).
cnf(s7,plain,
( spl58_3
| spl58_4 ),
inference(rat,[],[s3,s4]) ).
cnf(s8,plain,
( ~ spl58_3
| ~ spl58_4 ),
inference(rat,[],[s2,s4]) ).
cnf(s9,plain,
spl58_2,
inference(rat,[],[s1,s4]) ).
cnf(s10,plain,
spl58_3,
inference(rat,[],[s7,s5,s9]) ).
cnf(s11,plain,
spl58_4,
inference(rat,[],[s6,s9,s10]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s8,s11,s10]) ).
fof(f541,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC001+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.12/0.38 % Computer : n001.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 28 07:30:03 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.17/0.46 % (186571)Will run a generic schedule for satisfiability detection.
% 0.17/0.46 % (186581)% WARNING: option uhcvi not known.
% 0.17/0.46 % (186585)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3107737883:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.46 % (186584)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3153086996:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.46 % (186581)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1017008579:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.46 % (186580)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3722410404_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.46 % (186582)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1353613139:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.46 % (186585) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-186571-186585"...
% 0.17/0.46 % (186585)...printing done.
% 0.17/0.46 % (186586)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4282686191:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.46 % (186583)dis+10_1_sil=32000:sp=arity:random_seed=1785764720:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.46 % (186585)Refutation found. Thanks to Tanya!
% 0.17/0.46 % SZS status Theorem for theBenchmark
% 0.17/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.46 % (186585)------------------------------
% 0.17/0.46 % (186585)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46 % (186585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46 % (186585)CaDiCaL version: 2.1.3
% 0.17/0.46 % (186585)Termination reason: Refutation
% 0.17/0.46 % (186585)Time elapsed: 0.005 s
% 0.17/0.46 % (186585)Peak memory usage: 13 MB
% 0.17/0.46 % (186585)Instructions burned: 14 (million)
% 0.17/0.46 % (186571)Success in time 0.038 s
% 0.17/0.46 % Vampire exiting
%------------------------------------------------------------------------------