%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC069-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 : n018.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:18 PM UTC 2026
% Result : Unsatisfiable 3.76s 1.49s
% Output : Refutation 3.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of formulae : 60 ( 12 unt; 7 def)
% Number of atoms : 133 ( 16 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 142 ( 69 ~; 66 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause100) ).
fof(f102,plain,
! [X0,X1] :
( neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
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(f206,negated_conjecture,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk2,X0)
| ~ segmentP(sk1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( ssList(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( neq(sk5,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
( segmentP(sk4,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f212,negated_conjecture,
( segmentP(sk3,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f215,plain,
! [X0] :
( ~ neq(X0,nil)
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(definition_unfolding,[],[f206,f204,f205]) ).
fof(f216,plain,
( nil != sk4
| nil != sk3 ),
inference(definition_unfolding,[],[f208,f204,f205]) ).
fof(f236,definition,
( spl0_4
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f237,plain,
( ~ neq(sk4,nil)
| spl0_4 ),
inference(avatar_component_clause,[],[f236]) ).
fof(f239,definition,
( spl0_5
<=> segmentP(sk3,sk5) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f240,plain,
( segmentP(sk3,sk5)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f239]) ).
fof(f241,plain,
( ~ spl0_4
| spl0_5 ),
inference(avatar_split_clause,[],[f212,f239,f236]) ).
fof(f243,definition,
( spl0_6
<=> segmentP(sk4,sk5) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f244,plain,
( segmentP(sk4,sk5)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f243]) ).
fof(f245,plain,
( ~ spl0_4
| spl0_6 ),
inference(avatar_split_clause,[],[f211,f243,f236]) ).
fof(f247,definition,
( spl0_7
<=> neq(sk5,nil) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f248,plain,
( neq(sk5,nil)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f247]) ).
fof(f249,plain,
( ~ spl0_4
| spl0_7 ),
inference(avatar_split_clause,[],[f210,f247,f236]) ).
fof(f251,definition,
( spl0_8
<=> ssList(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f252,plain,
( ssList(sk5)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f251]) ).
fof(f253,plain,
( ~ spl0_4
| spl0_8 ),
inference(avatar_split_clause,[],[f209,f251,f236]) ).
fof(f255,definition,
( spl0_9
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f258,definition,
( spl0_10
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f259,plain,
( nil != sk4
| spl0_10 ),
inference(avatar_component_clause,[],[f258]) ).
fof(f260,plain,
( ~ spl0_9
| ~ spl0_10 ),
inference(avatar_split_clause,[],[f216,f258,f255]) ).
fof(f262,plain,
( ~ spl0_10
| spl0_9 ),
inference(avatar_split_clause,[],[f207,f255,f258]) ).
fof(f276,plain,
( ~ ssList(sk4)
| ~ ssList(nil)
| nil = sk4
| spl0_4 ),
inference(resolution,[],[f102,f237]) ).
fof(f282,plain,
( ~ ssList(nil)
| nil = sk4
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f276,f203]) ).
fof(f283,plain,
( nil = sk4
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f282,f8]) ).
fof(f284,plain,
( $false
| spl0_4
| spl0_10 ),
inference(forward_subsumption_resolution,[],[f283,f259]) ).
fof(f285,plain,
( spl0_4
| spl0_10 ),
inference(avatar_contradiction_clause,[],[f284]) ).
fof(f286,plain,
( ~ ssList(sk5)
| ~ segmentP(sk4,sk5)
| ~ segmentP(sk3,sk5)
| ~ spl0_7 ),
inference(resolution,[],[f248,f215]) ).
fof(f287,plain,
( ~ segmentP(sk4,sk5)
| ~ segmentP(sk3,sk5)
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f286,f252]) ).
fof(f288,plain,
( ~ segmentP(sk3,sk5)
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f287,f244]) ).
fof(f289,plain,
( $false
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f288,f240]) ).
fof(f290,plain,
( ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(avatar_contradiction_clause,[],[f289]) ).
cnf(s3,plain,
( ~ spl0_4
| spl0_5 ),
inference(sat_conversion,[],[f241]) ).
cnf(s4,plain,
( ~ spl0_4
| spl0_6 ),
inference(sat_conversion,[],[f245]) ).
cnf(s5,plain,
( ~ spl0_4
| spl0_7 ),
inference(sat_conversion,[],[f249]) ).
cnf(s6,plain,
( ~ spl0_4
| spl0_8 ),
inference(sat_conversion,[],[f253]) ).
cnf(s7,plain,
( ~ spl0_9
| ~ spl0_10 ),
inference(sat_conversion,[],[f260]) ).
cnf(s8,plain,
( spl0_9
| ~ spl0_10 ),
inference(sat_conversion,[],[f262]) ).
cnf(s10,plain,
( spl0_4
| spl0_10 ),
inference(sat_conversion,[],[f285]) ).
cnf(s11,plain,
( ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(sat_conversion,[],[f290]) ).
cnf(s14,plain,
~ spl0_10,
inference(rat,[],[s7,s8]) ).
cnf(s15,plain,
spl0_4,
inference(rat,[],[s10,s14]) ).
cnf(s16,plain,
spl0_8,
inference(rat,[],[s6,s15]) ).
cnf(s17,plain,
spl0_7,
inference(rat,[],[s5,s15]) ).
cnf(s18,plain,
spl0_6,
inference(rat,[],[s4,s15]) ).
cnf(s19,plain,
spl0_5,
inference(rat,[],[s3,s15]) ).
cnf(s20,plain,
$false,
inference(rat,[],[s11,s16,s17,s18,s19]) ).
fof(f291,plain,
$false,
inference(avatar_sat_refutation,[],[s20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC069-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.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 07:45:24 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.76/1.49 % (3212123)Input is clausal, will run a generic CNF schedule.
% 3.76/1.49 % (3212134)dis-21_1_sil=8000:lcm=predicate:random_seed=297186533: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.76/1.49 % (3212134)Instruction limit reached!
% 3.76/1.49 % (3212134)------------------------------
% 3.76/1.49 % (3212134)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.76/1.49 % (3212134)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.76/1.49 % (3212134)CaDiCaL version: 2.1.3
% 3.76/1.49 % (3212134)Termination reason: Instruction limit
% 3.76/1.49 % (3212134)Termination phase: Saturation
% 3.76/1.49 % (3212134)Time elapsed: 0.028 s
% 3.76/1.49 % (3212134)Peak memory usage: 89 MB
% 3.76/1.49 % (3212134)Instructions burned: 119 (million)
% 3.76/1.49 % (3212129)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2056056336:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.76/1.49 % (3212128)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=3945161363:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.76/1.49 % (3212130)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3946181905:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.76/1.49 % (3212133)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=862534220:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.76/1.49 % (3212132)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1467296971:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.76/1.49 % (3212131)lrs+10_1_sil=8000:sp=occurrence:random_seed=3161952167:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.76/1.49 % (3212131)Also succeeded, but the first one will report.
% 3.76/1.49 % (3212132)First to succeed.
% 3.76/1.49 % (3212132)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3212123"
% 3.76/1.49 % (3212133)Also succeeded, but the first one will report.
% 3.76/1.49 % (3212136)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=281728907:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.76/1.49 % (3212136)Also succeeded, but the first one will report.
% 3.76/1.49 % (3212132)Refutation found. Thanks to Tanya!
% 3.76/1.49 % SZS status Unsatisfiable for theBenchmark
% 3.76/1.49 % SZS output start Proof for theBenchmark
% See solution above
% 3.76/1.49 % (3212132)------------------------------
% 3.76/1.49 % (3212132)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.76/1.49 % (3212132)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.76/1.49 % (3212132)CaDiCaL version: 2.1.3
% 3.76/1.49 % (3212132)Termination reason: Refutation
% 3.76/1.49 % (3212132)Time elapsed: 0.004 s
% 3.76/1.49 % (3212132)Peak memory usage: 89 MB
% 3.76/1.49 % (3212132)Instructions burned: 3 (million)
% 3.76/1.49 % (3212132)------------------------------
% 3.76/1.49 % (3212132)------------------------------
% 3.76/1.49 % (3212123)Success in time 0.454 s
% 3.76/1.49 % Vampire exiting
%------------------------------------------------------------------------------