%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC422-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 : n001.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:55 PM UTC 2026
% Result : Unsatisfiable 2.59s 1.05s
% Output : Refutation 2.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of formulae : 58 ( 13 unt; 7 def)
% Number of atoms : 157 ( 23 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 202 ( 103 ~; 92 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f217,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk2
| app(app(X2,cons(X0,nil)),X1) != sk1
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f218,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk2 != app(app(X1,cons(X0,nil)),X2)
| sk1 != app(app(X2,cons(X0,nil)),X1)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f217]) ).
fof(f219,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
fof(f220,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
fof(f221,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
fof(f222,negated_conjecture,
( app(app(sk6,cons(sk5,nil)),sk7) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
fof(f223,plain,
( sk4 = app(app(sk6,cons(sk5,nil)),sk7)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f222]) ).
fof(f224,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),sk6) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_20) ).
fof(f225,plain,
( sk3 = app(app(sk7,cons(sk5,nil)),sk6)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f224]) ).
fof(f228,plain,
( neq(sk4,nil)
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f206,f204,f204]) ).
fof(f236,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk4 != app(app(X1,cons(X0,nil)),X2)
| sk3 != app(app(X2,cons(X0,nil)),X1)
| ~ neq(sk4,nil) ),
inference(definition_unfolding,[],[f218,f204,f205]) ).
fof(f244,plain,
neq(sk4,nil),
inference(duplicate_literal_removal,[],[f228]) ).
fof(f253,definition,
( spl0_3
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f256,definition,
( spl0_4
<=> sk3 = app(app(sk7,cons(sk5,nil)),sk6) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f257,plain,
( sk3 = app(app(sk7,cons(sk5,nil)),sk6)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f258,plain,
( ~ spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f225,f256,f253]) ).
fof(f260,definition,
( spl0_5
<=> sk4 = app(app(sk6,cons(sk5,nil)),sk7) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f261,plain,
( sk4 = app(app(sk6,cons(sk5,nil)),sk7)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f262,plain,
( ~ spl0_3
| spl0_5 ),
inference(avatar_split_clause,[],[f223,f260,f253]) ).
fof(f264,definition,
( spl0_6
<=> ssList(sk7) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f265,plain,
( ssList(sk7)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f266,plain,
( ~ spl0_3
| spl0_6 ),
inference(avatar_split_clause,[],[f221,f264,f253]) ).
fof(f268,definition,
( spl0_7
<=> ssList(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f269,plain,
( ssList(sk6)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f268]) ).
fof(f270,plain,
( ~ spl0_3
| spl0_7 ),
inference(avatar_split_clause,[],[f220,f268,f253]) ).
fof(f272,definition,
( spl0_8
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f273,plain,
( ssItem(sk5)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f274,plain,
( ~ spl0_3
| spl0_8 ),
inference(avatar_split_clause,[],[f219,f272,f253]) ).
fof(f276,definition,
( spl0_9
<=> ! [X2,X0,X1] :
( ~ ssItem(X0)
| sk3 != app(app(X2,cons(X0,nil)),X1)
| sk4 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f277,plain,
( ! [X2,X0,X1] :
( sk4 != app(app(X1,cons(X0,nil)),X2)
| sk3 != app(app(X2,cons(X0,nil)),X1)
| ~ ssItem(X0)
| ~ ssList(X2)
| ~ ssList(X1) )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f276]) ).
fof(f278,plain,
( ~ spl0_3
| spl0_9 ),
inference(avatar_split_clause,[],[f236,f276,f253]) ).
fof(f286,plain,
spl0_3,
inference(avatar_split_clause,[],[f244,f253]) ).
fof(f290,plain,
( sk4 != sk4
| sk3 != app(app(sk7,cons(sk5,nil)),sk6)
| ~ ssItem(sk5)
| ~ ssList(sk7)
| ~ ssList(sk6)
| ~ spl0_5
| ~ spl0_9 ),
inference(superposition,[],[f277,f261]) ).
fof(f291,plain,
( sk3 != app(app(sk7,cons(sk5,nil)),sk6)
| ~ ssItem(sk5)
| ~ ssList(sk7)
| ~ ssList(sk6)
| ~ spl0_5
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f290]) ).
fof(f292,plain,
( ~ ssItem(sk5)
| ~ ssList(sk7)
| ~ ssList(sk6)
| ~ spl0_4
| ~ spl0_5
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f291,f257]) ).
fof(f294,plain,
( ~ ssList(sk7)
| ~ ssList(sk6)
| ~ spl0_4
| ~ spl0_5
| ~ spl0_8
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f292,f273]) ).
fof(f296,plain,
( ~ ssList(sk6)
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f294,f265]) ).
fof(f298,plain,
( $false
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f296,f269]) ).
fof(f299,plain,
( ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f298]) ).
cnf(s2,plain,
( ~ spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f258]) ).
cnf(s3,plain,
( ~ spl0_3
| spl0_5 ),
inference(sat_conversion,[],[f262]) ).
cnf(s4,plain,
( ~ spl0_3
| spl0_6 ),
inference(sat_conversion,[],[f266]) ).
cnf(s5,plain,
( ~ spl0_3
| spl0_7 ),
inference(sat_conversion,[],[f270]) ).
cnf(s6,plain,
( ~ spl0_3
| spl0_8 ),
inference(sat_conversion,[],[f274]) ).
cnf(s7,plain,
( ~ spl0_3
| spl0_9 ),
inference(sat_conversion,[],[f278]) ).
cnf(s14,plain,
spl0_3,
inference(sat_conversion,[],[f286]) ).
cnf(s16,plain,
( ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_9 ),
inference(sat_conversion,[],[f299]) ).
cnf(s18,plain,
spl0_9,
inference(rat,[],[s7,s14]) ).
cnf(s19,plain,
spl0_8,
inference(rat,[],[s6,s14]) ).
cnf(s20,plain,
spl0_7,
inference(rat,[],[s5,s14]) ).
cnf(s21,plain,
spl0_6,
inference(rat,[],[s4,s14]) ).
cnf(s22,plain,
spl0_5,
inference(rat,[],[s3,s14]) ).
cnf(s23,plain,
~ spl0_4,
inference(rat,[],[s16,s18,s19,s20,s21,s22]) ).
cnf(s24,plain,
$false,
inference(rat,[],[s2,s23,s14]) ).
fof(f307,plain,
$false,
inference(avatar_sat_refutation,[],[s24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC422-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.09/0.19 % Computer : n001.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:41:48 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running first-order theorem proving
% 0.09/0.22 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.59/1.05 % (246316)Input is clausal, will run a generic CNF schedule.
% 2.59/1.05 % (246325)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2426273108:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.59/1.05 % (246325)First to succeed.
% 2.59/1.05 % (246325)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-246316"
% 2.59/1.05 % (246322)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3641943178:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.59/1.05 % (246321)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=2232574497:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.59/1.05 % (246323)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=262746638:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.59/1.05 % (246326)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1339231496:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.59/1.05 % (246326)Also succeeded, but the first one will report.
% 2.59/1.05 % (246324)lrs+10_1_sil=8000:sp=occurrence:random_seed=1842591462:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.59/1.05 % (246327)dis-21_1_sil=8000:lcm=predicate:random_seed=1710676186: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.59/1.05 % (246324)Also succeeded, but the first one will report.
% 2.59/1.05 % (246327)Also succeeded, but the first one will report.
% 2.59/1.05 % (246325)Refutation found. Thanks to Tanya!
% 2.59/1.05 % SZS status Unsatisfiable for theBenchmark
% 2.59/1.05 % SZS output start Proof for theBenchmark
% See solution above
% 2.59/1.05 % (246325)------------------------------
% 2.59/1.05 % (246325)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.59/1.05 % (246325)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.59/1.05 % (246325)CaDiCaL version: 2.1.3
% 2.59/1.05 % (246325)Termination reason: Refutation
% 2.59/1.05 % (246325)Time elapsed: 0.002 s
% 2.59/1.05 % (246325)Peak memory usage: 90 MB
% 2.59/1.05 % (246325)Instructions burned: 4 (million)
% 2.59/1.05 % (246325)------------------------------
% 2.59/1.05 % (246325)------------------------------
% 2.59/1.05 % (246316)Success in time 0.291 s
% 2.59/1.05 % Vampire exiting
%------------------------------------------------------------------------------