%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC118-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 : n015.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:32 PM UTC 2026
% Result : Unsatisfiable 2.65s 1.25s
% Output : Refutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 18
% Syntax : Number of formulae : 57 ( 17 unt; 4 def)
% Number of atoms : 132 ( 24 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 145 ( 70 ~; 71 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).
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(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,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
app(app(sk5,sk3),sk6) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,plain,
sk4 = app(app(sk5,sk3),sk6),
inference(reorient_equations,[],[f208]) ).
fof(f215,negated_conjecture,
( nil = sk4
| nil != sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f216,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f217,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f220,plain,
( nil != sk4
| nil != sk3 ),
inference(definition_unfolding,[],[f216,f204,f205]) ).
fof(f221,plain,
( ~ neq(sk3,nil)
| ~ segmentP(sk4,sk3) ),
inference(definition_unfolding,[],[f217,f205,f204,f205]) ).
fof(f226,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(f257,definition,
( spl0_6
<=> segmentP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f258,plain,
( ~ segmentP(sk4,sk3)
| spl0_6 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f260,definition,
( spl0_7
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f261,plain,
( ~ neq(sk3,nil)
| spl0_7 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f262,plain,
( ~ spl0_6
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f221,f260,f257]) ).
fof(f264,definition,
( spl0_8
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f265,plain,
( nil != sk3
| spl0_8 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f267,definition,
( spl0_9
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f269,plain,
( ~ spl0_8
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f220,f267,f264]) ).
fof(f271,plain,
( ~ spl0_8
| spl0_9 ),
inference(avatar_split_clause,[],[f215,f267,f264]) ).
fof(f662,plain,
( sk4 = app(sk5,app(sk3,sk6))
| ~ ssList(sk3)
| ~ ssList(sk5)
| ~ ssList(sk6) ),
inference(superposition,[],[f209,f161]) ).
fof(f700,plain,
( sk4 = app(sk5,app(sk3,sk6))
| ~ ssList(sk5)
| ~ ssList(sk6) ),
inference(forward_subsumption_resolution,[],[f662,f202]) ).
fof(f715,plain,
( sk4 = app(sk5,app(sk3,sk6))
| ~ ssList(sk6) ),
inference(forward_subsumption_resolution,[],[f700,f206]) ).
fof(f730,plain,
sk4 = app(sk5,app(sk3,sk6)),
inference(forward_subsumption_resolution,[],[f715,f207]) ).
fof(f936,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,[],[f226,f161]) ).
fof(f937,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,[],[f936,f161]) ).
fof(f977,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk5)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(sk6) ),
inference(superposition,[],[f937,f730]) ).
fof(f1000,plain,
( ~ ssList(sk5)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(sk6)
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f977,f258]) ).
fof(f1031,plain,
( ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(sk6)
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f1000,f206]) ).
fof(f1033,plain,
( ~ ssList(sk4)
| ~ ssList(sk6)
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f1031,f202]) ).
fof(f1034,plain,
( ~ ssList(sk6)
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f1033,f203]) ).
fof(f1035,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f1034,f207]) ).
fof(f1036,plain,
spl0_6,
inference(avatar_contradiction_clause,[],[f1035]) ).
fof(f1042,plain,
( ~ ssList(sk3)
| ~ ssList(nil)
| nil = sk3
| spl0_7 ),
inference(resolution,[],[f261,f102]) ).
fof(f1043,plain,
( ~ ssList(nil)
| nil = sk3
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f1042,f202]) ).
fof(f1045,plain,
( nil = sk3
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f1043,f8]) ).
fof(f1053,plain,
( $false
| spl0_7
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f1045,f265]) ).
fof(f1054,plain,
( spl0_7
| spl0_8 ),
inference(avatar_contradiction_clause,[],[f1053]) ).
cnf(s5,plain,
( ~ spl0_6
| ~ spl0_7 ),
inference(sat_conversion,[],[f262]) ).
cnf(s6,plain,
( ~ spl0_8
| ~ spl0_9 ),
inference(sat_conversion,[],[f269]) ).
cnf(s7,plain,
( ~ spl0_8
| spl0_9 ),
inference(sat_conversion,[],[f271]) ).
cnf(s56,plain,
spl0_6,
inference(sat_conversion,[],[f1036]) ).
cnf(s58,plain,
( spl0_7
| spl0_8 ),
inference(sat_conversion,[],[f1054]) ).
cnf(s68,plain,
~ spl0_7,
inference(rat,[],[s5,s56]) ).
cnf(s69,plain,
spl0_8,
inference(rat,[],[s58,s68]) ).
cnf(s70,plain,
spl0_9,
inference(rat,[],[s7,s69]) ).
cnf(s71,plain,
$false,
inference(rat,[],[s6,s70,s69]) ).
fof(f1055,plain,
$false,
inference(avatar_sat_refutation,[],[s71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC118-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.11/0.37 % Computer : n015.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 08:02:31 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/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.65/1.25 % (2461304)Input is clausal, will run a generic CNF schedule.
% 2.65/1.25 % (2461313)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2362541266:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.65/1.25 % (2461313)First to succeed.
% 2.65/1.25 % (2461313)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2461304"
% 2.65/1.25 % (2461309)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=2739915495:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.65/1.25 % (2461315)dis-21_1_sil=8000:lcm=predicate:random_seed=2464563712: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.25 % (2461311)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1057126219:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.65/1.25 % (2461312)lrs+10_1_sil=8000:sp=occurrence:random_seed=1886614293:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.65/1.25 % (2461310)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3397531550:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.65/1.25 % (2461314)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=530227073:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.65/1.25 % (2461312)Also succeeded, but the first one will report.
% 2.65/1.25 % (2461314)Also succeeded, but the first one will report.
% 2.65/1.25 % (2461315)Instruction limit reached!
% 2.65/1.25 % (2461315)------------------------------
% 2.65/1.25 % (2461315)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.25 % (2461315)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.25 % (2461315)CaDiCaL version: 2.1.3
% 2.65/1.25 % (2461315)Termination reason: Instruction limit
% 2.65/1.25 % (2461315)Termination phase: Saturation
% 2.65/1.25 % (2461315)Time elapsed: 0.068 s
% 2.65/1.25 % (2461315)Peak memory usage: 90 MB
% 2.65/1.25 % (2461315)Instructions burned: 117 (million)
% 2.65/1.25 % (2461313)Refutation found. Thanks to Tanya!
% 2.65/1.25 % SZS status Unsatisfiable for theBenchmark
% 2.65/1.25 % SZS output start Proof for theBenchmark
% See solution above
% 2.65/1.25 % (2461313)------------------------------
% 2.65/1.25 % (2461313)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.65/1.25 % (2461313)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.65/1.25 % (2461313)CaDiCaL version: 2.1.3
% 2.65/1.25 % (2461313)Termination reason: Refutation
% 2.65/1.25 % (2461313)Time elapsed: 0.016 s
% 2.65/1.25 % (2461313)Peak memory usage: 90 MB
% 2.65/1.25 % (2461313)Instructions burned: 41 (million)
% 2.65/1.25 % (2461313)------------------------------
% 2.65/1.25 % (2461313)------------------------------
% 2.65/1.25 % (2461304)Success in time 0.309 s
% 2.65/1.25 % Vampire exiting
%------------------------------------------------------------------------------