%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC003-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 : n006.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:14 PM UTC 2026
% Result : Unsatisfiable 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 25
% Syntax : Number of formulae : 92 ( 19 unt; 11 def)
% Number of atoms : 254 ( 28 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 322 ( 160 ~; 151 |; 0 &)
% ( 11 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 12 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f71,axiom,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f149,axiom,
! [X2,X0,X1] :
( X0 != X1
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0)
| memberP(cons(X1,X2),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause138) ).
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,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f217,negated_conjecture,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X0,X1),X2) != sk2
| app(X0,X2) != sk1
| ~ neq(X1,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
fof(f218,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
fof(f219,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
fof(f220,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
fof(f221,negated_conjecture,
( app(app(sk6,cons(sk5,nil)),sk7) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_20) ).
fof(f222,plain,
( sk4 = app(app(sk6,cons(sk5,nil)),sk7)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f221]) ).
fof(f223,negated_conjecture,
( app(sk6,sk7) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).
fof(f224,plain,
( sk3 = app(sk6,sk7)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f223]) ).
fof(f228,plain,
( neq(sk4,nil)
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f206,f204,f204]) ).
fof(f237,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X0,X1),X2) != sk4
| app(X0,X2) != sk3
| ~ neq(X1,nil)
| ~ neq(sk4,nil) ),
inference(definition_unfolding,[],[f217,f204,f205]) ).
fof(f247,plain,
! [X2,X1] :
( ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(equality_resolution,[],[f149]) ).
fof(f262,plain,
neq(sk4,nil),
inference(duplicate_literal_removal,[],[f228]) ).
fof(f265,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(duplicate_literal_removal,[],[f247]) ).
fof(f270,definition,
( spl0_1
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f278,definition,
( spl0_3
<=> sk3 = app(sk6,sk7) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f280,plain,
( sk3 = app(sk6,sk7)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f278]) ).
fof(f281,plain,
( ~ spl0_1
| spl0_3 ),
inference(avatar_split_clause,[],[f224,f278,f270]) ).
fof(f283,definition,
( spl0_4
<=> sk4 = app(app(sk6,cons(sk5,nil)),sk7) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f285,plain,
( sk4 = app(app(sk6,cons(sk5,nil)),sk7)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f283]) ).
fof(f286,plain,
( ~ spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f222,f283,f270]) ).
fof(f288,definition,
( spl0_5
<=> ssList(sk7) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f290,plain,
( ssList(sk7)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f288]) ).
fof(f291,plain,
( ~ spl0_1
| spl0_5 ),
inference(avatar_split_clause,[],[f220,f288,f270]) ).
fof(f293,definition,
( spl0_6
<=> ssList(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f295,plain,
( ssList(sk6)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f293]) ).
fof(f296,plain,
( ~ spl0_1
| spl0_6 ),
inference(avatar_split_clause,[],[f219,f293,f270]) ).
fof(f298,definition,
( spl0_7
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f300,plain,
( ssItem(sk5)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f298]) ).
fof(f301,plain,
( ~ spl0_1
| spl0_7 ),
inference(avatar_split_clause,[],[f218,f298,f270]) ).
fof(f303,definition,
( spl0_8
<=> ! [X2,X0,X1] :
( ~ ssList(X0)
| ~ neq(X1,nil)
| app(X0,X2) != sk3
| app(app(X0,X1),X2) != sk4
| ~ ssList(X2)
| ~ ssList(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f304,plain,
( ! [X2,X0,X1] :
( app(app(X0,X1),X2) != sk4
| ~ neq(X1,nil)
| app(X0,X2) != sk3
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X1) )
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f303]) ).
fof(f305,plain,
( ~ spl0_1
| spl0_8 ),
inference(avatar_split_clause,[],[f237,f303,f270]) ).
fof(f313,plain,
spl0_1,
inference(avatar_split_clause,[],[f262,f270]) ).
fof(f319,definition,
( spl0_10
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
fof(f320,plain,
( ssList(nil)
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f319]) ).
fof(f355,plain,
spl0_10,
inference(avatar_split_clause,[],[f8,f319]) ).
fof(f358,plain,
( sk4 != sk4
| ~ neq(cons(sk5,nil),nil)
| sk3 != app(sk6,sk7)
| ~ ssList(sk6)
| ~ ssList(sk7)
| ~ ssList(cons(sk5,nil))
| ~ spl0_4
| ~ spl0_8 ),
inference(superposition,[],[f304,f285]) ).
fof(f359,plain,
( ~ neq(cons(sk5,nil),nil)
| sk3 != app(sk6,sk7)
| ~ ssList(sk6)
| ~ ssList(sk7)
| ~ ssList(cons(sk5,nil))
| ~ spl0_4
| ~ spl0_8 ),
inference(trivial_inequality_removal,[],[f358]) ).
fof(f360,plain,
( ~ neq(cons(sk5,nil),nil)
| ~ ssList(sk6)
| ~ ssList(sk7)
| ~ ssList(cons(sk5,nil))
| ~ spl0_3
| ~ spl0_4
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f359,f280]) ).
fof(f363,plain,
( ~ neq(cons(sk5,nil),nil)
| ~ ssList(sk7)
| ~ ssList(cons(sk5,nil))
| ~ spl0_3
| ~ spl0_4
| ~ spl0_6
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f360,f295]) ).
fof(f377,plain,
( ~ neq(cons(sk5,nil),nil)
| ~ ssList(cons(sk5,nil))
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f363,f290]) ).
fof(f383,definition,
( spl0_22
<=> ssList(cons(sk5,nil)) ),
introduced(definition,[new_symbols(definition,[spl0_22])],[avatar_definition]) ).
fof(f385,plain,
( ~ ssList(cons(sk5,nil))
| spl0_22 ),
inference(avatar_component_clause,[],[f383]) ).
fof(f387,definition,
( spl0_23
<=> neq(cons(sk5,nil),nil) ),
introduced(definition,[new_symbols(definition,[spl0_23])],[avatar_definition]) ).
fof(f389,plain,
( ~ neq(cons(sk5,nil),nil)
| spl0_23 ),
inference(avatar_component_clause,[],[f387]) ).
fof(f390,plain,
( ~ spl0_22
| ~ spl0_23
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f377,f303,f293,f288,f283,f278,f387,f383]) ).
fof(f638,plain,
( ~ ssList(cons(sk5,nil))
| ~ ssList(nil)
| nil = cons(sk5,nil)
| spl0_23 ),
inference(resolution,[],[f102,f389]) ).
fof(f649,plain,
( ~ ssList(cons(sk5,nil))
| nil = cons(sk5,nil)
| ~ spl0_10
| spl0_23 ),
inference(forward_subsumption_resolution,[],[f638,f320]) ).
fof(f654,definition,
( spl0_28
<=> nil = cons(sk5,nil) ),
introduced(definition,[new_symbols(definition,[spl0_28])],[avatar_definition]) ).
fof(f656,plain,
( nil = cons(sk5,nil)
| ~ spl0_28 ),
inference(avatar_component_clause,[],[f654]) ).
fof(f657,plain,
( spl0_28
| ~ spl0_22
| ~ spl0_10
| spl0_23 ),
inference(avatar_split_clause,[],[f649,f387,f319,f383,f654]) ).
fof(f699,plain,
( ~ ssList(nil)
| ~ ssItem(sk5)
| spl0_22 ),
inference(resolution,[],[f385,f86]) ).
fof(f700,plain,
( ~ ssItem(sk5)
| ~ spl0_10
| spl0_22 ),
inference(forward_subsumption_resolution,[],[f699,f320]) ).
fof(f701,plain,
( $false
| ~ spl0_7
| ~ spl0_10
| spl0_22 ),
inference(forward_subsumption_resolution,[],[f700,f300]) ).
fof(f702,plain,
( ~ spl0_7
| ~ spl0_10
| spl0_22 ),
inference(avatar_contradiction_clause,[],[f701]) ).
fof(f727,plain,
( memberP(nil,sk5)
| ~ ssItem(sk5)
| ~ ssList(nil)
| ~ spl0_28 ),
inference(superposition,[],[f265,f656]) ).
fof(f735,plain,
( ~ ssItem(sk5)
| ~ ssList(nil)
| ~ spl0_28 ),
inference(forward_subsumption_resolution,[],[f727,f71]) ).
fof(f741,plain,
( ~ ssList(nil)
| ~ spl0_7
| ~ spl0_28 ),
inference(forward_subsumption_resolution,[],[f735,f300]) ).
fof(f743,plain,
( $false
| ~ spl0_7
| ~ spl0_10
| ~ spl0_28 ),
inference(forward_subsumption_resolution,[],[f741,f320]) ).
fof(f744,plain,
( ~ spl0_7
| ~ spl0_10
| ~ spl0_28 ),
inference(avatar_contradiction_clause,[],[f743]) ).
cnf(s2,plain,
( ~ spl0_1
| spl0_3 ),
inference(sat_conversion,[],[f281]) ).
cnf(s3,plain,
( ~ spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f286]) ).
cnf(s4,plain,
( ~ spl0_1
| spl0_5 ),
inference(sat_conversion,[],[f291]) ).
cnf(s5,plain,
( ~ spl0_1
| spl0_6 ),
inference(sat_conversion,[],[f296]) ).
cnf(s6,plain,
( ~ spl0_1
| spl0_7 ),
inference(sat_conversion,[],[f301]) ).
cnf(s7,plain,
( ~ spl0_1
| spl0_8 ),
inference(sat_conversion,[],[f305]) ).
cnf(s15,plain,
spl0_1,
inference(sat_conversion,[],[f313]) ).
cnf(s25,plain,
spl0_10,
inference(sat_conversion,[],[f355]) ).
cnf(s28,plain,
( ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_8
| ~ spl0_22
| ~ spl0_23 ),
inference(sat_conversion,[],[f390]) ).
cnf(s31,plain,
( ~ spl0_10
| ~ spl0_22
| spl0_23
| spl0_28 ),
inference(sat_conversion,[],[f657]) ).
cnf(s36,plain,
( ~ spl0_7
| ~ spl0_10
| spl0_22 ),
inference(sat_conversion,[],[f702]) ).
cnf(s39,plain,
( ~ spl0_7
| ~ spl0_10
| ~ spl0_28 ),
inference(sat_conversion,[],[f744]) ).
cnf(s44,plain,
spl0_8,
inference(rat,[],[s7,s15]) ).
cnf(s47,plain,
spl0_7,
inference(rat,[],[s6,s15]) ).
cnf(s48,plain,
~ spl0_28,
inference(rat,[],[s39,s25,s47]) ).
cnf(s49,plain,
spl0_22,
inference(rat,[],[s36,s25,s47]) ).
cnf(s50,plain,
spl0_23,
inference(rat,[],[s31,s48,s25,s49]) ).
cnf(s51,plain,
spl0_6,
inference(rat,[],[s5,s15]) ).
cnf(s52,plain,
spl0_5,
inference(rat,[],[s4,s15]) ).
cnf(s53,plain,
spl0_4,
inference(rat,[],[s3,s15]) ).
cnf(s54,plain,
~ spl0_3,
inference(rat,[],[s28,s50,s49,s44,s51,s52,s53]) ).
cnf(s55,plain,
$false,
inference(rat,[],[s2,s54,s15]) ).
fof(f745,plain,
$false,
inference(avatar_sat_refutation,[],[s55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC003-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n006.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:24:10 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.43 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.19/0.49 % (3792265)Will run a generic schedule for satisfiability detection.
% 0.19/0.49 % (3792275)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3340097301:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.49 % (3792271)% WARNING: option uhcvi not known.
% 0.19/0.49 % (3792273)dis+10_1_sil=32000:sp=arity:random_seed=19907623:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.49 % (3792270)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1079488360_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.49 % (3792271)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=249471670:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.49 % (3792272)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1250574348:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.49 % (3792274)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2419725333:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.49 % (3792276)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4286230219:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.49 % (3792273) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3792265-3792273"...
% 0.19/0.49 % TRYING [1]
% 0.19/0.49 % TRYING [2]
% 0.19/0.49 % (3792273)...printing done.
% 0.19/0.49 % (3792273)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (3792273)------------------------------
% 0.19/0.49 % (3792273)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.49 % (3792273)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.49 % (3792273)CaDiCaL version: 2.1.3
% 0.19/0.49 % (3792273)Termination reason: Refutation
% 0.19/0.49 % (3792273)Time elapsed: 0.013 s
% 0.19/0.49 % (3792273)Peak memory usage: 13 MB
% 0.19/0.49 % (3792273)Instructions burned: 18 (million)
% 0.19/0.49 % (3792265)Success in time 0.056 s
% 0.19/0.49 % Vampire exiting
%------------------------------------------------------------------------------