%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC415-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 : n016.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:53 PM UTC 2026
% Result : Unsatisfiable 4.74s 1.63s
% Output : Refutation 4.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 52 ( 12 unt; 4 def)
% Number of atoms : 130 ( 20 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 146 ( 68 ~; 74 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 12 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
fof(f75,axiom,
! [X0] :
( ssList(tl(X0))
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause75) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause100) ).
fof(f102,plain,
! [X0,X1] :
( neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f118,axiom,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause115) ).
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(f206,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f210,negated_conjecture,
! [X0] :
( ~ ssList(X0)
| sk3 = X0
| tl(sk4) != X0
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
! [X0] :
( ~ ssList(X0)
| tl(sk2) != X0
| sk1 != X0
| ~ neq(nil,sk2)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f214,plain,
( neq(sk4,nil)
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f206,f204,f204]) ).
fof(f218,plain,
! [X0] :
( ~ ssList(X0)
| tl(sk4) != X0
| sk3 != X0
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(definition_unfolding,[],[f211,f204,f205,f204]) ).
fof(f221,plain,
( ~ ssList(tl(sk4))
| sk3 = tl(sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(equality_resolution,[],[f210]) ).
fof(f222,plain,
( ~ ssList(tl(sk4))
| sk3 != tl(sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(equality_resolution,[],[f218]) ).
fof(f224,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f228,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f224]) ).
fof(f230,plain,
neq(sk4,nil),
inference(duplicate_literal_removal,[],[f214]) ).
fof(f232,definition,
( spl0_1
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f233,plain,
( neq(sk4,nil)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f232]) ).
fof(f236,definition,
( spl0_2
<=> neq(nil,sk4) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f237,plain,
( neq(nil,sk4)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f236]) ).
fof(f238,plain,
( ~ neq(nil,sk4)
| spl0_2 ),
inference(avatar_component_clause,[],[f236]) ).
fof(f240,definition,
( spl0_3
<=> sk3 = tl(sk4) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f244,definition,
( spl0_4
<=> ssList(tl(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f246,plain,
( ~ ssList(tl(sk4))
| spl0_4 ),
inference(avatar_component_clause,[],[f244]) ).
fof(f247,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f222,f244,f240,f236,f232]) ).
fof(f248,plain,
( ~ spl0_1
| ~ spl0_2
| spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f221,f244,f240,f236,f232]) ).
fof(f251,plain,
spl0_1,
inference(avatar_split_clause,[],[f230,f232]) ).
fof(f272,plain,
( ~ ssList(nil)
| ~ ssList(sk4)
| nil = sk4
| spl0_2 ),
inference(resolution,[],[f102,f238]) ).
fof(f277,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f272,f8]) ).
fof(f278,plain,
( nil = sk4
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f277,f203]) ).
fof(f286,plain,
( ~ neq(nil,nil)
| spl0_2 ),
inference(superposition,[],[f238,f278]) ).
fof(f287,plain,
( neq(nil,nil)
| ~ spl0_1
| spl0_2 ),
inference(superposition,[],[f233,f278]) ).
fof(f289,plain,
( $false
| ~ spl0_1
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f286,f287]) ).
fof(f290,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_contradiction_clause,[],[f289]) ).
fof(f291,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_4 ),
inference(resolution,[],[f246,f75]) ).
fof(f292,plain,
( nil = sk4
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f291,f203]) ).
fof(f311,plain,
( neq(nil,nil)
| ~ spl0_2
| spl0_4 ),
inference(superposition,[],[f237,f292]) ).
fof(f323,plain,
( ~ ssList(nil)
| ~ spl0_2
| spl0_4 ),
inference(resolution,[],[f311,f228]) ).
fof(f324,plain,
( $false
| ~ spl0_2
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f323,f8]) ).
fof(f325,plain,
( ~ spl0_2
| spl0_4 ),
inference(avatar_contradiction_clause,[],[f324]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(sat_conversion,[],[f247]) ).
cnf(s2,plain,
( ~ spl0_1
| ~ spl0_2
| spl0_3
| ~ spl0_4 ),
inference(sat_conversion,[],[f248]) ).
cnf(s5,plain,
spl0_1,
inference(sat_conversion,[],[f251]) ).
cnf(s6,plain,
( ~ spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f290]) ).
cnf(s8,plain,
( ~ spl0_2
| spl0_4 ),
inference(sat_conversion,[],[f325]) ).
cnf(s9,plain,
spl0_2,
inference(rat,[],[s6,s5]) ).
cnf(s10,plain,
spl0_4,
inference(rat,[],[s8,s9]) ).
cnf(s11,plain,
spl0_3,
inference(rat,[],[s2,s10,s9,s5]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s1,s10,s11,s9,s5]) ).
fof(f326,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC415-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.10/0.17 % Computer : n016.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Mon Sep 28 09:38:10 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running first-order theorem proving
% 0.10/0.21 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
% 4.74/1.63 % (3509101)Input is clausal, will run a generic CNF schedule.
% 4.74/1.63 % (3509129)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=113936920:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.74/1.63 % (3509127)lrs+10_1_sil=8000:sp=occurrence:random_seed=3843001005:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.74/1.63 % (3509127)First to succeed.
% 4.74/1.63 % (3509127)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3509101"
% 4.74/1.63 % (3509129)Also succeeded, but the first one will report.
% 4.74/1.63 % (3509130)dis-21_1_sil=8000:lcm=predicate:random_seed=289372151: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)
% 4.74/1.63 % (3509126)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4102921887:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.74/1.63 % (3509124)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=1884779862:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.74/1.63 % (3509125)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2693114372:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.74/1.63 % (3509128)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=970298255:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.74/1.63 % (3509128)Also succeeded, but the first one will report.
% 4.74/1.63 % (3509130)Instruction limit reached!
% 4.74/1.63 % (3509130)------------------------------
% 4.74/1.63 % (3509130)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.74/1.63 % (3509130)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.74/1.63 % (3509130)CaDiCaL version: 2.1.3
% 4.74/1.63 % (3509130)Termination reason: Instruction limit
% 4.74/1.63 % (3509130)Termination phase: Saturation
% 4.74/1.63 % (3509130)Time elapsed: 0.044 s
% 4.74/1.63 % (3509130)Peak memory usage: 88 MB
% 4.74/1.63 % (3509130)Instructions burned: 117 (million)
% 4.74/1.63 % (3509141)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=4137714345:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 4.74/1.63 % (3509141)Also succeeded, but the first one will report.
% 4.74/1.63 % (3509127)Refutation found. Thanks to Tanya!
% 4.74/1.63 % SZS status Unsatisfiable for theBenchmark
% 4.74/1.63 % SZS output start Proof for theBenchmark
% See solution above
% 4.74/1.63 % (3509127)------------------------------
% 4.74/1.63 % (3509127)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.74/1.63 % (3509127)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.74/1.63 % (3509127)CaDiCaL version: 2.1.3
% 4.74/1.63 % (3509127)Termination reason: Refutation
% 4.74/1.63 % (3509127)Time elapsed: 0.009 s
% 4.74/1.63 % (3509127)Peak memory usage: 90 MB
% 4.74/1.63 % (3509127)Instructions burned: 5 (million)
% 4.74/1.63 % (3509127)------------------------------
% 4.74/1.63 % (3509127)------------------------------
% 4.74/1.63 % (3509101)Success in time 0.548 s
% 4.74/1.63 % Vampire exiting
%------------------------------------------------------------------------------