%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC198+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 : n016.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:04 PM UTC 2026
% Result : Theorem 0.37s 0.55s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 53 ( 10 unt; 3 def)
% Number of atoms : 206 ( 49 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 252 ( 99 ~; 94 |; 38 &)
% ( 5 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 41 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
? [X0] :
( ssItem(X0)
& ? [X1] :
( ssItem(X1)
& X0 != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax2) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/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)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X0,X5)
| X4 = X5 ) ) )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X2
| ~ memberP(X3,X6)
| ? [X7] :
( ssItem(X7)
& X6 != X7
& memberP(X3,X7)
& leq(X6,X7) ) ) )
& ( nil != X3
| nil != 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] :
( ssItem(X4)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X0,X5)
| X4 = X5 ) ) )
| ( ! [X6] :
( ssItem(X6)
=> ( cons(X6,nil) != X2
| ~ memberP(X3,X6)
| ? [X7] :
( ssItem(X7)
& X6 != X7
& memberP(X3,X7)
& leq(X6,X7) ) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
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] :
( ~ ssItem(X4)
| ? [X5] :
( memberP(X0,X5)
& X4 != X5
& ssItem(X5) ) )
& ( ? [X6] :
( cons(X6,nil) = X2
& memberP(X3,X6)
& ! [X7] :
( ~ ssItem(X7)
| X6 = X7
| ~ memberP(X3,X7)
| ~ leq(X6,X7) )
& ssItem(X6) )
| ( nil = X3
& nil = 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] :
( ~ ssItem(X4)
| ? [X5] :
( memberP(X0,X5)
& X4 != X5
& ssItem(X5) ) )
& ( ? [X6] :
( cons(X6,nil) = X2
& memberP(X3,X6)
& ! [X7] :
( ~ ssItem(X7)
| X6 = X7
| ~ memberP(X3,X7)
| ~ leq(X6,X7) )
& ssItem(X6) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f227,plain,
ssItem(sK0),
inference(cnf_transformation,[],[f2]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f333,plain,
! [X2,X0,X1] :
( ~ memberP(cons(X1,X2),X0)
| ~ ssItem(X1)
| ~ ssList(X2)
| memberP(X2,X0)
| X0 = X1
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f147]) ).
fof(f336,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f413,plain,
! [X4] :
( ssItem(sK52(X4))
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
! [X4] :
( sK52(X4) != X4
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
! [X4] :
( memberP(sK47,sK52(X4))
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
( nil = sK49
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
( nil = sK49
| sK49 = cons(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f423,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f430,plain,
! [X4] :
( memberP(sK49,sK52(X4))
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f415,f423]) ).
fof(f467,definition,
( spl53_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl53_2])],[avatar_definition]) ).
fof(f469,plain,
( nil = sK49
| ~ spl53_2 ),
inference(avatar_component_clause,[],[f467]) ).
fof(f477,definition,
( spl53_4
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl53_4])],[avatar_definition]) ).
fof(f479,plain,
( ssItem(sK51)
| ~ spl53_4 ),
inference(avatar_component_clause,[],[f477]) ).
fof(f487,definition,
( spl53_6
<=> sK49 = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl53_6])],[avatar_definition]) ).
fof(f489,plain,
( sK49 = cons(sK51,nil)
| ~ spl53_6 ),
inference(avatar_component_clause,[],[f487]) ).
fof(f491,plain,
( spl53_4
| spl53_2 ),
inference(avatar_split_clause,[],[f419,f467,f477]) ).
fof(f493,plain,
( spl53_6
| spl53_2 ),
inference(avatar_split_clause,[],[f421,f467,f487]) ).
fof(f528,plain,
( ! [X4] :
( memberP(nil,sK52(X4))
| ~ ssItem(X4) )
| ~ spl53_2 ),
inference(forward_demodulation,[],[f430,f469]) ).
fof(f529,plain,
( ! [X0] :
( ~ ssItem(sK52(X0))
| ~ ssItem(X0) )
| ~ spl53_2 ),
inference(resolution,[],[f336,f528]) ).
fof(f530,plain,
( ! [X0] : ~ ssItem(X0)
| ~ spl53_2 ),
inference(forward_subsumption_resolution,[],[f529,f413]) ).
fof(f531,plain,
( $false
| ~ spl53_2 ),
inference(resolution,[],[f530,f227]) ).
fof(f534,plain,
~ spl53_2,
inference(avatar_contradiction_clause,[],[f531]) ).
fof(f756,plain,
( ! [X0] :
( ~ memberP(sK49,X0)
| ~ ssItem(sK51)
| ~ ssList(nil)
| memberP(nil,X0)
| sK51 = X0
| ~ ssItem(X0) )
| ~ spl53_6 ),
inference(superposition,[],[f333,f489]) ).
fof(f770,plain,
( ! [X0] :
( ~ memberP(sK49,X0)
| ~ ssList(nil)
| memberP(nil,X0)
| sK51 = X0
| ~ ssItem(X0) )
| ~ spl53_4
| ~ spl53_6 ),
inference(forward_subsumption_resolution,[],[f756,f479]) ).
fof(f773,plain,
( ! [X0] :
( ~ memberP(sK49,X0)
| memberP(nil,X0)
| sK51 = X0
| ~ ssItem(X0) )
| ~ spl53_4
| ~ spl53_6 ),
inference(forward_subsumption_resolution,[],[f770,f306]) ).
fof(f779,plain,
( ! [X0] :
( ~ memberP(sK49,X0)
| sK51 = X0
| ~ ssItem(X0) )
| ~ spl53_4
| ~ spl53_6 ),
inference(forward_subsumption_resolution,[],[f773,f336]) ).
fof(f781,plain,
( ! [X0] :
( sK51 = sK52(X0)
| ~ ssItem(sK52(X0))
| ~ ssItem(X0) )
| ~ spl53_4
| ~ spl53_6 ),
inference(resolution,[],[f779,f430]) ).
fof(f789,plain,
( ! [X0] :
( ~ ssItem(X0)
| sK51 = sK52(X0) )
| ~ spl53_4
| ~ spl53_6 ),
inference(forward_subsumption_resolution,[],[f781,f413]) ).
fof(f803,plain,
( sK51 = sK52(sK51)
| ~ spl53_4
| ~ spl53_6 ),
inference(resolution,[],[f789,f479]) ).
fof(f816,plain,
( sK51 != sK51
| ~ ssItem(sK51)
| ~ spl53_4
| ~ spl53_6 ),
inference(superposition,[],[f414,f803]) ).
fof(f818,plain,
( ~ ssItem(sK51)
| ~ spl53_4
| ~ spl53_6 ),
inference(trivial_inequality_removal,[],[f816]) ).
fof(f819,plain,
( $false
| ~ spl53_4
| ~ spl53_6 ),
inference(forward_subsumption_resolution,[],[f818,f479]) ).
fof(f820,plain,
( ~ spl53_4
| ~ spl53_6 ),
inference(avatar_contradiction_clause,[],[f819]) ).
cnf(s6,plain,
( spl53_2
| spl53_4 ),
inference(sat_conversion,[],[f491]) ).
cnf(s8,plain,
( spl53_2
| spl53_6 ),
inference(sat_conversion,[],[f493]) ).
cnf(s16,plain,
~ spl53_2,
inference(sat_conversion,[],[f534]) ).
cnf(s41,plain,
( ~ spl53_4
| ~ spl53_6 ),
inference(sat_conversion,[],[f820]) ).
cnf(s48,plain,
spl53_6,
inference(rat,[],[s8,s16]) ).
cnf(s49,plain,
~ spl53_4,
inference(rat,[],[s41,s48]) ).
cnf(s51,plain,
$false,
inference(rat,[],[s6,s49,s16]) ).
fof(f821,plain,
$false,
inference(avatar_sat_refutation,[],[s51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC198+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37 % Computer : n016.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 08:30:33 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.41 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.37/0.55 % (3475092)Will run a generic schedule for satisfiability detection.
% 0.37/0.55 % (3475103)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1275402380:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.37/0.55 % (3475097)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4156934095_2999 on theBenchmark for (2999ds/0Mi)
% 0.37/0.55 % (3475099)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3318266741:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.37/0.55 % (3475100)dis+10_1_sil=32000:sp=arity:random_seed=3909424147:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.37/0.55 % (3475101)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2366749162:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.37/0.55 % (3475102)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2218185656:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.37/0.55 % (3475098)% WARNING: option uhcvi not known.
% 0.37/0.55 % (3475098)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=586154513:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.37/0.55 % TRYING [1]
% 0.37/0.55 % TRYING [2]
% 0.37/0.55 % TRYING [3]
% 0.37/0.55 % TRYING [4]
% 0.37/0.55 % (3475103)Instruction limit reached!
% 0.37/0.55 % (3475103)------------------------------
% 0.37/0.55 % (3475103)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.37/0.55 % (3475103)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.37/0.55 % (3475103)CaDiCaL version: 2.1.3
% 0.37/0.55 % (3475103)Termination reason: Instruction limit
% 0.37/0.55 % (3475103)Termination phase: Saturation
% 0.37/0.55 % (3475103)Time elapsed: 0.054 s
% 0.37/0.55 % (3475103)Peak memory usage: 14 MB
% 0.37/0.55 % (3475103)Instructions burned: 160 (million)
% 0.37/0.55 % (3475111)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4123983529:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.37/0.55 % (3475100)Instruction limit reached!
% 0.37/0.55 % (3475100)------------------------------
% 0.37/0.55 % (3475100)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.37/0.55 % (3475100)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.37/0.55 % (3475100)CaDiCaL version: 2.1.3
% 0.37/0.55 % (3475100)Termination reason: Instruction limit
% 0.37/0.55 % (3475100)Termination phase: Saturation
% 0.37/0.55 % (3475100)Time elapsed: 0.061 s
% 0.37/0.55 % (3475100)Peak memory usage: 13 MB
% 0.37/0.55 % (3475100)Instructions burned: 104 (million)
% 0.37/0.55 % TRYING [1]
% 0.37/0.55 % (3475101)Instruction limit reached!
% 0.37/0.55 % (3475101)------------------------------
% 0.37/0.55 % (3475101)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.37/0.55 % (3475101)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.37/0.55 % (3475101)CaDiCaL version: 2.1.3
% 0.37/0.55 % (3475101)Termination reason: Instruction limit
% 0.37/0.55 % (3475101)Termination phase: Saturation
% 0.37/0.55 % (3475101)Time elapsed: 0.066 s
% 0.37/0.55 % (3475101)Peak memory usage: 13 MB
% 0.37/0.55 % (3475101)Instructions burned: 117 (million)
% 0.37/0.55 % TRYING [2]
% 0.37/0.55 % TRYING [3]
% 0.37/0.55 % (3475102)Instruction limit reached!
% 0.37/0.55 % (3475102)------------------------------
% 0.37/0.55 % (3475102)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.37/0.55 % (3475102)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.37/0.55 % (3475102)CaDiCaL version: 2.1.3
% 0.37/0.55 % (3475102)Termination reason: Instruction limit
% 0.37/0.55 % (3475102)Termination phase: Saturation
% 0.37/0.55 % (3475102)Time elapsed: 0.075 s
% 0.37/0.55 % (3475102)Peak memory usage: 14 MB
% 0.37/0.55 % (3475102)Instructions burned: 131 (million)
% 0.37/0.55 % TRYING [4]
% 0.37/0.55 % (3475113)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1916046340:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.37/0.55 % (3475114)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2944203612:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.37/0.55 % TRYING [5]
% 0.37/0.55 % (3475115)ott-21_1_sil=16000:fs=off:random_seed=269738800:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.37/0.55 % (3475114) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3475092-3475114"...
% 0.37/0.55 % (3475114)...printing done.
% 0.37/0.55 % (3475114)Refutation found. Thanks to Tanya!
% 0.37/0.55 % SZS status Theorem for theBenchmark
% 0.37/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.37/0.55 % (3475114)------------------------------
% 0.37/0.55 % (3475114)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.37/0.55 % (3475114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.37/0.55 % (3475114)CaDiCaL version: 2.1.3
% 0.37/0.55 % (3475114)Termination reason: Refutation
% 0.37/0.55 % (3475114)Time elapsed: 0.015 s
% 0.37/0.55 % (3475114)Peak memory usage: 13 MB
% 0.37/0.55 % (3475114)Instructions burned: 21 (million)
% 0.37/0.55 % (3475092)Success in time 0.138 s
% 0.37/0.55 % Vampire exiting
%------------------------------------------------------------------------------