%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC017+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 : n013.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:18 PM UTC 2026
% Result : Theorem 0.17s 0.50s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 76 ( 13 unt; 7 def)
% Number of atoms : 234 ( 38 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 284 ( 126 ~; 116 |; 21 &)
% ( 11 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 33 ( 0 sgn 27 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax42) ).
fof(f46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax46) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& frontsegP(X1,X4)
& frontsegP(X0,X4) ) ) )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,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
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& frontsegP(X1,X4)
& frontsegP(X0,X4) ) ) )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ),
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(f153,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f158,plain,
! [X0] :
( ( frontsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f46]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4)
| ~ frontsegP(X0,X4) ) ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f303,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f305,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f339,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f153]) ).
fof(f346,plain,
! [X0] :
( ~ frontsegP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f410,plain,
! [X4] :
( ~ frontsegP(sK47,X4)
| ~ frontsegP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK48 ),
inference(cnf_transformation,[],[f221]) ).
fof(f412,plain,
( neq(sK48,nil)
| nil != sK47 ),
inference(cnf_transformation,[],[f221]) ).
fof(f415,plain,
( neq(sK49,nil)
| nil = sK50 ),
inference(cnf_transformation,[],[f221]) ).
fof(f416,plain,
( frontsegP(sK50,sK49)
| nil = sK49 ),
inference(cnf_transformation,[],[f221]) ).
fof(f417,plain,
( frontsegP(sK50,sK49)
| nil = sK50 ),
inference(cnf_transformation,[],[f221]) ).
fof(f418,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f221]) ).
fof(f419,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f221]) ).
fof(f421,plain,
ssList(sK49),
inference(cnf_transformation,[],[f221]) ).
fof(f427,plain,
( neq(sK50,nil)
| nil != sK49 ),
inference(definition_unfolding,[],[f412,f419,f418]) ).
fof(f429,plain,
! [X4] :
( ~ frontsegP(sK49,X4)
| ~ frontsegP(sK50,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK50 ),
inference(definition_unfolding,[],[f410,f418,f419,f419]) ).
fof(f444,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f303]) ).
fof(f459,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f444]) ).
fof(f463,definition,
( spl51_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f465,plain,
( nil = sK50
| ~ spl51_1 ),
inference(avatar_component_clause,[],[f463]) ).
fof(f467,definition,
( spl51_2
<=> ! [X4] :
( ~ frontsegP(sK49,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK50,X4) ) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f468,plain,
( ! [X4] :
( ~ neq(X4,nil)
| ~ ssList(X4)
| ~ frontsegP(sK49,X4)
| ~ frontsegP(sK50,X4) )
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f467]) ).
fof(f469,plain,
( spl51_1
| spl51_2 ),
inference(avatar_split_clause,[],[f429,f467,f463]) ).
fof(f471,definition,
( spl51_3
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f473,plain,
( nil != sK49
| spl51_3 ),
inference(avatar_component_clause,[],[f471]) ).
fof(f476,definition,
( spl51_4
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f478,plain,
( neq(sK50,nil)
| ~ spl51_4 ),
inference(avatar_component_clause,[],[f476]) ).
fof(f479,plain,
( ~ spl51_3
| spl51_4 ),
inference(avatar_split_clause,[],[f427,f476,f471]) ).
fof(f482,definition,
( spl51_5
<=> neq(sK49,nil) ),
introduced(definition,[new_symbols(definition,[spl51_5])],[avatar_definition]) ).
fof(f484,plain,
( neq(sK49,nil)
| ~ spl51_5 ),
inference(avatar_component_clause,[],[f482]) ).
fof(f486,plain,
( spl51_1
| spl51_5 ),
inference(avatar_split_clause,[],[f415,f482,f463]) ).
fof(f488,definition,
( spl51_6
<=> frontsegP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).
fof(f490,plain,
( frontsegP(sK50,sK49)
| ~ spl51_6 ),
inference(avatar_component_clause,[],[f488]) ).
fof(f491,plain,
( spl51_3
| spl51_6 ),
inference(avatar_split_clause,[],[f416,f488,f471]) ).
fof(f492,plain,
( spl51_1
| spl51_6 ),
inference(avatar_split_clause,[],[f417,f488,f463]) ).
fof(f494,definition,
( spl51_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_7])],[avatar_definition]) ).
fof(f495,plain,
( ssList(nil)
| ~ spl51_7 ),
inference(avatar_component_clause,[],[f494]) ).
fof(f522,plain,
spl51_7,
inference(avatar_split_clause,[],[f305,f494]) ).
fof(f526,plain,
( ~ ssList(sK49)
| ~ frontsegP(sK49,sK49)
| ~ frontsegP(sK50,sK49)
| ~ spl51_2
| ~ spl51_5 ),
inference(resolution,[],[f468,f484]) ).
fof(f527,plain,
( ~ frontsegP(sK49,sK49)
| ~ frontsegP(sK50,sK49)
| ~ spl51_2
| ~ spl51_5 ),
inference(forward_subsumption_resolution,[],[f526,f421]) ).
fof(f529,plain,
( ~ frontsegP(sK49,sK49)
| ~ spl51_2
| ~ spl51_5
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f527,f490]) ).
fof(f539,plain,
( ~ ssList(sK49)
| ~ spl51_2
| ~ spl51_5
| ~ spl51_6 ),
inference(resolution,[],[f339,f529]) ).
fof(f543,plain,
( $false
| ~ spl51_2
| ~ spl51_5
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f539,f421]) ).
fof(f544,plain,
( ~ spl51_2
| ~ spl51_5
| ~ spl51_6 ),
inference(avatar_contradiction_clause,[],[f543]) ).
fof(f546,plain,
( frontsegP(nil,sK49)
| ~ spl51_1
| ~ spl51_6 ),
inference(superposition,[],[f490,f465]) ).
fof(f547,plain,
( neq(nil,nil)
| ~ spl51_1
| ~ spl51_4 ),
inference(superposition,[],[f478,f465]) ).
fof(f549,plain,
( ~ ssList(nil)
| ~ spl51_1
| ~ spl51_4 ),
inference(resolution,[],[f459,f547]) ).
fof(f550,plain,
( $false
| ~ spl51_1
| ~ spl51_4
| ~ spl51_7 ),
inference(forward_subsumption_resolution,[],[f549,f495]) ).
fof(f551,plain,
( ~ spl51_1
| ~ spl51_4
| ~ spl51_7 ),
inference(avatar_contradiction_clause,[],[f550]) ).
fof(f580,plain,
( nil = sK49
| ~ ssList(sK49)
| ~ spl51_1
| ~ spl51_6 ),
inference(resolution,[],[f346,f546]) ).
fof(f585,plain,
( ~ ssList(sK49)
| ~ spl51_1
| spl51_3
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f580,f473]) ).
fof(f586,plain,
( $false
| ~ spl51_1
| spl51_3
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f585,f421]) ).
fof(f587,plain,
( ~ spl51_1
| spl51_3
| ~ spl51_6 ),
inference(avatar_contradiction_clause,[],[f586]) ).
cnf(s1,plain,
( spl51_1
| spl51_2 ),
inference(sat_conversion,[],[f469]) ).
cnf(s3,plain,
( ~ spl51_3
| spl51_4 ),
inference(sat_conversion,[],[f479]) ).
cnf(s6,plain,
( spl51_1
| spl51_5 ),
inference(sat_conversion,[],[f486]) ).
cnf(s7,plain,
( spl51_3
| spl51_6 ),
inference(sat_conversion,[],[f491]) ).
cnf(s8,plain,
( spl51_1
| spl51_6 ),
inference(sat_conversion,[],[f492]) ).
cnf(s16,plain,
spl51_7,
inference(sat_conversion,[],[f522]) ).
cnf(s19,plain,
( ~ spl51_2
| ~ spl51_5
| ~ spl51_6 ),
inference(sat_conversion,[],[f544]) ).
cnf(s20,plain,
( ~ spl51_1
| ~ spl51_4
| ~ spl51_7 ),
inference(sat_conversion,[],[f551]) ).
cnf(s21,plain,
( ~ spl51_1
| spl51_3
| ~ spl51_6 ),
inference(sat_conversion,[],[f587]) ).
cnf(s26,plain,
spl51_1,
inference(rat,[],[s19,s1,s6,s8]) ).
cnf(s27,plain,
~ spl51_4,
inference(rat,[],[s20,s16,s26]) ).
cnf(s28,plain,
~ spl51_3,
inference(rat,[],[s3,s27]) ).
cnf(s29,plain,
~ spl51_6,
inference(rat,[],[s21,s26,s28]) ).
cnf(s31,plain,
$false,
inference(rat,[],[s7,s29,s28]) ).
fof(f588,plain,
$false,
inference(avatar_sat_refutation,[],[s31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC017+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.11/0.41 % Computer : n013.cluster.edu
% 0.11/0.41 % Model : x86_64 x86_64
% 0.11/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.41 % Memory : 8046.5625MB
% 0.11/0.41 % OS : Linux 6.8.0-71-generic
% 0.11/0.41 % CPULimit : 300
% 0.11/0.41 % WCLimit : 300
% 0.11/0.41 % DateTime : Mon Sep 28 07:26:07 UTC 2026
% 0.11/0.42 % CPUTime :
% 0.11/0.42 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.45 Running first-order model finding
% 0.11/0.45 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.17/0.50 % (1000885)Will run a generic schedule for satisfiability detection.
% 0.17/0.50 % (1000894)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1271533944:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.50 % (1000891)% WARNING: option uhcvi not known.
% 0.17/0.50 % (1000892)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2869567558:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.50 % (1000890)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1293257824_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.50 % (1000891)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2284065483:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.50 % (1000893)dis+10_1_sil=32000:sp=arity:random_seed=1280842254:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.50 % (1000894) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1000885-1000894"...
% 0.17/0.50 % (1000895)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3775499040:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.50 % (1000896)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2689108110:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.50 % (1000894)...printing done.
% 0.17/0.50 % (1000894)Refutation found. Thanks to Tanya!
% 0.17/0.50 % SZS status Theorem for theBenchmark
% 0.17/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.50 % (1000894)------------------------------
% 0.17/0.50 % (1000894)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.50 % (1000894)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.50 % (1000894)CaDiCaL version: 2.1.3
% 0.17/0.50 % (1000894)Termination reason: Refutation
% 0.17/0.50 % (1000894)Time elapsed: 0.008 s
% 0.17/0.50 % (1000894)Peak memory usage: 13 MB
% 0.17/0.50 % (1000894)Instructions burned: 21 (million)
% 0.17/0.50 % (1000885)Success in time 0.037 s
% 0.17/0.50 % Vampire exiting
%------------------------------------------------------------------------------