%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC060-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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:04:29 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.46s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 65 ( 9 unt; 4 def)
% Number of atoms : 166 ( 23 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 194 ( 93 ~; 97 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 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(f57,axiom,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
fof(f80,axiom,
! [X0] :
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause80) ).
fof(f118,axiom,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
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(f207,negated_conjecture,
! [X0] :
( nil = sk2
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk2,X0)
| ~ segmentP(sk1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
! [X0] :
( nil != sk1
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk2,X0)
| ~ segmentP(sk1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f212,negated_conjecture,
( nil = sk3
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f213,negated_conjecture,
( nil = sk3
| segmentP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f217,plain,
! [X0] :
( nil = sk4
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(definition_unfolding,[],[f207,f204,f204,f205]) ).
fof(f218,plain,
( nil != sk3
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f208,f205,f204]) ).
fof(f219,plain,
! [X0] :
( nil != sk3
| ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(definition_unfolding,[],[f209,f205,f204,f205]) ).
fof(f226,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f248,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f226]) ).
fof(f263,definition,
( spl0_5
<=> ! [X0] :
( ~ ssList(X0)
| ~ segmentP(sk3,X0)
| ~ segmentP(sk4,X0)
| ~ neq(X0,nil) ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f264,plain,
( ! [X0] :
( ~ neq(X0,nil)
| ~ segmentP(sk3,X0)
| ~ segmentP(sk4,X0)
| ~ ssList(X0) )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f263]) ).
fof(f266,definition,
( spl0_6
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f267,plain,
( nil = sk3
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f268,plain,
( nil != sk3
| spl0_6 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f269,plain,
( spl0_5
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f219,f266,f263]) ).
fof(f286,plain,
( ssList(nil)
| ~ spl0_6 ),
inference(superposition,[],[f202,f267]) ).
fof(f288,plain,
( neq(sk4,nil)
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f218,f267]) ).
fof(f291,plain,
( neq(nil,nil)
| nil = sk4
| ~ spl0_6 ),
inference(forward_demodulation,[],[f210,f267]) ).
fof(f305,definition,
( spl0_10
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f306,plain,
( nil != sk4
| spl0_10 ),
inference(avatar_component_clause,[],[f305]) ).
fof(f307,plain,
( nil = sk4
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f305]) ).
fof(f309,definition,
( spl0_11
<=> neq(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f311,plain,
( neq(nil,nil)
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f309]) ).
fof(f312,plain,
( spl0_10
| spl0_11
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f291,f266,f309,f305]) ).
fof(f313,plain,
( neq(nil,nil)
| ~ spl0_6
| ~ spl0_10 ),
inference(superposition,[],[f288,f307]) ).
fof(f315,plain,
( spl0_11
| ~ spl0_6
| ~ spl0_10 ),
inference(avatar_split_clause,[],[f313,f305,f266,f309]) ).
fof(f316,plain,
( ~ ssList(nil)
| ~ spl0_11 ),
inference(resolution,[],[f311,f248]) ).
fof(f317,plain,
( $false
| ~ spl0_6
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f316,f286]) ).
fof(f318,plain,
( ~ spl0_6
| ~ spl0_11 ),
inference(avatar_contradiction_clause,[],[f317]) ).
fof(f319,plain,
( segmentP(nil,sk3)
| nil = sk3
| ~ spl0_10 ),
inference(forward_demodulation,[],[f213,f307]) ).
fof(f321,plain,
( neq(sk3,nil)
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f212,f268]) ).
fof(f322,plain,
( segmentP(nil,sk3)
| spl0_6
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f319,f268]) ).
fof(f882,plain,
( ~ ssList(sk3)
| nil = sk3
| spl0_6
| ~ spl0_10 ),
inference(resolution,[],[f80,f322]) ).
fof(f889,plain,
( nil = sk3
| spl0_6
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f882,f202]) ).
fof(f890,plain,
( $false
| spl0_6
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f889,f268]) ).
fof(f891,plain,
( spl0_6
| ~ spl0_10 ),
inference(avatar_contradiction_clause,[],[f890]) ).
fof(f892,plain,
( segmentP(sk4,sk3)
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f213,f268]) ).
fof(f904,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) )
| spl0_10 ),
inference(forward_subsumption_resolution,[],[f217,f306]) ).
fof(f905,plain,
( spl0_5
| spl0_10 ),
inference(avatar_split_clause,[],[f904,f305,f263]) ).
fof(f918,plain,
( ~ segmentP(sk3,sk3)
| ~ segmentP(sk4,sk3)
| ~ ssList(sk3)
| ~ spl0_5
| spl0_6 ),
inference(resolution,[],[f264,f321]) ).
fof(f927,plain,
( ~ segmentP(sk4,sk3)
| ~ ssList(sk3)
| ~ spl0_5
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f918,f57]) ).
fof(f929,plain,
( ~ ssList(sk3)
| ~ spl0_5
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f927,f892]) ).
fof(f930,plain,
( $false
| ~ spl0_5
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f929,f202]) ).
fof(f931,plain,
( ~ spl0_5
| spl0_6 ),
inference(avatar_contradiction_clause,[],[f930]) ).
cnf(s199,plain,
( spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f269]) ).
cnf(s252,plain,
( ~ spl0_6
| spl0_10
| spl0_11 ),
inference(sat_conversion,[],[f312]) ).
cnf(s257,plain,
( ~ spl0_6
| ~ spl0_10
| spl0_11 ),
inference(sat_conversion,[],[f315]) ).
cnf(s260,plain,
( ~ spl0_6
| ~ spl0_11 ),
inference(sat_conversion,[],[f318]) ).
cnf(s590,plain,
( spl0_6
| ~ spl0_10 ),
inference(sat_conversion,[],[f891]) ).
cnf(s611,plain,
( spl0_5
| spl0_10 ),
inference(sat_conversion,[],[f905]) ).
cnf(s624,plain,
( ~ spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f931]) ).
cnf(s626,plain,
spl0_5,
inference(rat,[],[s590,s199,s611]) ).
cnf(s627,plain,
spl0_6,
inference(rat,[],[s624,s626]) ).
cnf(s628,plain,
~ spl0_11,
inference(rat,[],[s260,s627]) ).
cnf(s629,plain,
~ spl0_10,
inference(rat,[],[s257,s628,s627]) ).
cnf(s630,plain,
$false,
inference(rat,[],[s252,s628,s629,s627]) ).
fof(f932,plain,
$false,
inference(avatar_sat_refutation,[],[s630]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC060-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37 % Computer : n019.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 07:40:04 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40 Running first-order model finding
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.46 % (3835112)Will run a generic schedule for satisfiability detection.
% 0.10/0.46 % (3835119)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3162885131:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.46 % (3835118)% WARNING: option uhcvi not known.
% 0.10/0.46 % (3835117)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2468627181_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.46 % (3835118)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=526466907:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.46 % (3835120)dis+10_1_sil=32000:sp=arity:random_seed=3168752678:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.46 % (3835122)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2829611158:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.46 % (3835121)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3830857686:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.46 % (3835123)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2274588116:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.46 % (3835119) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3835112-3835119"...
% 0.10/0.46 % (3835119)...printing done.
% 0.10/0.46 % (3835118) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3835112-3835118"...
% 0.10/0.46 % (3835120) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3835112-3835120"...
% 0.10/0.46 % (3835119)Refutation found. Thanks to Tanya!
% 0.10/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.37/0.46 % (3835119)------------------------------
% 0.37/0.46 % (3835119)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.37/0.46 % (3835119)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.37/0.46 % (3835119)CaDiCaL version: 2.1.3
% 0.37/0.46 % (3835119)Termination reason: Refutation
% 0.37/0.46 % (3835119)Time elapsed: 0.011 s
% 0.37/0.46 % (3835119)Peak memory usage: 13 MB
% 0.37/0.46 % (3835119)Instructions burned: 27 (million)
% 0.37/0.46 % (3835112)Success in time 0.048 s
% 0.37/0.46 % Vampire exiting
%------------------------------------------------------------------------------