%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n006.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:02:03 PM UTC 2026
% Result : Unsatisfiable 2.58s 1.33s
% Output : Refutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 20
% Syntax : Number of formulae : 69 ( 11 unt; 6 def)
% Number of atoms : 171 ( 20 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 200 ( 98 ~; 96 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
fof(f61,axiom,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause61) ).
fof(f84,axiom,
! [X0] :
( ~ frontsegP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause84) ).
fof(f118,axiom,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause115) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f207,negated_conjecture,
! [X0] :
( nil = sk2
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ frontsegP(sk2,X0)
| ~ frontsegP(sk1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
! [X0] :
( nil != sk1
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ frontsegP(sk2,X0)
| ~ frontsegP(sk1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
( nil = sk4
| frontsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f212,negated_conjecture,
( nil = sk3
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f213,negated_conjecture,
( nil = sk3
| frontsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f217,plain,
! [X0] :
( nil = sk4
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ frontsegP(sk4,X0)
| ~ frontsegP(sk3,X0) ),
inference(definition_unfolding,[],[f207,f204,f204,f205]) ).
fof(f218,plain,
( nil != sk3
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f208,f205,f204]) ).
fof(f219,plain,
! [X0] :
( nil != sk3
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ frontsegP(sk4,X0)
| ~ frontsegP(sk3,X0) ),
inference(definition_unfolding,[],[f209,f205,f204,f205]) ).
fof(f220,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f226,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f220]) ).
fof(f229,definition,
( spl0_1
<=> frontsegP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f231,plain,
( frontsegP(sk4,sk3)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f233,definition,
( spl0_2
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f234,plain,
( nil != sk3
| spl0_2 ),
inference(avatar_component_clause,[],[f233]) ).
fof(f236,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f213,f233,f229]) ).
fof(f238,definition,
( spl0_3
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f240,plain,
( neq(sk3,nil)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f238]) ).
fof(f241,plain,
( spl0_3
| spl0_2 ),
inference(avatar_split_clause,[],[f212,f233,f238]) ).
fof(f243,definition,
( spl0_4
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f245,plain,
( nil = sk4
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f243]) ).
fof(f246,plain,
( spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f211,f243,f229]) ).
fof(f247,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f210,f243,f238]) ).
fof(f249,definition,
( spl0_5
<=> ! [X0] :
( ~ ssList(X0)
| ~ frontsegP(sk3,X0)
| ~ frontsegP(sk4,X0)
| ~ neq(X0,nil) ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f250,plain,
( ! [X0] :
( ~ neq(X0,nil)
| ~ frontsegP(sk3,X0)
| ~ frontsegP(sk4,X0)
| ~ ssList(X0) )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f251,plain,
( spl0_5
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f219,f233,f249]) ).
fof(f253,definition,
( spl0_6
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f255,plain,
( neq(sk4,nil)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f256,plain,
( spl0_6
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f218,f233,f253]) ).
fof(f257,plain,
( spl0_5
| spl0_4 ),
inference(avatar_split_clause,[],[f217,f243,f249]) ).
fof(f260,plain,
( neq(nil,nil)
| ~ spl0_4
| ~ spl0_6 ),
inference(forward_demodulation,[],[f255,f245]) ).
fof(f269,plain,
( frontsegP(nil,sk3)
| ~ spl0_1
| ~ spl0_4 ),
inference(forward_demodulation,[],[f231,f245]) ).
fof(f279,plain,
( ~ ssList(nil)
| ~ spl0_4
| ~ spl0_6 ),
inference(resolution,[],[f226,f260]) ).
fof(f280,plain,
( $false
| ~ spl0_4
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f279,f8]) ).
fof(f281,plain,
( ~ spl0_4
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f280]) ).
fof(f282,plain,
( ~ frontsegP(sk3,sk3)
| ~ frontsegP(sk4,sk3)
| ~ ssList(sk3)
| ~ spl0_3
| ~ spl0_5 ),
inference(resolution,[],[f250,f240]) ).
fof(f285,plain,
( ~ frontsegP(sk4,sk3)
| ~ ssList(sk3)
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f282,f61]) ).
fof(f287,plain,
( ~ ssList(sk3)
| ~ spl0_1
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f285,f231]) ).
fof(f288,plain,
( $false
| ~ spl0_1
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f287,f202]) ).
fof(f289,plain,
( ~ spl0_1
| ~ spl0_3
| ~ spl0_5 ),
inference(avatar_contradiction_clause,[],[f288]) ).
fof(f301,plain,
( ~ ssList(sk3)
| nil = sk3
| ~ spl0_1
| ~ spl0_4 ),
inference(resolution,[],[f84,f269]) ).
fof(f306,plain,
( nil = sk3
| ~ spl0_1
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f301,f202]) ).
fof(f307,plain,
( $false
| ~ spl0_1
| spl0_2
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f306,f234]) ).
fof(f308,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f307]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f236]) ).
cnf(s2,plain,
( spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f241]) ).
cnf(s3,plain,
( spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f246]) ).
cnf(s4,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f247]) ).
cnf(s5,plain,
( ~ spl0_2
| spl0_5 ),
inference(sat_conversion,[],[f251]) ).
cnf(s6,plain,
( ~ spl0_2
| spl0_6 ),
inference(sat_conversion,[],[f256]) ).
cnf(s7,plain,
( spl0_4
| spl0_5 ),
inference(sat_conversion,[],[f257]) ).
cnf(s11,plain,
( ~ spl0_4
| ~ spl0_6 ),
inference(sat_conversion,[],[f281]) ).
cnf(s12,plain,
( ~ spl0_1
| ~ spl0_3
| ~ spl0_5 ),
inference(sat_conversion,[],[f289]) ).
cnf(s13,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_4 ),
inference(sat_conversion,[],[f308]) ).
cnf(s14,plain,
spl0_1,
inference(rat,[],[s6,s11,s1,s3]) ).
cnf(s15,plain,
~ spl0_2,
inference(rat,[],[s4,s12,s11,s5,s6,s14]) ).
cnf(s16,plain,
~ spl0_4,
inference(rat,[],[s13,s14,s15]) ).
cnf(s17,plain,
spl0_3,
inference(rat,[],[s2,s15]) ).
cnf(s19,plain,
spl0_5,
inference(rat,[],[s7,s16]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s12,s14,s19,s17]) ).
fof(f309,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC017-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n006.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 07:26:41 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.58/1.33 % (3794339)Input is clausal, will run a generic CNF schedule.
% 2.58/1.33 % (3794347)lrs+10_1_sil=8000:sp=occurrence:random_seed=436421357:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.58/1.33 % (3794347)First to succeed.
% 2.58/1.33 % (3794347)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3794339"
% 2.58/1.33 % (3794344)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3758205325:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.58/1.33 % (3794349)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=749363977:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.58/1.33 % (3794345)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3380864537:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.58/1.33 % (3794346)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1875451306:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.58/1.33 % (3794348)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1312685357:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.58/1.33 % (3794350)dis-21_1_sil=8000:lcm=predicate:random_seed=4193817387:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.58/1.33 % (3794349)Also succeeded, but the first one will report.
% 2.58/1.33 % (3794348)Also succeeded, but the first one will report.
% 2.58/1.33 % (3794350)Instruction limit reached!
% 2.58/1.33 % (3794350)------------------------------
% 2.58/1.33 % (3794350)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.33 % (3794350)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.33 % (3794350)CaDiCaL version: 2.1.3
% 2.58/1.33 % (3794350)Termination reason: Instruction limit
% 2.58/1.33 % (3794350)Termination phase: Saturation
% 2.58/1.33 % (3794350)Time elapsed: 0.050 s
% 2.58/1.33 % (3794350)Peak memory usage: 89 MB
% 2.58/1.33 % (3794350)Instructions burned: 118 (million)
% 2.58/1.33 % (3794347)Refutation found. Thanks to Tanya!
% 2.58/1.33 % SZS status Unsatisfiable for theBenchmark
% 2.58/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 2.58/1.33 % (3794347)------------------------------
% 2.58/1.33 % (3794347)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.33 % (3794347)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.33 % (3794347)CaDiCaL version: 2.1.3
% 2.58/1.33 % (3794347)Termination reason: Refutation
% 2.58/1.33 % (3794347)Time elapsed: 0.003 s
% 2.58/1.33 % (3794347)Peak memory usage: 90 MB
% 2.58/1.33 % (3794347)Instructions burned: 4 (million)
% 2.58/1.33 % (3794347)------------------------------
% 2.58/1.33 % (3794347)------------------------------
% 2.58/1.33 % (3794339)Success in time 0.283 s
% 2.58/1.33 % Vampire exiting
%------------------------------------------------------------------------------