%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC030-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 : n007.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:07 PM UTC 2026
% Result : Unsatisfiable 2.65s 1.27s
% Output : Refutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 18
% Syntax : Number of formulae : 80 ( 20 unt; 6 def)
% Number of atoms : 190 ( 70 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 213 ( 103 ~; 104 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
fof(f121,axiom,
! [X0,X1] :
( app(X0,X1) != nil
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause118) ).
fof(f122,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X0 ),
inference(reorient_equations,[],[f121]) ).
fof(f123,axiom,
! [X0,X1] :
( app(X0,X1) != nil
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause119) ).
fof(f124,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X1 ),
inference(reorient_equations,[],[f123]) ).
fof(f156,axiom,
! [X0,X1] :
( nil != X0
| nil != X1
| ~ ssList(X1)
| ~ ssList(X0)
| app(X0,X1) = nil ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause145) ).
fof(f157,plain,
! [X0,X1] :
( nil != X0
| nil != X1
| ~ ssList(X1)
| ~ ssList(X0)
| nil = app(X0,X1) ),
inference(reorient_equations,[],[f156]) ).
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,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
app(sk5,sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,plain,
sk4 = app(sk5,sk6),
inference(reorient_equations,[],[f208]) ).
fof(f210,negated_conjecture,
app(sk6,sk5) = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f211,plain,
sk3 = app(sk6,sk5),
inference(reorient_equations,[],[f210]) ).
fof(f212,negated_conjecture,
( nil = sk2
| nil = sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f215,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f228,plain,
! [X1] :
( nil != X1
| ~ ssList(X1)
| ~ ssList(nil)
| nil = app(nil,X1) ),
inference(equality_resolution,[],[f157]) ).
fof(f229,plain,
( ~ ssList(nil)
| ~ ssList(nil)
| nil = app(nil,nil) ),
inference(equality_resolution,[],[f228]) ).
fof(f241,plain,
( ~ ssList(nil)
| nil = app(nil,nil) ),
inference(duplicate_literal_removal,[],[f229]) ).
fof(f247,definition,
( spl0_1
<=> nil = sk2 ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f249,plain,
( nil != sk2
| spl0_1 ),
inference(avatar_component_clause,[],[f247]) ).
fof(f251,definition,
( spl0_2
<=> nil = sk1 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f252,plain,
( nil = sk1
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f251]) ).
fof(f253,plain,
( nil != sk1
| spl0_2 ),
inference(avatar_component_clause,[],[f251]) ).
fof(f254,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f215,f251,f247]) ).
fof(f255,plain,
( spl0_2
| spl0_1 ),
inference(avatar_split_clause,[],[f212,f247,f251]) ).
fof(f257,definition,
( spl0_3
<=> nil = app(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f259,plain,
( nil = app(nil,nil)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f261,definition,
( spl0_4
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f264,plain,
( spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f241,f261,f257]) ).
fof(f297,plain,
spl0_4,
inference(avatar_split_clause,[],[f8,f261]) ).
fof(f302,plain,
sk2 = app(sk5,sk6),
inference(forward_demodulation,[],[f209,f204]) ).
fof(f303,plain,
sk1 = app(sk6,sk5),
inference(forward_demodulation,[],[f211,f205]) ).
fof(f304,plain,
( nil = app(sk6,sk5)
| ~ spl0_2 ),
inference(forward_demodulation,[],[f303,f252]) ).
fof(f335,plain,
( nil != sk2
| ~ ssList(sk6)
| ~ ssList(sk5)
| nil = sk5 ),
inference(superposition,[],[f122,f302]) ).
fof(f336,plain,
( nil != nil
| ~ ssList(sk5)
| ~ ssList(sk6)
| nil = sk6
| ~ spl0_2 ),
inference(superposition,[],[f122,f304]) ).
fof(f337,plain,
( ~ ssList(sk5)
| ~ ssList(sk6)
| nil = sk6
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f336]) ).
fof(f339,plain,
( ~ ssList(sk6)
| nil = sk6
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f337,f206]) ).
fof(f340,plain,
( nil = sk6
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f339,f207]) ).
fof(f345,plain,
( nil != sk2
| ~ ssList(sk6)
| ~ ssList(sk5)
| nil = sk6 ),
inference(superposition,[],[f124,f302]) ).
fof(f346,plain,
( nil != nil
| ~ ssList(sk5)
| ~ ssList(sk6)
| nil = sk5
| ~ spl0_2 ),
inference(superposition,[],[f124,f304]) ).
fof(f347,plain,
( ~ ssList(sk5)
| ~ ssList(sk6)
| nil = sk5
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f346]) ).
fof(f349,plain,
( ~ ssList(sk6)
| nil = sk5
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f347,f206]) ).
fof(f350,plain,
( nil = sk5
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f349,f207]) ).
fof(f352,plain,
( sk2 = app(nil,sk6)
| ~ spl0_2 ),
inference(superposition,[],[f302,f350]) ).
fof(f354,plain,
( sk2 = app(nil,nil)
| ~ spl0_2 ),
inference(forward_demodulation,[],[f352,f340]) ).
fof(f356,plain,
( nil = sk2
| ~ spl0_2
| ~ spl0_3 ),
inference(forward_demodulation,[],[f354,f259]) ).
fof(f357,plain,
( $false
| spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f356,f249]) ).
fof(f358,plain,
( spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f357]) ).
fof(f359,plain,
( nil != sk2
| ~ ssList(sk5)
| nil = sk5 ),
inference(forward_subsumption_resolution,[],[f335,f207]) ).
fof(f360,plain,
( nil != sk2
| ~ ssList(sk5)
| nil = sk6 ),
inference(forward_subsumption_resolution,[],[f345,f207]) ).
fof(f361,plain,
( nil != sk2
| nil = sk5 ),
inference(forward_subsumption_resolution,[],[f359,f206]) ).
fof(f362,plain,
( nil != sk2
| nil = sk6 ),
inference(forward_subsumption_resolution,[],[f360,f206]) ).
fof(f364,definition,
( spl0_12
<=> nil = sk5 ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f366,plain,
( nil = sk5
| ~ spl0_12 ),
inference(avatar_component_clause,[],[f364]) ).
fof(f367,plain,
( spl0_12
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f361,f247,f364]) ).
fof(f369,definition,
( spl0_13
<=> nil = sk6 ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f371,plain,
( nil = sk6
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f369]) ).
fof(f372,plain,
( spl0_13
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f362,f247,f369]) ).
fof(f382,plain,
( sk1 = app(nil,sk5)
| ~ spl0_13 ),
inference(superposition,[],[f303,f371]) ).
fof(f386,plain,
( sk1 = app(nil,nil)
| ~ spl0_12
| ~ spl0_13 ),
inference(forward_demodulation,[],[f382,f366]) ).
fof(f388,plain,
( nil = sk1
| ~ spl0_3
| ~ spl0_12
| ~ spl0_13 ),
inference(forward_demodulation,[],[f386,f259]) ).
fof(f389,plain,
( $false
| spl0_2
| ~ spl0_3
| ~ spl0_12
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f388,f253]) ).
fof(f390,plain,
( spl0_2
| ~ spl0_3
| ~ spl0_12
| ~ spl0_13 ),
inference(avatar_contradiction_clause,[],[f389]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f254]) ).
cnf(s2,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f255]) ).
cnf(s3,plain,
( spl0_3
| ~ spl0_4 ),
inference(sat_conversion,[],[f264]) ).
cnf(s12,plain,
spl0_4,
inference(sat_conversion,[],[f297]) ).
cnf(s14,plain,
( spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f358]) ).
cnf(s15,plain,
( ~ spl0_1
| spl0_12 ),
inference(sat_conversion,[],[f367]) ).
cnf(s16,plain,
( ~ spl0_1
| spl0_13 ),
inference(sat_conversion,[],[f372]) ).
cnf(s17,plain,
( spl0_2
| ~ spl0_3
| ~ spl0_12
| ~ spl0_13 ),
inference(sat_conversion,[],[f390]) ).
cnf(s21,plain,
spl0_3,
inference(rat,[],[s3,s12]) ).
cnf(s22,plain,
spl0_1,
inference(rat,[],[s2,s14,s21]) ).
cnf(s23,plain,
spl0_13,
inference(rat,[],[s16,s22]) ).
cnf(s24,plain,
spl0_12,
inference(rat,[],[s15,s22]) ).
cnf(s25,plain,
~ spl0_2,
inference(rat,[],[s1,s22]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s17,s23,s21,s24,s25]) ).
fof(f391,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC030-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.13/0.37 % Computer : n007.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Mon Sep 28 07:29:55 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/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
% 2.65/1.27 % (2222227)Input is clausal, will run a generic CNF schedule.
% 2.65/1.27 % (2222237)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3536524452:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.65/1.27 % (2222237)First to succeed.
% 2.65/1.27 % (2222237)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2222227"
% 2.65/1.27 % (2222233)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2247371185:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.65/1.27 % (2222232)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=779060415:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.65/1.27 % (2222234)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2037897261:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.65/1.27 % (2222235)lrs+10_1_sil=8000:sp=occurrence:random_seed=4084308276:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.65/1.27 % (2222235)Also succeeded, but the first one will report.
% 2.65/1.27 % (2222238)dis-21_1_sil=8000:lcm=predicate:random_seed=3758678738: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.65/1.27 % (2222236)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=848725720:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.65/1.27 % (2222236)Also succeeded, but the first one will report.
% 2.65/1.27 % (2222238)Instruction limit reached!
% 2.65/1.27 % (2222238)------------------------------
% 2.65/1.27 % (2222238)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.27 % (2222238)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.27 % (2222238)CaDiCaL version: 2.1.3
% 2.65/1.27 % (2222238)Termination reason: Instruction limit
% 2.65/1.27 % (2222238)Termination phase: Saturation
% 2.65/1.27 % (2222238)Time elapsed: 0.056 s
% 2.65/1.27 % (2222238)Peak memory usage: 89 MB
% 2.65/1.27 % (2222238)Instructions burned: 118 (million)
% 2.65/1.27 % (2222237)Refutation found. Thanks to Tanya!
% 2.65/1.27 % SZS status Unsatisfiable for theBenchmark
% 2.65/1.27 % SZS output start Proof for theBenchmark
% See solution above
% 2.65/1.27 % (2222237)------------------------------
% 2.65/1.27 % (2222237)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.27 % (2222237)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.27 % (2222237)CaDiCaL version: 2.1.3
% 2.65/1.27 % (2222237)Termination reason: Refutation
% 2.65/1.27 % (2222237)Time elapsed: 0.005 s
% 2.65/1.27 % (2222237)Peak memory usage: 90 MB
% 2.65/1.27 % (2222237)Instructions burned: 11 (million)
% 2.65/1.27 % (2222237)------------------------------
% 2.65/1.27 % (2222237)------------------------------
% 2.65/1.27 % (2222227)Success in time 0.314 s
% 2.65/1.27 % Vampire exiting
%------------------------------------------------------------------------------