%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC028-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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:21 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.46s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of formulae : 55 ( 12 unt; 5 def)
% Number of atoms : 116 ( 22 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 115 ( 54 ~; 56 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 5 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f82,axiom,
! [X0] :
( ~ rearsegP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause82) ).
fof(f118,axiom,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
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,
( nil = sk2
| nil = sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f209,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
( nil = sk4
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f213,negated_conjecture,
( nil = sk3
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f216,plain,
( nil = sk4
| nil = sk3 ),
inference(definition_unfolding,[],[f206,f204,f205]) ).
fof(f219,plain,
( nil != sk3
| nil != sk4 ),
inference(definition_unfolding,[],[f209,f205,f204]) ).
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(f251,definition,
( spl0_1
<=> rearsegP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f253,plain,
( rearsegP(sk4,sk3)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f251]) ).
fof(f255,definition,
( spl0_2
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f256,plain,
( nil != sk3
| spl0_2 ),
inference(avatar_component_clause,[],[f255]) ).
fof(f257,plain,
( nil = sk3
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f255]) ).
fof(f258,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f213,f255,f251]) ).
fof(f260,definition,
( spl0_3
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f262,plain,
( nil = sk4
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f263,plain,
( spl0_1
| spl0_3 ),
inference(avatar_split_clause,[],[f211,f260,f251]) ).
fof(f265,definition,
( spl0_4
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f267,plain,
( neq(sk3,nil)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f268,plain,
( spl0_4
| spl0_3 ),
inference(avatar_split_clause,[],[f210,f260,f265]) ).
fof(f269,plain,
( ~ spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f219,f255,f260]) ).
fof(f270,plain,
( spl0_2
| spl0_3 ),
inference(avatar_split_clause,[],[f216,f260,f255]) ).
fof(f276,definition,
( spl0_6
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f277,plain,
( ssList(nil)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f276]) ).
fof(f312,plain,
spl0_6,
inference(avatar_split_clause,[],[f8,f276]) ).
fof(f313,plain,
( rearsegP(nil,sk3)
| ~ spl0_1
| ~ spl0_3 ),
inference(superposition,[],[f253,f262]) ).
fof(f384,plain,
( ~ ssList(sk3)
| nil = sk3
| ~ spl0_1
| ~ spl0_3 ),
inference(resolution,[],[f82,f313]) ).
fof(f390,plain,
( nil = sk3
| ~ spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f384,f202]) ).
fof(f391,plain,
( $false
| ~ spl0_1
| spl0_2
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f390,f256]) ).
fof(f392,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f391]) ).
fof(f393,plain,
( neq(nil,nil)
| ~ spl0_2
| ~ spl0_4 ),
inference(forward_demodulation,[],[f267,f257]) ).
fof(f398,plain,
( ~ ssList(nil)
| ~ spl0_2
| ~ spl0_4 ),
inference(resolution,[],[f393,f248]) ).
fof(f400,plain,
( $false
| ~ spl0_2
| ~ spl0_4
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f398,f277]) ).
fof(f401,plain,
( ~ spl0_2
| ~ spl0_4
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f400]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f258]) ).
cnf(s2,plain,
( spl0_1
| spl0_3 ),
inference(sat_conversion,[],[f263]) ).
cnf(s3,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f268]) ).
cnf(s4,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f269]) ).
cnf(s5,plain,
( spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f270]) ).
cnf(s15,plain,
spl0_6,
inference(sat_conversion,[],[f312]) ).
cnf(s16,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f392]) ).
cnf(s17,plain,
( ~ spl0_2
| ~ spl0_4
| ~ spl0_6 ),
inference(sat_conversion,[],[f401]) ).
cnf(s22,plain,
spl0_1,
inference(rat,[],[s4,s1,s2]) ).
cnf(s23,plain,
spl0_2,
inference(rat,[],[s16,s5,s22]) ).
cnf(s24,plain,
~ spl0_4,
inference(rat,[],[s17,s15,s23]) ).
cnf(s25,plain,
~ spl0_3,
inference(rat,[],[s4,s23]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s3,s24,s25]) ).
fof(f402,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC028-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n017.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % 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:26:06 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.46 % (3374264)Will run a generic schedule for satisfiability detection.
% 0.15/0.46 % (3374273)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2827266100:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.46 % (3374270)% WARNING: option uhcvi not known.
% 0.15/0.46 % (3374273) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3374264-3374273"...
% 0.15/0.46 % (3374273)...printing done.
% 0.15/0.46 % (3374269)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=881134841_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.46 % (3374270)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2539283662:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.46 % (3374271)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2953072867:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.46 % (3374272)dis+10_1_sil=32000:sp=arity:random_seed=1844276582:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.46 % (3374273)Refutation found. Thanks to Tanya!
% 0.15/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.46 % (3374273)------------------------------
% 0.15/0.46 % (3374273)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.46 % (3374273)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.46 % (3374273)CaDiCaL version: 2.1.3
% 0.15/0.46 % (3374273)Termination reason: Refutation
% 0.15/0.46 % (3374273)Time elapsed: 0.006 s
% 0.15/0.46 % (3374273)Peak memory usage: 12 MB
% 0.15/0.46 % (3374273)Instructions burned: 16 (million)
% 0.15/0.46 % (3374264)Success in time 0.039 s
% 0.15/0.46 % Vampire exiting
%------------------------------------------------------------------------------