%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC100-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:02:26 PM UTC 2026
% Result : Unsatisfiable 2.48s 1.21s
% Output : Refutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of formulae : 65 ( 14 unt; 5 def)
% Number of atoms : 149 ( 30 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 163 ( 79 ~; 79 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause85) ).
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(f121,axiom,
! [X0,X1] :
( app(X0,X1) != nil
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause118) ).
fof(f122,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| nil = X0 ),
inference(reorient_equations,[],[f121]) ).
fof(f155,axiom,
! [X2,X0,X1] :
( app(X0,X1) != X2
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| frontsegP(X2,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause144) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
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,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,plain,
sk4 = app(sk3,sk5),
inference(reorient_equations,[],[f207]) ).
fof(f212,negated_conjecture,
( nil = sk4
| nil != sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f214,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ frontsegP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f215,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f220,plain,
( nil = sk4
| ~ neq(sk3,nil)
| ~ frontsegP(sk4,sk3) ),
inference(definition_unfolding,[],[f214,f204,f205,f204,f205]) ).
fof(f221,plain,
( nil != sk3
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f215,f205,f204]) ).
fof(f229,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f231,plain,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1))
| frontsegP(app(X0,X1),X0) ),
inference(equality_resolution,[],[f155]) ).
fof(f236,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f229]) ).
fof(f260,definition,
( spl0_6
<=> frontsegP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f261,plain,
( ~ frontsegP(sk4,sk3)
| spl0_6 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f263,definition,
( spl0_7
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f264,plain,
( ~ neq(sk3,nil)
| spl0_7 ),
inference(avatar_component_clause,[],[f263]) ).
fof(f266,definition,
( spl0_8
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f270,definition,
( spl0_9
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f271,plain,
( neq(sk4,nil)
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f272,plain,
( spl0_9
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f221,f266,f270]) ).
fof(f274,definition,
( spl0_10
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f275,plain,
( nil = sk4
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f276,plain,
( ~ spl0_6
| ~ spl0_7
| spl0_10 ),
inference(avatar_split_clause,[],[f220,f274,f263,f260]) ).
fof(f278,plain,
( ~ spl0_8
| spl0_10 ),
inference(avatar_split_clause,[],[f212,f274,f266]) ).
fof(f315,plain,
( nil != sk4
| ~ ssList(sk5)
| ~ ssList(sk3)
| nil = sk3 ),
inference(superposition,[],[f122,f208]) ).
fof(f318,plain,
( nil != sk4
| ~ ssList(sk3)
| nil = sk3 ),
inference(forward_subsumption_resolution,[],[f315,f206]) ).
fof(f319,plain,
( nil != sk4
| nil = sk3 ),
inference(forward_subsumption_resolution,[],[f318,f202]) ).
fof(f356,plain,
! [X0,X1] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f231,f85]) ).
fof(f362,plain,
( frontsegP(sk4,sk3)
| ~ ssList(sk3)
| ~ ssList(sk5) ),
inference(superposition,[],[f356,f208]) ).
fof(f368,plain,
( ~ ssList(sk3)
| ~ ssList(sk5)
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f362,f261]) ).
fof(f370,plain,
( ~ ssList(sk5)
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f368,f202]) ).
fof(f371,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f370,f206]) ).
fof(f372,plain,
spl0_6,
inference(avatar_contradiction_clause,[],[f371]) ).
fof(f379,plain,
( spl0_8
| ~ spl0_10 ),
inference(avatar_split_clause,[],[f319,f274,f266]) ).
fof(f387,plain,
( ~ ssList(sk3)
| ~ ssList(nil)
| nil = sk3
| spl0_7 ),
inference(resolution,[],[f264,f102]) ).
fof(f388,plain,
( ~ ssList(nil)
| nil = sk3
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f387,f202]) ).
fof(f396,plain,
( nil = sk3
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f388,f8]) ).
fof(f397,plain,
( spl0_8
| spl0_7 ),
inference(avatar_split_clause,[],[f396,f263,f266]) ).
fof(f398,plain,
( neq(nil,nil)
| ~ spl0_9
| ~ spl0_10 ),
inference(superposition,[],[f271,f275]) ).
fof(f489,plain,
( ~ ssList(nil)
| ~ spl0_9
| ~ spl0_10 ),
inference(resolution,[],[f398,f236]) ).
fof(f490,plain,
( $false
| ~ spl0_9
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f489,f8]) ).
fof(f491,plain,
( ~ spl0_9
| ~ spl0_10 ),
inference(avatar_contradiction_clause,[],[f490]) ).
cnf(s6,plain,
( ~ spl0_8
| spl0_9 ),
inference(sat_conversion,[],[f272]) ).
cnf(s7,plain,
( ~ spl0_6
| ~ spl0_7
| spl0_10 ),
inference(sat_conversion,[],[f276]) ).
cnf(s9,plain,
( ~ spl0_8
| spl0_10 ),
inference(sat_conversion,[],[f278]) ).
cnf(s14,plain,
spl0_6,
inference(sat_conversion,[],[f372]) ).
cnf(s16,plain,
( spl0_8
| ~ spl0_10 ),
inference(sat_conversion,[],[f379]) ).
cnf(s19,plain,
( spl0_7
| spl0_8 ),
inference(sat_conversion,[],[f397]) ).
cnf(s24,plain,
( ~ spl0_9
| ~ spl0_10 ),
inference(sat_conversion,[],[f491]) ).
cnf(s26,plain,
( ~ spl0_7
| spl0_10 ),
inference(rat,[],[s7,s14]) ).
cnf(s30,plain,
~ spl0_8,
inference(rat,[],[s24,s6,s9]) ).
cnf(s32,plain,
spl0_7,
inference(rat,[],[s19,s30]) ).
cnf(s33,plain,
~ spl0_10,
inference(rat,[],[s16,s30]) ).
cnf(s34,plain,
$false,
inference(rat,[],[s26,s33,s32]) ).
fof(f493,plain,
$false,
inference(avatar_sat_refutation,[],[s34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC100-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.36 % Computer : n013.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 07:52:07 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 2.48/1.21 % (1010052)Input is clausal, will run a generic CNF schedule.
% 2.48/1.21 % (1010061)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=496903150:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.48/1.21 % (1010061)First to succeed.
% 2.48/1.21 % (1010061)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1010052"
% 2.48/1.21 % (1010060)lrs+10_1_sil=8000:sp=occurrence:random_seed=3319523799:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.48/1.21 % (1010058)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2175014083:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.48/1.21 % (1010062)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3056270726:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.48/1.21 % (1010057)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=53689070:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.48/1.21 % (1010059)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4166125275:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.48/1.21 % (1010060)Also succeeded, but the first one will report.
% 2.48/1.21 % (1010063)dis-21_1_sil=8000:lcm=predicate:random_seed=2052278206: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.48/1.21 % (1010062)Also succeeded, but the first one will report.
% 2.48/1.21 % (1010063)Instruction limit reached!
% 2.48/1.21 % (1010063)------------------------------
% 2.48/1.21 % (1010063)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.48/1.21 % (1010063)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.48/1.21 % (1010063)CaDiCaL version: 2.1.3
% 2.48/1.21 % (1010063)Termination reason: Instruction limit
% 2.48/1.21 % (1010063)Termination phase: Saturation
% 2.48/1.21 % (1010063)Time elapsed: 0.058 s
% 2.48/1.21 % (1010063)Peak memory usage: 89 MB
% 2.48/1.21 % (1010063)Instructions burned: 117 (million)
% 2.48/1.21 % (1010061)Refutation found. Thanks to Tanya!
% 2.48/1.21 % SZS status Unsatisfiable for theBenchmark
% 2.48/1.21 % SZS output start Proof for theBenchmark
% See solution above
% 2.48/1.21 % (1010061)------------------------------
% 2.48/1.21 % (1010061)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.48/1.21 % (1010061)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.48/1.21 % (1010061)CaDiCaL version: 2.1.3
% 2.48/1.21 % (1010061)Termination reason: Refutation
% 2.48/1.21 % (1010061)Time elapsed: 0.006 s
% 2.48/1.21 % (1010061)Peak memory usage: 90 MB
% 2.48/1.21 % (1010061)Instructions burned: 12 (million)
% 2.48/1.21 % (1010061)------------------------------
% 2.48/1.21 % (1010061)------------------------------
% 2.48/1.21 % (1010052)Success in time 0.282 s
% 2.48/1.21 % Vampire exiting
%------------------------------------------------------------------------------