%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC364+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 : n009.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:43 PM UTC 2026
% Result : Theorem 0.20s 0.34s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of formulae : 78 ( 24 unt; 6 def)
% Number of atoms : 226 ( 25 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 236 ( 88 ~; 99 |; 26 &)
% ( 8 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 39 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ( ~ neq(X1,nil)
| ! [X4] :
( ssItem(X4)
=> app(cons(X4,nil),X2) != X3 )
| segmentP(X1,X0) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
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
| ( ( ~ neq(X1,nil)
| ! [X4] :
( ssItem(X4)
=> app(cons(X4,nil),X2) != X3 )
| segmentP(X1,X0) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& ~ segmentP(X1,X0) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ? [X4] :
( app(cons(X4,nil),X2) = X3
& ssItem(X4) )
& ~ segmentP(X1,X0) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f241,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
fof(f305,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f397,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f411,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( ~ neq(sK50,nil)
| sK50 = app(cons(sK51,nil),sK49) ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
( ~ neq(sK50,nil)
| ~ segmentP(sK48,sK47) ),
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f423,plain,
ssList(sK48),
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
ssList(sK47),
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
ssList(sK49),
inference(definition_unfolding,[],[f424,f420]) ).
fof(f426,plain,
ssList(sK50),
inference(definition_unfolding,[],[f423,f421]) ).
fof(f428,plain,
( ~ neq(sK50,nil)
| ~ segmentP(sK50,sK49) ),
inference(definition_unfolding,[],[f417,f421,f420]) ).
fof(f429,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f416,f421]) ).
fof(f438,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f241]) ).
fof(f474,plain,
! [X2,X3,X1] :
( ~ segmentP(app(app(X2,X1),X3),X1)
| ssList(X1)
| ssList(X3)
| ssList(X2)
| ssList(app(app(X2,X1),X3)) ),
inference(consistent_polarity_flipping,[],[f438]) ).
fof(f535,plain,
! [X0,X1] :
( ~ ssList(cons(X1,X0))
| ~ ssItem(X1)
| ssList(X0) ),
inference(consistent_polarity_flipping,[],[f305]) ).
fof(f536,plain,
~ ssList(nil),
inference(consistent_polarity_flipping,[],[f306]) ).
fof(f611,plain,
! [X0] :
( ssList(X0)
| app(X0,nil) = X0 ),
inference(consistent_polarity_flipping,[],[f397]) ).
fof(f619,plain,
~ ssList(sK49),
inference(consistent_polarity_flipping,[],[f425]) ).
fof(f620,plain,
~ ssList(sK50),
inference(consistent_polarity_flipping,[],[f426]) ).
fof(f623,plain,
( ~ neq(sK50,nil)
| segmentP(sK50,sK49) ),
inference(consistent_polarity_flipping,[],[f428]) ).
fof(f633,definition,
( spl52_1
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl52_1])],[avatar_definition]) ).
fof(f635,plain,
( ssItem(sK51)
| ~ spl52_1 ),
inference(avatar_component_clause,[],[f633]) ).
fof(f637,definition,
( spl52_2
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f640,plain,
( spl52_1
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f411,f637,f633]) ).
fof(f642,definition,
( spl52_3
<=> sK50 = app(cons(sK51,nil),sK49) ),
introduced(definition,[new_symbols(definition,[spl52_3])],[avatar_definition]) ).
fof(f644,plain,
( sK50 = app(cons(sK51,nil),sK49)
| ~ spl52_3 ),
inference(avatar_component_clause,[],[f642]) ).
fof(f645,plain,
( spl52_3
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f412,f637,f642]) ).
fof(f649,definition,
( spl52_4
<=> segmentP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f651,plain,
( segmentP(sK50,sK49)
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f649]) ).
fof(f653,plain,
spl52_2,
inference(avatar_split_clause,[],[f429,f637]) ).
fof(f654,plain,
( spl52_4
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f623,f637,f649]) ).
fof(f660,definition,
( spl52_6
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl52_6])],[avatar_definition]) ).
fof(f661,plain,
( ~ ssList(nil)
| spl52_6 ),
inference(avatar_component_clause,[],[f660]) ).
fof(f689,plain,
~ spl52_6,
inference(avatar_split_clause,[],[f536,f660]) ).
fof(f735,plain,
sK50 = app(sK50,nil),
inference(resolution,[],[f611,f620]) ).
fof(f1128,definition,
( spl52_20
<=> ssList(cons(sK51,nil)) ),
introduced(definition,[new_symbols(definition,[spl52_20])],[avatar_definition]) ).
fof(f1129,plain,
( ~ ssList(cons(sK51,nil))
| spl52_20 ),
inference(avatar_component_clause,[],[f1128]) ).
fof(f1130,plain,
( ssList(cons(sK51,nil))
| ~ spl52_20 ),
inference(avatar_component_clause,[],[f1128]) ).
fof(f1231,plain,
( ~ ssItem(sK51)
| ssList(nil)
| ~ spl52_20 ),
inference(resolution,[],[f1130,f535]) ).
fof(f1232,plain,
( ssList(nil)
| ~ spl52_1
| ~ spl52_20 ),
inference(forward_subsumption_resolution,[],[f1231,f635]) ).
fof(f1233,plain,
( $false
| ~ spl52_1
| spl52_6
| ~ spl52_20 ),
inference(forward_subsumption_resolution,[],[f1232,f661]) ).
fof(f1234,plain,
( ~ spl52_1
| spl52_6
| ~ spl52_20 ),
inference(avatar_contradiction_clause,[],[f1233]) ).
fof(f2180,plain,
( ! [X0] :
( ~ segmentP(app(sK50,X0),sK49)
| ssList(sK49)
| ssList(X0)
| ssList(cons(sK51,nil))
| ssList(app(sK50,X0)) )
| ~ spl52_3 ),
inference(superposition,[],[f474,f644]) ).
fof(f2192,plain,
( ! [X0] :
( ~ segmentP(app(sK50,X0),sK49)
| ssList(X0)
| ssList(cons(sK51,nil))
| ssList(app(sK50,X0)) )
| ~ spl52_3 ),
inference(forward_subsumption_resolution,[],[f2180,f619]) ).
fof(f2195,plain,
( ! [X0] :
( ~ segmentP(app(sK50,X0),sK49)
| ssList(X0)
| ssList(app(sK50,X0)) )
| ~ spl52_3
| spl52_20 ),
inference(forward_subsumption_resolution,[],[f2192,f1129]) ).
fof(f3483,plain,
( ~ segmentP(sK50,sK49)
| ssList(nil)
| ssList(sK50)
| ~ spl52_3
| spl52_20 ),
inference(superposition,[],[f2195,f735]) ).
fof(f3488,plain,
( ssList(nil)
| ssList(sK50)
| ~ spl52_3
| ~ spl52_4
| spl52_20 ),
inference(forward_subsumption_resolution,[],[f3483,f651]) ).
fof(f3492,plain,
( ssList(sK50)
| ~ spl52_3
| ~ spl52_4
| spl52_6
| spl52_20 ),
inference(forward_subsumption_resolution,[],[f3488,f661]) ).
fof(f3493,plain,
( $false
| ~ spl52_3
| ~ spl52_4
| spl52_6
| spl52_20 ),
inference(forward_subsumption_resolution,[],[f3492,f620]) ).
fof(f3494,plain,
( ~ spl52_3
| ~ spl52_4
| spl52_6
| spl52_20 ),
inference(avatar_contradiction_clause,[],[f3493]) ).
cnf(s1,plain,
( spl52_1
| ~ spl52_2 ),
inference(sat_conversion,[],[f640]) ).
cnf(s2,plain,
( ~ spl52_2
| spl52_3 ),
inference(sat_conversion,[],[f645]) ).
cnf(s6,plain,
spl52_2,
inference(sat_conversion,[],[f653]) ).
cnf(s7,plain,
( ~ spl52_2
| spl52_4 ),
inference(sat_conversion,[],[f654]) ).
cnf(s16,plain,
~ spl52_6,
inference(sat_conversion,[],[f689]) ).
cnf(s32,plain,
( ~ spl52_1
| spl52_6
| ~ spl52_20 ),
inference(sat_conversion,[],[f1234]) ).
cnf(s295,plain,
( ~ spl52_3
| ~ spl52_4
| spl52_6
| spl52_20 ),
inference(sat_conversion,[],[f3494]) ).
cnf(s301,plain,
spl52_4,
inference(rat,[],[s7,s6]) ).
cnf(s366,plain,
spl52_3,
inference(rat,[],[s2,s6]) ).
cnf(s367,plain,
spl52_20,
inference(rat,[],[s295,s301,s16,s366]) ).
cnf(s368,plain,
~ spl52_1,
inference(rat,[],[s32,s16,s367]) ).
cnf(s369,plain,
$false,
inference(rat,[],[s1,s6,s368]) ).
fof(f3495,plain,
$false,
inference(avatar_sat_refutation,[],[s369]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC364+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.08/0.19 % Computer : n009.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 09:16:45 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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.20/0.34 % (2906815)Will run a generic schedule for satisfiability detection.
% 0.20/0.34 % (2906824)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3359077928:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.34 % (2906821)% WARNING: option uhcvi not known.
% 0.20/0.34 % (2906820)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1211763185_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.34 % (2906823)dis+10_1_sil=32000:sp=arity:random_seed=2078992862:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.34 % (2906821)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=61625403:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.34 % (2906822)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=819877437:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.34 % (2906825)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1623523704:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.34 % (2906826)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1388876155:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.34 % TRYING [1]
% 0.20/0.34 % TRYING [2]
% 0.20/0.34 % TRYING [3]
% 0.20/0.34 % (2906824)Instruction limit reached!
% 0.20/0.34 % (2906824)------------------------------
% 0.20/0.34 % (2906824)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.34 % (2906824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.34 % (2906824)CaDiCaL version: 2.1.3
% 0.20/0.34 % (2906824)Termination reason: Instruction limit
% 0.20/0.34 % (2906824)Termination phase: Saturation
% 0.20/0.34 % (2906824)Time elapsed: 0.038 s
% 0.20/0.34 % (2906824)Peak memory usage: 13 MB
% 0.20/0.34 % (2906824)Instructions burned: 117 (million)
% 0.20/0.34 % TRYING [4]
% 0.20/0.34 % (2906834)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=24580118:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.34 % TRYING [1]
% 0.20/0.34 % TRYING [2]
% 0.20/0.34 % TRYING [3]
% 0.20/0.34 % TRYING [4]
% 0.20/0.34 % (2906823)Instruction limit reached!
% 0.20/0.34 % (2906823)------------------------------
% 0.20/0.34 % (2906823)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.34 % (2906823)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.34 % (2906823)CaDiCaL version: 2.1.3
% 0.20/0.34 % (2906823)Termination reason: Instruction limit
% 0.20/0.34 % (2906823)Termination phase: Saturation
% 0.20/0.34 % (2906823)Time elapsed: 0.063 s
% 0.20/0.34 % (2906823)Peak memory usage: 13 MB
% 0.20/0.34 % (2906823)Instructions burned: 108 (million)
% 0.20/0.34 % (2906821) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2906815-2906821"...
% 0.20/0.34 % (2906821)...printing done.
% 0.20/0.34 % (2906821)Refutation found. Thanks to Tanya!
% 0.20/0.34 % SZS status Theorem for theBenchmark
% 0.20/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.34 % (2906821)------------------------------
% 0.20/0.34 % (2906821)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.34 % (2906821)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.34 % (2906821)CaDiCaL version: 2.1.3
% 0.20/0.34 % (2906821)Termination reason: Refutation
% 0.20/0.34 % (2906821)Time elapsed: 0.067 s
% 0.20/0.34 % (2906821)Peak memory usage: 14 MB
% 0.20/0.34 % (2906821)Instructions burned: 110 (million)
% 0.20/0.34 % (2906815)Success in time 0.102 s
% 0.20/0.34 % Vampire exiting
%------------------------------------------------------------------------------