%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC355-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 : n013.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:36 PM UTC 2026
% Result : Unsatisfiable 0.20s 1.14s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of formulae : 62 ( 15 unt; 6 def)
% Number of atoms : 149 ( 9 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 168 ( 81 ~; 81 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause74) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause86) ).
fof(f161,axiom,
! [X2,X0,X1] :
( app(app(X2,X1),X0) = app(X2,app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause149) ).
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/sandbox2/benchmark/theBenchmark.p',clause173) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
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(f212,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f213,negated_conjecture,
( app(sk3,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f214,plain,
( sk4 = app(sk3,cons(sk5,nil))
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f213]) ).
fof(f215,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f218,plain,
( neq(sk4,nil)
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f206,f204,f204]) ).
fof(f223,plain,
( ~ segmentP(sk4,sk3)
| ~ neq(sk4,nil) ),
inference(definition_unfolding,[],[f215,f204,f205]) ).
fof(f228,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(app(X0,X1),X2))
| segmentP(app(app(X0,X1),X2),X1) ),
inference(equality_resolution,[],[f187]) ).
fof(f233,plain,
neq(sk4,nil),
inference(duplicate_literal_removal,[],[f218]) ).
fof(f246,definition,
( spl0_4
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f249,definition,
( spl0_5
<=> segmentP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f250,plain,
( ~ segmentP(sk4,sk3)
| spl0_5 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f251,plain,
( ~ spl0_4
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f223,f249,f246]) ).
fof(f253,definition,
( spl0_6
<=> sk4 = app(sk3,cons(sk5,nil)) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f254,plain,
( sk4 = app(sk3,cons(sk5,nil))
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f255,plain,
( ~ spl0_4
| spl0_6 ),
inference(avatar_split_clause,[],[f214,f253,f246]) ).
fof(f257,definition,
( spl0_7
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f258,plain,
( ssItem(sk5)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f259,plain,
( ~ spl0_4
| spl0_7 ),
inference(avatar_split_clause,[],[f212,f257,f246]) ).
fof(f264,plain,
spl0_4,
inference(avatar_split_clause,[],[f233,f246]) ).
fof(f295,definition,
( spl0_9
<=> ssList(cons(sk5,nil)) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f296,plain,
( ~ ssList(cons(sk5,nil))
| spl0_9 ),
inference(avatar_component_clause,[],[f295]) ).
fof(f301,plain,
( ~ ssList(nil)
| ~ ssItem(sk5)
| spl0_9 ),
inference(resolution,[],[f296,f86]) ).
fof(f302,plain,
( ~ ssItem(sk5)
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f301,f8]) ).
fof(f303,plain,
( $false
| ~ spl0_7
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f302,f258]) ).
fof(f304,plain,
( ~ spl0_7
| spl0_9 ),
inference(avatar_contradiction_clause,[],[f303]) ).
fof(f620,plain,
! [X2,X0,X1] :
( ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(X0,app(X1,X2)))
| segmentP(app(app(X0,X1),X2),X1) ),
inference(forward_subsumption_demodulation,[],[f228,f161]) ).
fof(f621,plain,
! [X2,X0,X1] :
( segmentP(app(X0,app(X1,X2)),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(X0,app(X1,X2)))
| ~ ssList(X2) ),
inference(forward_subsumption_demodulation,[],[f620,f161]) ).
fof(f629,plain,
( ! [X0] :
( segmentP(app(X0,sk4),sk3)
| ~ ssList(X0)
| ~ ssList(sk3)
| ~ ssList(app(X0,sk4))
| ~ ssList(cons(sk5,nil)) )
| ~ spl0_6 ),
inference(superposition,[],[f621,f254]) ).
fof(f641,plain,
( ! [X0] :
( segmentP(app(X0,sk4),sk3)
| ~ ssList(X0)
| ~ ssList(app(X0,sk4))
| ~ ssList(cons(sk5,nil)) )
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f629,f202]) ).
fof(f647,definition,
( spl0_19
<=> ! [X0] :
( segmentP(app(X0,sk4),sk3)
| ~ ssList(app(X0,sk4))
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_19])],[avatar_definition]) ).
fof(f648,plain,
( ! [X0] :
( segmentP(app(X0,sk4),sk3)
| ~ ssList(app(X0,sk4))
| ~ ssList(X0) )
| ~ spl0_19 ),
inference(avatar_component_clause,[],[f647]) ).
fof(f649,plain,
( ~ spl0_9
| spl0_19
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f641,f253,f647,f295]) ).
fof(f655,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk4)
| ~ ssList(nil)
| ~ ssList(sk4)
| ~ spl0_19 ),
inference(superposition,[],[f648,f74]) ).
fof(f657,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk4)
| ~ ssList(nil)
| ~ spl0_19 ),
inference(duplicate_literal_removal,[],[f655]) ).
fof(f660,plain,
( ~ ssList(sk4)
| ~ ssList(nil)
| spl0_5
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f657,f250]) ).
fof(f663,plain,
( ~ ssList(nil)
| spl0_5
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f660,f203]) ).
fof(f664,plain,
( $false
| spl0_5
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f663,f8]) ).
fof(f665,plain,
( spl0_5
| ~ spl0_19 ),
inference(avatar_contradiction_clause,[],[f664]) ).
cnf(s3,plain,
( ~ spl0_4
| ~ spl0_5 ),
inference(sat_conversion,[],[f251]) ).
cnf(s4,plain,
( ~ spl0_4
| spl0_6 ),
inference(sat_conversion,[],[f255]) ).
cnf(s5,plain,
( ~ spl0_4
| spl0_7 ),
inference(sat_conversion,[],[f259]) ).
cnf(s9,plain,
spl0_4,
inference(sat_conversion,[],[f264]) ).
cnf(s12,plain,
( ~ spl0_7
| spl0_9 ),
inference(sat_conversion,[],[f304]) ).
cnf(s24,plain,
( ~ spl0_6
| ~ spl0_9
| spl0_19 ),
inference(sat_conversion,[],[f649]) ).
cnf(s25,plain,
( spl0_5
| ~ spl0_19 ),
inference(sat_conversion,[],[f665]) ).
cnf(s26,plain,
spl0_7,
inference(rat,[],[s5,s9]) ).
cnf(s27,plain,
spl0_9,
inference(rat,[],[s12,s26]) ).
cnf(s28,plain,
spl0_6,
inference(rat,[],[s4,s9]) ).
cnf(s29,plain,
spl0_19,
inference(rat,[],[s24,s27,s28]) ).
cnf(s35,plain,
spl0_5,
inference(rat,[],[s25,s29]) ).
cnf(s39,plain,
$false,
inference(rat,[],[s3,s35,s9]) ).
fof(f666,plain,
$false,
inference(avatar_sat_refutation,[],[s39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC355-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.09/0.17 % Computer : n013.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Mon Sep 28 09:14:21 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running first-order theorem proving
% 0.09/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
% 0.20/1.14 % (1042270)Input is clausal, will run a generic CNF schedule.
% 0.20/1.14 % (1042279)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2867908930:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.20/1.14 % (1042279)First to succeed.
% 0.20/1.14 % (1042279)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1042270"
% 0.20/1.14 % (1042281)dis-21_1_sil=8000:lcm=predicate:random_seed=2899799532: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 % (1042277)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=12893385:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.20/1.14 % (1042276)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2206214751:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.20/1.14 % (1042280)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=415423683:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.20/1.14 % (1042275)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=4291044810:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.20/1.14 % (1042278)lrs+10_1_sil=8000:sp=occurrence:random_seed=2070602654:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.20/1.14 % (1042278)Also succeeded, but the first one will report.
% 0.20/1.14 % (1042280)Also succeeded, but the first one will report.
% 0.20/1.14 % (1042281)Instruction limit reached!
% 0.20/1.14 % (1042281)------------------------------
% 0.20/1.14 % (1042281)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.14 % (1042281)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.14 % (1042281)CaDiCaL version: 2.1.3
% 0.20/1.14 % (1042281)Termination reason: Instruction limit
% 0.20/1.14 % (1042281)Termination phase: Saturation
% 0.20/1.14 % (1042281)Time elapsed: 0.065 s
% 0.20/1.14 % (1042281)Peak memory usage: 90 MB
% 0.20/1.14 % (1042281)Instructions burned: 118 (million)
% 0.20/1.14 % (1042279)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 % (1042279)------------------------------
% 0.20/1.14 % (1042279)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.14 % (1042279)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.14 % (1042279)CaDiCaL version: 2.1.3
% 0.20/1.14 % (1042279)Termination reason: Refutation
% 0.20/1.14 % (1042279)Time elapsed: 0.009 s
% 0.20/1.14 % (1042279)Peak memory usage: 90 MB
% 0.20/1.14 % (1042279)Instructions burned: 23 (million)
% 0.20/1.14 % (1042279)------------------------------
% 0.20/1.14 % (1042279)------------------------------
% 0.20/1.14 % (1042270)Success in time 0.297 s
% 0.20/1.14 % Vampire exiting
%------------------------------------------------------------------------------