%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC320-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 : n003.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:27 PM UTC 2026
% Result : Unsatisfiable 0.20s 1.14s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 19
% Syntax : Number of formulae : 63 ( 8 unt; 8 def)
% Number of atoms : 165 ( 45 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 203 ( 101 ~; 94 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(f206,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,plain,
( sk3 = app(cons(sk5,nil),sk6)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f209]) ).
fof(f211,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f212,plain,
( sk4 = app(sk6,cons(sk5,nil))
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f211]) ).
fof(f213,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f214,negated_conjecture,
! [X0,X1] :
( nil = sk2
| ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) != sk1
| app(X1,cons(X0,nil)) != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f215,plain,
! [X0,X1] :
( nil = sk2
| ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) != sk1
| sk2 != app(X1,cons(X0,nil)) ),
inference(reorient_equations,[],[f214]) ).
fof(f216,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f217,negated_conjecture,
! [X0,X1] :
( nil != sk1
| ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) != sk1
| app(X1,cons(X0,nil)) != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f218,plain,
! [X0,X1] :
( nil != sk1
| ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) != sk1
| sk2 != app(X1,cons(X0,nil)) ),
inference(reorient_equations,[],[f217]) ).
fof(f221,plain,
( nil = sk4
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f213,f204,f204]) ).
fof(f222,plain,
! [X0,X1] :
( nil = sk4
| ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) != sk3
| sk4 != app(X1,cons(X0,nil)) ),
inference(definition_unfolding,[],[f215,f204,f205,f204]) ).
fof(f223,plain,
( nil != sk3
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f216,f205,f204]) ).
fof(f224,plain,
! [X0,X1] :
( nil != sk3
| ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) != sk3
| sk4 != app(X1,cons(X0,nil)) ),
inference(definition_unfolding,[],[f218,f205,f205,f204]) ).
fof(f233,definition,
( spl0_1
<=> ! [X0,X1] :
( ~ ssItem(X0)
| sk4 != app(X1,cons(X0,nil))
| app(cons(X0,nil),X1) != sk3
| ~ ssList(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f234,plain,
( ! [X0,X1] :
( sk4 != app(X1,cons(X0,nil))
| ~ ssItem(X0)
| app(cons(X0,nil),X1) != sk3
| ~ ssList(X1) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f233]) ).
fof(f236,definition,
( spl0_2
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f239,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f224,f236,f233]) ).
fof(f241,definition,
( spl0_3
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f244,plain,
( spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f223,f236,f241]) ).
fof(f246,definition,
( spl0_4
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f249,plain,
( spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f222,f246,f233]) ).
fof(f250,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f221,f246,f241]) ).
fof(f252,definition,
( spl0_5
<=> sk4 = app(sk6,cons(sk5,nil)) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f254,plain,
( sk4 = app(sk6,cons(sk5,nil))
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f255,plain,
( ~ spl0_3
| spl0_5 ),
inference(avatar_split_clause,[],[f212,f252,f241]) ).
fof(f257,definition,
( spl0_6
<=> sk3 = app(cons(sk5,nil),sk6) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f259,plain,
( sk3 = app(cons(sk5,nil),sk6)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f260,plain,
( ~ spl0_3
| spl0_6 ),
inference(avatar_split_clause,[],[f210,f257,f241]) ).
fof(f262,definition,
( spl0_7
<=> ssList(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f264,plain,
( ssList(sk6)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f265,plain,
( ~ spl0_3
| spl0_7 ),
inference(avatar_split_clause,[],[f208,f262,f241]) ).
fof(f267,definition,
( spl0_8
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f269,plain,
( ssItem(sk5)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f267]) ).
fof(f270,plain,
( ~ spl0_3
| spl0_8 ),
inference(avatar_split_clause,[],[f207,f267,f241]) ).
fof(f271,plain,
( ~ spl0_4
| spl0_2 ),
inference(avatar_split_clause,[],[f206,f236,f246]) ).
fof(f274,plain,
( sk4 != sk4
| ~ ssItem(sk5)
| sk3 != app(cons(sk5,nil),sk6)
| ~ ssList(sk6)
| ~ spl0_1
| ~ spl0_5 ),
inference(superposition,[],[f234,f254]) ).
fof(f275,plain,
( ~ ssItem(sk5)
| sk3 != app(cons(sk5,nil),sk6)
| ~ ssList(sk6)
| ~ spl0_1
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f274]) ).
fof(f276,plain,
( sk3 != app(cons(sk5,nil),sk6)
| ~ ssList(sk6)
| ~ spl0_1
| ~ spl0_5
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f275,f269]) ).
fof(f277,plain,
( sk3 != app(cons(sk5,nil),sk6)
| ~ spl0_1
| ~ spl0_5
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f276,f264]) ).
fof(f281,plain,
( $false
| ~ spl0_1
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f277,f259]) ).
fof(f282,plain,
( ~ spl0_1
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(avatar_contradiction_clause,[],[f281]) ).
cnf(s1,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f239]) ).
cnf(s2,plain,
( ~ spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f244]) ).
cnf(s3,plain,
( spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f249]) ).
cnf(s4,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f250]) ).
cnf(s5,plain,
( ~ spl0_3
| spl0_5 ),
inference(sat_conversion,[],[f255]) ).
cnf(s6,plain,
( ~ spl0_3
| spl0_6 ),
inference(sat_conversion,[],[f260]) ).
cnf(s7,plain,
( ~ spl0_3
| spl0_7 ),
inference(sat_conversion,[],[f265]) ).
cnf(s8,plain,
( ~ spl0_3
| spl0_8 ),
inference(sat_conversion,[],[f270]) ).
cnf(s9,plain,
( spl0_2
| ~ spl0_4 ),
inference(sat_conversion,[],[f271]) ).
cnf(s11,plain,
( ~ spl0_1
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(sat_conversion,[],[f282]) ).
cnf(s12,plain,
spl0_1,
inference(rat,[],[s9,s1,s3]) ).
cnf(s13,plain,
~ spl0_3,
inference(rat,[],[s11,s5,s6,s7,s8,s12]) ).
cnf(s14,plain,
spl0_4,
inference(rat,[],[s4,s13]) ).
cnf(s15,plain,
~ spl0_2,
inference(rat,[],[s2,s13]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s9,s14,s15]) ).
fof(f283,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC320-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.19 % Computer : n003.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 09:06:12 UTC 2026
% 0.07/0.20 % CPUTime :
% 0.07/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running first-order theorem proving
% 0.07/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 % (1450362)Input is clausal, will run a generic CNF schedule.
% 0.20/1.14 % (1450370)lrs+10_1_sil=8000:sp=occurrence:random_seed=1914071016:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.20/1.14 % (1450370)First to succeed.
% 0.20/1.14 % (1450370)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1450362"
% 0.20/1.14 % (1450367)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=858725230:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.20/1.14 % (1450368)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3839962232:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.20/1.14 % (1450369)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3466155908:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.20/1.14 % (1450372)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1685768690:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.20/1.14 % (1450371)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3585555393:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.20/1.14 % (1450373)dis-21_1_sil=8000:lcm=predicate:random_seed=1754522355: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 % (1450371)Also succeeded, but the first one will report.
% 0.20/1.14 % (1450373)Also succeeded, but the first one will report.
% 0.20/1.14 % (1450372)Also succeeded, but the first one will report.
% 0.20/1.14 % (1450370)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 % (1450370)------------------------------
% 0.20/1.14 % (1450370)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.14 % (1450370)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.14 % (1450370)CaDiCaL version: 2.1.3
% 0.20/1.14 % (1450370)Termination reason: Refutation
% 0.20/1.14 % (1450370)Time elapsed: 0.002 s
% 0.20/1.14 % (1450370)Peak memory usage: 90 MB
% 0.20/1.14 % (1450370)Instructions burned: 4 (million)
% 0.20/1.14 % (1450370)------------------------------
% 0.20/1.14 % (1450370)------------------------------
% 0.20/1.14 % (1450362)Success in time 0.275 s
% 0.20/1.14 % Vampire exiting
%------------------------------------------------------------------------------