%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC060-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 : n002.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:15 PM UTC 2026
% Result : Unsatisfiable 3.50s 1.46s
% Output : Refutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 20
% Syntax : Number of formulae : 71 ( 12 unt; 6 def)
% Number of atoms : 177 ( 20 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 209 ( 103 ~; 100 |; 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(f57,axiom,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause57) ).
fof(f80,axiom,
! [X0] :
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause80) ).
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)
| ~ segmentP(sk2,X0)
| ~ segmentP(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)
| ~ segmentP(sk2,X0)
| ~ segmentP(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
| segmentP(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
| segmentP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f217,plain,
! [X0] :
( nil = sk4
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk4,X0)
| ~ segmentP(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)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(definition_unfolding,[],[f209,f205,f204,f205]) ).
fof(f222,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f225,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f222]) ).
fof(f239,definition,
( spl0_4
<=> segmentP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f240,plain,
( segmentP(sk4,sk3)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f239]) ).
fof(f242,definition,
( spl0_5
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f244,plain,
( spl0_4
| spl0_5 ),
inference(avatar_split_clause,[],[f213,f242,f239]) ).
fof(f246,definition,
( spl0_6
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f247,plain,
( neq(sk3,nil)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f248,plain,
( spl0_6
| spl0_5 ),
inference(avatar_split_clause,[],[f212,f242,f246]) ).
fof(f250,definition,
( spl0_7
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f251,plain,
( nil = sk4
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f252,plain,
( spl0_4
| spl0_7 ),
inference(avatar_split_clause,[],[f211,f250,f239]) ).
fof(f253,plain,
( spl0_6
| spl0_7 ),
inference(avatar_split_clause,[],[f210,f250,f246]) ).
fof(f255,definition,
( spl0_8
<=> ! [X0] :
( ~ ssList(X0)
| ~ segmentP(sk3,X0)
| ~ segmentP(sk4,X0)
| ~ neq(X0,nil) ) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f256,plain,
( ! [X0] :
( ~ neq(X0,nil)
| ~ segmentP(sk3,X0)
| ~ segmentP(sk4,X0)
| ~ ssList(X0) )
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f255]) ).
fof(f257,plain,
( nil != sk3
| spl0_5 ),
inference(avatar_component_clause,[],[f242]) ).
fof(f258,plain,
( spl0_8
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f219,f242,f255]) ).
fof(f260,definition,
( spl0_9
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f261,plain,
( neq(sk4,nil)
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f262,plain,
( spl0_9
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f218,f242,f260]) ).
fof(f263,plain,
( spl0_8
| spl0_7 ),
inference(avatar_split_clause,[],[f217,f250,f255]) ).
fof(f265,plain,
( segmentP(nil,sk3)
| ~ spl0_4
| ~ spl0_7 ),
inference(superposition,[],[f240,f251]) ).
fof(f269,plain,
( ~ segmentP(sk3,sk3)
| ~ segmentP(sk4,sk3)
| ~ ssList(sk3)
| ~ spl0_6
| ~ spl0_8 ),
inference(resolution,[],[f256,f247]) ).
fof(f272,plain,
( ~ segmentP(sk3,sk3)
| ~ ssList(sk3)
| ~ spl0_4
| ~ spl0_6
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f269,f240]) ).
fof(f280,plain,
( ~ segmentP(sk3,sk3)
| ~ spl0_4
| ~ spl0_6
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f272,f202]) ).
fof(f284,plain,
( ~ ssList(sk3)
| ~ spl0_4
| ~ spl0_6
| ~ spl0_8 ),
inference(resolution,[],[f57,f280]) ).
fof(f285,plain,
( $false
| ~ spl0_4
| ~ spl0_6
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f284,f202]) ).
fof(f286,plain,
( ~ spl0_4
| ~ spl0_6
| ~ spl0_8 ),
inference(avatar_contradiction_clause,[],[f285]) ).
fof(f289,plain,
( neq(nil,nil)
| ~ spl0_7
| ~ spl0_9 ),
inference(superposition,[],[f261,f251]) ).
fof(f292,plain,
( ~ ssList(nil)
| ~ spl0_7
| ~ spl0_9 ),
inference(resolution,[],[f289,f225]) ).
fof(f293,plain,
( $false
| ~ spl0_7
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f292,f8]) ).
fof(f294,plain,
( ~ spl0_7
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f293]) ).
fof(f296,plain,
( ~ ssList(sk3)
| nil = sk3
| ~ spl0_4
| ~ spl0_7 ),
inference(resolution,[],[f80,f265]) ).
fof(f301,plain,
( nil = sk3
| ~ spl0_4
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f296,f202]) ).
fof(f302,plain,
( $false
| ~ spl0_4
| spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f301,f257]) ).
fof(f303,plain,
( ~ spl0_4
| spl0_5
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f302]) ).
cnf(s3,plain,
( spl0_4
| spl0_5 ),
inference(sat_conversion,[],[f244]) ).
cnf(s4,plain,
( spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f248]) ).
cnf(s5,plain,
( spl0_4
| spl0_7 ),
inference(sat_conversion,[],[f252]) ).
cnf(s6,plain,
( spl0_6
| spl0_7 ),
inference(sat_conversion,[],[f253]) ).
cnf(s7,plain,
( ~ spl0_5
| spl0_8 ),
inference(sat_conversion,[],[f258]) ).
cnf(s8,plain,
( ~ spl0_5
| spl0_9 ),
inference(sat_conversion,[],[f262]) ).
cnf(s9,plain,
( spl0_7
| spl0_8 ),
inference(sat_conversion,[],[f263]) ).
cnf(s14,plain,
( ~ spl0_4
| ~ spl0_6
| ~ spl0_8 ),
inference(sat_conversion,[],[f286]) ).
cnf(s16,plain,
( ~ spl0_7
| ~ spl0_9 ),
inference(sat_conversion,[],[f294]) ).
cnf(s17,plain,
( ~ spl0_4
| spl0_5
| ~ spl0_7 ),
inference(sat_conversion,[],[f303]) ).
cnf(s21,plain,
spl0_4,
inference(rat,[],[s8,s16,s3,s5]) ).
cnf(s22,plain,
spl0_5,
inference(rat,[],[s14,s9,s4,s17,s21]) ).
cnf(s23,plain,
spl0_9,
inference(rat,[],[s8,s22]) ).
cnf(s24,plain,
spl0_8,
inference(rat,[],[s7,s22]) ).
cnf(s25,plain,
~ spl0_7,
inference(rat,[],[s16,s23]) ).
cnf(s27,plain,
~ spl0_6,
inference(rat,[],[s14,s21,s24]) ).
cnf(s28,plain,
$false,
inference(rat,[],[s6,s25,s27]) ).
fof(f304,plain,
$false,
inference(avatar_sat_refutation,[],[s28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC060-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n002.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:42:37 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.42 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
% 3.50/1.46 % (192732)Input is clausal, will run a generic CNF schedule.
% 3.50/1.46 % (192743)dis-21_1_sil=8000:lcm=predicate:random_seed=2580532483: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)
% 3.50/1.46 % (192740)lrs+10_1_sil=8000:sp=occurrence:random_seed=3368621596:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.50/1.46 % (192737)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=1076895410:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.50/1.46 % (192741)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2269002591:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.50/1.46 % (192738)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2486168719:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.50/1.46 % (192739)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3795408111:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.50/1.46 % (192743)Instruction limit reached!
% 3.50/1.46 % (192743)------------------------------
% 3.50/1.46 % (192743)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.50/1.46 % (192743)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.50/1.46 % (192743)CaDiCaL version: 2.1.3
% 3.50/1.46 % (192743)Termination reason: Instruction limit
% 3.50/1.46 % (192743)Termination phase: Saturation
% 3.50/1.46 % (192743)Time elapsed: 0.027 s
% 3.50/1.46 % (192743)Peak memory usage: 88 MB
% 3.50/1.46 % (192743)Instructions burned: 118 (million)
% 3.50/1.46 % (192742)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=280182699:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.50/1.46 % (192740)Also succeeded, but the first one will report.
% 3.50/1.46 % (192741)First to succeed.
% 3.50/1.46 % (192741)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-192732"
% 3.50/1.46 % (192742)Also succeeded, but the first one will report.
% 3.50/1.46 % (192751)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=1120693280:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.50/1.46 % (192751)Also succeeded, but the first one will report.
% 3.50/1.46 % (192741)Refutation found. Thanks to Tanya!
% 3.50/1.46 % SZS status Unsatisfiable for theBenchmark
% 3.50/1.46 % SZS output start Proof for theBenchmark
% See solution above
% 3.50/1.46 % (192741)------------------------------
% 3.50/1.46 % (192741)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.50/1.46 % (192741)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.50/1.46 % (192741)CaDiCaL version: 2.1.3
% 3.50/1.46 % (192741)Termination reason: Refutation
% 3.50/1.46 % (192741)Time elapsed: 0.004 s
% 3.50/1.46 % (192741)Peak memory usage: 89 MB
% 3.50/1.46 % (192741)Instructions burned: 4 (million)
% 3.50/1.46 % (192741)------------------------------
% 3.50/1.46 % (192741)------------------------------
% 3.50/1.46 % (192732)Success in time 0.411 s
% 3.50/1.46 % Vampire exiting
%------------------------------------------------------------------------------