%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC092-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 : n010.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:24 PM UTC 2026
% Result : Unsatisfiable 2.16s 1.19s
% Output : Refutation 2.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 24
% Syntax : Number of formulae : 87 ( 22 unt; 8 def)
% Number of atoms : 204 ( 21 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 231 ( 114 ~; 109 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
fof(f56,axiom,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause56) ).
fof(f57,axiom,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause57) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause74) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause85) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause100) ).
fof(f102,plain,
! [X0,X1] :
( neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f187,axiom,
! [X2,X3,X0,X1] :
( app(app(X0,X1),X2) != X3
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X3)
| segmentP(X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause173) ).
fof(f201,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
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),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk2,X0)
| ~ segmentP(sk1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f210,plain,
sk4 = app(sk3,sk5),
inference(reorient_equations,[],[f209]) ).
fof(f214,negated_conjecture,
( nil = sk4
| nil != sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f229,plain,
! [X2,X0,X1] :
( ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(app(X0,X1),X2),X1) ),
inference(equality_resolution,[],[f187]) ).
fof(f246,definition,
( spl0_1
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f248,plain,
( nil != sk3
| spl0_1 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f250,definition,
( spl0_2
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f252,plain,
( nil = sk4
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f253,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f214,f250,f246]) ).
fof(f259,definition,
( spl0_4
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f260,plain,
( ssList(nil)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f295,plain,
spl0_4,
inference(avatar_split_clause,[],[f8,f259]) ).
fof(f298,plain,
sk2 = app(sk3,sk5),
inference(forward_demodulation,[],[f210,f204]) ).
fof(f299,plain,
! [X0] :
( ~ segmentP(sk3,X0)
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk2,X0) ),
inference(forward_demodulation,[],[f207,f205]) ).
fof(f300,plain,
( ~ ssList(sk3)
| ~ ssList(nil)
| ~ neq(nil,nil)
| ~ segmentP(sk2,nil) ),
inference(resolution,[],[f56,f299]) ).
fof(f301,plain,
( ~ ssList(nil)
| ~ neq(nil,nil)
| ~ segmentP(sk2,nil) ),
inference(forward_subsumption_resolution,[],[f300,f202]) ).
fof(f302,plain,
( ~ neq(nil,nil)
| ~ segmentP(sk2,nil)
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f301,f260]) ).
fof(f304,definition,
( spl0_12
<=> segmentP(sk2,nil) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f306,plain,
( ~ segmentP(sk2,nil)
| spl0_12 ),
inference(avatar_component_clause,[],[f304]) ).
fof(f308,definition,
( spl0_13
<=> neq(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f310,plain,
( ~ neq(nil,nil)
| spl0_13 ),
inference(avatar_component_clause,[],[f308]) ).
fof(f311,plain,
( ~ spl0_12
| ~ spl0_13
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f302,f259,f308,f304]) ).
fof(f312,plain,
( ~ ssList(sk2)
| spl0_12 ),
inference(resolution,[],[f306,f56]) ).
fof(f313,plain,
( $false
| spl0_12 ),
inference(forward_subsumption_resolution,[],[f312,f201]) ).
fof(f314,plain,
spl0_12,
inference(avatar_contradiction_clause,[],[f313]) ).
fof(f315,plain,
( ~ ssList(sk3)
| ~ ssList(sk3)
| ~ neq(sk3,nil)
| ~ segmentP(sk2,sk3) ),
inference(resolution,[],[f57,f299]) ).
fof(f316,plain,
( ~ ssList(sk3)
| ~ neq(sk3,nil)
| ~ segmentP(sk2,sk3) ),
inference(duplicate_literal_removal,[],[f315]) ).
fof(f317,plain,
( ~ neq(sk3,nil)
| ~ segmentP(sk2,sk3) ),
inference(forward_subsumption_resolution,[],[f316,f202]) ).
fof(f319,definition,
( spl0_14
<=> segmentP(sk2,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f321,plain,
( ~ segmentP(sk2,sk3)
| spl0_14 ),
inference(avatar_component_clause,[],[f319]) ).
fof(f323,definition,
( spl0_15
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_15])],[avatar_definition]) ).
fof(f325,plain,
( ~ neq(sk3,nil)
| spl0_15 ),
inference(avatar_component_clause,[],[f323]) ).
fof(f326,plain,
( ~ spl0_14
| ~ spl0_15 ),
inference(avatar_split_clause,[],[f317,f323,f319]) ).
fof(f560,definition,
( spl0_18
<=> nil = sk2 ),
introduced(definition,[new_symbols(definition,[spl0_18])],[avatar_definition]) ).
fof(f561,plain,
( nil = sk2
| ~ spl0_18 ),
inference(avatar_component_clause,[],[f560]) ).
fof(f588,plain,
( nil = sk2
| ~ spl0_2 ),
inference(superposition,[],[f204,f252]) ).
fof(f590,plain,
( spl0_18
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f588,f250,f560]) ).
fof(f1515,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(X1)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f229,f74]) ).
fof(f1530,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(X1)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f1515]) ).
fof(f1541,plain,
( ! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| segmentP(app(X0,X1),X0) )
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f1530,f260]) ).
fof(f1550,plain,
( ! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f1541,f85]) ).
fof(f1940,plain,
( neq(nil,nil)
| ~ spl0_18 ),
inference(superposition,[],[f206,f561]) ).
fof(f1958,plain,
( $false
| spl0_13
| ~ spl0_18 ),
inference(forward_subsumption_resolution,[],[f1940,f310]) ).
fof(f1959,plain,
( spl0_13
| ~ spl0_18 ),
inference(avatar_contradiction_clause,[],[f1958]) ).
fof(f1979,plain,
( ~ ssList(sk3)
| ~ ssList(nil)
| nil = sk3
| spl0_15 ),
inference(resolution,[],[f325,f102]) ).
fof(f1980,plain,
( ~ ssList(nil)
| nil = sk3
| spl0_15 ),
inference(forward_subsumption_resolution,[],[f1979,f202]) ).
fof(f1981,plain,
( nil = sk3
| ~ spl0_4
| spl0_15 ),
inference(forward_subsumption_resolution,[],[f1980,f260]) ).
fof(f1982,plain,
( $false
| spl0_1
| ~ spl0_4
| spl0_15 ),
inference(forward_subsumption_resolution,[],[f1981,f248]) ).
fof(f1983,plain,
( spl0_1
| ~ spl0_4
| spl0_15 ),
inference(avatar_contradiction_clause,[],[f1982]) ).
fof(f3032,plain,
( segmentP(sk2,sk3)
| ~ ssList(sk5)
| ~ ssList(sk3)
| ~ spl0_4 ),
inference(superposition,[],[f1550,f298]) ).
fof(f3044,plain,
( ~ ssList(sk5)
| ~ ssList(sk3)
| ~ spl0_4
| spl0_14 ),
inference(forward_subsumption_resolution,[],[f3032,f321]) ).
fof(f3055,plain,
( ~ ssList(sk3)
| ~ spl0_4
| spl0_14 ),
inference(forward_subsumption_resolution,[],[f3044,f208]) ).
fof(f3063,plain,
( $false
| ~ spl0_4
| spl0_14 ),
inference(forward_subsumption_resolution,[],[f3055,f202]) ).
fof(f3064,plain,
( ~ spl0_4
| spl0_14 ),
inference(avatar_contradiction_clause,[],[f3063]) ).
cnf(s1,plain,
( ~ spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f253]) ).
cnf(s11,plain,
spl0_4,
inference(sat_conversion,[],[f295]) ).
cnf(s12,plain,
( ~ spl0_4
| ~ spl0_12
| ~ spl0_13 ),
inference(sat_conversion,[],[f311]) ).
cnf(s13,plain,
spl0_12,
inference(sat_conversion,[],[f314]) ).
cnf(s14,plain,
( ~ spl0_14
| ~ spl0_15 ),
inference(sat_conversion,[],[f326]) ).
cnf(s23,plain,
( ~ spl0_2
| spl0_18 ),
inference(sat_conversion,[],[f590]) ).
cnf(s105,plain,
( spl0_13
| ~ spl0_18 ),
inference(sat_conversion,[],[f1959]) ).
cnf(s112,plain,
( spl0_1
| ~ spl0_4
| spl0_15 ),
inference(sat_conversion,[],[f1983]) ).
cnf(s133,plain,
( ~ spl0_4
| spl0_14 ),
inference(sat_conversion,[],[f3064]) ).
cnf(s135,plain,
( ~ spl0_4
| ~ spl0_13 ),
inference(rat,[],[s12,s13]) ).
cnf(s136,plain,
spl0_14,
inference(rat,[],[s133,s11]) ).
cnf(s137,plain,
~ spl0_13,
inference(rat,[],[s135,s11]) ).
cnf(s138,plain,
~ spl0_15,
inference(rat,[],[s14,s136]) ).
cnf(s139,plain,
~ spl0_18,
inference(rat,[],[s105,s137]) ).
cnf(s140,plain,
spl0_1,
inference(rat,[],[s112,s11,s138]) ).
cnf(s141,plain,
~ spl0_2,
inference(rat,[],[s23,s139]) ).
cnf(s149,plain,
$false,
inference(rat,[],[s1,s141,s140]) ).
fof(f3068,plain,
$false,
inference(avatar_sat_refutation,[],[s149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC092-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n010.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 28 07:49:33 UTC 2026
% 0.11/0.40 % CPUTime :
% 0.11/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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.16/1.19 % (1752435)Input is clausal, will run a generic CNF schedule.
% 2.16/1.19 % (1752445)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=37886938:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.16/1.19 % (1752441)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2892580159:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.16/1.19 % (1752443)lrs+10_1_sil=8000:sp=occurrence:random_seed=1281331947:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.16/1.19 % (1752442)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2078649334:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.16/1.19 % (1752440)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=1272648504:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.16/1.19 % (1752444)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1731890144:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.16/1.19 % (1752446)dis-21_1_sil=8000:lcm=predicate:random_seed=2663179632: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.16/1.19 % (1752445)First to succeed.
% 2.16/1.19 % (1752445)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1752435"
% 2.16/1.19 % (1752443)Also succeeded, but the first one will report.
% 2.16/1.19 % (1752444)Also succeeded, but the first one will report.
% 2.16/1.19 % (1752446)Instruction limit reached!
% 2.16/1.19 % (1752446)------------------------------
% 2.16/1.19 % (1752446)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.16/1.19 % (1752446)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.16/1.19 % (1752446)CaDiCaL version: 2.1.3
% 2.16/1.19 % (1752446)Termination reason: Instruction limit
% 2.16/1.19 % (1752446)Termination phase: Saturation
% 2.16/1.19 % (1752446)Time elapsed: 0.059 s
% 2.16/1.19 % (1752446)Peak memory usage: 89 MB
% 2.16/1.19 % (1752446)Instructions burned: 118 (million)
% 2.16/1.19 % (1752445)Refutation found. Thanks to Tanya!
% 2.16/1.19 % SZS status Unsatisfiable for theBenchmark
% 2.16/1.19 % SZS output start Proof for theBenchmark
% See solution above
% 2.80/1.39 % (1752445)------------------------------
% 2.80/1.39 % (1752445)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.80/1.39 % (1752445)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.80/1.39 % (1752445)CaDiCaL version: 2.1.3
% 2.80/1.39 % (1752445)Termination reason: Refutation
% 2.80/1.39 % (1752445)Time elapsed: 0.040 s
% 2.80/1.39 % (1752445)Peak memory usage: 91 MB
% 2.80/1.39 % (1752445)Instructions burned: 107 (million)
% 2.80/1.39 % (1752445)------------------------------
% 2.80/1.39 % (1752445)------------------------------
% 2.80/1.39 % (1752435)Success in time 0.322 s
% 2.80/1.39 % Vampire exiting
%------------------------------------------------------------------------------