%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC241-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 : n016.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:05:13 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 16
% Syntax : Number of formulae : 70 ( 12 unt; 6 def)
% Number of atoms : 234 ( 28 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 321 ( 157 ~; 158 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 34 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f106,axiom,
! [X0,X1] :
( ~ lt(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| leq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause103) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| ssItem(sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ssItem(sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f207]) ).
fof(f213,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| lt(X0,sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f214,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| lt(X0,sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f213]) ).
fof(f215,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| ~ leq(X0,sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f216,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ~ leq(X0,sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f215]) ).
fof(f217,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f218,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f219,negated_conjecture,
( nil = sk3
| ssList(sk8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f220,negated_conjecture,
( nil = sk3
| app(app(sk7,cons(sk6,nil)),sk8) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
fof(f221,plain,
( nil = sk3
| sk3 = app(app(sk7,cons(sk6,nil)),sk8) ),
inference(reorient_equations,[],[f220]) ).
fof(f225,plain,
nil != sk3,
inference(definition_unfolding,[],[f206,f205]) ).
fof(f226,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| ssItem(sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f208,f205]) ).
fof(f229,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| lt(X0,sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f214,f205]) ).
fof(f230,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ leq(X0,sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f216,f205]) ).
fof(f280,plain,
! [X0,X1] :
( ~ lt(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ leq(X0,X1) ),
inference(consistent_polarity_flipping,[],[f106]) ).
fof(f317,plain,
! [X2,X0,X1] :
( leq(X0,sk5(X2,X1,X0))
| ~ ssList(X1)
| ~ ssList(X2)
| sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssItem(X0) ),
inference(consistent_polarity_flipping,[],[f230]) ).
fof(f329,definition,
( spl0_2
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f334,definition,
( spl0_3
<=> sk3 = app(app(sk7,cons(sk6,nil)),sk8) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f336,plain,
( sk3 = app(app(sk7,cons(sk6,nil)),sk8)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f334]) ).
fof(f337,plain,
( spl0_3
| spl0_2 ),
inference(avatar_split_clause,[],[f221,f329,f334]) ).
fof(f339,definition,
( spl0_4
<=> ssList(sk8) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f341,plain,
( ssList(sk8)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f339]) ).
fof(f342,plain,
( spl0_4
| spl0_2 ),
inference(avatar_split_clause,[],[f219,f329,f339]) ).
fof(f344,definition,
( spl0_5
<=> ssList(sk7) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f346,plain,
( ssList(sk7)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f344]) ).
fof(f347,plain,
( spl0_5
| spl0_2 ),
inference(avatar_split_clause,[],[f218,f329,f344]) ).
fof(f349,definition,
( spl0_6
<=> ssItem(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f351,plain,
( ssItem(sk6)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f349]) ).
fof(f352,plain,
( spl0_6
| spl0_2 ),
inference(avatar_split_clause,[],[f217,f329,f349]) ).
fof(f353,plain,
~ spl0_2,
inference(avatar_split_clause,[],[f225,f329]) ).
fof(f396,plain,
( sk3 != sk3
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ssItem(sk5(sk8,sk7,sk6))
| ~ spl0_3 ),
inference(superposition,[],[f226,f336]) ).
fof(f397,plain,
( ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| ssItem(sk5(sk8,sk7,sk6))
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f396]) ).
fof(f398,plain,
( ~ ssList(sk8)
| ~ ssItem(sk6)
| ssItem(sk5(sk8,sk7,sk6))
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f397,f346]) ).
fof(f399,plain,
( ~ ssItem(sk6)
| ssItem(sk5(sk8,sk7,sk6))
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f398,f341]) ).
fof(f400,plain,
( ssItem(sk5(sk8,sk7,sk6))
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f399,f351]) ).
fof(f411,plain,
( sk3 != sk3
| ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| lt(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_3 ),
inference(superposition,[],[f229,f336]) ).
fof(f412,plain,
( ~ ssList(sk7)
| ~ ssList(sk8)
| ~ ssItem(sk6)
| lt(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f411]) ).
fof(f413,plain,
( ~ ssList(sk8)
| ~ ssItem(sk6)
| lt(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f412,f346]) ).
fof(f414,plain,
( ~ ssItem(sk6)
| lt(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f413,f341]) ).
fof(f415,plain,
( lt(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f414,f351]) ).
fof(f424,definition,
( spl0_17
<=> leq(sk6,sk5(sk8,sk7,sk6)) ),
introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition]) ).
fof(f425,plain,
( ~ leq(sk6,sk5(sk8,sk7,sk6))
| spl0_17 ),
inference(avatar_component_clause,[],[f424]) ).
fof(f622,plain,
( ~ ssItem(sk5(sk8,sk7,sk6))
| ~ ssItem(sk6)
| ~ leq(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6 ),
inference(resolution,[],[f280,f415]) ).
fof(f623,plain,
( ~ ssItem(sk6)
| ~ leq(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f622,f400]) ).
fof(f624,plain,
( ~ leq(sk6,sk5(sk8,sk7,sk6))
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f623,f351]) ).
fof(f625,plain,
( ~ spl0_17
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f624,f349,f344,f339,f334,f424]) ).
fof(f626,plain,
( ~ ssList(sk7)
| ~ ssList(sk8)
| sk3 != app(app(sk7,cons(sk6,nil)),sk8)
| ~ ssItem(sk6)
| spl0_17 ),
inference(resolution,[],[f425,f317]) ).
fof(f627,plain,
( ~ ssList(sk8)
| sk3 != app(app(sk7,cons(sk6,nil)),sk8)
| ~ ssItem(sk6)
| ~ spl0_5
| spl0_17 ),
inference(forward_subsumption_resolution,[],[f626,f346]) ).
fof(f628,plain,
( sk3 != app(app(sk7,cons(sk6,nil)),sk8)
| ~ ssItem(sk6)
| ~ spl0_4
| ~ spl0_5
| spl0_17 ),
inference(forward_subsumption_resolution,[],[f627,f341]) ).
fof(f629,plain,
( ~ ssItem(sk6)
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| spl0_17 ),
inference(forward_subsumption_resolution,[],[f628,f336]) ).
fof(f630,plain,
( $false
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| spl0_17 ),
inference(forward_subsumption_resolution,[],[f629,f351]) ).
fof(f631,plain,
( ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| spl0_17 ),
inference(avatar_contradiction_clause,[],[f630]) ).
cnf(s2,plain,
( spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f337]) ).
cnf(s3,plain,
( spl0_2
| spl0_4 ),
inference(sat_conversion,[],[f342]) ).
cnf(s4,plain,
( spl0_2
| spl0_5 ),
inference(sat_conversion,[],[f347]) ).
cnf(s5,plain,
( spl0_2
| spl0_6 ),
inference(sat_conversion,[],[f352]) ).
cnf(s6,plain,
~ spl0_2,
inference(sat_conversion,[],[f353]) ).
cnf(s18,plain,
( ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_17 ),
inference(sat_conversion,[],[f625]) ).
cnf(s19,plain,
( ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| spl0_17 ),
inference(sat_conversion,[],[f631]) ).
cnf(s24,plain,
spl0_6,
inference(rat,[],[s5,s6]) ).
cnf(s25,plain,
spl0_5,
inference(rat,[],[s4,s6]) ).
cnf(s26,plain,
spl0_4,
inference(rat,[],[s3,s6]) ).
cnf(s27,plain,
spl0_3,
inference(rat,[],[s2,s6]) ).
cnf(s28,plain,
spl0_17,
inference(rat,[],[s19,s26,s24,s25,s27]) ).
cnf(s29,plain,
$false,
inference(rat,[],[s18,s26,s24,s25,s28,s27]) ).
fof(f632,plain,
$false,
inference(avatar_sat_refutation,[],[s29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC241-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.09/0.17 % Computer : n016.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 08:43:33 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 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.20/0.28 % (3481131)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (3481152)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2728955628_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28 % (3481153)% WARNING: option uhcvi not known.
% 0.20/0.28 % TRYING [1]
% 0.20/0.28 % TRYING [2]
% 0.20/0.28 % (3481154)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1512689757:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28 % (3481153)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3335574996:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28 % (3481156)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3073202351:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28 % TRYING [3]
% 0.20/0.28 % (3481157)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1592666697:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.28 % (3481153) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3481131-3481153"...
% 0.20/0.28 % (3481153)...printing done.
% 0.20/0.28 % TRYING [4]
% 0.20/0.28 % (3481153)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (3481153)------------------------------
% 0.20/0.28 % (3481153)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (3481153)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (3481153)CaDiCaL version: 2.1.3
% 0.20/0.28 % (3481153)Termination reason: Refutation
% 0.20/0.28 % (3481153)Time elapsed: 0.012 s
% 0.20/0.28 % (3481153)Peak memory usage: 12 MB
% 0.20/0.28 % (3481153)Instructions burned: 17 (million)
% 0.20/0.28 % (3481131)Success in time 0.059 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------