%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC105-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 : n001.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:41 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 21
% Syntax : Number of formulae : 75 ( 14 unt; 7 def)
% Number of atoms : 170 ( 22 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 182 ( 87 ~; 88 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f81,axiom,
! [X0] :
( nil != X0
| ~ ssList(X0)
| rearsegP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause81) ).
fof(f82,axiom,
! [X0] :
( ~ rearsegP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause82) ).
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,
( nil = sk2
| ~ neq(sk1,nil)
| ~ rearsegP(sk2,sk1) ),
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,
( nil != sk1
| ~ neq(sk1,nil)
| ~ rearsegP(sk2,sk1) ),
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(f211,negated_conjecture,
( nil = sk4
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f212,negated_conjecture,
( nil = sk3
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f213,negated_conjecture,
( nil = sk3
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f217,plain,
( nil = sk4
| ~ neq(sk3,nil)
| ~ rearsegP(sk4,sk3) ),
inference(definition_unfolding,[],[f207,f204,f205,f204,f205]) ).
fof(f218,plain,
( nil != sk3
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f208,f205,f204]) ).
fof(f219,plain,
( nil != sk3
| ~ neq(sk3,nil)
| ~ rearsegP(sk4,sk3) ),
inference(definition_unfolding,[],[f209,f205,f205,f204,f205]) ).
fof(f221,plain,
( ~ ssList(nil)
| rearsegP(nil,nil) ),
inference(equality_resolution,[],[f81]) ).
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(f252,plain,
( ~ rearsegP(sk4,sk3)
| spl0_1 ),
inference(avatar_component_clause,[],[f251]) ).
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
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f263,plain,
( spl0_3
| spl0_2 ),
inference(avatar_split_clause,[],[f212,f255,f260]) ).
fof(f265,definition,
( spl0_4
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f267,plain,
( nil = sk4
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f268,plain,
( spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f211,f265,f251]) ).
fof(f269,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f210,f265,f260]) ).
fof(f270,plain,
( ~ spl0_1
| ~ spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f219,f255,f260,f251]) ).
fof(f272,definition,
( spl0_5
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f274,plain,
( neq(sk4,nil)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f275,plain,
( spl0_5
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f218,f255,f272]) ).
fof(f276,plain,
( ~ spl0_1
| ~ spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f217,f265,f260,f251]) ).
fof(f283,definition,
( spl0_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f284,plain,
( ssList(nil)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f283]) ).
fof(f301,definition,
( spl0_11
<=> rearsegP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f304,plain,
( spl0_11
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f221,f283,f301]) ).
fof(f319,plain,
spl0_7,
inference(avatar_split_clause,[],[f8,f283]) ).
fof(f323,plain,
( ~ rearsegP(nil,sk3)
| spl0_1
| ~ spl0_4 ),
inference(superposition,[],[f252,f267]) ).
fof(f326,plain,
( ~ rearsegP(nil,nil)
| spl0_1
| ~ spl0_2
| ~ spl0_4 ),
inference(forward_demodulation,[],[f323,f257]) ).
fof(f327,plain,
( ~ spl0_11
| spl0_1
| ~ spl0_2
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f326,f265,f255,f251,f301]) ).
fof(f332,plain,
( neq(nil,nil)
| ~ spl0_4
| ~ spl0_5 ),
inference(forward_demodulation,[],[f274,f267]) ).
fof(f335,plain,
( rearsegP(nil,sk3)
| ~ spl0_1
| ~ spl0_4 ),
inference(forward_demodulation,[],[f253,f267]) ).
fof(f375,plain,
( ~ ssList(nil)
| ~ spl0_4
| ~ spl0_5 ),
inference(resolution,[],[f248,f332]) ).
fof(f376,plain,
( $false
| ~ spl0_4
| ~ spl0_5
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f375,f284]) ).
fof(f377,plain,
( ~ spl0_4
| ~ spl0_5
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f376]) ).
fof(f449,plain,
( ~ ssList(sk3)
| nil = sk3
| ~ spl0_1
| ~ spl0_4 ),
inference(resolution,[],[f82,f335]) ).
fof(f455,plain,
( nil = sk3
| ~ spl0_1
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f449,f202]) ).
fof(f456,plain,
( $false
| ~ spl0_1
| spl0_2
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f455,f256]) ).
fof(f457,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f456]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f258]) ).
cnf(s2,plain,
( spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f263]) ).
cnf(s3,plain,
( spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f268]) ).
cnf(s4,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f269]) ).
cnf(s5,plain,
( ~ spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f270]) ).
cnf(s6,plain,
( ~ spl0_2
| spl0_5 ),
inference(sat_conversion,[],[f275]) ).
cnf(s7,plain,
( ~ spl0_1
| ~ spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f276]) ).
cnf(s13,plain,
( ~ spl0_7
| spl0_11 ),
inference(sat_conversion,[],[f304]) ).
cnf(s18,plain,
spl0_7,
inference(sat_conversion,[],[f319]) ).
cnf(s21,plain,
( spl0_1
| ~ spl0_2
| ~ spl0_4
| ~ spl0_11 ),
inference(sat_conversion,[],[f327]) ).
cnf(s25,plain,
( ~ spl0_4
| ~ spl0_5
| ~ spl0_7 ),
inference(sat_conversion,[],[f377]) ).
cnf(s26,plain,
( ~ spl0_1
| spl0_2
| ~ spl0_4 ),
inference(sat_conversion,[],[f457]) ).
cnf(s28,plain,
spl0_11,
inference(rat,[],[s13,s18]) ).
cnf(s31,plain,
spl0_1,
inference(rat,[],[s21,s1,s3,s28]) ).
cnf(s32,plain,
spl0_2,
inference(rat,[],[s7,s2,s26,s31]) ).
cnf(s33,plain,
spl0_5,
inference(rat,[],[s6,s32]) ).
cnf(s34,plain,
~ spl0_3,
inference(rat,[],[s5,s31,s32]) ).
cnf(s35,plain,
~ spl0_4,
inference(rat,[],[s25,s18,s33]) ).
cnf(s36,plain,
$false,
inference(rat,[],[s4,s35,s34]) ).
fof(f458,plain,
$false,
inference(avatar_sat_refutation,[],[s36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC105-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.09/0.39 % Computer : n001.cluster.edu
% 0.09/0.39 % Model : x86_64 x86_64
% 0.09/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.39 % Memory : 8046.5625MB
% 0.09/0.39 % OS : Linux 6.8.0-71-generic
% 0.09/0.39 % CPULimit : 300
% 0.09/0.39 % WCLimit : 300
% 0.09/0.39 % DateTime : Mon Sep 28 07:59:33 UTC 2026
% 0.09/0.39 % CPUTime :
% 0.09/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.42 Running first-order model finding
% 0.09/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.47 % (197124)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (197132)dis+10_1_sil=32000:sp=arity:random_seed=2483023585:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47 % (197130)% WARNING: option uhcvi not known.
% 0.17/0.47 % (197132) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-197124-197132"...
% 0.17/0.47 % (197132)...printing done.
% 0.17/0.47 % (197132)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (197132)------------------------------
% 0.17/0.47 % (197132)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (197132)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (197132)CaDiCaL version: 2.1.3
% 0.17/0.47 % (197132)Termination reason: Refutation
% 0.17/0.47 % (197132)Time elapsed: 0.004 s
% 0.17/0.47 % (197132)Peak memory usage: 12 MB
% 0.17/0.47 % (197132)Instructions burned: 10 (million)
% 0.17/0.47 % (197124)Success in time 0.036 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------