%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC086-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 : n003.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:36 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.48s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of formulae : 60 ( 17 unt; 6 def)
% Number of atoms : 118 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 113 ( 55 ~; 52 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f57,axiom,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
fof(f79,axiom,
! [X0] :
( nil != X0
| ~ ssList(X0)
| segmentP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause79) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
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(f206,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
! [X0] :
( ~ 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 = sk4
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( nil = sk4
| segmentP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( nil = sk3
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
( nil = sk3
| segmentP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f214,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f206,f204]) ).
fof(f215,plain,
! [X0] :
( ~ neq(X0,nil)
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(definition_unfolding,[],[f207,f204,f205]) ).
fof(f216,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(equality_resolution,[],[f79]) ).
fof(f247,definition,
( spl0_1
<=> segmentP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f249,plain,
( segmentP(sk4,sk3)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f247]) ).
fof(f251,definition,
( spl0_2
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f253,plain,
( nil = sk3
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f251]) ).
fof(f254,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f211,f251,f247]) ).
fof(f256,definition,
( spl0_3
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f258,plain,
( neq(sk3,nil)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f259,plain,
( spl0_3
| spl0_2 ),
inference(avatar_split_clause,[],[f210,f251,f256]) ).
fof(f261,definition,
( spl0_4
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f263,plain,
( nil = sk4
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f264,plain,
( spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f209,f261,f247]) ).
fof(f265,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f208,f261,f256]) ).
fof(f271,definition,
( spl0_6
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f294,definition,
( spl0_11
<=> segmentP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f296,plain,
( segmentP(nil,nil)
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f294]) ).
fof(f297,plain,
( spl0_11
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f216,f271,f294]) ).
fof(f307,plain,
spl0_6,
inference(avatar_split_clause,[],[f8,f271]) ).
fof(f311,plain,
( ~ ssList(sk4)
| ~ segmentP(sk4,sk4)
| ~ segmentP(sk3,sk4) ),
inference(resolution,[],[f215,f214]) ).
fof(f312,plain,
( ~ ssList(sk4)
| ~ segmentP(sk3,sk4) ),
inference(forward_subsumption_resolution,[],[f311,f57]) ).
fof(f313,plain,
~ segmentP(sk3,sk4),
inference(forward_subsumption_resolution,[],[f312,f203]) ).
fof(f314,plain,
( ~ segmentP(sk3,nil)
| ~ spl0_4 ),
inference(forward_demodulation,[],[f313,f263]) ).
fof(f315,plain,
( ~ segmentP(nil,nil)
| ~ spl0_2
| ~ spl0_4 ),
inference(forward_demodulation,[],[f314,f253]) ).
fof(f316,plain,
( $false
| ~ spl0_2
| ~ spl0_4
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f315,f296]) ).
fof(f317,plain,
( ~ spl0_2
| ~ spl0_4
| ~ spl0_11 ),
inference(avatar_contradiction_clause,[],[f316]) ).
fof(f319,plain,
( ~ ssList(sk3)
| ~ segmentP(sk4,sk3)
| ~ segmentP(sk3,sk3)
| ~ spl0_3 ),
inference(resolution,[],[f258,f215]) ).
fof(f320,plain,
( ~ ssList(sk3)
| ~ segmentP(sk4,sk3)
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f319,f57]) ).
fof(f321,plain,
( ~ segmentP(sk4,sk3)
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f320,f202]) ).
fof(f325,plain,
( $false
| ~ spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f321,f249]) ).
fof(f326,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f325]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f254]) ).
cnf(s2,plain,
( spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f259]) ).
cnf(s3,plain,
( spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f264]) ).
cnf(s4,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f265]) ).
cnf(s10,plain,
( ~ spl0_6
| spl0_11 ),
inference(sat_conversion,[],[f297]) ).
cnf(s14,plain,
spl0_6,
inference(sat_conversion,[],[f307]) ).
cnf(s15,plain,
( ~ spl0_2
| ~ spl0_4
| ~ spl0_11 ),
inference(sat_conversion,[],[f317]) ).
cnf(s17,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(sat_conversion,[],[f326]) ).
cnf(s18,plain,
spl0_11,
inference(rat,[],[s10,s14]) ).
cnf(s22,plain,
spl0_1,
inference(rat,[],[s15,s1,s3,s18]) ).
cnf(s23,plain,
~ spl0_3,
inference(rat,[],[s17,s22]) ).
cnf(s24,plain,
spl0_4,
inference(rat,[],[s4,s23]) ).
cnf(s25,plain,
spl0_2,
inference(rat,[],[s2,s23]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s15,s18,s24,s25]) ).
fof(f327,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC086-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.12/0.39 % Computer : n003.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 28 07:50:12 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.17/0.48 % (1414000)Will run a generic schedule for satisfiability detection.
% 0.17/0.48 % (1414026)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=560248326:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48 % (1414023)% WARNING: option uhcvi not known.
% 0.17/0.48 % (1414026) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1414000-1414026"...
% 0.17/0.48 % (1414026)...printing done.
% 0.17/0.48 % (1414026)Refutation found. Thanks to Tanya!
% 0.17/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.49 % (1414026)------------------------------
% 0.17/0.49 % (1414026)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.49 % (1414026)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.49 % (1414026)CaDiCaL version: 2.1.3
% 0.17/0.49 % (1414026)Termination reason: Refutation
% 0.17/0.49 % (1414026)Time elapsed: 0.004 s
% 0.17/0.49 % (1414026)Peak memory usage: 12 MB
% 0.17/0.49 % (1414026)Instructions burned: 12 (million)
% 0.17/0.49 % (1414000)Success in time 0.05 s
% 0.17/0.49 % Vampire exiting
%------------------------------------------------------------------------------