%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC330-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:03:29 PM UTC 2026
% Result : Unsatisfiable 0.20s 1.14s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 23
% Syntax : Number of formulae : 77 ( 13 unt; 8 def)
% Number of atoms : 189 ( 19 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 202 ( 90 ~; 104 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 9 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).
fof(f56,axiom,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause56) ).
fof(f57,axiom,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause57) ).
fof(f64,axiom,
! [X0] :
( equalelemsP(cons(X0,nil))
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause64) ).
fof(f186,axiom,
! [X2,X3,X0,X1] :
( segmentP(app(app(X3,X0),X2),X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause172) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f207,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f216,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f217,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
fof(f218,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
fof(f219,plain,
( sk3 = cons(sk5,nil)
| nil = sk3 ),
inference(reorient_equations,[],[f218]) ).
fof(f220,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
fof(f221,plain,
( sk4 = app(app(sk6,sk3),sk7)
| nil = sk3 ),
inference(reorient_equations,[],[f220]) ).
fof(f224,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).
fof(f227,plain,
( ~ segmentP(sk4,sk3)
| ~ equalelemsP(sk3) ),
inference(definition_unfolding,[],[f224,f204,f205,f205]) ).
fof(f240,definition,
( spl0_1
<=> equalelemsP(sk3) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f242,plain,
( ~ equalelemsP(sk3)
| spl0_1 ),
inference(avatar_component_clause,[],[f240]) ).
fof(f244,definition,
( spl0_2
<=> segmentP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f246,plain,
( ~ segmentP(sk4,sk3)
| spl0_2 ),
inference(avatar_component_clause,[],[f244]) ).
fof(f247,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f227,f244,f240]) ).
fof(f249,definition,
( spl0_3
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f251,plain,
( nil = sk3
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f261,definition,
( spl0_6
<=> sk4 = app(app(sk6,sk3),sk7) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f263,plain,
( sk4 = app(app(sk6,sk3),sk7)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f264,plain,
( spl0_3
| spl0_6 ),
inference(avatar_split_clause,[],[f221,f261,f249]) ).
fof(f266,definition,
( spl0_7
<=> sk3 = cons(sk5,nil) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f268,plain,
( sk3 = cons(sk5,nil)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f269,plain,
( spl0_3
| spl0_7 ),
inference(avatar_split_clause,[],[f219,f266,f249]) ).
fof(f271,definition,
( spl0_8
<=> ssList(sk7) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f273,plain,
( ssList(sk7)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f271]) ).
fof(f274,plain,
( spl0_3
| spl0_8 ),
inference(avatar_split_clause,[],[f217,f271,f249]) ).
fof(f276,definition,
( spl0_9
<=> ssList(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f278,plain,
( ssList(sk6)
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f276]) ).
fof(f279,plain,
( spl0_3
| spl0_9 ),
inference(avatar_split_clause,[],[f216,f276,f249]) ).
fof(f291,definition,
( spl0_11
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f293,plain,
( ssItem(sk5)
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f291]) ).
fof(f294,plain,
( spl0_3
| spl0_11 ),
inference(avatar_split_clause,[],[f207,f291,f249]) ).
fof(f296,plain,
( ~ segmentP(sk4,nil)
| spl0_2
| ~ spl0_3 ),
inference(superposition,[],[f246,f251]) ).
fof(f306,plain,
( equalelemsP(sk3)
| ~ ssItem(sk5)
| ~ spl0_7 ),
inference(superposition,[],[f64,f268]) ).
fof(f307,plain,
( equalelemsP(sk3)
| ~ spl0_7
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f306,f293]) ).
fof(f308,plain,
( spl0_1
| ~ spl0_7
| ~ spl0_11 ),
inference(avatar_split_clause,[],[f307,f291,f266,f240]) ).
fof(f407,plain,
( ~ equalelemsP(nil)
| spl0_1
| ~ spl0_3 ),
inference(superposition,[],[f242,f251]) ).
fof(f414,plain,
( $false
| spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f407,f1]) ).
fof(f415,plain,
( spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f414]) ).
fof(f426,plain,
( ~ ssList(sk4)
| spl0_2
| ~ spl0_3 ),
inference(resolution,[],[f296,f56]) ).
fof(f427,plain,
( $false
| spl0_2
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f426,f203]) ).
fof(f428,plain,
( spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f427]) ).
fof(f789,plain,
( ! [X0] :
( segmentP(sk4,X0)
| ~ ssList(sk7)
| ~ ssList(sk6)
| ~ ssList(X0)
| ~ ssList(sk3)
| ~ segmentP(sk3,X0) )
| ~ spl0_6 ),
inference(superposition,[],[f186,f263]) ).
fof(f795,plain,
( ! [X0] :
( segmentP(sk4,X0)
| ~ ssList(sk6)
| ~ ssList(X0)
| ~ ssList(sk3)
| ~ segmentP(sk3,X0) )
| ~ spl0_6
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f789,f273]) ).
fof(f811,plain,
( ! [X0] :
( segmentP(sk4,X0)
| ~ ssList(X0)
| ~ ssList(sk3)
| ~ segmentP(sk3,X0) )
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f795,f278]) ).
fof(f826,plain,
( ! [X0] :
( ~ segmentP(sk3,X0)
| ~ ssList(X0)
| segmentP(sk4,X0) )
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f811,f202]) ).
fof(f828,plain,
( ~ ssList(sk3)
| segmentP(sk4,sk3)
| ~ ssList(sk3)
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(resolution,[],[f826,f57]) ).
fof(f829,plain,
( ~ ssList(sk3)
| segmentP(sk4,sk3)
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(duplicate_literal_removal,[],[f828]) ).
fof(f830,plain,
( segmentP(sk4,sk3)
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f829,f202]) ).
fof(f832,plain,
( $false
| spl0_2
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f830,f246]) ).
fof(f833,plain,
( spl0_2
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f832]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f247]) ).
cnf(s4,plain,
( spl0_3
| spl0_6 ),
inference(sat_conversion,[],[f264]) ).
cnf(s5,plain,
( spl0_3
| spl0_7 ),
inference(sat_conversion,[],[f269]) ).
cnf(s6,plain,
( spl0_3
| spl0_8 ),
inference(sat_conversion,[],[f274]) ).
cnf(s7,plain,
( spl0_3
| spl0_9 ),
inference(sat_conversion,[],[f279]) ).
cnf(s14,plain,
( spl0_3
| spl0_11 ),
inference(sat_conversion,[],[f294]) ).
cnf(s17,plain,
( spl0_1
| ~ spl0_7
| ~ spl0_11 ),
inference(sat_conversion,[],[f308]) ).
cnf(s21,plain,
( spl0_1
| ~ spl0_3 ),
inference(sat_conversion,[],[f415]) ).
cnf(s22,plain,
( spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f428]) ).
cnf(s27,plain,
( spl0_2
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(sat_conversion,[],[f833]) ).
cnf(s28,plain,
spl0_1,
inference(rat,[],[s17,s5,s14,s21]) ).
cnf(s29,plain,
~ spl0_2,
inference(rat,[],[s1,s28]) ).
cnf(s30,plain,
~ spl0_3,
inference(rat,[],[s22,s29]) ).
cnf(s32,plain,
spl0_9,
inference(rat,[],[s7,s30]) ).
cnf(s33,plain,
spl0_8,
inference(rat,[],[s6,s30]) ).
cnf(s35,plain,
spl0_6,
inference(rat,[],[s4,s30]) ).
cnf(s40,plain,
$false,
inference(rat,[],[s27,s32,s29,s33,s35]) ).
fof(f835,plain,
$false,
inference(avatar_sat_refutation,[],[s40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC330-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n013.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 09:05:52 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running first-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/1.14 % (1040053)Input is clausal, will run a generic CNF schedule.
% 0.20/1.14 % (1040061)lrs+10_1_sil=8000:sp=occurrence:random_seed=2212294895:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.20/1.14 % (1040061)First to succeed.
% 0.20/1.14 % (1040061)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1040053"
% 0.20/1.14 % (1040062)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3580525739:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.20/1.14 % (1040063)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=358132446:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.20/1.14 % (1040058)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=3223276669:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.20/1.14 % (1040064)dis-21_1_sil=8000:lcm=predicate:random_seed=3401339682: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)
% 0.20/1.14 % (1040060)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2877558155:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.20/1.14 % (1040059)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=845321731:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.20/1.14 % (1040062)Also succeeded, but the first one will report.
% 0.20/1.14 % (1040063)Also succeeded, but the first one will report.
% 0.20/1.14 % (1040064)Instruction limit reached!
% 0.20/1.14 % (1040064)------------------------------
% 0.20/1.14 % (1040064)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.14 % (1040064)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.14 % (1040064)CaDiCaL version: 2.1.3
% 0.20/1.14 % (1040064)Termination reason: Instruction limit
% 0.20/1.14 % (1040064)Termination phase: Saturation
% 0.20/1.14 % (1040064)Time elapsed: 0.051 s
% 0.20/1.14 % (1040064)Peak memory usage: 89 MB
% 0.20/1.14 % (1040064)Instructions burned: 117 (million)
% 0.20/1.14 % (1040061)Refutation found. Thanks to Tanya!
% 0.20/1.14 % SZS status Unsatisfiable for theBenchmark
% 0.20/1.14 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/1.14 % (1040061)------------------------------
% 0.20/1.14 % (1040061)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.14 % (1040061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.14 % (1040061)CaDiCaL version: 2.1.3
% 0.20/1.14 % (1040061)Termination reason: Refutation
% 0.20/1.14 % (1040061)Time elapsed: 0.008 s
% 0.20/1.14 % (1040061)Peak memory usage: 90 MB
% 0.20/1.14 % (1040061)Instructions burned: 20 (million)
% 0.20/1.14 % (1040061)------------------------------
% 0.20/1.14 % (1040061)------------------------------
% 0.20/1.14 % (1040053)Success in time 0.28 s
% 0.20/1.14 % Vampire exiting
%------------------------------------------------------------------------------