%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC047-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:11 PM UTC 2026
% Result : Unsatisfiable 2.68s 1.37s
% Output : Refutation 2.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 55 ( 14 unt; 6 def)
% Number of atoms : 128 ( 14 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 143 ( 70 ~; 67 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 13 ( 0 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f59,axiom,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause59) ).
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,
sk4 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,plain,
sk3 = sk4,
inference(reorient_equations,[],[f206]) ).
fof(f208,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f209,negated_conjecture,
! [X0] :
( nil = sk2
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk2,X0)
| ~ rearsegP(sk1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f210,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f211,negated_conjecture,
! [X0] :
( nil != sk1
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk2,X0)
| ~ rearsegP(sk1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f212,plain,
sk1 = sk4,
inference(definition_unfolding,[],[f205,f207]) ).
fof(f216,plain,
( nil = sk4
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f208,f204,f204]) ).
fof(f217,plain,
! [X0] :
( nil = sk4
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk4,X0)
| ~ rearsegP(sk4,X0) ),
inference(definition_unfolding,[],[f209,f204,f204,f212]) ).
fof(f218,plain,
( nil != sk4
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f210,f212,f204]) ).
fof(f219,plain,
! [X0] :
( nil != sk4
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk4,X0)
| ~ rearsegP(sk4,X0) ),
inference(definition_unfolding,[],[f211,f212,f204,f212]) ).
fof(f241,definition,
! [X0,X1] :
( sQ0_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(definition,[new_symbols(definition,[sQ0_eqProxy])],[equality_proxy_definition]) ).
fof(f242,plain,
( sQ0_eqProxy(nil,sk4)
| neq(sk4,nil) ),
inference(equality_proxy_replacement,[],[f216,f241]) ).
fof(f243,plain,
! [X0] :
( sQ0_eqProxy(nil,sk4)
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk4,X0)
| ~ rearsegP(sk4,X0) ),
inference(equality_proxy_replacement,[],[f217,f241]) ).
fof(f244,plain,
( ~ sQ0_eqProxy(nil,sk4)
| neq(sk4,nil) ),
inference(equality_proxy_replacement,[],[f218,f241]) ).
fof(f245,plain,
! [X0] :
( ~ sQ0_eqProxy(nil,sk4)
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk4,X0)
| ~ rearsegP(sk4,X0) ),
inference(equality_proxy_replacement,[],[f219,f241]) ).
fof(f300,plain,
! [X0] :
( ~ sQ0_eqProxy(nil,sk4)
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk4,X0) ),
inference(duplicate_literal_removal,[],[f245]) ).
fof(f301,plain,
! [X0] :
( sQ0_eqProxy(nil,sk4)
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk4,X0) ),
inference(duplicate_literal_removal,[],[f243]) ).
fof(f330,definition,
( spl1_8
<=> ! [X0] :
( ~ ssList(X0)
| ~ rearsegP(sk4,X0)
| ~ neq(X0,nil) ) ),
introduced(definition,[new_symbols(definition,[spl1_8])],[avatar_definition]) ).
fof(f331,plain,
( ! [X0] :
( ~ neq(X0,nil)
| ~ rearsegP(sk4,X0)
| ~ ssList(X0) )
| ~ spl1_8 ),
inference(avatar_component_clause,[],[f330]) ).
fof(f333,definition,
( spl1_9
<=> sQ0_eqProxy(nil,sk4) ),
introduced(definition,[new_symbols(definition,[spl1_9])],[avatar_definition]) ).
fof(f335,plain,
( spl1_8
| ~ spl1_9 ),
inference(avatar_split_clause,[],[f300,f333,f330]) ).
fof(f337,definition,
( spl1_10
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl1_10])],[avatar_definition]) ).
fof(f338,plain,
( neq(sk4,nil)
| ~ spl1_10 ),
inference(avatar_component_clause,[],[f337]) ).
fof(f339,plain,
( spl1_10
| ~ spl1_9 ),
inference(avatar_split_clause,[],[f244,f333,f337]) ).
fof(f341,plain,
( spl1_8
| spl1_9 ),
inference(avatar_split_clause,[],[f301,f333,f330]) ).
fof(f342,plain,
( spl1_10
| spl1_9 ),
inference(avatar_split_clause,[],[f242,f333,f337]) ).
fof(f343,plain,
( ~ rearsegP(sk4,sk4)
| ~ ssList(sk4)
| ~ spl1_8
| ~ spl1_10 ),
inference(resolution,[],[f331,f338]) ).
fof(f345,definition,
( spl1_11
<=> ssList(sk4) ),
introduced(definition,[new_symbols(definition,[spl1_11])],[avatar_definition]) ).
fof(f346,plain,
( ~ ssList(sk4)
| spl1_11 ),
inference(avatar_component_clause,[],[f345]) ).
fof(f348,definition,
( spl1_12
<=> rearsegP(sk4,sk4) ),
introduced(definition,[new_symbols(definition,[spl1_12])],[avatar_definition]) ).
fof(f349,plain,
( ~ rearsegP(sk4,sk4)
| spl1_12 ),
inference(avatar_component_clause,[],[f348]) ).
fof(f350,plain,
( ~ spl1_11
| ~ spl1_12
| ~ spl1_8
| ~ spl1_10 ),
inference(avatar_split_clause,[],[f343,f337,f330,f348,f345]) ).
fof(f351,plain,
( $false
| spl1_11 ),
inference(resolution,[],[f346,f203]) ).
fof(f352,plain,
spl1_11,
inference(avatar_contradiction_clause,[],[f351]) ).
fof(f355,plain,
( ~ ssList(sk4)
| spl1_12 ),
inference(resolution,[],[f59,f349]) ).
fof(f356,plain,
( ~ spl1_11
| spl1_12 ),
inference(avatar_split_clause,[],[f355,f348,f345]) ).
cnf(s7,plain,
( spl1_8
| ~ spl1_9 ),
inference(sat_conversion,[],[f335]) ).
cnf(s8,plain,
( ~ spl1_9
| spl1_10 ),
inference(sat_conversion,[],[f339]) ).
cnf(s9,plain,
( spl1_8
| spl1_9 ),
inference(sat_conversion,[],[f341]) ).
cnf(s10,plain,
( spl1_9
| spl1_10 ),
inference(sat_conversion,[],[f342]) ).
cnf(s11,plain,
( ~ spl1_8
| ~ spl1_10
| ~ spl1_11
| ~ spl1_12 ),
inference(sat_conversion,[],[f350]) ).
cnf(s12,plain,
spl1_11,
inference(sat_conversion,[],[f352]) ).
cnf(s14,plain,
( ~ spl1_11
| spl1_12 ),
inference(sat_conversion,[],[f356]) ).
cnf(s15,plain,
spl1_12,
inference(rat,[],[s14,s12]) ).
cnf(s16,plain,
( ~ spl1_8
| ~ spl1_10 ),
inference(rat,[],[s11,s15,s12]) ).
cnf(s23,plain,
spl1_8,
inference(rat,[],[s7,s9]) ).
cnf(s24,plain,
~ spl1_10,
inference(rat,[],[s16,s23]) ).
cnf(s25,plain,
spl1_9,
inference(rat,[],[s10,s24]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s8,s24,s25]) ).
fof(f357,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC047-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.39 % Computer : n015.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:39:47 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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.68/1.37 % (2452510)Input is clausal, will run a generic CNF schedule.
% 2.68/1.37 % (2452521)dis-21_1_sil=8000:lcm=predicate:random_seed=3311129384: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.68/1.37 % (2452521)First to succeed.
% 2.68/1.37 % (2452521)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2452510"
% 2.68/1.37 % (2452518)lrs+10_1_sil=8000:sp=occurrence:random_seed=1551844041:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.68/1.37 % (2452516)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2069160461:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.68/1.37 % (2452517)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1217423524:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.68/1.37 % (2452519)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2780173602:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.68/1.37 % (2452515)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=3049108431:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.68/1.37 % (2452519)Also succeeded, but the first one will report.
% 2.68/1.37 % (2452518)Also succeeded, but the first one will report.
% 2.68/1.37 % (2452520)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2669312919:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.68/1.37 % (2452520)Also succeeded, but the first one will report.
% 2.68/1.37 % (2452521)Refutation found. Thanks to Tanya!
% 2.68/1.37 % SZS status Unsatisfiable for theBenchmark
% 2.68/1.37 % SZS output start Proof for theBenchmark
% See solution above
% 2.68/1.37 % (2452521)------------------------------
% 2.68/1.37 % (2452521)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.68/1.37 % (2452521)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.68/1.37 % (2452521)CaDiCaL version: 2.1.3
% 2.68/1.37 % (2452521)Termination reason: Refutation
% 2.68/1.37 % (2452521)Time elapsed: 0.003 s
% 2.68/1.37 % (2452521)Peak memory usage: 89 MB
% 2.68/1.37 % (2452521)Instructions burned: 6 (million)
% 2.68/1.37 % (2452521)------------------------------
% 2.68/1.37 % (2452521)------------------------------
% 2.68/1.37 % (2452510)Success in time 0.299 s
% 2.68/1.37 % Vampire exiting
%------------------------------------------------------------------------------